Yehoshua Sagiv
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Interests
Yehoshua Sagiv has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Alexander Serebrenik
Eindhoven University of Technology, Eindhoven, The Netherlands
1 shared publication - Sara Cohen
Institute for Computer Science, The Hebrew University, Jerusalem 91904, Israel
1 shared publication - Werner Nutt
Free University of Bozen-Bolzano
1 shared publication - Yakov Kogan
Institute for Computer Science, The Hebrew University, Jerusalem 91904, Israel
1 shared publication - Yaron Kanza
Institute for Computer Science, The Hebrew University, Jerusalem 91904, Israel
1 shared publication
Latest Publications
- 1 January 2002
- Published by Wiley in Journal of the American Society for Information Science and Technology
- Vol. 53 (6) , 454-466
EquiX—A search and query language for XML
EquiX is a search language for XML that combines the power of querying with the simplicity of searching. Requirements for such languages are discussed, and it is shown that EquiX meets the necessary criteria. Both a graph‐based abstract syntax and a formal concrete syntax are presented for EquiX queries. In addition, the semantics is defined and an evaluation algorithm is presented. The evaluation algorithm is polynomial under combined complexity. EquiX combines pattern matching, quantification, and logical expressions to query both the data and meta‐data of XML documents. The result of a query in EquiX is a set of XML documents. A DTD describing the result documents is derived automatically from the query.
- 1 January 2002
- Published by Wiley in Journal of the American Society for Information Science and Technology
- Vol. 53 (6) , 454-466
EquiX—A search and query language for XML
EquiX is a search language for XML that combines the power of querying with the simplicity of searching. Requirements for such languages are discussed, and it is shown that EquiX meets the necessary criteria. Both a graph‐based abstract syntax and a formal concrete syntax are presented for EquiX queries. In addition, the semantics is defined and an evaluation algorithm is presented. The evaluation algorithm is polynomial under combined complexity. EquiX combines pattern matching, quantification, and logical expressions to query both the data and meta‐data of XML documents. The result of a query in EquiX is a set of XML documents. A DTD describing the result documents is derived automatically from the query.