EquiX: A Search and Query Language for XML: Difference between revisions
Created page with "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..." |
No edit summary |
||
| Line 2: | Line 2: | ||
Abstract: | 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 | 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 graph-based abstract syntax and formal concrete syntax. 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. | 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: | Introduction: | ||
The widespread use of the World-Wide Web has | The widespread use of the World-Wide Web has given rise to simple query processors called search engines. These processors can query semi-structured data like HTML pages but cannot handle meta-data. As more XML pages appear on the Web, it becomes increasingly important to query both data and meta-data. EquiX is proposed to fill this void. | ||
EquiX's simplicity makes it | EquiX's simplicity makes it user-friendly, even for novices. It allows both searching and querying, with criteria defined for search languages. Results are either sets of documents or sections of documents that satisfy the query. Pattern matching on both data and meta-data is supported. | ||
Conclusion: | |||
EquiX is a search and query language for XML that combines the power of querying with the simplicity of searching. It meets the necessary criteria for such languages and has both graph-based abstract syntax and formal concrete syntax. 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. | |||
EquiX is a | |||
Implications: | |||
EquiX's simplicity and effectiveness make it a promising tool for querying XML documents. Its ability to handle both data and meta-data sets it apart from traditional search engines. As more data is stored in XML format, EquiX will become increasingly valuable for users of all levels of expertise. | |||
Link to Article: https://arxiv.org/abs/ | Link to Article: https://arxiv.org/abs/0110044v1 | ||
Authors: | Authors: | ||
arXiv ID: | arXiv ID: 0110044v1 | ||
[[Category:Computer Science]] | |||
[[Category:Query]] | |||
[[Category:Data]] | |||
[[Category:Equix]] | |||
[[Category:Xml]] | |||
[[Category:Documents]] | |||
Latest revision as of 03:20, 24 December 2023
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 graph-based abstract syntax and formal concrete syntax. 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 given rise to simple query processors called search engines. These processors can query semi-structured data like HTML pages but cannot handle meta-data. As more XML pages appear on the Web, it becomes increasingly important to query both data and meta-data. EquiX is proposed to fill this void.
EquiX's simplicity makes it user-friendly, even for novices. It allows both searching and querying, with criteria defined for search languages. Results are either sets of documents or sections of documents that satisfy the query. Pattern matching on both data and meta-data is supported.
Conclusion: EquiX is a search and query language for XML that combines the power of querying with the simplicity of searching. It meets the necessary criteria for such languages and has both graph-based abstract syntax and formal concrete syntax. 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.
Implications: EquiX's simplicity and effectiveness make it a promising tool for querying XML documents. Its ability to handle both data and meta-data sets it apart from traditional search engines. As more data is stored in XML format, EquiX will become increasingly valuable for users of all levels of expertise.
Link to Article: https://arxiv.org/abs/0110044v1 Authors: arXiv ID: 0110044v1