EquiX---a search and query language for XML

  • Authors:
  • Sara Cohen;Yaron Kanza;Yakov Kogan;Yehoshua Sagiv;Werner Nutt;Alexander Serebrenik

  • Affiliations:
  • Institute for Computer Science, The Hebrew University, Jerusalem 91904, Israel;Institute for Computer Science, The Hebrew University, Jerusalem 91904, Israel;Institute for Computer Science, The Hebrew University, Jerusalem 91904, Israel;Institute for Computer Science, The Hebrew University, Jerusalem 91904, Israel;Department of Computing and Electrical Engineering, Heriot-Watt University, Edinburgh, EH14 4AS, UK;Department of Computer Science, K.U. Leuven, Celestijnenlaan 200A, B-3001, Heverlee, Belgium

  • Venue:
  • Journal of the American Society for Information Science and Technology - XML
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.