Database Paper Browser

Back to papers

View-Based Query Processing for Regular Path Queries with Inverse

Summary: Introduce two-way finite-state automata for view-based processing of regular path queries with inverse on semistructured data. Prove that query rewriting and query answering with inverse incur the same computational complexity as standard RPQs. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1195
Venue
PODS
Year
2000
Pagerank
7.3405281e-05
Overall Rank
3,228 | 77.55%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 12 of 12 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

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

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
6,567 Generating Efficient Plans for Queries Using Views 2001 SIGMOD 5.0069599e-05
297 Complexity of Answering Queries Using Materialized Views 1998 PODS 0.00028596715
584 Answering Queries with Aggregation Using Views 1996 VLDB 0.0001971526
971 Rewriting Aggregate Queries Using Views 1999 PODS 0.00014925576
11,826 Bounded Query Rewriting Using Views 2016 PODS 4.1945683e-05
82 Answering Queries Using Views (Extended Abstract) 1995 PODS 0.00054402763
4,553 View-Based Query Containment 2003 PODS 6.091702e-05
5,406 Query Containment and Rewriting Using Views for Regular Path Queries Under Constraints 2003 PODS 5.5243825e-05
3,531 Lossless Regular Views 2002 PODS 7.003412e-05
2,342 Rewriting of Regular Expressions and Regular Path Queries 1999 PODS 9.0015589e-05