Using Partial Evaluation in Distributed Query Evaluation

Summary: Distributed XPath evaluation via partial evaluation: send the full query to every fragment site; sites partially evaluate and return compact boolean functions. No decomposition or DTD constraints; single-site visits per fragment; bounds on total work and traffic; incremental maintenance with data-independent traffic. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: h47b481da04674c78
Venue: VLDB
Year: 2006
Pagerank: 6.073568e-05
Overall Rank: 5,593 | 62.40%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Peter Buneman (University of Edinburgh)
2. Gao Cong (University of Edinburgh)
3. Wenfei Fan (AT&T; University of Edinburgh)
4. Anastasios Kementsietsidis (University of Edinburgh)

BibTeX Citation

@article{buneman_vldb06,
        title = {{Using Partial Evaluation in Distributed Query Evaluation}},
        author = {Buneman, Peter and Cong, Gao and Fan, Wenfei and Kementsietsidis, Anastasios},
        journal = {PVLDB},
        series = {{VLDB} '06},
        pages = {211--222},
        year = {2006}
}

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
947	Parallelizing Sequential Graph Computations	2017	SIGMOD	0.00012914714
1,840	Towards Effective Partition Management for Large Graphs	2012	SIGMOD	9.5291859e-05
2,627	Boosting XML Filtering with a Scalable FPGA-based Architecture	2009	CIDR	8.2057483e-05
5,152	Performance Guarantees for Distributed Reachability Queries	2012	VLDB	6.2525917e-05
5,462	Distributed Query Evaluation with Performance Guarantees	2007	SIGMOD	6.1221387e-05
12,674	Generating Efficient Execution Plans for Vertically Partitioned XML Databases	2011	VLDB	4.9793485e-05
12,924	Querying XML with Update Syntax	2007	SIGMOD	4.9793485e-05

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
247	Efficient Filtering of XML Documents for Selective Dissemination of Information	2000	VLDB	0.00023199427
398	View Maintenance in a Warehousing Environment	1995	SIGMOD	0.00019152162
679	Efficient Algorithms for Processing XPath Queries	2002	VLDB	0.00014837097
1,471	Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems	2004	VLDB	0.00010559076
2,241	Querying Network Directories	1999	SIGMOD	8.7708234e-05
2,680	Efficient Processing of Expressive Node-Selecting Queries on XML Data in Secondary Storage: A Tree Automata-based Approach	2003	VLDB	8.1432169e-05
2,733	Efficient Algorithms for Minimizing Tree Pattern Queries	2002	SIGMOD	8.0819e-05
3,027	Labeling Dynamic XML Trees	2002	PODS	7.7381398e-05
3,751	Dynamic XML Documents with Distribution and Replication	2003	SIGMOD	7.0519156e-05
4,066	Rewriting XPath Queries Using Materialized Views	2005	VLDB	6.8221983e-05
8,146	Incremental Maintenance of Path-Expression Views	2005	SIGMOD	5.3910052e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	4,066	Rewriting XPath Queries Using Materialized Views	2005	VLDB
2	2,715	A Framework for Using Materialized XPath Views in XML Query Processing	2004	VLDB
3	12,923	Efficient Algorithms for Evaluating XPath over Streams	2007	SIGMOD
4	5,368	Buffering in Query Evaluation over XML Streams	2005	PODS
5	3,746	On the Memory Requirements of XPath Evaluation over XML Streams	2004	PODS
6	9,547	Scalable XML Query Processing using Parallel Pushdown Transducers	2013	VLDB
7	679	Efficient Algorithms for Processing XPath Queries	2002	VLDB
8	2,177	The Complexity of XPath Query Evaluation	2003	PODS
9	12,674	Generating Efficient Execution Plans for Vertically Partitioned XML Databases	2011	VLDB
10	5,462	Distributed Query Evaluation with Performance Guarantees	2007	SIGMOD