On the public citation graph

External segment trees

0 signed · 67 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/3-540-19074-0_62openalex-snapshot

The twin grid file: A nearly space optimal index structure

inferredcites →https://doi.org/10.1007/3-540-19074-0_70openalex-snapshot

Geo-relational algebra: A model and query language for geometric database systems

inferredcites →https://doi.org/10.1007/3-540-51295-0_140openalex-snapshot

Advances in the design of the BANG file

inferredcites →https://doi.org/10.1007/3-540-51295-0_142openalex-snapshot

The arc tree: An approximation scheme to represent arbitrary curved shapes

inferredcites →https://doi.org/10.1007/3-540-52208-5_20openalex-snapshot

The fieldtree: A data structure for geographic information systems

inferredcites →https://doi.org/10.1007/3-540-52208-5_23openalex-snapshot

Performance comparison of point and spatial access methods

inferredcites →https://doi.org/10.1007/3-540-52208-5_33openalex-snapshot

A well-behaved file structure for the storage of spatial objects

inferredcites →https://doi.org/10.1007/978-3-642-67838-7_35openalex-snapshot

Multidimensional B-tree: An efficient dynamic file structure for exact match queries

inferredcites →https://doi.org/10.1007/978-3-642-71388-0_42openalex-snapshot

Hintergrundspeicherstrukturen für ausgedehnte Objekte

inferredcites →https://doi.org/10.1007/978-3-642-72617-0_17openalex-snapshot

Spatial kd-Tree: A Data Structure for Geographic Database

inferredcites →https://doi.org/10.1007/978-3-642-74571-3_19openalex-snapshot

The Implementation of the Cell Tree: Design Alternatives and Performance Evaluation

inferredcites →https://doi.org/10.1007/978-3-642-77590-1openalex-snapshot

Intervall-Indexstrukturen in Datenbanksystemen

inferredcites →https://doi.org/10.1007/bf00288933openalex-snapshot

Quad trees a data structure for retrieval on composite keys

inferredcites →https://doi.org/10.1007/bf01932838openalex-snapshot

MultidimensionalB-trees: Analysis of dynamic behavior

inferredcites →https://doi.org/10.1007/bf01934457openalex-snapshot

Interpolation-based index maintenance

inferredcites →https://doi.org/10.1007/bf03037383openalex-snapshot

A Logic-based Calculus of Events

inferredcites →https://doi.org/10.1007/bfb0017305openalex-snapshot

Dynamic k-dimensional multiway search under time-varying access frequencies

inferredcites →https://doi.org/10.1007/bfb0035830openalex-snapshot

Maintaining range trees in secondary memory

inferredcites →https://doi.org/10.1016/0020-0190(79)90117-0openalex-snapshot

Decomposable searching problems

inferredcites →https://doi.org/10.1016/0020-0190(81)90053-3openalex-snapshot

On the intersection of Orthogonal objects

inferredcites →https://doi.org/10.1016/0734-189x(84)90215-9openalex-snapshot

A file organization for geographic information systems based on spatial proximity

inferredcites →https://doi.org/10.1016/s0019-9958(84)80011-xopenalex-snapshot

Dynamic C-oriented polygonal intersection searching

inferredcites →https://doi.org/10.1109/dac.1982.1585522openalex-snapshot

The EXCELL Method for Efficient Geometric Access to Data

inferredcites →https://doi.org/10.1109/icde.1986.7266242openalex-snapshot

Towards an implementation of database management systems with temporal support

inferredcites →https://doi.org/10.1109/icde.1988.105439openalex-snapshot

PLOP-hashing: A grid file without directory

inferredcites →https://doi.org/10.1109/icde.1988.105496openalex-snapshot

Spatial searching in geometric databases

inferredcites →https://doi.org/10.1109/icde.1988.105505openalex-snapshot

Globally order preserving multidimensional linear hashing

inferredcites →https://doi.org/10.1109/tcad.1985.1270098openalex-snapshot

Geographical Data Structures Compared: A Study of Data Structures Supporting Region Queries

inferredcites →https://doi.org/10.1109/tse.1979.234200openalex-snapshot

Multidimensional Binary Search Trees in Database Applications

inferredcites →https://doi.org/10.1137/0214021openalex-snapshot

Priority Search Trees

inferredcites →https://doi.org/10.1145/1499949.1500029openalex-snapshot

INGRES

inferredcites →https://doi.org/10.1145/182.358434openalex-snapshot

Maintaining knowledge about temporal intervals

inferredcites →https://doi.org/10.1145/22952.22956openalex-snapshot

The temporal query language TQuel

inferredcites →https://doi.org/10.1145/318898.318921openalex-snapshot

A taxonomy of time databases

inferredcites →https://doi.org/10.1145/348.318586openalex-snapshot

The Grid File

inferredcites →https://doi.org/10.1145/361002.361007openalex-snapshot

Multidimensional binary search trees used for associative searching

inferredcites →https://doi.org/10.1145/38713.38758openalex-snapshot

Analysis of object oriented spatial access methods

inferredcites →https://doi.org/10.1145/50020.50021openalex-snapshot

Hierarchical representations of collections of small rectangles

inferredcites →https://doi.org/10.1145/50202.50222openalex-snapshot

Twin grid files: space optimizing access schemes

inferredcites →https://doi.org/10.1145/582353.582389openalex-snapshot

Efficient spatial access to a data base

inferredcites →https://doi.org/10.1145/6012.6015openalex-snapshot

Balanced multidimensional extendible hash tree

inferredcites →https://doi.org/10.1145/602259.602266openalex-snapshot

R-trees

inferredcites →https://doi.org/10.1145/971701.50222openalex-snapshot

Twin grid files: space optimizing access schemes

inferredcites →https://doi.org/10.1184/r1/6610748openalex-snapshot

The R+-Tree: A Dynamic Index for Multi-Dimensional Objects

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

inferredcites →https://doi.org/10.5555/800263.809228openalex-snapshot

The EXCELL Method for Efficient Geometric Access to Data

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jcss.1996.0043openalex-snapshot

Indexing for Data Models with Constraints and Classes

inferred← citeshttps://doi.org/10.1007/978-0-387-39940-9_1513openalex-snapshot

Valid-Time Indexing

inferred← citeshttps://doi.org/10.1007/978-1-4419-8590-3_4openalex-snapshot

Access Methods for Intervals

inferred← citeshttps://doi.org/10.1007/978-3-642-14959-7_8openalex-snapshot

Temporal Indexes Supporting Valid Time

inferred← citeshttps://doi.org/10.1007/bf02948836openalex-snapshot

Dynamic interval index structure in constraint database systems

inferred← citeshttps://doi.org/10.1007/s10619-026-07459-1openalex-snapshot

Cartempian model: a spatial perspective for temporal interval queries using graph databases

inferred← citeshttps://doi.org/10.1016/b978-155860588-6/50011-7openalex-snapshot

Bibliography

inferred← citeshttps://doi.org/10.1016/j.is.2017.08.005openalex-snapshot

Efficiently answer top-k queries on typed intervals

inferred← citeshttps://doi.org/10.1109/icde.2013.6544892openalex-snapshot

Efficient snapshot retrieval over historical graph data

inferred← citeshttps://doi.org/10.1109/ideas.2002.1029652openalex-snapshot

Interval processing with the UB-Tree

inferred← citeshttps://doi.org/10.1109/raid67961.2025.00036openalex-snapshot

TypeFlexer: Type Directed Flexible Program Partitioning

inferred← citeshttps://doi.org/10.1109/sfcs.1996.548515openalex-snapshot

Optimal dynamic interval management in external memory

inferred← citeshttps://doi.org/10.1109/time.2000.856594openalex-snapshot

An incremental batch-oriented index for bitemporal databases

inferred← citeshttps://doi.org/10.1109/tpami.2025.3610211openalex-snapshot

Efficient Nearest Neighbor Search Using Dynamic Programming

inferred← citeshttps://doi.org/10.1137/s009753970240481xopenalex-snapshot

Optimal External Memory Interval Management

inferred← citeshttps://doi.org/10.1145/182591.182595openalex-snapshot

Path caching (extended abstract)

inferred← citeshttps://doi.org/10.1145/319806.319816openalex-snapshot

Comparison of access methods for time-evolving data

inferred← citeshttps://doi.org/10.1145/3837093openalex-snapshot

AITTI: Augmented Interval Tree for Temporal Indexing

inferred← citeshttps://doi.org/10.48550/arxiv.1509.08960openalex-snapshot

Storing and Analyzing Historical Graph Data at Scale

inferred← citeshttps://doi.org/10.5282/edoc.6231openalex-snapshot

Enhanced Query Processing on Complex Spatial and Temporal Data

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.