DBScholar

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
1525
Venue
PODS
Year
2010
Pagerank
5.4528142e-05
Overall Rank
8,329 | 42.86%
DOI
10.1145/1807085.1807121

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{fagin_pods10,
        address = {New York, NY, USA},
        series = {{PODS} '10},
        title = {{Understanding Queries in a Search Database System}},
        url = {https://dl.acm.org/doi/10.1145/1807085.1807121},
        doi = {10.1145/1807085.1807121},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Fagin, Ronald and Kimelfeld, Benny and Li, Yunyao and Raghavan, Sriram and Vaithyanathan, Shivakumar},
        year = {2010}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
6,883 Facet Discovery for Structured Web Search: A Query-log Mining Approach 2011 SIGMOD 5.7468523e-05
13,684 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