On the public citation graph
Optimizing multidimensional index trees for main memory access
0 signed · 117 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.1016/0026-2692(93)90111-qopenalex-snapshot
Computer architecture: a quantitative approach
inferredcites →https://doi.org/10.1016/b978-0-12-722442-8.x5000-9openalex-snapshot
Proceedings 2003 VLDB Conference
inferredcites →https://doi.org/10.1109/icde.1997.582015openalex-snapshot
STR: a simple and efficient algorithm for R-tree packing
inferredcites →https://doi.org/10.1109/icde.1998.655800openalex-snapshot
Compressing relations and indexes
inferredcites →https://doi.org/10.1145/160688.160697openalex-snapshot
Is Huffman coding dead? (extended abstract)
inferredcites →https://doi.org/10.1145/182591.182593openalex-snapshot
Beyond uniformity and independence
inferredcites →https://doi.org/10.1145/191839.191880openalex-snapshot
Multi-step processing of spatial joins
inferredcites →https://doi.org/10.1145/280277.280279openalex-snapshot
Multidimensional access methods
inferredcites →https://doi.org/10.1145/335191.335449openalex-snapshot
Making B+- trees cache conscious in main memory
inferredcites →https://doi.org/10.1145/342009.335449openalex-snapshot
Making B+- trees cache conscious in main memory
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.1184/r1/6606125openalex-snapshot
Hilbert R-tree: An Improved R-tree using Fractals
inferredcites →https://doi.org/10.1184/r1/6610748openalex-snapshot
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
inferredcites →https://doi.org/10.7916/d8t441zbopenalex-snapshot
Cache Conscious Indexing for Decision-Support in Main Memory
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11408079_58openalex-snapshot
A Spatial Index Using MBR Compression and Hashing Technique for Mobile Map Service
inferred← citeshttps://doi.org/10.1007/11427865_13openalex-snapshot
MR-Tree: A Cache-Conscious Main Memory Spatial Index Structure for Mobile GIS
inferred← citeshttps://doi.org/10.1007/11535331_9openalex-snapshot
Evaluation of a Dynamic Tree Structure for Indexing Query Regions on Streaming Geospatial Data
inferred← citeshttps://doi.org/10.1007/11599289_1openalex-snapshot
Development of an Embedded Spatial MMDBMS for Spatial Mobile Devices
inferred← citeshttps://doi.org/10.1007/11603771_9openalex-snapshot
CLUR-Tree for Supporting Frequent Updates of Data Stream over Sensor Networks
inferred← citeshttps://doi.org/10.1007/11687238_15openalex-snapshot
Approximation Techniques to Enable Dimensionality Reduction for Voronoi-Based Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1007/11751588_39openalex-snapshot
Spatial Indexing Based on the Semi-approximation Scheme of MBR
inferred← citeshttps://doi.org/10.1007/11758532_85openalex-snapshot
Performance Analysis of the Cache Conscious-Generalized Search Tree
inferred← citeshttps://doi.org/10.1007/11775300_25openalex-snapshot
MiniTasking: Improving Cache Performance for Multiple Query Workloads
inferred← citeshttps://doi.org/10.1007/11775300_3openalex-snapshot
Spatial Index Compression for Location-Based Services Based on a MBR Semi-approximation Scheme
inferred← citeshttps://doi.org/10.1007/11892960_135openalex-snapshot
MBR Compression in Spatial Databases Using Semi-Approximation Scheme
inferred← citeshttps://doi.org/10.1007/11935148_24openalex-snapshot
TMOM: A Moving Object Main Memory-Based DBMS for Telematics Services
inferred← citeshttps://doi.org/10.1007/3-540-46146-9_72openalex-snapshot
Efficient Evaluation of Continuous Range Queries on Moving Objects
inferred← citeshttps://doi.org/10.1007/978-3-540-24768-5_93openalex-snapshot
An Efficient Cache Conscious Multi-dimensional Index Structure
inferred← citeshttps://doi.org/10.1007/978-3-540-30075-5_19openalex-snapshot
Growing Node Policies of a Main Memory Index Structure for Moving Objects Databases
inferred← citeshttps://doi.org/10.1007/978-3-540-30075-5_21openalex-snapshot
PCR-Tree: An Enhanced Cache Conscious Multi-dimensional Index Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-45072-6_2openalex-snapshot
Performance Evaluation of Main-Memory R-tree Variants
inferred← citeshttps://doi.org/10.1007/978-3-540-45227-0_15openalex-snapshot
Optimizing Both Cache and Disk Performance of R-Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-72584-8_92openalex-snapshot
An Extended R-Tree Indexing Method Using Selective Prefetching in Main Memory
inferred← citeshttps://doi.org/10.1007/978-3-540-76414-4_33openalex-snapshot
An Efficient Compression Technique for a Multi-dimensional Index in Main Memory
inferred← citeshttps://doi.org/10.1007/978-3-540-87395-2_17openalex-snapshot
3D Continuous K-NN Query for a Landmark-based Wayfinding Location-based Service
inferred← citeshttps://doi.org/10.1007/978-3-642-02457-3_45openalex-snapshot
Towards Location-Based Real-Time Monitoring Systems in u-LBS
inferred← citeshttps://doi.org/10.1007/978-3-642-16385-2_5openalex-snapshot
Range Queries over a Compact Representation of Minimum Bounding Rectangles
inferred← citeshttps://doi.org/10.1007/978-3-642-22922-0_12openalex-snapshot
Thread-Level Parallel Indexing of Update Intensive Moving-Object Workloads
inferred← citeshttps://doi.org/10.1007/s00778-008-0120-3openalex-snapshot
The RUM-tree: supporting frequent updates in R-trees using memos
inferred← citeshttps://doi.org/10.1007/s00778-014-0353-2openalex-snapshot
Processing of extreme moving-object update and query workloads in main memory
inferred← citeshttps://doi.org/10.1007/s11390-007-9034-6openalex-snapshot
Efficient Execution of Multiple Queries on Deep Memory Hierarchy
inferred← citeshttps://doi.org/10.1016/b978-012722442-8/50043-4openalex-snapshot
Buffering Accesses to Memory-Resident Index Structures
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.06.017openalex-snapshot
An efficient cache conscious multi-dimensional index structure
inferred← citeshttps://doi.org/10.1016/j.is.2005.07.002openalex-snapshot
Fast similarity join for multi-dimensional data
inferred← citeshttps://doi.org/10.1016/j.is.2010.05.001openalex-snapshot
Indexing high-dimensional data for main-memory similarity search
inferred← citeshttps://doi.org/10.1016/j.is.2013.01.005openalex-snapshot
Space-efficient representations of rectangle datasets supporting orthogonal range querying
inferred← citeshttps://doi.org/10.1023/b:dapd.0000013068.25976.88openalex-snapshot
Main Memory Evaluation of Monitoring Queries Over Moving Objects
inferred← citeshttps://doi.org/10.1080/03772063.2015.1054899openalex-snapshot
Extended Rice Code and Its application to R-Tree Compression
inferred← citeshttps://doi.org/10.1088/1742-6596/1202/1/012020openalex-snapshot
Multidimensional data structures usage in adaptive data storages
inferred← citeshttps://doi.org/10.1093/ietisy/e89-d.11.2724openalex-snapshot
Accelerating Database Processing at Database-Driven Web Sites
inferred← citeshttps://doi.org/10.1093/ietisy/e91-d.2.243openalex-snapshot
The Optimization of In-Memory Space Partitioning Trees for Cache Utilization
inferred← citeshttps://doi.org/10.1109/aispc.2008.4460543openalex-snapshot
Indexing moving objects in main memory
inferred← citeshttps://doi.org/10.1109/bigcomp.2014.6741419openalex-snapshot
Distributed compilation system for high-speed software build processes
inferred← citeshttps://doi.org/10.1109/bliss.2007.23openalex-snapshot
Multi-receiver Certificate-Based Encryption and Application to Public Key Broadcast Encryption
inferred← citeshttps://doi.org/10.1109/bliss.2007.34openalex-snapshot
Frameworks of Indexing Mechanism for Mobile Devices
inferred← citeshttps://doi.org/10.1109/cinc.2009.130openalex-snapshot
An Index Creating Method Based on an Improved Clustering Algorithm
inferred← citeshttps://doi.org/10.1109/dasfaa.2003.1192363openalex-snapshot
Similarity join for low-and high-dimensional data
inferred← citeshttps://doi.org/10.1109/iadcc.2014.6779447openalex-snapshot
Review on indexing methods in location based services
inferred← citeshttps://doi.org/10.1109/icde.2006.81openalex-snapshot
Indexing for Dynamic Abstract Regions
inferred← citeshttps://doi.org/10.1109/icde.2014.6816718openalex-snapshot
OCTOPUS: Efficient query execution on dynamic mesh datasets
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00214openalex-snapshot
DB-LSH: Locality-Sensitive Hashing with Query-based Dynamic Bucketing
inferred← citeshttps://doi.org/10.1109/icmlc.2007.4370595openalex-snapshot
A New Approach to Creating Spatial Index with R-Tree
inferred← citeshttps://doi.org/10.1109/icmlc.2008.4620656openalex-snapshot
A new parallel spatial query algorithm for distributed spatial databases
inferred← citeshttps://doi.org/10.1109/ictai.2008.25openalex-snapshot
Quantized Indexing Tree for Frequent Updates over Data Streams
inferred← citeshttps://doi.org/10.1109/ipc.2007.20openalex-snapshot
A Cost Model for Incremental Nearest Neighbor Search in Multidimensional Spaces
inferred← citeshttps://doi.org/10.1109/itaic.2011.6030251openalex-snapshot
Research about the index mechanism base on embedded database system
inferred← citeshttps://doi.org/10.1109/mdm.2016.46openalex-snapshot
D-Grid: An In-Memory Dual Space Grid Index for Moving Object Databases
inferred← citeshttps://doi.org/10.1109/nas.2010.44openalex-snapshot
Multi-dimensional Index on Hadoop Distributed File System
inferred← citeshttps://doi.org/10.1109/ssdbm.2007.9openalex-snapshot
CSR+-tree: Cache-conscious Indexing for High-dimensional Similarity Search
inferred← citeshttps://doi.org/10.1109/tkde.2005.46openalex-snapshot
Indexing high-dimensional data for efficient in-memory similarity search
inferred← citeshttps://doi.org/10.1109/tkde.2006.48openalex-snapshot
Maintaining sliding window skylines on data streams
inferred← citeshttps://doi.org/10.1109/tkde.2007.190616openalex-snapshot
Adaptive Index Utilization in Memory-Resident Structural Joins
inferred← citeshttps://doi.org/10.1109/tkde.2023.3295831openalex-snapshot
DB-LSH 2.0: Locality-Sensitive Hashing With Query-Based Dynamic Bucketing
inferred← citeshttps://doi.org/10.1109/tkde.2023.3297975openalex-snapshot
Two-Layer Space-Oriented Partitioning for Non-Point Data
inferred← citeshttps://doi.org/10.1109/tkde.2024.3364183openalex-snapshot
A Survey of Multi-Dimensional Indexes: Past and Future Trends
inferred← citeshttps://doi.org/10.1145/1007568.1007592openalex-snapshot
Buffering databse operations for enhanced instruction cache performance
inferred← citeshttps://doi.org/10.1145/1093382.1093387openalex-snapshot
Self-tuning cost modeling of user-defined functions in an object-relational DBMS
inferred← citeshttps://doi.org/10.1145/1363189.1363193openalex-snapshot
A general framework for improving query processing performance on multi-level memory hierarchies
inferred← citeshttps://doi.org/10.1145/2213836.2213842openalex-snapshot
Parallel main-memory indexing for moving-object query and update workloads
inferred← citeshttps://doi.org/10.1145/2345316.2345339openalex-snapshot
Retrieving large-scale high density video target tracks from spatial database
inferred← citeshttps://doi.org/10.1145/3137586.3137590openalex-snapshot
A Survey of Traditional and MapReduceBased Spatial Query Processing Approaches
inferred← citeshttps://doi.org/10.1145/3221269.3223031openalex-snapshot
Multidimensional range queries on modern hardware
inferred← citeshttps://doi.org/10.1145/563932.563925openalex-snapshot
Compacting discriminator information for spatial trees
inferred← citeshttps://doi.org/10.1145/564691.564709openalex-snapshot
Implementing database operations using SIMD instructions
inferred← citeshttps://doi.org/10.1145/584792.584860openalex-snapshot
Trajectory queries and octagons in moving object databases
inferred← citeshttps://doi.org/10.1145/781027.781063openalex-snapshot
Effect of node size on the performance of cache-conscious B + -trees
inferred← citeshttps://doi.org/10.1145/872757.872815openalex-snapshot
Contorting high dimensional data for efficient main memory KNN processing
inferred← citeshttps://doi.org/10.1145/885651.781063openalex-snapshot
Effect of node size on the performance of cache-conscious B + -trees
inferred← citeshttps://doi.org/10.11606/d.45.2004.tde-20210729-134728openalex-snapshot
Índices para consultas por conteúdo em bancos de dados heterogêneos
inferred← citeshttps://doi.org/10.14778/2556549.2556570openalex-snapshot
An experimental analysis of iterated spatial joins in main memory
inferred← citeshttps://doi.org/10.14778/2735461.2735470openalex-snapshot
Spatial joins in main memory
inferred← citeshttps://doi.org/10.1590/s1982-21702014000100011openalex-snapshot
DWSI: an approach to solving the polygon intersection-spreading problem with a parallel union algorithm at the feature layer level
inferred← citeshttps://doi.org/10.2197/ipsjdc.2.25openalex-snapshot
Array-based Cache Conscious Trees
inferred← citeshttps://doi.org/10.22215/etd/2018-12991openalex-snapshot
Distributed Real-Time Analysis of High-Velocity Many-Dimensional Data Sets
inferred← citeshttps://doi.org/10.3745/kipstd.2004.11d.1.001openalex-snapshot
Design and Implementation of Java-based Spatial Web Database System
inferred← citeshttps://doi.org/10.3745/kipstd.2004.11d.1.011openalex-snapshot
Design and Implementation of a Main-Memory Database System for Real-time Mobile GIS Application
inferred← citeshttps://doi.org/10.3745/kipstd.2006.13d.4.463openalex-snapshot
Prefetch R-tree: A Disk and Cache Optimized Multidimensional Index Structure
inferred← citeshttps://doi.org/10.3745/kipstd.2007.14-d.1.021openalex-snapshot
CC-GiST: A Generalized Framework for Efficiently Implementing Arbitrary Cache-Conscious Search Trees
inferred← citeshttps://doi.org/10.48550/arxiv.2005.08600openalex-snapshot
A Two-level Spatial In-Memory Index
inferred← citeshttps://doi.org/10.5441/002/edbt.2014.20openalex-snapshot
Spatial Data Management Challenges in the Simulation Sciences
inferred← citeshttps://doi.org/10.5441/002/edbt.2019.16openalex-snapshot
BB-Tree: A practical and efficient main-memory index structure for multidimensional workloads
inferred← citeshttps://doi.org/10.7916/d8057ps0openalex-snapshot
Improving Database Performance on Simultaneous Multithreading Processors
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.