Database Paper Browser

Back to papers

Understanding Queries in a Search Database System

Summary: Formalize interpretations as parses in a 'search database system'; generate parses with nonempty evaluation in polynomial time (combined input+output) and decide specificity efficiently. Most-specific parse is intractable, but under mild assumptions parses can be enumerated by decreasing specificity with polynomial delay and space. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1526
Venue
PODS
Year
2010
Pagerank
4.6028544e-05
Overall Rank
8,029 | 44.15%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
6,845 Facet Discovery for Structured Web Search: A Query-log Mining Approach 2011 SIGMOD 4.9092609e-05
13,485 Rewrite Rules for Search Database Systems 2011 PODS -
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 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