Answering XPath Queries over Networks by Sending Minimal Views

Summary: Introduces minimal view sets for answering one or more XPath queries over a network, eliminating duplicate and ancestor–descendant results before transmission. Algorithms compute an optimal, nonredundant view containing exactly the elements needed for client-side answer reconstruction. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID: 9394
Venue: VLDB
Year: 2004
Pagerank: 5.093636e-05
Overall Rank: 12,797 | 12.21%
DOI: 10.1016/B978-012088469-8.50008-5

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

1. Keishi Tajima (Japan Advanced Institute of Science and Technology)
2. Yoshiki Fukui (Japan Advanced Institute of Science and Technology)

BibTeX Citation

@article{tajima_vldb04,
        title = {{Answering XPath Queries over Networks by Sending Minimal Views}},
        author = {Tajima, Keishi and Fukui, Yoshiki},
        journal = {PVLDB},
        series = {{VLDB} '04},
        pages = {48},
        doi = {10.1016/B978-012088469-8.50008-5},
        url = {https://doi.org/10.1016/B978-012088469-8.50008-5},
        year = {2004}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
25	NiagaraCQ: A Scalable Continuous Query System for Internet Databases	2000	SIGMOD	0.00054667018
79	XMark: A Benchmark for XML Data Management	2002	VLDB	0.00036555628
236	Efficient Filtering of XML Documents for Selective Dissemination of Information	2000	VLDB	0.00023721569
395	Containment and Equivalence for an XPath Fragment [Extended Abstract]	2002	PODS	0.00019298983
409	Semantic Data Caching and Replacement	1996	VLDB	0.00018985783
738	Stream Processing of XPath Queries with Predicates	2003	SIGMOD	0.00014484337
893	Accelerating XPath Location Steps	2002	SIGMOD	0.00013374715
928	XPath Queries on Streaming Data	2003	SIGMOD	0.00013153017
1,068	Minimization of Tree Pattern Queries	2001	SIGMOD	0.00012326498
1,082	A Transducer-Based XML Query Processor	2002	VLDB	0.00012257574
5,146	Query Containment and Rewriting Using Views for Regular Path Queries Under Constraints	2003	PODS	6.3470184e-05
9,403	Materializing Views with Minimal Size To Answer Queries	2003	PODS	5.2755515e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	666	Efficient Algorithms for Processing XPath Queries	2002	VLDB
2	3,659	On the Memory Requirements of XPath Evaluation over XML Streams	2004	PODS
3	12,534	Efficient Rewriting of XPath Queries Using Query Set Specifications	2009	VLDB
4	9,687	Answering Tree Pattern Queries Using Views	2006	VLDB
5	5,336	Distributed Query Evaluation with Performance Guarantees	2007	SIGMOD
6	7,853	The View Selection Problem for XML Content Based Routing	2003	PODS
7	5,237	Query Caching and View Selection for XML Databases	2005	VLDB
8	2,658	A Framework for Using Materialized XPath Views in XML Query Processing	2004	VLDB
9	2,817	On the minimization of XPath queries	2003	VLDB
10	3,976	Rewriting XPath Queries Using Materialized Views	2005	VLDB