EquiX - A search and query language for XML

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

doi:10.1002/asi.10058

EquiX - A search and query language for XML

Sara Cohen^*, Yaron Kanza, Yakov Kogan, Yehoshua Sagiv, Werner Nutt, Alexander Serebrenik

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to journal › Article › peer-review

21 Scopus citations

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.

Original language	English
Pages (from-to)	454-466
Number of pages	13
Journal	Journal of the American Society for Information Science and Technology
Volume	53
Issue number	6
DOIs	https://doi.org/10.1002/asi.10058
State	Published - Apr 2002

Access to Document

10.1002/asi.10058

Cite this

@article{190cbdf9eb7046fd8e8ec7247e7425ef,

title = "EquiX - A search and query language for XML",

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.",

author = "Sara Cohen and Yaron Kanza and Yakov Kogan and Yehoshua Sagiv and Werner Nutt and Alexander Serebrenik",

year = "2002",

month = apr,

doi = "10.1002/asi.10058",

language = "אנגלית",

volume = "53",

pages = "454--466",

journal = "Journal of the American Society for Information Science and Technology",

issn = "1532-2882",

publisher = "John Wiley and Sons Ltd",

number = "6",

}

TY - JOUR

T1 - EquiX - A search and query language for XML

AU - Cohen, Sara

AU - Kanza, Yaron

AU - Kogan, Yakov

AU - Sagiv, Yehoshua

AU - Nutt, Werner

AU - Serebrenik, Alexander

PY - 2002/4

Y1 - 2002/4

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0036535289&partnerID=8YFLogxK

U2 - 10.1002/asi.10058

DO - 10.1002/asi.10058

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0036535289

SN - 1532-2882

VL - 53

SP - 454

EP - 466

JO - Journal of the American Society for Information Science and Technology

JF - Journal of the American Society for Information Science and Technology

IS - 6

ER -

EquiX - A search and query language for XML

Abstract

Access to Document

Other files and links

Fingerprint

Cite this