EquiX: A Search and Query Language for XML

Title: EquiX: A Search and Query Language for XML

Abstract: EquiX is a search and query language for XML that combines the power of querying with the simplicity of searching. It meets necessary criteria for such languages and has both graphical and formal syntaxes. Its semantics is defined, and an evaluation algorithm is presented. The algorithm is polynomial under combined complexity.

EquiX allows pattern matching, quantification, and logical expressions to query both 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.

Introduction: The widespread use of the World-Wide Web has led to simple query processors called search engines. These engines can only query data in HTML pages, not meta-data. As more XML pages appear on the Web, it becomes increasingly important to query both data and meta-data. EquiX is proposed as a language to address this need.

EquiX's simplicity makes it easy for novice Internet users to formulate queries, unlike traditional database query languages. It combines the concepts of searching and querying, allowing users to search imprecisely or query precisely.

Design Criteria: 1. Format of Results: Search results should be either sets of documents or sections of documents that satisfy the query. This simplifies the formulation of a search query. 2. Pattern Matching: EquiX should allow pattern matching on both data and meta-data. This allows users to formulate queries without knowing the exact document structure. 3. Quantification: EquiX should support quantification to specify search requirements.

Conclusion: EquiX is a search and query language for XML that meets the design criteria and is suitable for querying both data and meta-data on the Web. Its simplicity makes it accessible to a wide audience, while its power allows for complex queries.

Link to Article: https://arxiv.org/abs/0011041v1 Authors: arXiv ID: 0011041v1