Indexing for Function Approximation
Summary: Recasts high-dimensional function approximation in combustion simulation as an indexed storage/retrieval problem. Taylor-expansion workloads mix similarity search and updates, exposing novel search–maintenance tradeoffs for high-dimensional index design. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Biswanath Panda (Cornell University)
- 2. Mirek Riedewald (Cornell University)
- 3. Stephen B. Pope (Cornell University)
- 4. Johannes Gehrke (Cornell University)
- 5. L. Paul Chew (Cornell University)
BibTeX Citation
@article{panda_vldb06,
title = {{Indexing for Function Approximation}},
author = {Panda, Biswanath and Riedewald, Mirek and Pope, Stephen B. and Gehrke, Johannes and Chew, L. Paul},
journal = {PVLDB},
series = {{VLDB} '06},
pages = {523--534},
doi = {10.14778/1164134.1164181},
url = {https://doi.org/10.14778/1164134.1164181},
year = {2006}
}
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 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 |
|---|---|---|---|---|
| 2 | R-Trees: A Dynamic Index Structure For Spatial Searching | 1984 | SIGMOD | 0.0020210012 |
| 4 | The R*-tree: An Efficient and Robust Access Method for Points and Rectangles | 1990 | SIGMOD | 0.001157935 |
| 21 | Similarity Search in High Dimensions via Hashing | 1999 | VLDB | 0.00056760516 |
| 42 | The R+-Tree: A Dynamic Multi-Dimensional Index for Objects | 1987 | VLDB | 0.00046170812 |
| 46 | A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces | 1998 | VLDB | 0.00044853085 |
| 85 | The X-tree: An Index Structure for High-Dimensional Data | 1996 | VLDB | 0.00035405879 |
| 8,765 | Contorting High Dimensional Data for Efficient Main Memory KNN Processing | 2003 | SIGMOD | 5.3766157e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 12,690 | Efficient Query Processing on Unstructured Tetrahedral Meshes | 2006 | SIGMOD |
| 2 | 7,896 | Optimizing Index for Taxonomy Keyword Search | 2012 | SIGMOD |
| 3 | 190 | Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases | 2001 | SIGMOD |
| 4 | 1,778 | The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation | 2000 | VLDB |
| 5 | 7,942 | Efficient and Tunable Similar Set Retrieval | 2001 | SIGMOD |
| 6 | 1,722 | Indexable PLA for Efficient Similarity Search | 2007 | VLDB |
| 7 | 1,512 | On the Analysis of Indexing Schemes | 1997 | PODS |
| 8 | 9,034 | Fast and Adaptive Indexing of Multi-Dimensional Observational Data | 2016 | VLDB |
| 9 | 10,984 | Benchmarking Adaptive Multidimensional Indices | 2025 | VLDB |
| 10 | 8,570 | Modeling High-Dimensional Index Structures using Sampling | 2001 | SIGMOD |