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
10167
Venue
VLDB
Year
2011
Pagerank
5.5642069e-05
Overall Rank
5,331 | 62.96%
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,702 Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries 2020 VLDB 6.8251643e-05
7,500 Ranked Enumeration of Minimal Triangulations 2019 PODS 4.7135369e-05
7,768 On the Complexity of Package Recommendation Problems 2012 PODS 4.6523419e-05
9,088 Efficiently Enumerating Minimal Triangulations 2017 PODS 4.3940132e-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
53 DISCOVER: Keyword Search in Relational Databases 2002 VLDB 0.00065993143
337 Bidirectional Expansion For Keyword Search on Graph Databases 2005 VLDB 0.00027002505
1,072 Finding and Approximating Top-k Answers in Keyword Proximity Search 2006 PODS 0.00014256848
1,453 Keyword Proximity Search in Complex Data Graphs 2008 SIGMOD 0.00011921738
1,564 Keyword Search in Databases: The Power of RDBMS 2009 SIGMOD 0.00011340407
3,116 Learning to Create Data-Integrating Queries 2008 VLDB 7.5404022e-05
12,221 Transducing Markov Sequences 2010 PODS 4.1905499e-05
Previous Page 1 / 1 Next

Semantically Similar Papers