On the public citation graph
Space-Partitioning Trees in PostgreSQL: Realization and Performance
0 signed · 65 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-47724-1_21openalex-snapshot
Efficient Processing of Large Spatial Queries Using Interior Approximations
inferredcites →https://doi.org/10.1007/3-540-63343-x_48openalex-snapshot
The universal B-tree for multidimensional indexing: General concepts
inferredcites →https://doi.org/10.1007/978-3-642-59412-0_15openalex-snapshot
Organization and Maintenance of Large Ordered Indexes
inferredcites →https://doi.org/10.1007/bf00288683openalex-snapshot
Organization and maintenance of large ordered indexes
inferredcites →https://doi.org/10.1007/bf00288933openalex-snapshot
Quad trees a data structure for retrieval on composite keys
inferredcites →https://doi.org/10.1007/s007780050030openalex-snapshot
The hB $^\Pi$ -tree: a multi-attribute index supporting concurrency, recovery and node consolidation
inferredcites →https://doi.org/10.1016/0924-2716(91)90007-iopenalex-snapshot
The design and analysis of spatial data structures
inferredcites →https://doi.org/10.1023/a:1012809914301openalex-snapshot
SP-GiST: An Extensible Database Index for Supporting Space Partitioning Trees
inferredcites →https://doi.org/10.1109/69.75895openalex-snapshot
Relational-linear quadtree approach for two-dimensional spatial representation and manipulation
inferredcites →https://doi.org/10.1109/dac.1982.1585523openalex-snapshot
The Quad-CIF Tree: A Data Structure for Hierarchical On-Line Algorithms
inferredcites →https://doi.org/10.1109/icde.1986.7266230openalex-snapshot
Inclusion of new types in relational data base systems
inferredcites →https://doi.org/10.1109/icde.2000.839396openalex-snapshot
Extensible indexing: a framework for integrating domain-specific indexing schemes into Oracle8i
inferredcites →https://doi.org/10.1109/icde.2004.1319982openalex-snapshot
Bulk operations for space-partitioning trees
inferredcites →https://doi.org/10.1109/ssdm.2001.938537openalex-snapshot
An extensible index for spatial databases
inferredcites →https://doi.org/10.1109/tse.1979.234200openalex-snapshot
Multidimensional Binary Search Trees in Database Applications
inferredcites →https://doi.org/10.1145/125223.125262openalex-snapshot
The POSTGRES next generation database management system
inferredcites →https://doi.org/10.1145/130283.130316openalex-snapshot
A qualitative comparison study of data structures for large line segment databases
inferredcites →https://doi.org/10.1145/237661.237705openalex-snapshot
A model for the prediction of R-tree performance
inferredcites →https://doi.org/10.1145/280277.280279openalex-snapshot
Multidimensional access methods
inferredcites →https://doi.org/10.1145/320083.320092openalex-snapshot
Extendible hashing—a fast access method for dynamic files
inferredcites →https://doi.org/10.1145/320455.320469openalex-snapshot
Hashing and trie algorithms for partial match retrieval
inferredcites →https://doi.org/10.1145/358728.358741openalex-snapshot
An effective way to represent quadtrees
inferredcites →https://doi.org/10.1145/361002.361007openalex-snapshot
Multidimensional binary search trees used for associative searching
inferredcites →https://doi.org/10.1145/38713.38744openalex-snapshot
A population analysis for hierarchical data structures
inferredcites →https://doi.org/10.1145/564691.564755openalex-snapshot
Quadtree and R-tree indexes in oracle spatial
inferredcites →https://doi.org/10.1145/93597.98741openalex-snapshot
The R*-tree: an efficient and robust access method for points and rectangles
inferredcites →https://doi.org/10.1145/93605.98741openalex-snapshot
The R*-tree: an efficient and robust access method for points and rectangles
inferredcites →https://doi.org/10.1184/r1/6610748openalex-snapshot
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
inferredcites →https://doi.org/10.5555/800263.809229openalex-snapshot
The Quad-CIF Tree: A Data Structure for Hierarchical On-Line Algorithms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-05810-8_7openalex-snapshot
Scalable Numerical Queries by Algebraic Inequality Transformations
inferred← citeshttps://doi.org/10.1007/978-3-642-13911-6_3openalex-snapshot
Advancing Search Query Autocompletion Services with More and Better Suggestions
inferred← citeshttps://doi.org/10.1007/978-981-96-0821-8_21openalex-snapshot
Towards Unified Spatio-Temporal Index for Hybrid Trajectory Search
inferred← citeshttps://doi.org/10.1007/s10707-026-00576-0openalex-snapshot
Efficient algorithms for top-k range search on weighted interval data
inferred← citeshttps://doi.org/10.1016/j.csi.2017.05.003openalex-snapshot
An efficient algorithm for bulk-loading xBR + -trees
inferred← citeshttps://doi.org/10.1109/igarss47720.2021.9554247openalex-snapshot
Implementation of a Federated Large-Scale Remote Sensing Data Sharing Platform
inferred← citeshttps://doi.org/10.1109/iscc.2009.5202326openalex-snapshot
Compact N-tree: an indexing structure for distance range queries
inferred← citeshttps://doi.org/10.1109/iwcmc.2011.5982841openalex-snapshot
VN-tree for efficient nearest neighbors search in location based services
inferred← citeshttps://doi.org/10.1109/mdm71479.2026.00018openalex-snapshot
GeoBenchr: An Application-Centric Benchmarking Suite for Spatiotemporal Database Platforms
inferred← citeshttps://doi.org/10.1109/pci.2008.46openalex-snapshot
Mitos: Design and Evaluation of a DBMS-Based Web Search Engine
inferred← citeshttps://doi.org/10.1109/ssdbm.2007.10openalex-snapshot
Duplicate Elimination in Space-partitioning Tree Indexes
inferred← citeshttps://doi.org/10.1109/vast.2012.6400544openalex-snapshot
Optimizing an SPT-tree for visual analytics
inferred← citeshttps://doi.org/10.1111/j.1467-9671.2011.01248.xopenalex-snapshot
Collaborative Web‐GIS Design: A Case Study for Road Risk Analysis and Monitoring
inferred← citeshttps://doi.org/10.1145/1653771.1653815openalex-snapshot
Efficiently managing large-scale raster species distribution data in PostgreSQL
inferred← citeshttps://doi.org/10.1145/2820783.2820815openalex-snapshot
Spatial queries with k-nearest-neighbor and relational predicates
inferred← citeshttps://doi.org/10.11606/d.55.2020.tde-04022020-111451openalex-snapshot
Desenvolvimento de uma Técnica para Estender um SGBD Relacional com Consultas por Similaridade
inferred← citeshttps://doi.org/10.1186/s40537-014-0009-5openalex-snapshot
DCMS: A data analytics and management system for molecular simulation
inferred← citeshttps://doi.org/10.15407/pp2026.01.014openalex-snapshot
Implementing indexes in POSTGRESQL
inferred← citeshttps://doi.org/10.15546/aeei-2020-0009openalex-snapshot
TOWARDS ON EXPERIMENTAL COMPARISON OF THE M-TREE INDEX STRUCTURE WITH BK-TREE AND VP-TREE
inferred← citeshttps://doi.org/10.48550/arxiv.0803.2220openalex-snapshot
The Anatomy of Mitos Web Search Engine
inferred← citeshttps://doi.org/10.48550/arxiv.0906.3112openalex-snapshot
Object-Relational Database Representations for Text Indexing
inferred← citeshttps://doi.org/10.48550/arxiv.1609.01319openalex-snapshot
Analytic Performance Model of a Main-Memory Index Structure
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0612127openalex-snapshot
bdbms -- A Database Management System for Biological Data
inferred← citeshttps://doi.org/10.5441/002/edbt.2015.40openalex-snapshot
Cost Estimation of Spatial k-Nearest-Neighbor Operators
inferred← citeshttps://doi.org/10.63282/3050-9246.ijetcsit-v5i3p103openalex-snapshot
PostgreSQL Table Partitioning Strategies: Handling Billions of Rows Efficiently
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.