Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
Optimizing Regular Path Expressions Using Graph Schemas
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
EDBT '02 Proceedings of the Worshops XMLDM, MDDE, and YRWS on XML-Based Data Management and Multimedia Engineering-Revised Papers
ACM SIGMOD Record
On the complexity of nonrecursive XQuery and functional query languages on complex values
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Semantic query optimization for XQuery over XML streams
VLDB '05 Proceedings of the 31st international conference on Very large data bases
MonetDB/XQuery: a fast XQuery processor powered by a relational engine
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Query optimization in XML structured-document databases
The VLDB Journal — The International Journal on Very Large Data Bases
SPEX: Streamed and Progressive Evaluation of XPath
IEEE Transactions on Knowledge and Data Engineering
Descriptive typing rules for xcerpt
PPSWR'05 Proceedings of the Third international conference on Principles and Practice of Semantic Web Reasoning
Hi-index | 0.00 |
Web queries have been and will remain an essential tool for accessing, processing, and, ultimately, reasoning with data on the Web. With the vast data size on the Web and Semantic Web, reducing costs of data transfer and query evaluation for Web queries is crucial. To reduce costs, it is necessary to narrow the data candidates to query, simplify complex queries and reduce intermediate results. This article describes a static approach to optimization of web queries. We introduce a set of rules which achieves the desired optimization by schema and type based query rewriting. The approach consists in using schema information for removing incompleteness (as expressed by 'descendant' constructs and disjunctions) from queries. The approach is presented on the query language Xcerpt, though applicable to other query languages like XQuery. The approach is an application of rules in many aspects--query rules are optimized using rewriting rules based on schema or type information specified in grammar rules.