Parallel database systems: the future of high performance database systems
Communications of the ACM
View maintenance in a warehousing environment
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
An introduction to partial evaluation
ACM Computing Surveys (CSUR)
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Theory of answering queries using views
ACM SIGMOD Record
The state of the art in distributed query processing
ACM Computing Surveys (CSUR)
Distributed query evaluation on semistructured data
ACM Transactions on Database Systems (TODS)
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient algorithms for minimizing tree pattern queries
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Chained Declustering: A New Availability Strategy for Multiprocessor Database Machines
Proceedings of the Sixth International Conference on Data Engineering
Efficient Filtering of XML Documents for Selective Dissemination of Information
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
A Strategy for Partial Evaluation of Views
Proceedings of the IIS'2000 Symposium on Intelligent Information Systems
Dynamic XML documents with distribution and replication
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Distributed Evaluation of Network Directory Queries
IEEE Transactions on Knowledge and Data Engineering
Where the Rubber Meets the Sky: The Semantic Gap between Data Producers and Data Consumers
SSDBM '04 Proceedings of the 16th International Conference on Scientific and Statistical Database Management
Querying peer-to-peer networks using P-trees
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
Incremental maintenance of path-expression views
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Efficient algorithms for processing XPath queries
ACM Transactions on Database Systems (TODS)
Rewriting XPath queries using materialized views
VLDB '05 Proceedings of the 31st international conference on Very large data bases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Online balancing of range-partitioned data with applications to peer-to-peer systems
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Querying xml with update syntax
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Distributed query evaluation with performance guarantees
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Integrating and querying distributed XML data via XLink
Information Systems
Fault-tolerant computation of distributed regular path queries
Theoretical Computer Science
Parallelization of XPath queries using multi-core processors: challenges and experiences
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Statistics-based parallelization of XPath queries in shared memory systems
Proceedings of the 13th International Conference on Extending Database Technology
Query and update through XML views
DNIS'07 Proceedings of the 5th international conference on Databases in networked information systems
Querying structural and behavioral properties of business processes
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Generating efficient execution plans for vertically partitioned XML databases
Proceedings of the VLDB Endowment
Updating XML views and querying XML views with update syntax
International Journal of Computational Science and Engineering
Distributed XML query processing
XSym'10 Proceedings of the 7th international XML database conference on Database and XML technologies
Scaling XML query processing: distribution, localization and pruning
Distributed and Parallel Databases
A structural/temporal query language for Business Processes
Journal of Computer and System Sciences
Towards effective partition management for large graphs
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Graph pattern matching revised for social network analysis
Proceedings of the 15th International Conference on Database Theory
Performance guarantees for distributed reachability queries
Proceedings of the VLDB Endowment
Partial Evaluation for Distributed XPath Query Processing and Beyond
ACM Transactions on Database Systems (TODS)
Minimizing data transfers for regular reachability queries on distributed graphs
Proceedings of the Fourth Symposium on Information and Communication Technology
Hi-index | 0.00 |
A basic idea in parallel query processing is that one is prepared to do more computation than strictly necessary at individual sites in order to reduce the elapsed time, the network traffic, or both in the evaluation of the query. We develop this idea for the evaluation of boolean XPath queries over a tree that is fragmented, both horizontally and vertically over a number of sites. The key idea is to send the whole query to each site which partially evaluates, in parallel, the query and sends the results as compact boolean functions to a coordinator which combines these to obtain the result. This approach has several advantages. First, each site is visited only once, even if several fragments of the tree are stored at that site. Second, no prior constraints on how the tree is decomposed are needed, nor is any structural information about the tree required, such as a DTD. Third, there is a satisfactory bound on the total computation performed on all sites and on the total network traffic. We also develop a simple incremental maintenance algorithm that requires communication only with the sites at which changes have taken place; moreover the network traffic depends neither on the data nor on the update. These results, we believe, illustrate the usefulness and potential of partial evaluation in distributed systems as well as centralized xml stores for evaluating XPath queries and beyond.