Database Paper Browser

Back to papers

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)

Paper ID
1958
Venue
PODS
Year
2024
Pagerank
-
Overall Rank
13,147 | 8.54%
DOI
10.1145/3695840

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 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

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

Rank Cited Paper Year Venue Pagerank
8,753 Document Spanners — A Brief Overview of Concepts, Results, and Recent Developments 2022 PODS 4.456315e-05
Previous Page 1 / 1 Next

Semantically Similar Papers