Lazy, Adaptive RID-List Intersection, and Its Application to Index Anding
Summary: Lazy RID-list intersection forms lists on demand during conjunction, cutting IO/sort costs and reducing fragility to misestimates on skewed data. An adaptive set-intersection method replaces AND-tree, robust to cardinality errors; experiments show efficiency and predictability. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Vijayshankar Raman
- 2. Lin Qiao
- 3. Wei Han
- 4. Inderpal S. Narang
- 5. Ying-Lin Chen
- 6. Kou-Horng Yang
- 7. Fen-Lin Ling
Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,121 | Improving the Performance of List Intersection | 2009 | VLDB | 0.00013838956 |
| 1,828 | Authenticated Join Processing in Outsourced Databases | 2009 | SIGMOD | 0.0001038324 |
| 2,821 | An Experimental Study of Bitmap Compression vs. Inverted List Compression | 2017 | SIGMOD | 8.0639288e-05 |
| 7,160 | MILC: Inverted List Compression in Memory | 2017 | VLDB | 4.8088037e-05 |
| 7,693 | Processing and Optimizing Main Memory Spatial-Keyword Queries | 2016 | VLDB | 4.6714423e-05 |
| 7,745 | Scalable Distributed Inverted List Indexes in Disaggregated Memory | 2024 | SIGMOD | 4.6578829e-05 |
| 8,930 | An Application-Specific Instruction Set for Accelerating Set-Oriented Database Primitives | 2014 | SIGMOD | 4.4229886e-05 |
| 12,303 | Secondary Indexing in One Dimension: Beyond B-trees and Bitmap Indexes | 2009 | PODS | 4.1905499e-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 |
|---|---|---|---|---|
| 20 | C-Store: A Column-oriented DBMS | 2005 | VLDB | 0.00086163998 |
| 100 | On the Propagation of Errors in the Size of Join Results | 1991 | SIGMOD | 0.00050033475 |
| 116 | Eddies: Continuously Adaptive Query Processing | 2000 | SIGMOD | 0.00046191288 |
| 121 | Improved Query Performance with Variant Indexes | 1997 | SIGMOD | 0.00045429472 |
| 181 | LEO - DB2's LEarning Optimizer | 2001 | VLDB | 0.00036970794 |
| 239 | Holistic Twig Joins: Optimal XML Pattern Matching | 2002 | SIGMOD | 0.00031581944 |
| 1,041 | Adaptive Ordering of Pipelined Stream Filters | 2004 | SIGMOD | 0.00014470785 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,449 | Index-Based Join Size Estimation Using Adaptive Sampling | 2021 | SIGMOD | 4.1905499e-05 |
| 8,342 | QPPT: Query Processing on Prefix Trees | 2013 | CIDR | 4.5367151e-05 |
| 2,281 | Adopting Worst-Case Optimal Joins in Relational Database Systems | 2020 | VLDB | 9.122455e-05 |
| 11,698 | Document Reordering for Faster Intersection | 2019 | VLDB | 4.1905499e-05 |
| 12,573 | Efficiently Processing Queries on Interval-and-Value Tuples in Relational Databases | 2005 | VLDB | 4.1905499e-05 |
| 1,104 | Cardinality Estimation Done Right: Index-Based Join Sampling | 2017 | CIDR | 0.0001398479 |
| 11,256 | Asymptotically Better Query Optimization Using Indexed Algebra | 2023 | VLDB | 4.1905499e-05 |
| 10,326 | Index Intersection for High-Dimensional Range Queries | 2026 | VLDB | 4.1905499e-05 |
| 2,361 | Merging What’s Cracked, Cracking What’s Merged: Adaptive Indexing in Main-Memory Column-Stores | 2011 | VLDB | 8.9648608e-05 |
| 1,121 | Improving the Performance of List Intersection | 2009 | VLDB | 0.00013838956 |