On the public citation graph
Efficient Creation and Incremental Maintenance of the HOPI Index for Complex XML Document Collections
0 signed · 117 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/978-3-540-30192-9_20openalex-snapshot
L-Tree: A Dynamic Labeling Structure for Ordered XML Data
inferredcites →https://doi.org/10.1007/978-3-540-30192-9_22openalex-snapshot
Dynamic Range Labeling for XML Trees
inferredcites →https://doi.org/10.1007/978-3-540-30192-9_23openalex-snapshot
FliX: A Flexible Framework for Indexing Complex XML Document Collections
inferredcites →https://doi.org/10.1007/978-3-540-39429-7_10openalex-snapshot
Tree Signatures for XML Querying and Navigation
inferredcites →https://doi.org/10.1007/978-3-540-45194-5_19openalex-snapshot
The INEX Evaluation Initiative
inferredcites →https://doi.org/10.1109/icde.2002.994696openalex-snapshot
Detecting changes in XML documents
inferredcites →https://doi.org/10.1109/icde.2003.1260818openalex-snapshot
X-Diff: an effective change detection algorithm for XML documents
inferredcites →https://doi.org/10.1109/icde.2004.1319985openalex-snapshot
A prime number labeling scheme for dynamic ordered XML trees
inferredcites →https://doi.org/10.1109/icde.2004.1320037openalex-snapshot
Multiresolution indexing of XML for frequent queries
inferredcites →https://doi.org/10.1109/mwscas.2003.1562604openalex-snapshot
Index-supported on XML-documents containing links
inferredcites →https://doi.org/10.1137/s0097539702403098openalex-snapshot
Reachability and Distance Queries via 2-Hop Labels
inferredcites →https://doi.org/10.1145/1007568.1007624openalex-snapshot
Incremental maintenance of XML structural indexes
inferredcites →https://doi.org/10.1145/564691.564705openalex-snapshot
Accelerating XPath location steps
inferredcites →https://doi.org/10.1145/564691.564707openalex-snapshot
Covering indexes for branching path queries
inferredcites →https://doi.org/10.1145/872757.872761openalex-snapshot
Querying structured text in an XML database
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11530084_7openalex-snapshot
Querying Ontologies in Relational Database Systems
inferred← citeshttps://doi.org/10.1007/11687238_56openalex-snapshot
Fast Computation of Reachability Labeling for Large Graphs
inferred← citeshttps://doi.org/10.1007/11733836_47openalex-snapshot
Fast Reachability Query Processing
inferred← citeshttps://doi.org/10.1007/11799511_15openalex-snapshot
Using Term Lists and Inverted Files to Improve Search Speed for Metabolic Pathway Databases
inferred← citeshttps://doi.org/10.1007/978-1-4419-6045-0openalex-snapshot
Managing and Mining Graph Data
inferred← citeshttps://doi.org/10.1007/978-1-4419-6045-0_4openalex-snapshot
Query Language and Access Methods for Graph Databases
inferred← citeshttps://doi.org/10.1007/978-1-4419-6045-0_6openalex-snapshot
Graph Reachability Queries: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-030-73197-7_52openalex-snapshot
DBL: Efficient Reachability Queries on Dynamic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-46565-4_17openalex-snapshot
Modified MinG Algorithm to Find Top-K Shortest Paths from large RDF Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-55699-4_41openalex-snapshot
Edge Influence Computation in Dynamic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-00887-0_12openalex-snapshot
A Uniform Framework for Ad-Hoc Indexes to Answer Reachability Queries on Large Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-02279-1_29openalex-snapshot
Evaluating Reachability Queries over Path Collections
inferred← citeshttps://doi.org/10.1007/978-3-642-11486-1_11openalex-snapshot
Towards a Scalable, Pragmatic Knowledge Representation Language for the Web
inferred← citeshttps://doi.org/10.1007/978-3-642-14589-6_2openalex-snapshot
On-Line Preferential Nearest Neighbor Browsing in Large Attributed Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-15349-5_13openalex-snapshot
Efficient Graph Reachability Query Answering Using Tree Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-642-37453-1_16openalex-snapshot
Spectral Decomposition for Optimal Graph Index Prediction
inferred← citeshttps://doi.org/10.1007/978-90-481-9794-1_26openalex-snapshot
Data Engineering in Graph Databases
inferred← citeshttps://doi.org/10.1007/s00778-009-0141-6openalex-snapshot
Optimizing updates of recursive XML views of relations
inferred← citeshttps://doi.org/10.1007/s00778-011-0256-4openalex-snapshot
GRAIL: a scalable index for reachability queries in very large graphs
inferred← citeshttps://doi.org/10.1007/s00778-012-0274-xopenalex-snapshot
The exact distance to destination in undirected world
inferred← citeshttps://doi.org/10.1007/s00778-012-0288-4openalex-snapshot
Computing weight constraint reachability in large networks
inferred← citeshttps://doi.org/10.1007/s00778-021-00715-zopenalex-snapshot
Span-reachability querying in large temporal graphs
inferred← citeshttps://doi.org/10.1007/s00778-025-00951-7openalex-snapshot
On Querying Historical Connectivity in Large-scale Temporal Graphs
inferred← citeshttps://doi.org/10.1007/s11280-016-0407-zopenalex-snapshot
HD-GDD: high dimensional graph dominance drawing approach for reachability query
inferred← citeshttps://doi.org/10.1007/s11280-016-0421-1openalex-snapshot
Efficient computation of distance labeling for decremental updates in large dynamic graphs
inferred← citeshttps://doi.org/10.1007/s11390-008-9150-yopenalex-snapshot
Updating Recursive XML Views of Relations
inferred← citeshttps://doi.org/10.1007/s11390-016-1633-7openalex-snapshot
Answering Reachability Queries on Incrementally Updated Graphs by Hierarchical Labeling Schema
inferred← citeshttps://doi.org/10.1016/j.jbi.2011.11.012openalex-snapshot
k-Neighborhood decentralization: A comprehensive solution to index the UMLS for large scale knowledge discovery
inferred← citeshttps://doi.org/10.1016/j.jcss.2015.06.008openalex-snapshot
Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs
inferred← citeshttps://doi.org/10.1016/j.neucom.2015.04.003openalex-snapshot
A hierarchical model for label constraint reachability computation
inferred← citeshttps://doi.org/10.1109/iadcc.2013.6514365openalex-snapshot
GRU: Efficient reachability answering for large graphs using united interval labeling
inferred← citeshttps://doi.org/10.1109/iccnit.2011.6020908openalex-snapshot
MinG: An efficient algorithm to mine graphs for semantic associations
inferred← citeshttps://doi.org/10.1109/icde.2006.53openalex-snapshot
Dual Labeling: Answering Graph Reachability Queries in Constant Time
inferred← citeshttps://doi.org/10.1109/icde.2007.367922openalex-snapshot
Updating Recursive XML Views of Relations
inferred← citeshttps://doi.org/10.1109/icde.2008.4497498openalex-snapshot
An Efficient Algorithm for Answering Graph Reachability Queries
inferred← citeshttps://doi.org/10.1109/icde.2008.4497500openalex-snapshot
Fast Graph Pattern Matching
inferred← citeshttps://doi.org/10.1109/icde.2009.191openalex-snapshot
Reachability Indexes for Relational Keyword Search
inferred← citeshttps://doi.org/10.1109/icde.2011.5767832openalex-snapshot
Decomposing DAGs into spanning trees: A new way to compress transitive closures
inferred← citeshttps://doi.org/10.1109/icde.2016.7498236openalex-snapshot
Reachability and time-based path queries in temporal graphs
inferred← citeshttps://doi.org/10.1109/icde.2019.00049openalex-snapshot
ARROW: Approximating Reachability Using Random Walks Over Web-Scale Graphs
inferred← citeshttps://doi.org/10.1109/icde48307.2020.00104openalex-snapshot
Efficiently Answering Span-Reachability Queries in Large Temporal Graphs
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00172openalex-snapshot
IFCA: Index-Free Community-Aware Reachability Processing Over Large Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00090openalex-snapshot
HL-Index: Fast Reachability Query in Hypergraphs
inferred← citeshttps://doi.org/10.1109/icdew.2010.5452724openalex-snapshot
Graph indexing for reachability queries
inferred← citeshttps://doi.org/10.1109/icdew.2010.5452732openalex-snapshot
Evaluating path queries over route collections
inferred← citeshttps://doi.org/10.1109/icdew.2019.000-9openalex-snapshot
Reachability in Large Graphs Using Bloom Filters
inferred← citeshttps://doi.org/10.1109/sitis.2008.31openalex-snapshot
Core Labeling: A New Way to Compress Transitive Closure
inferred← citeshttps://doi.org/10.1109/skg.2013.21openalex-snapshot
3-Hop: A Novel Hop-Based Reachability Index
inferred← citeshttps://doi.org/10.1109/socialcom-passat.2012.73openalex-snapshot
Efficient Graph Models for Retrieving Top-k News Feeds from Ego Networks
inferred← citeshttps://doi.org/10.1109/swod.2007.353193openalex-snapshot
Efficient reachability test on directed graphs and its application to large XML data
inferred← citeshttps://doi.org/10.1109/tkde.2007.1060openalex-snapshot
Efficiently Querying Large XML Data Repositories: A Survey
inferred← citeshttps://doi.org/10.1109/tkde.2009.117openalex-snapshot
Incremental Maintenance of 2-Hop Labeling of Large Graphs
inferred← citeshttps://doi.org/10.1109/tkde.2010.169openalex-snapshot
Graph Pattern Matching: A Join/Semijoin Approach
inferred← citeshttps://doi.org/10.1109/tkde.2011.30openalex-snapshot
Evaluating Path Queries over Frequently Updated Route Collections
inferred← citeshttps://doi.org/10.1109/tsc.2020.2969898openalex-snapshot
Providing Fast Reachability Query Services With MGTag: A Multi-Dimensional Graph Labeling Method
inferred← citeshttps://doi.org/10.1145/1168092.1168099openalex-snapshot
The database research group at the Max-Planck Institute for Informatics
inferred← citeshttps://doi.org/10.1145/1247480.1247573openalex-snapshot
Fast and practical indexing and querying of very large graphs
inferred← citeshttps://doi.org/10.1145/1328438.1328480openalex-snapshot
Extensible encoding of type hierarchies
inferred← citeshttps://doi.org/10.1145/1328897.1328480openalex-snapshot
Extensible encoding of type hierarchies
inferred← citeshttps://doi.org/10.1145/1352431.1352458openalex-snapshot
Fast computing reachability labelings for large graphs with high compression rate
inferred← citeshttps://doi.org/10.1145/1353343.1353370openalex-snapshot
Fast computing reachability labelings for large graphs with high compression rate
inferred← citeshttps://doi.org/10.1145/1367497.1367611openalex-snapshot
On incremental maintenance of 2-hop labeling of graphs
inferred← citeshttps://doi.org/10.1145/1370256.1370293openalex-snapshot
A new method for generating compressed representation of transitive closure
inferred← citeshttps://doi.org/10.1145/1516360.1516417openalex-snapshot
On-line exact shortest distance query processing
inferred← citeshttps://doi.org/10.1145/1516360.1516418openalex-snapshot
Efficiently indexing shortest paths by exploiting symmetry in graphs
inferred← citeshttps://doi.org/10.1145/1557626.1557665openalex-snapshot
General spanning trees and reachability query evaluation
inferred← citeshttps://doi.org/10.1145/1871437.1871625openalex-snapshot
A hierarchical approach to reachability query answering in very large graph databases
inferred← citeshttps://doi.org/10.1145/1935826.1935879openalex-snapshot
Efficient online ad serving in a display advertising exchange
inferred← citeshttps://doi.org/10.1145/1963405.1963476openalex-snapshot
Efficiently evaluating graph constraints in content-based publish/subscribe
inferred← citeshttps://doi.org/10.1145/2396761.2396881openalex-snapshot
Pay-as-you-go maintenance of precomputed nearest neighbors in large graphs
inferred← citeshttps://doi.org/10.1145/2530531openalex-snapshot
Shortest-path queries in static networks
inferred← citeshttps://doi.org/10.1145/2588555.2612181openalex-snapshot
Reachability queries on large dynamic graphs
inferred← citeshttps://doi.org/10.1145/3448016.3459245openalex-snapshot
P2H: Efficient Distance Querying on Road Networks by Projected Vertex Separators
inferred← citeshttps://doi.org/10.1145/3555041.3589408openalex-snapshot
An Overview of Reachability Indexes on Graphs
inferred← citeshttps://doi.org/10.1145/3654960openalex-snapshot
On Querying Historical Connectivity in Temporal Graphs
inferred← citeshttps://doi.org/10.1145/3698805openalex-snapshot
Constant-time Connectivity Querying in Dynamic Graphs
inferred← citeshttps://doi.org/10.1145/3767166openalex-snapshot
ReachCheck: Compositional Library-Aware Call Graph Reachability Analysis in the IDEs
inferred← citeshttps://doi.org/10.1527/tjsai.22.191openalex-snapshot
Fast Reachability Test on DAGs for XML
inferred← citeshttps://doi.org/10.3233/fi-2013-921openalex-snapshot
Generalized Hybrid Encoding of Polyhierarchical Structures
inferred← citeshttps://doi.org/10.32657/10356/42234openalex-snapshot
On incremental maintenance of 2-hop labeling of graphs
inferred← citeshttps://doi.org/10.32657/10356/61838openalex-snapshot
Efficient query processing on large graphs
inferred← citeshttps://doi.org/10.3389/fdata.2024.1427104openalex-snapshot
ActiveReach: an active learning framework for approximate reachability query answering in large-scale graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1109.2641openalex-snapshot
More Compact Oracles for Approximate Distances in Planar Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1301.0977openalex-snapshot
DAGGER: A Scalable Index for Reachability Queries in Large Dynamic Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1601.05909openalex-snapshot
Efficient Processing of Reachability and Time-Based Path Queries in a Temporal Graph
inferred← citeshttps://doi.org/10.48550/arxiv.2101.09441openalex-snapshot
DBL: Efficient Reachability Queries on Dynamic Graphs (Complete Version)
inferred← citeshttps://doi.org/10.5441/002/edbt.2014.46openalex-snapshot
Reachability Queries in Very Large Graphs: A Fast Refined Online Search Approach
inferred← citeshttps://doi.org/10.5441/002/edbt.2015.12openalex-snapshot
TimeReach: Historical Reachability Queries on Evolving Graphs
inferred← citeshttps://doi.org/10.5441/002/edbt.2015.14openalex-snapshot
SIEF: Efficiently Answering Distance Queries for Failure Prone Graphs
inferred← citeshttps://doi.org/10.5555/1182635.1164150openalex-snapshot
An incrementally maintainable index for approximate lookups in hierarchical 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.