Data allocation in distributed database systems
ACM Transactions on Database Systems (TODS)
NiagaraCQ: a scalable continuous query system for Internet databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Minimization of tree pattern queries
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Containment and equivalence for an XPath fragment
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Accelerating XPath location steps
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Continual Queries for Internet Scale Event-Driven Information Delivery
IEEE Transactions on Knowledge and Data Engineering
Structural Properties of XPath Fragments
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Efficient Filtering of XML Documents for Selective Dissemination of Information
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Semantic Data Caching and Replacement
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
EDBT '02 Proceedings of the Worshops XMLDM, MDDE, and YRWS on XML-Based Data Management and Multimedia Engineering-Revised Papers
To Form a More Perfect Union (Intersection, Difference)
DBLP-5 Proceedings of the Fifth International Workshop on Database Programming Languages
Answering queries using views: A survey
The VLDB Journal — The International Journal on Very Large Data Bases
Materializing views with minimal size to answer queries
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Query containment and rewriting using views for regular path queries under constraints
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Answering Regular Path Queries Using Views
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Stream processing of XPath queries with predicates
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
XPath queries on streaming data
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Efficient Filtering of XML Documents with XPath Expressions
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
A transducer-based XML query processor
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
XMark: a benchmark for XML data management
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Peer-to-peer management of XML data: issues and research challenges
ACM SIGMOD Record
Data & Knowledge Engineering
XPath Rewriting Using Multiple Views
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
The complexity of query containment in expressive fragments of XPath 2.0
Journal of the ACM (JACM)
Efficient evaluation of query rewriting plan over materialized XML view
Journal of Systems and Software
The view selection problem for regular path queries
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Reducing redundancy of XPath query over networks by transmitting XML views
WAIM'10 Proceedings of the 2010 international conference on Web-age information management
Scaling XML query processing: distribution, localization and pruning
Distributed and Parallel Databases
Efficient dissemination of filtered data in XML-Based SDI
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
Revisiting answering tree pattern queries using views
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
When a client submits a set of XPath queries to a XML database on a network, the set of answer sets sent back by the database may include redundancy in two ways: some elements may appear in more than one answer set, and some elements in some answer sets may be subelements of other elements in other (or the same) answer sets. Even when a client submits a single query, the answer can be self-redundant because some elements may be subelements of other elements in that answer. Therefore, sending those answers as they are is not optimal with respect to communication costs. In this paper, we propose a method of minimizing communication costs in XPath processing over networks. Given a single or a set of queries, we compute a minimal-size view set that can answer all the original queries. The database sends this view set to the client, and the client produces answers from it. We show algorithms for computing such a minimal view set for given queries. This view set is optimal; it only includes elements that appear in some of the final answers, and each element appears only once.