On the public citation graph
Scalable access within the context of digital libraries
0 signed · 57 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-49257-7_17openalex-snapshot
Optimal Dynamic Range Searching inNon-replicating Index Structures
inferredcites →https://doi.org/10.1007/3-540-62222-5_39openalex-snapshot
Selection of views to materialize in a data warehouse
inferredcites →https://doi.org/10.1007/978-3-642-59412-0_18openalex-snapshot
The Entity Relationship Model — Toward a Unified View of Data
inferredcites →https://doi.org/10.1016/0169-7552(95)00098-5openalex-snapshot
The Harvest information discovery and access system
inferredcites →https://doi.org/10.1016/0306-4379(95)98559-vopenalex-snapshot
Efficient organization and access of multi-dimensional datasets on tertiary storage systems
inferredcites →https://doi.org/10.1016/0377-2217(95)90067-5openalex-snapshot
Heuristic scheduling systems with applications to production systems and project management
inferredcites →https://doi.org/10.1080/15458830.1996.11770714openalex-snapshot
Scheduling: Theory, Algorithms, and Systems
inferredcites →https://doi.org/10.1109/2.493457openalex-snapshot
A digital library for geographically referenced materials
inferredcites →https://doi.org/10.1109/34.531803openalex-snapshot
Texture features for browsing and retrieval of image data
inferredcites →https://doi.org/10.1109/dexa.1997.617416openalex-snapshot
Scheduling tertiary I/O in database applications
inferredcites →https://doi.org/10.1109/icde.1994.283048openalex-snapshot
Efficient organization of large multidimensional arrays
inferredcites →https://doi.org/10.1109/icde.1996.492085openalex-snapshot
A log-stuctured organization for tertiary storage
inferredcites →https://doi.org/10.1109/ideas.1997.625695openalex-snapshot
Indexing non-uniform spatial data
inferredcites →https://doi.org/10.1109/mass.1995.528232openalex-snapshot
Analysis of striping techniques in robotic storage libraries
inferredcites →https://doi.org/10.1109/sfcs.1996.548514openalex-snapshot
New algorithms for the disk scheduling problem
inferredcites →https://doi.org/10.1109/spdp.1996.570358openalex-snapshot
Parallelizing multidimensional index structures
inferredcites →https://doi.org/10.1142/9789812819536_0004openalex-snapshot
Classifying Network Architectures for Locating Information Sources
inferredcites →https://doi.org/10.1145/1479992.1479994openalex-snapshot
Properties of disk scheduling policies in multiprogrammed computer systems
inferredcites →https://doi.org/10.1145/169627.169757openalex-snapshot
Striping in large tape libraries
inferredcites →https://doi.org/10.1145/191839.191925openalex-snapshot
Fast subsequence matching in time-series databases
inferredcites →https://doi.org/10.1145/191843.191925openalex-snapshot
Fast subsequence matching in time-series databases
inferredcites →https://doi.org/10.1145/212433.220198openalex-snapshot
Answering queries using views (extended abstract)
inferredcites →https://doi.org/10.1145/223784.223796openalex-snapshot
A general solution of the n-dimensional B-tree problem
inferredcites →https://doi.org/10.1145/233269.233332openalex-snapshot
Random I/O scheduling in online tertiary storage systems
inferredcites →https://doi.org/10.1145/233269.233333openalex-snapshot
Implementing data cubes efficiently
inferredcites →https://doi.org/10.1145/238355.238365openalex-snapshot
Efficient retrieval for browsing large image databases
inferredcites →https://doi.org/10.1145/266220.266230openalex-snapshot
Browsing and placement of multiresolution images on parallel disks
inferredcites →https://doi.org/10.1145/331697.331730openalex-snapshot
A brief survey of tertiary storage systems and research
inferredcites →https://doi.org/10.1145/38713.38743openalex-snapshot
The BANG file: A new kind of grid file
inferredcites →https://doi.org/10.1145/66926.66955openalex-snapshot
Retrieval performance versus disc space utilization on WORM optical discs
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.2307/1571915openalex-snapshot
Textures: A Photographic Album for Artists and Designers
inferredcites →https://doi.org/10.3758/bf03203370openalex-snapshot
Improving the retrieval of information from external sources
inferredcites →https://doi.org/10.7551/mitpress/4472.003.0012openalex-snapshot
Answering Queries Using Views
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-47724-1_14openalex-snapshot
Constrained Nearest Neighbor Queries
inferred← citeshttps://doi.org/10.1007/978-3-540-78568-2_33openalex-snapshot
Automated Data Discovery in Similarity Score Queries
inferred← citeshttps://doi.org/10.1007/s00530-002-0068-xopenalex-snapshot
Browsing and placement of multi-resolution images on parallel disks
inferred← citeshttps://doi.org/10.1007/s10115-009-0233-zopenalex-snapshot
Practical protocol for Yao’s millionaires problem enables secure multi-party computation of metrics and efficient privacy-preserving k-NN for large data sets
inferred← citeshttps://doi.org/10.1016/j.is.2005.01.001openalex-snapshot
High dimensional nearest neighbor searching
inferred← citeshttps://doi.org/10.1023/b:dapd.0000045550.56749.75openalex-snapshot
Optimal Data-Space Partitioning of Spatial Data for Parallel I/O
inferred← citeshttps://doi.org/10.1023/b:jmse.0000043449.85576.daopenalex-snapshot
Optimal Data-Space Partitioning of Spatial Data for Parallel I/O
inferred← citeshttps://doi.org/10.1109/escience.2010.10openalex-snapshot
Applying Data Mining and Mathematical Morphology to Borehole Data Coming from Exploration and Mining Industry
inferred← citeshttps://doi.org/10.1109/icde.1998.655763openalex-snapshot
Cyclic allocation of two-dimensional data
inferred← citeshttps://doi.org/10.1109/ptp.2003.1231501openalex-snapshot
Peer-to-peer spatial queries in sensor networks
inferred← citeshttps://doi.org/10.1109/tkde.2004.9openalex-snapshot
Dimensionality reduction and similarity computation by inner-product approximations
inferred← citeshttps://doi.org/10.1145/277651.277674openalex-snapshot
Efficient disk allocation for fast similarity searching
inferred← citeshttps://doi.org/10.1145/354756.354820openalex-snapshot
Vector approximation based indexing for non-uniform high dimensional data sets
inferred← citeshttps://doi.org/10.1145/354756.354822openalex-snapshot
Dimensionality reduction and similarity computation by inner product approximations
inferred← citeshttps://doi.org/10.1145/502585.502587openalex-snapshot
Efficient processing of conical queries
inferred← citeshttps://doi.org/10.1145/584792.584813openalex-snapshot
Vulnerabilities in similarity search based systems
inferred← citeshttps://doi.org/10.9790/3021-0203451453openalex-snapshot
Indexing of Query on Spatial Data in P2P Systems
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.