Database Paper Browser

Back to papers

Rewrite Rules for Search Database Systems

Summary: Models search-query augmentation as rewrite programs (hedge-rewriting) that produce a least fixpoint (lfp) set of alternative queries and introduces lfp‑convergence (finiteness of each lfp). Shows lfp‑convergence undecidable, gives a polynomial-time decidable safety condition that guarantees convergence and validates it on a deployed rewrite program. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1559
Venue
PODS
Year
2011
Pagerank
-
Overall Rank
13,485 | 6.19%
DOI
-

Incoming Non-self Citations Over Time

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

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
5,398 Cleaning Inconsistencies in Information Extraction via Prioritized Repairs 2014 PODS 5.5295577e-05
12,062 Next Generation Data Analytics at IBM Research 2013 VLDB 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

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

Rank Cited Paper Year Venue Pagerank
3,341 Avatar Semantic Search: A Database Approach to Information Retrieval 2006 SIGMOD 7.1972915e-05
8,029 Understanding Queries in a Search Database System 2010 PODS 4.6028544e-05
Previous Page 1 / 1 Next

Semantically Similar Papers