Database Paper Browser

Back to papers

Optimizing and Parallelizing Ranked Enumeration

Summary: Optimizes and parallelizes Lawler-Murty's ranked enumeration for database tasks, notably keyword search over data graphs. Freezes optimization instances to improve thread utilization, enabling earlier next-answer output and yielding strong serial and parallel speedups. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10166
Venue
VLDB
Year
2011
Pagerank
5.5693009e-05
Overall Rank
5,323 | 62.97%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank Citing Paper Year Venue Pagerank
3,715 Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries 2020 VLDB 6.8220943e-05
7,501 Ranked Enumeration of Minimal Triangulations 2019 PODS 4.7180617e-05
7,770 On the Complexity of Package Recommendation Problems 2012 PODS 4.6562597e-05
9,091 Efficiently Enumerating Minimal Triangulations 2017 PODS 4.39823e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

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

Rank Cited Paper Year Venue Pagerank
54 DISCOVER: Keyword Search in Relational Databases 2002 VLDB 0.00066047203
336 Bidirectional Expansion For Keyword Search on Graph Databases 2005 VLDB 0.00027020919
1,073 Finding and Approximating Top-k Answers in Keyword Proximity Search 2006 PODS 0.00014264992
1,453 Keyword Proximity Search in Complex Data Graphs 2008 SIGMOD 0.00011917976
1,564 Keyword Search in Databases: The Power of RDBMS 2009 SIGMOD 0.00011350495
3,110 Learning to Create Data-Integrating Queries 2008 VLDB 7.5475982e-05
12,213 Transducing Markov Sequences 2010 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Semantically Similar Papers