Answering XPath Queries over Networks by Sending Minimal Views
Summary: Minimizes network cost for XPath by computing a minimal-view set that answers the queries. The view is optimal and redundancy-free: only final-answer elements are included, each once; the client reconstructs all results from it. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Keishi Tajima
- 2. Yoshiki Fukui
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
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.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 712 | Efficient Algorithms for Processing XPath Queries | 2002 | VLDB | 0.00017714027 |
| 3,697 | On the Memory Requirements of XPath Evaluation over XML Streams | 2004 | PODS | 6.8281158e-05 |
| 12,348 | Efficient Rewriting of XPath Queries Using Query Set Specifications | 2009 | VLDB | 4.1905499e-05 |
| 9,535 | Answering Tree Pattern Queries Using Views | 2006 | VLDB | 4.3226836e-05 |
| 5,324 | Distributed Query Evaluation with Performance Guarantees | 2007 | SIGMOD | 5.5668659e-05 |
| 7,409 | The View Selection Problem for XML Content Based Routing | 2003 | PODS | 4.7321381e-05 |
| 5,621 | Query Caching and View Selection for XML Databases | 2005 | VLDB | 5.4061733e-05 |
| 2,980 | A Framework for Using Materialized XPath Views in XML Query Processing | 2004 | VLDB | 7.7800968e-05 |
| 3,089 | On the minimization of Xpath queries | 2003 | VLDB | 7.5938563e-05 |
| 4,568 | Rewriting XPath Queries Using Materialized Views | 2005 | VLDB | 6.0725918e-05 |