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)
Incoming Non-self Citations Over Time
Authors
- 1. Konstantin Golenberg (Hebrew University)
- 2. Benny Kimelfeld (IBM Research—Almaden)
- 3. Yehoshua Sagiv (Hebrew University)
BibTeX Citation
@article{golenberg_vldb11,
title = {{Optimizing and Parallelizing Ranked Enumeration}},
author = {Golenberg, Konstantin and Kimelfeld, Benny and Sagiv, Yehoshua},
journal = {PVLDB},
series = {{VLDB} '11},
volume = {4},
number = {11},
pages = {1028--1039},
doi = {10.14778/3402707.3402739},
url = {https://doi.org/10.14778/3402707.3402739},
year = {2011}
}Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,745 | Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries | 2020 | VLDB | 8.1747954e-05 |
| 7,923 | Ranked Enumeration of Minimal Triangulations | 2019 | PODS | 5.5181056e-05 |
| 8,028 | On the Complexity of Package Recommendation Problems | 2012 | PODS | 5.504636e-05 |
| 9,337 | Efficiently Enumerating Minimal Triangulations | 2017 | PODS | 5.2876688e-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 |
|---|---|---|---|---|
| 37 | DISCOVER: Keyword Search in Relational Databases | 2002 | VLDB | 0.00048017193 |
| 302 | Bidirectional Expansion For Keyword Search on Graph Databases | 2005 | VLDB | 0.00021963347 |
| 1,429 | Finding and Approximating Top-k Answers in Keyword Proximity Search | 2006 | PODS | 0.00010811133 |
| 1,542 | Keyword Proximity Search in Complex Data Graphs | 2008 | SIGMOD | 0.00010421046 |
| 1,555 | Keyword Search in Databases: The Power of RDBMS | 2009 | SIGMOD | 0.00010370683 |
| 3,032 | Learning to Create Data-Integrating Queries | 2008 | VLDB | 7.8323614e-05 |
| 12,408 | Transducing Markov Sequences | 2010 | PODS | 5.093636e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 434 | Query Optimization for Parallel Execution | 1992 | SIGMOD |
| 2 | 7,664 | Optimal Enumeration: Efficient Top-k Tree Matching | 2015 | VLDB |
| 3 | 6,018 | Dependency-Aware Reordering for Parallelizing Query Optimization in Multi-Core CPUs | 2009 | SIGMOD |
| 4 | 6,699 | Percentile Finding Algorithm for Multiple Sorted Runs | 1989 | VLDB |
| 5 | 12,461 | Ten Thousand SQLs: Parallel Keyword Queries Computing | 2010 | VLDB |
| 6 | 2,104 | Optimization of Multi-Way Join Queries for Parallel Execution | 1991 | VLDB |
| 7 | 6,412 | Ranked Enumeration of Join Queries with Projections | 2022 | VLDB |
| 8 | 6,026 | Parallelizing Extensible Query Optimizers | 2009 | SIGMOD |
| 9 | 2,745 | Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries | 2020 | VLDB |
| 10 | 3,726 | Parallelizing Query Optimization | 2008 | VLDB |