On the public citation graph
Improving the query performance of high-dimensional index structures by bulk load operations
0 signed · 80 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/bf00962238openalex-snapshot
Efficient and effective Querying by Image Content
inferredcites →https://doi.org/10.1007/bf01231606openalex-snapshot
The TV-tree: An index structure for high-dimensional data
inferredcites →https://doi.org/10.1016/b978-155860651-7/50124-8openalex-snapshot
The X-tree: An Index Structure for High-Dimensional Data Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its date appear, and…
inferredcites →https://doi.org/10.1109/icde.1993.344072openalex-snapshot
Feature-based retrieval of similar shapes
inferredcites →https://doi.org/10.1109/icde.1996.492202openalex-snapshot
Similarity indexing with the SS-tree
inferredcites →https://doi.org/10.1117/12.234810openalex-snapshot
Similarity indexing: algorithms and performance
inferredcites →https://doi.org/10.1145/115790.115821openalex-snapshot
A retrieval technique for similar shapes
inferredcites →https://doi.org/10.1145/253260.253263openalex-snapshot
Fast parallel similarity search in multimedia databases
inferredcites →https://doi.org/10.1145/263661.263671openalex-snapshot
A cost model for nearest neighbor search in high-dimensional data space
inferredcites →https://doi.org/10.1145/355744.355745openalex-snapshot
An Algorithm for Finding Best Matches in Logarithmic Expected Time
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
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-36265-7_38openalex-snapshot
Active File Systems for Data Mining and Multimedia
inferred← citeshttps://doi.org/10.1007/3-540-44676-1_1openalex-snapshot
External Memory Data Structures
inferred← citeshttps://doi.org/10.1007/3-540-44801-2_29openalex-snapshot
Determining the Convex Hull in Large Multidimensional Databases
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_10openalex-snapshot
A Framework for Index Bulk Loading and Dynamization
inferred← citeshttps://doi.org/10.1007/3-540-48298-9_27openalex-snapshot
Efficient Bulk Loading of Large High-Dimensional Indexes
inferred← citeshttps://doi.org/10.1007/3-540-48298-9_28openalex-snapshot
Implementation of Multidimensional Index Structures for Knowledge Discovery in Relational Databases
inferred← citeshttps://doi.org/10.1007/3-540-48447-7_35openalex-snapshot
Online Data Structures in External Memory
inferred← citeshttps://doi.org/10.1007/3-540-48518-x_20openalex-snapshot
Efficient Bulk Operations on Dynamic R-trees
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_10openalex-snapshot
Online Data Structures in External Memory
inferred← citeshttps://doi.org/10.1007/978-1-4615-0005-6_9openalex-snapshot
External Memory Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-319-17885-1_1556openalex-snapshot
Foundations of Nearest Neighbor Queries in Euclidean Space
inferred← citeshttps://doi.org/10.1007/978-3-319-23519-6_1556-1openalex-snapshot
Foundations of Nearest Neighbor Queries in Euclidean Space
inferred← citeshttps://doi.org/10.1007/978-3-319-45547-1_5openalex-snapshot
Bulk-Loading xBR $$^+$$ -trees
inferred← citeshttps://doi.org/10.1007/978-3-540-30198-1_35openalex-snapshot
A Study on Grid Partition for Declustering High-Dimensional Data
inferred← citeshttps://doi.org/10.1007/978-3-540-30542-2_57openalex-snapshot
Indexing Issues in Supporting Similarity Searching
inferred← citeshttps://doi.org/10.1007/978-3-540-45072-6_13openalex-snapshot
Accessing Scientific Data: Simpler is Better
inferred← citeshttps://doi.org/10.1007/978-3-540-45072-6_4openalex-snapshot
Bkd-Tree: A Dynamic Scalable kd-Tree
inferred← citeshttps://doi.org/10.1007/978-3-540-45227-0_59openalex-snapshot
Efficient Indexing of High Dimensional Normalized Histograms
inferred← citeshttps://doi.org/10.1007/978-3-540-78568-2_14openalex-snapshot
Bulk-Loading the ND-Tree in Non-ordered Discrete Data Spaces
inferred← citeshttps://doi.org/10.1007/978-3-540-85654-2_37openalex-snapshot
Space-Partitioning-Based Bulk-Loading for the NSP-Tree in Non-ordered Discrete Data Spaces
inferred← citeshttps://doi.org/10.1007/s00453-001-0107-6openalex-snapshot
Efficient Bulk Operations on Dynamic R-Trees
inferred← citeshttps://doi.org/10.1007/s00607-019-00709-4openalex-snapshot
Bulk-loading and bulk-insertion algorithms for $$\hbox {xBR}^{+}\hbox {-trees}$$ xBR + -trees in Solid State Drives
inferred← citeshttps://doi.org/10.1007/s00778-008-0121-2openalex-snapshot
Self-tuning management of update-intensive multidimensional data in clusters of workstations
inferred← citeshttps://doi.org/10.1007/s00778-010-0185-7openalex-snapshot
Efficient k-nearest neighbor search on moving object trajectories
inferred← citeshttps://doi.org/10.1007/s10115-009-0195-1openalex-snapshot
Bulk construction of dynamic clustered metric trees
inferred← citeshttps://doi.org/10.1007/s10115-013-0677-zopenalex-snapshot
Surfacing code in the dark: an instant clone search approach
inferred← citeshttps://doi.org/10.1007/s10707-014-0211-9openalex-snapshot
GMOBench: Benchmarking generic moving objects
inferred← citeshttps://doi.org/10.1007/s10707-014-0218-2openalex-snapshot
The TM-RTree: an index on generic moving objects for range queries
inferred← citeshttps://doi.org/10.1007/s11859-011-0790-3openalex-snapshot
Parallel bulk-loading of spatial data with MapReduce: An R-tree case
inferred← citeshttps://doi.org/10.1016/j.is.2009.07.002openalex-snapshot
Efficient bulk-loading on dynamic metric access methods
inferred← citeshttps://doi.org/10.1016/j.parco.2003.05.003openalex-snapshot
Parallel bulk-loading of spatial data
inferred← citeshttps://doi.org/10.1023/a:1008729828172openalex-snapshot
Multidimensional Index Structures in Relational Databases
inferred← citeshttps://doi.org/10.1023/a:1012809914301openalex-snapshot
SP-GiST: An Extensible Database Index for Supporting Space Partitioning Trees
inferred← citeshttps://doi.org/10.1109/aimsec.2011.6010420openalex-snapshot
Approach of outlier mining based on high dimension sparse clustering
inferred← citeshttps://doi.org/10.1109/cbd.2016.019openalex-snapshot
Fast Construction of an Index Tree for Large Non-ordered Discrete Datasets Using Multi-way Top-Down Split and MapReduce
inferred← citeshttps://doi.org/10.1109/icde.1998.655799openalex-snapshot
The LSD/sup h/-tree: an access structure for feature vectors
inferred← citeshttps://doi.org/10.1109/icde.2000.839456openalex-snapshot
Independent quantization: an index compression technique for high-dimensional data spaces
inferred← citeshttps://doi.org/10.1109/icde.2001.914854openalex-snapshot
A cost model and index architecture for the similarity join
inferred← citeshttps://doi.org/10.1109/icde.2004.1319982openalex-snapshot
Bulk operations for space-partitioning trees
inferred← citeshttps://doi.org/10.1109/icdew.2008.4498342openalex-snapshot
High-dimensional similarity retrieval using dimensional choice
inferred← citeshttps://doi.org/10.1109/icdew.2008.4498348openalex-snapshot
Similarity searching: Towards bulk-loading peer-to-peer networks
inferred← citeshttps://doi.org/10.1109/sccc49216.2019.8966419openalex-snapshot
Covering a Set of Points with k Bounding Boxes
inferred← citeshttps://doi.org/10.1109/sisap.2008.20openalex-snapshot
High-Dimensional Similarity Retrieval Using Dimensional Choice
inferred← citeshttps://doi.org/10.1109/sisap.2008.9openalex-snapshot
Similarity Searching: Towards Bulk-Loading Peer-to-Peer Networks
inferred← citeshttps://doi.org/10.1109/sp54263.2024.00103openalex-snapshot
Bulkor: Enabling Bulk Loading for Path ORAM
inferred← citeshttps://doi.org/10.1109/ssdm.2002.1029714openalex-snapshot
Efficient techniques for range search queries on earth science data
inferred← citeshttps://doi.org/10.1109/tpami.2007.1182openalex-snapshot
K-Nearest Neighbor Finding Using MaxNearestDist
inferred← citeshttps://doi.org/10.1145/276304.276353openalex-snapshot
High-dimensional index structures database support for next decade's applications (tutorial)
inferred← citeshttps://doi.org/10.1145/354756.354832openalex-snapshot
High performance clustering based on the similarity join
inferred← citeshttps://doi.org/10.1145/357775.357776openalex-snapshot
A cost model for query processing in high dimensional data spaces
inferred← citeshttps://doi.org/10.1145/3626742openalex-snapshot
PLATON: Top-down R-tree Packing with Learned Partition Policy
inferred← citeshttps://doi.org/10.1145/502807.502809openalex-snapshot
Searching in high-dimensional spaces
inferred← citeshttps://doi.org/10.11606/d.55.2007.tde-25042008-102856openalex-snapshot
Operação de carga-rápida (bulk-loading) em métodos de acesso métricos
inferred← citeshttps://doi.org/10.2112/si97-001.1openalex-snapshot
The Tracing of Wastewater in Enterprises Based on Hybrid Neural Network
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.