On the public citation graph

Tree vector indexes: efficient range queries for dynamic content on peer-to-peer networks

0 signed · 28 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-45518-3_18openalex-snapshot
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
inferredcites →https://doi.org/10.1007/978-3-540-31838-5_2openalex-snapshot
On Using Histograms as Routing Indexes in Peer-to-Peer Systems
inferredcites →https://doi.org/10.1007/978-3-540-45172-3_11openalex-snapshot
On Death, Taxes, and the Convergence of Peer-to-Peer and Grid Computing
inferredcites →https://doi.org/10.1016/s0278-6125(99)90119-xopenalex-snapshot
Simulation modeling and analysis
inferredcites →https://doi.org/10.1109/dexa.2005.166openalex-snapshot
Resource Discovery in a Dynamic Grid Environment
inferredcites →https://doi.org/10.1109/grid.2003.1261714openalex-snapshot
MAAN: a multi-attribute addressable network for grid information services
inferredcites →https://doi.org/10.1109/icdcs.2002.1022239openalex-snapshot
Routing indices for peer-to-peer systems
inferredcites →https://doi.org/10.1109/jsac.2003.814666openalex-snapshot
Building low-diameter peer-to-peer networks
inferredcites →https://doi.org/10.1109/mic.2003.1215667openalex-snapshot
Toward a synergy between p2p and grids
inferredcites →https://doi.org/10.1109/ptp.2002.1046310openalex-snapshot
Scalable, efficient range queries for grid information services
inferredcites →https://doi.org/10.1109/tnet.2002.808407openalex-snapshot
Chord: a scalable peer-to-peer lookup protocol for internet applications
inferredcites →https://doi.org/10.1145/1013367.1013490openalex-snapshot
P-tree
inferredcites →https://doi.org/10.1145/1017074.1017081openalex-snapshot
One torus to rule them all
inferredcites →https://doi.org/10.1145/383059.383072openalex-snapshot
A scalable content-addressable network
inferredcites →https://doi.org/10.1145/606272.606299openalex-snapshot
Looking up data in P2P systems
inferredcites →https://doi.org/10.1145/964723.383072openalex-snapshot
A scalable content-addressable network
inferredcites →https://doi.org/10.2307/2288169openalex-snapshot
Simulation Modeling and Analysis.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/s10115-014-0739-xopenalex-snapshot
A new ant colony optimization-based algorithm for range query answering problem in relational schema-based P2P database systems
inferred← citeshttps://doi.org/10.1007/s11280-010-0107-zopenalex-snapshot
Comparing data summaries for processing live queries over Linked Data
inferred← citeshttps://doi.org/10.1016/j.future.2015.07.020openalex-snapshot
dragon: Multidimensional range queries on distributed aggregation trees
inferred← citeshttps://doi.org/10.1016/j.jnca.2017.03.021openalex-snapshot
Fractal: An advanced multidimensional range query lookup protocol on nested rings for distributed systems
inferred← citeshttps://doi.org/10.1016/j.parco.2007.02.006openalex-snapshot
Peer-to-peer systems for discovering resources in a dynamic grid
inferred← citeshttps://doi.org/10.1109/nca.2008.14openalex-snapshot
FaSReD: Fast and Scalable Resource Discovery in Support of Multiple Resource Range Requirements for Computational Grids
inferred← citeshttps://doi.org/10.1109/wicom.2010.5601249openalex-snapshot
The Geographic Structure Query Language Based on the Peer to Peer and Cooperating Computing Hybrid Discovering Model
inferred← citeshttps://doi.org/10.1145/1772690.1772733openalex-snapshot
Data summaries for on-demand queries over linked data
inferred← citeshttps://doi.org/10.14257/ijfgcn.2016.9.9.19openalex-snapshot
Computational Nodes Location using Spatial Points Clustering in P2P Network System
inferred← citeshttps://doi.org/10.4028/www.scientific.net/aef.6-7.937openalex-snapshot
A Dynamic Resource Management Scheme on P2P-Based Grid Systems
inferred← citeshttps://doi.org/10.4108/icst.collaboratecom2009.8356openalex-snapshot
DDT: A distributed data structure for the support of P2P range query
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.