Revisiting Weighted Information Extraction: A Simpler and Faster Algorithm for Ranked Enumeration
Summary: Shortest-path enumeration used to simplify weighted information extraction, enabling linear preprocessing and per-output delay O(|s_i| + min{log i, log |D|}). A rounding technique yields O(|s|) delay with high probability, via algebra, high-dimensional geometry, and LP. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Paweł Gawrychowski (University of Wrocław)
- 2. Florin Manea (University of Göttingen)
- 3. Markus L. Schmid (Humboldt University of Berlin)
BibTeX Citation
@inproceedings{gawrychowski_pods24,
address = {New York, NY, USA},
series = {{PODS} '24},
title = {{Revisiting Weighted Information Extraction: A Simpler and Faster Algorithm for Ranked Enumeration}},
url = {https://dl.acm.org/doi/10.1145/3695840},
doi = {10.1145/3695840},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Gawrychowski, Paweł and Manea, Florin and Schmid, Markus L.},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
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 |
|---|---|---|---|---|
| 2,348 | Document Spanners for Extracting Incomplete Information: Expressiveness and Complexity | 2018 | PODS | 8.7135317e-05 |
| 8,923 | Document Spanners — A Brief Overview of Concepts, Results, and Recent Developments | 2022 | PODS | 5.3483178e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,073 | Efficient Indexes for Diverse Top-k Range Queries | 2020 | PODS |
| 2 | 5,579 | Enumeration on Trees with Tractable Combined Complexity and Efficient Updates | 2019 | PODS |
| 3 | 6,412 | Ranked Enumeration of Join Queries with Projections | 2022 | VLDB |
| 4 | 4,063 | Enumeration for FO Queries over Nowhere Dense Graphs | 2018 | PODS |
| 5 | 5,041 | Enumeration of First-Order Queries on Classes of Structures With Bounded Expansion | 2013 | PODS |
| 6 | 10,305 | Weighted Set Multi-Cover on Bounded Universe and Applications in Package Recommendation | 2026 | SIGMOD |
| 7 | 8,195 | When Speed Has a Price: Fast Information Extraction Using Approximate Algorithms | 2013 | VLDB |
| 8 | 8,909 | Enumeration for MSO-Queries on Compressed Trees | 2024 | PODS |
| 9 | 1,429 | Finding and Approximating Top-k Answers in Keyword Proximity Search | 2006 | PODS |
| 10 | 2,745 | Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries | 2020 | VLDB |