On the public citation graph
Fast in‐memory XPath search using compressed indexes
0 signed · 80 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/11547273_10openalex-snapshot
XPathMark: An XPath Benchmark for the XMark Generated Data
inferredcites →https://doi.org/10.1007/11780441_29openalex-snapshot
Reducing the Space Requirement of LZ-Index
inferredcites →https://doi.org/10.1007/978-3-540-27801-6_12openalex-snapshot
A Simple Optimal Representation for Balanced Parentheses
inferredcites →https://doi.org/10.1007/978-3-540-69068-9_26openalex-snapshot
An Improved Succinct Representation for Dynamic k-ary Trees
inferredcites →https://doi.org/10.1007/978-3-540-75530-2_21openalex-snapshot
Implicit Compression Boosting with Applications to Self-indexing
inferredcites →https://doi.org/10.1007/978-3-540-89097-3_18openalex-snapshot
Practical Rank/Select Queries over Arbitrary Sequences
inferredcites →https://doi.org/10.1007/978-3-642-03784-9_7openalex-snapshot
Compressed Suffix Arrays for Massive Data
inferredcites →https://doi.org/10.1007/978-3-642-17514-5_27openalex-snapshot
Alphabet Partitioning for Compressed Rank/Select and Applications
inferredcites →https://doi.org/10.1007/s00453-004-1146-6openalex-snapshot
Representing Trees of Higher Degree
inferredcites →https://doi.org/10.1016/b978-012722442-8/50030-6openalex-snapshot
Efficient Processing of Expressive Node-Selecting Queries on XML Data in Secondary Storage
inferredcites →https://doi.org/10.1016/b978-012722442-8/50109-9openalex-snapshot
Implementing XQuery 1.0
inferredcites →https://doi.org/10.1016/b978-155860869-6/50017-2openalex-snapshot
Efficient Algorithms for Processing XPath Queries
inferredcites →https://doi.org/10.1016/j.jal.2009.09.005openalex-snapshot
Reasoning about XML with temporal logics and automata
inferredcites →https://doi.org/10.1016/j.tcs.2007.07.013openalex-snapshot
Rank and select revisited and extended
inferredcites →https://doi.org/10.1017/cbo9780511762093openalex-snapshot
Foundations of XML Processing
inferredcites →https://doi.org/10.1089/cmb.2009.0169openalex-snapshot
Storage and Retrieval of Highly Repetitive Sequence Collections
inferredcites →https://doi.org/10.1093/bioinformatics/btn032openalex-snapshot
Compressed indexing and local alignment of DNA
inferredcites →https://doi.org/10.1093/bioinformatics/btp324openalex-snapshot
Fast and accurate short read alignment with Burrows–Wheeler transform
inferredcites →https://doi.org/10.1109/dcc.2011.47openalex-snapshot
Search and Modification in Compressed Texts
inferredcites →https://doi.org/10.1109/icde.2010.5447786openalex-snapshot
XML reasoning made practical
inferredcites →https://doi.org/10.1109/icde.2010.5447858openalex-snapshot
Fast in-memory XPath search using compressed indexes
inferredcites →https://doi.org/10.1109/sfcs.1989.63533openalex-snapshot
Space-efficient static trees and graphs
inferredcites →https://doi.org/10.1109/sfcs.1997.646100openalex-snapshot
Succinct representation of balanced parentheses, static trees and planar graphs
inferredcites →https://doi.org/10.1109/sfcs.2005.69openalex-snapshot
Structuring labeled trees for optimal succinctness, and beyond
inferredcites →https://doi.org/10.1109/tkde.2007.1063openalex-snapshot
SPEX: Streamed and Progressive Evaluation of XPath
inferredcites →https://doi.org/10.1137/1.9781611972870.6openalex-snapshot
Practical Entropy-Compressed Rank/Select Dictionary
inferredcites →https://doi.org/10.1137/1.9781611973075.13openalex-snapshot
Fully-Functional Succinct Trees
inferredcites →https://doi.org/10.1137/1.9781611973105.62openalex-snapshot
Optimal Dynamic Sequence Representations
inferredcites →https://doi.org/10.1137/s0097539799364092openalex-snapshot
Succinct Representation of Balanced Parentheses and Static Trees
inferredcites →https://doi.org/10.1145/1042046.1042051openalex-snapshot
Processing XML streams with deterministic automata and stream indexes
inferredcites →https://doi.org/10.1145/1109557.1109599openalex-snapshot
Rank/select operations on large alphabets
inferredcites →https://doi.org/10.1145/1135777.1135891openalex-snapshot
Compressing and searching XML data via two zips
inferredcites →https://doi.org/10.1145/1159876.1159880openalex-snapshot
Type-safe modular hash-consing
inferredcites →https://doi.org/10.1145/1240233.1240243openalex-snapshot
Compressed representations of sequences and full-text indexes
inferredcites →https://doi.org/10.1145/1240233.1240244openalex-snapshot
Compressed indexes for dynamic text collections
inferredcites →https://doi.org/10.1145/1367064.1367072openalex-snapshot
Dynamic entropy-compressed sequences and full-text indexes
inferredcites →https://doi.org/10.1145/1989727.1989731openalex-snapshot
XPath evaluation in linear time
inferredcites →https://doi.org/10.1145/2094072.2094073openalex-snapshot
Word-based self-indexes for natural language text
inferredcites →https://doi.org/10.1145/382780.382782openalex-snapshot
An analysis of the Burrows—Wheeler transform
inferredcites →https://doi.org/10.1145/601858.601869openalex-snapshot
Automata theory for XML researchers
inferredcites →https://doi.org/10.1186/gb-2009-10-3-r25openalex-snapshot
Ultrafast and memory-efficient alignment of short DNA sequences to the human genome
inferredcites →https://doi.org/10.14778/1920841.1920954openalex-snapshot
XPath whole query optimization
inferredcites →https://doi.org/10.4230/dagsemproc.08261.6openalex-snapshot
An In-Memory XQuery/XPath Engine over a Compressed Structured Text Representation
inferredcites →https://doi.org/10.48550/arxiv.0905.0768openalex-snapshot
Fully-Functional Static and Dynamic Succinct Trees
inferredcites →https://doi.org/10.48550/arxiv.1012.5696openalex-snapshot
Fast and Tiny Structural Self-Indexes for XML
inferredcites →https://doi.org/10.5220/0001518000130021openalex-snapshot
BSBC: TOWARDS A SUCCINCT DATA FORMAT FOR XML STREAMS
inferredcites →https://doi.org/10.5555/1109557.1109599openalex-snapshot
Rank/select operations on large alphabets: a tool for text indexing
inferredcites →https://doi.org/10.5555/1873601.1873614openalex-snapshot
Fully-functional succinct trees
inferredcites →https://doi.org/10.5555/545381.545411openalex-snapshot
Succinct indexable dictionaries with applications to encoding k-ary trees and multisets
inferredcites →https://doi.org/10.5555/644108.644250openalex-snapshot
High-order entropy-compressed text indexes
inferredcites →https://doi.org/10.5860/choice.48-6328openalex-snapshot
Foundations of XML processing: the tree-automata approach
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/spe.2485openalex-snapshot
Regression test suite minimization using integer linear programming model
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_332openalex-snapshot
Rank and Select Operations on Binary Strings
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_332openalex-snapshot
Rank and Select Operations on Bit Strings
inferred← citeshttps://doi.org/10.1007/978-3-030-32686-9_31openalex-snapshot
Faster Repetition-Aware Compressed Suffix Trees Based on Block Trees
inferred← citeshttps://doi.org/10.1007/978-3-030-69992-5_2openalex-snapshot
A Dual-Index Based Representation for Processing XPath Queries on Very Large XML Documents
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_332-2openalex-snapshot
Rank and Select Operations on Bit Strings
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104749openalex-snapshot
Faster repetition-aware compressed suffix trees based on Block Trees
inferred← citeshttps://doi.org/10.1016/j.jda.2016.10.001openalex-snapshot
Grammar compressed sequences with rank/select support
inferred← citeshttps://doi.org/10.1016/j.knosys.2020.106446openalex-snapshot
Pentagonal scheme for dynamic XML prefix labelling
inferred← citeshttps://doi.org/10.1145/3018743.3018772openalex-snapshot
Grammar-aware Parallelization for Scalable XPath Querying
inferred← citeshttps://doi.org/10.1145/3155284.3018772openalex-snapshot
Grammar-aware Parallelization for Scalable XPath Querying
inferred← citeshttps://doi.org/10.1145/3294052.3319685openalex-snapshot
Decidable XPath Fragments in the Real World
inferred← citeshttps://doi.org/10.15625/1813-9663/19018openalex-snapshot
AN IMPROVED INDEXING METHOD FOR QUERYING BIG XML FILES
inferred← citeshttps://doi.org/10.70675/9574fbc5zea00z4774zbd87zee73ba8839a2openalex-snapshot
Logique de requêtes à la XPath : systèmes de preuve et pertinence pratique
inferred← citeshttps://doi.org/10.70675/bbc76177z3efcz417cz88ffzee51021690ceopenalex-snapshot
Evaluation of XPath queries on XML streams with networks of early nested word automata
inferred← citeshttps://doi.org/10.7287/peerj-cs.148v0.1/reviews/2openalex-snapshot
Peer Review #2 of "Indexing labeled sequences (v0.1)"
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.