On the public citation graph

Implementation of the grid file: Design concepts and experience

0 signed · 68 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-642-55481-0openalex-snapshot
Programming in Prolog
inferredcites →https://doi.org/10.1007/978-3-642-83565-0openalex-snapshot
Programming in Modula-2
inferredcites →https://doi.org/10.1007/bf01934379openalex-snapshot
Analysis of grid file algorithms
inferredcites →https://doi.org/10.1007/bf01934393openalex-snapshot
The extendible cell method for closest point problems
inferredcites →https://doi.org/10.1007/bf01934457openalex-snapshot
Interpolation-based index maintenance
inferredcites →https://doi.org/10.1007/bf01934994openalex-snapshot
On search by address computation
inferredcites →https://doi.org/10.1007/bf02247933openalex-snapshot
A storage scheme for extendible arrays
inferredcites →https://doi.org/10.1109/tse.1979.234200openalex-snapshot
Multidimensional Binary Search Trees in Database Applications
inferredcites →https://doi.org/10.1109/tse.1982.236022openalex-snapshot
Analysis of Extendible Hashing
inferredcites →https://doi.org/10.1145/320083.320092openalex-snapshot
Extendible hashing—a fast access method for dynamic files
inferredcites →https://doi.org/10.1145/348.318586openalex-snapshot
The Grid File
inferredcites →https://doi.org/10.1145/582318.582321openalex-snapshot
The K-D-B-tree
inferredcites →https://doi.org/10.1145/588058.588071openalex-snapshot
Storage mappings for multidimensional linear dynamic hashing
inferredcites →https://doi.org/10.1145/602259.602284openalex-snapshot
Performance comparison of index structures for multi-key retrieval
inferredcites →https://doi.org/10.1145/971697.602284openalex-snapshot
Performance comparison of index structures for multi-key retrieval
inferredcites →https://doi.org/10.3929/ethz-a-000325694openalex-snapshot
The grid file system: implementation and case studies of applications
inferredcites →https://doi.org/10.3929/ethz-a-005363208openalex-snapshot
The Grid file: A data structure designed to support proximity queries on spatial objects

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/0471224634.ch14openalex-snapshot
Multidimensional Indexing Structures for Content‐Based Retrieval
inferred← citeshttps://doi.org/10.1007/3-540-48309-8_97openalex-snapshot
Temporal Indexing with Multidimensional File Structures
inferred← citeshttps://doi.org/10.1007/3-540-52208-5_19openalex-snapshot
7±2 criteria for assessing and comparing spatial data structures
inferred← citeshttps://doi.org/10.1007/3-540-54009-1_13openalex-snapshot
The Nested Interpolation Based Grid File
inferred← citeshttps://doi.org/10.1007/3-540-58435-8_171openalex-snapshot
A study of spatial clustering techniques
inferred← citeshttps://doi.org/10.1007/978-1-4613-1881-1_37openalex-snapshot
Storage and Access Structures for Geometric Data Bases
inferred← citeshttps://doi.org/10.1007/978-3-319-22852-5_24openalex-snapshot
Grid-File: Towards to a Flash Efficient Multi-dimensional Index
inferred← citeshttps://doi.org/10.1007/978-3-642-37450-0_21openalex-snapshot
An In-Memory/GPGPU Approach to Query Processing for Aspect-Oriented Data Management
inferred← citeshttps://doi.org/10.1007/978-3-642-70840-4_16openalex-snapshot
Interactive deductive data management — the Smart Data Interaction package
inferred← citeshttps://doi.org/10.1007/bf00289018openalex-snapshot
Maintaining range trees in secondary memory
inferred← citeshttps://doi.org/10.1007/bf01178777openalex-snapshot
A robust and efficient spatial data structure
inferred← citeshttps://doi.org/10.1007/bfb0015932openalex-snapshot
The virtual floating grid file
inferred← citeshttps://doi.org/10.1007/bfb0035830openalex-snapshot
Maintaining range trees in secondary memory
inferred← citeshttps://doi.org/10.1007/s00778-006-0022-1openalex-snapshot
Hierarchical clustering for OLAP: the CUBE File approach
inferred← citeshttps://doi.org/10.1007/s00778-019-00559-8openalex-snapshot
Indexing in flash storage devices: a survey on challenges, current approaches, and future trends
inferred← citeshttps://doi.org/10.1007/s10619-004-0234-6openalex-snapshot
The PN-Tree: A Parallel and Distributed Multidimensional Index
inferred← citeshttps://doi.org/10.1016/0169-023x(95)00034-popenalex-snapshot
Indexing temporal data using existing B+ -trees
inferred← citeshttps://doi.org/10.1016/0306-4379(87)90029-9openalex-snapshot
Optimal bucket size for multiattribute retrieval in partitioned files
inferred← citeshttps://doi.org/10.1016/j.datak.2019.04.002openalex-snapshot
LB-Grid: An SSD efficient Grid File
inferred← citeshttps://doi.org/10.1016/j.patcog.2007.09.012openalex-snapshot
Symbolic image indexing and retrieval by spatial similarity: An approach based on B-tree
inferred← citeshttps://doi.org/10.1016/s0169-023x(97)00027-xopenalex-snapshot
Temporal Grid File: A file structure for interval data
inferred← citeshttps://doi.org/10.1016/s0950-5849(98)00054-8openalex-snapshot
Indexing bitemporal databases as points
inferred← citeshttps://doi.org/10.1080/136588198241897openalex-snapshot
Mean-variance analysis of the performance of spatial ordering methods
inferred← citeshttps://doi.org/10.1109/69.277778openalex-snapshot
G-tree: a new data structure for organizing multidimensional data
inferred← citeshttps://doi.org/10.1109/cmpsac.1989.65095openalex-snapshot
A partitioning method for grid file directories
inferred← citeshttps://doi.org/10.1109/icde.1988.105439openalex-snapshot
PLOP-hashing: A grid file without directory
inferred← citeshttps://doi.org/10.1109/icde.1993.344063openalex-snapshot
A new algorithm for computing joins with grid files
inferred← citeshttps://doi.org/10.1109/ms.1986.229470openalex-snapshot
A Portable Operating System Interface and Utility Library
inferred← citeshttps://doi.org/10.1109/ssdm.1996.505914openalex-snapshot
Astronomical tables, 2-D indexing, and fuzzy-joins
inferred← citeshttps://doi.org/10.1109/ssdm.1998.688106openalex-snapshot
Scalable, parallel, scientific databases
inferred← citeshttps://doi.org/10.1109/tkde.2014.2363658openalex-snapshot
Topological Transformation Approaches to Database Query Processing
inferred← citeshttps://doi.org/10.1109/tkde.2023.3242207openalex-snapshot
Spatial Index Structures for Modern Storage Devices: A Survey
inferred← citeshttps://doi.org/10.1145/1141277.1141294openalex-snapshot
Schemes for SR-Tree packing
inferred← citeshttps://doi.org/10.1145/1363189.1363196openalex-snapshot
In-memory grid files on graphics processors
inferred← citeshttps://doi.org/10.1145/143559.143644openalex-snapshot
Dynamic addition and removal of attributes in BANG files
inferred← citeshttps://doi.org/10.1145/1670679.1670682openalex-snapshot
Location-dependent query processing
inferred← citeshttps://doi.org/10.1145/238355.238503openalex-snapshot
Performance evaluation of G-tree and its application in fuzzy databases
inferred← citeshttps://doi.org/10.1145/256163.256165openalex-snapshot
Data structures for efficient broker implementation
inferred← citeshttps://doi.org/10.1145/280277.280279openalex-snapshot
Multidimensional access methods
inferred← citeshttps://doi.org/10.1145/319950.319953openalex-snapshot
Simple QSF-trees
inferred← citeshttps://doi.org/10.1145/3331076.3331091openalex-snapshot
A spatial index for hybrid storage
inferred← citeshttps://doi.org/10.1145/384192.384193openalex-snapshot
External memory algorithms and data structures
inferred← citeshttps://doi.org/10.1145/50020.50021openalex-snapshot
Hierarchical representations of collections of small rectangles
inferred← citeshttps://doi.org/10.1145/502585.502643openalex-snapshot
Dynamic and hierarchical spatial access method using integer searching
inferred← citeshttps://doi.org/10.1145/502807.502809openalex-snapshot
Searching in high-dimensional spaces
inferred← citeshttps://doi.org/10.1201/9781439828632-10openalex-snapshot
Advanced Data Structures
inferred← citeshttps://doi.org/10.1561/0400000014openalex-snapshot
Algorithms and Data Structures for External Memory
inferred← citeshttps://doi.org/10.1561/9781601981073openalex-snapshot
Algorithms and Data Structures for External Memory
inferred← citeshttps://doi.org/10.3929/ethz-a-004126124openalex-snapshot
Similarity search in high-dimensional vector spaces
inferred← citeshttps://doi.org/10.5555/2429759.2430265openalex-snapshot
An adaptive simulator for ML-rules
inferred← citeshttps://doi.org/10.5821/dissertation-2117-93958openalex-snapshot
Design and Analysis of Multidimensional Data Structures
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.