On the public citation graph

Querying Incomplete Information in Semistructured Data

0 signed · 53 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.1006/jcss.1999.1627openalex-snapshot
Regular Path Queries with Constraints
inferredcites →https://doi.org/10.1007/3-540-48738-7_34openalex-snapshot
Queries and Constraints on Semi-structured Data
inferredcites →https://doi.org/10.1007/3-540-60608-4_48openalex-snapshot
Querying semistructured heterogeneous information
inferredcites →https://doi.org/10.1007/3-540-62222-5_33openalex-snapshot
Querying semi-structured data
inferredcites →https://doi.org/10.1007/3-540-62222-5_55openalex-snapshot
Adding structure to unstructured data
inferredcites →https://doi.org/10.1007/3-540-64823-2_9openalex-snapshot
A structure-based approach to querying semi-structured data
inferredcites →https://doi.org/10.1007/s007990050004openalex-snapshot
Querying the World Wide Web
inferredcites →https://doi.org/10.1007/s007990050005openalex-snapshot
The Lorel query language for semistructured data
inferredcites →https://doi.org/10.1016/s0169-023x(98)00026-3openalex-snapshot
Utilizing the multiple facets of WWW contents
inferredcites →https://doi.org/10.1016/s0304-3975(99)00221-2openalex-snapshot
Queries and computation on the web
inferredcites →https://doi.org/10.1016/s0306-4379(98)00032-5openalex-snapshot
Formal models of Web queries
inferredcites →https://doi.org/10.1109/icde.1995.380386openalex-snapshot
Object exchange across heterogeneous information sources
inferredcites →https://doi.org/10.1109/icde.1997.582040openalex-snapshot
W3QS-a system for WWW querying
inferredcites →https://doi.org/10.1109/icde.1998.655752openalex-snapshot
Representing and querying changes in semistructured data
inferredcites →https://doi.org/10.1109/icde.1998.655754openalex-snapshot
WebOQL: restructuring documents, databases and Webs
inferredcites →https://doi.org/10.1109/ride.1996.492238openalex-snapshot
A declarative language for querying and restructuring the Web
inferredcites →https://doi.org/10.1137/0210059openalex-snapshot
Power of Natural Semijoins
inferredcites →https://doi.org/10.1137/s009753979122370xopenalex-snapshot
Finding Regular Simple Paths in Graph Databases
inferredcites →https://doi.org/10.1145/191839.191908openalex-snapshot
Outerjoins as disjunctions
inferredcites →https://doi.org/10.1145/233269.233368openalex-snapshot
A query language and optimization techniques for unstructured data
inferredcites →https://doi.org/10.1145/233269.280355openalex-snapshot
LORE
inferredcites →https://doi.org/10.1145/245882.245900openalex-snapshot
Applying database visualization to the World Wide Web
inferredcites →https://doi.org/10.1145/262762.262770openalex-snapshot
Lore
inferredcites →https://doi.org/10.1145/263661.263675openalex-snapshot
Semistructured data
inferredcites →https://doi.org/10.1145/275487.275502openalex-snapshot
Path constraints on semistructured and structured data
inferredcites →https://doi.org/10.1145/275487.275503openalex-snapshot
Query containment for conjunctive queries with regular expressions
inferredcites →https://doi.org/10.1145/276304.276331openalex-snapshot
Extracting schema from semistructured data
inferredcites →https://doi.org/10.1145/276304.276375openalex-snapshot
The Araneus Web-based management system
inferredcites →https://doi.org/10.1145/38713.38749openalex-snapshot
A graphical query language supporting recursion
inferredcites →https://doi.org/10.1145/800105.803397openalex-snapshot
Optimal implementation of conjunctive queries in relational data bases
inferredcites →https://doi.org/10.5860/choice.26-5107openalex-snapshot
Principles of database and knowledge-base systems

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11965893_23openalex-snapshot
Combining Incompleteness and Ranking in Tree Queries
inferred← citeshttps://doi.org/10.1007/978-3-319-30024-5_10openalex-snapshot
The Challenge of Optional Matching in SPARQL
inferred← citeshttps://doi.org/10.1007/s10707-017-0297-yopenalex-snapshot
Combined geo-social search: computing top-k join queries over incomplete information
inferred← citeshttps://doi.org/10.1007/s10796-017-9748-0openalex-snapshot
Object-stack: An object-oriented approach for top-k keyword querying over fuzzy XML
inferred← citeshttps://doi.org/10.1007/s11280-011-0149-xopenalex-snapshot
Querying and ranking incomplete twigs in probabilistic XML
inferred← citeshttps://doi.org/10.1016/j.ins.2010.09.001openalex-snapshot
Matching twigs in fuzzy XML
inferred← citeshttps://doi.org/10.1016/j.is.2009.05.001openalex-snapshot
Correcting queries for XML
inferred← citeshttps://doi.org/10.1016/j.is.2022.102008openalex-snapshot
Weighted top-k dominating queries on highly incomplete data
inferred← citeshttps://doi.org/10.1109/fskd.2010.5569314openalex-snapshot
FTwig: Efficient algorithm for processing fuzzy XML twig pattern matching
inferred← citeshttps://doi.org/10.1109/icde.2009.24openalex-snapshot
Flexible XML Querying Using Skyline Semantics
inferred← citeshttps://doi.org/10.1145/1265530.1265572openalex-snapshot
Maximally joining probabilistic data
inferred← citeshttps://doi.org/10.1145/1559795.1559832openalex-snapshot
XML with incomplete information
inferred← citeshttps://doi.org/10.1145/1645953.1645971openalex-snapshot
Efficient processing of twig pattern matching in fuzzy XML
inferred← citeshttps://doi.org/10.1145/1870103.1870107openalex-snapshot
XML with incomplete information
inferred← citeshttps://doi.org/10.1145/1989284.1989307openalex-snapshot
Querying graph patterns
inferred← citeshttps://doi.org/10.1145/2213556.2213572openalex-snapshot
Static analysis and optimization of semantic web queries
inferred← citeshttps://doi.org/10.1145/2500130openalex-snapshot
Static analysis and optimization of semantic web queries
inferred← citeshttps://doi.org/10.1145/2559905openalex-snapshot
Querying Regular Graph Patterns
inferred← citeshttps://doi.org/10.1145/773153.773162openalex-snapshot
Computing full disjunctions
inferred← citeshttps://doi.org/10.3233/kes-180379openalex-snapshot
A structure-based approach of keyword querying for fuzzy XML data
inferred← citeshttps://doi.org/10.4230/lipics.csl.2011.367openalex-snapshot
Trees in Trees: Is the Incomplete Information about a Tree Consistent?
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2014.279openalex-snapshot
Consistency of Injective Tree Patterns
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.