On the public citation graph

Relevance Matters: Capitalizing on Less (Top-k Matching in Publish/Subscribe)

0 signed · 38 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.1016/s0022-0000(03)00026-6openalex-snapshot
Optimal aggregation algorithms for middleware
inferredcites →https://doi.org/10.1109/icse.2001.919117openalex-snapshot
Efficient filtering in publish-subscribe systems using binary decision diagrams
inferredcites →https://doi.org/10.1145/1391729.1391730openalex-snapshot
A survey of top- k query processing techniques in relational database systems
inferredcites →https://doi.org/10.1145/176567.176573openalex-snapshot
Index structures for selective dissemination of information under the Boolean model
inferredcites →https://doi.org/10.1145/1807167.1807171openalex-snapshot
Efficiently evaluating complex boolean expressions
inferredcites →https://doi.org/10.1145/1989323.1989390openalex-snapshot
BE-tree
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/280277.280279openalex-snapshot
Multidimensional access methods
inferredcites →https://doi.org/10.1145/301308.301326openalex-snapshot
Matching events in a content-based subscription system
inferredcites →https://doi.org/10.1145/375551.375567openalex-snapshot
Optimal aggregation algorithms for middleware
inferredcites →https://doi.org/10.1145/375663.375677openalex-snapshot
Filtering algorithms and implementation for very fast publish/subscribe systems
inferredcites →https://doi.org/10.1145/376284.375677openalex-snapshot
Filtering algorithms and implementation for very fast publish/subscribe systems
inferredcites →https://doi.org/10.1145/568271.223796openalex-snapshot
A general solution of the n-dimensional B-tree problem
inferredcites →https://doi.org/10.1145/602259.602266openalex-snapshot
R-trees
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.1145/93605.98741openalex-snapshot
The R*-tree: an efficient and robust access method for points and rectangles
inferredcites →https://doi.org/10.14778/1453856.1453906openalex-snapshot
Scalable ranked publish/subscribe
inferredcites →https://doi.org/10.14778/1687627.1687633openalex-snapshot
Indexing Boolean expressions
inferredcites →https://doi.org/10.5555/381473.381519openalex-snapshot
Efficient filtering in publish-subscribe systems using binary decision diagrams

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-319-22363-6_18openalex-snapshot
Efficient Top-k Subscription Matching for Location-Aware Publish/Subscribe
inferred← citeshttps://doi.org/10.1007/978-3-319-32049-6_21openalex-snapshot
An Efficient Location-Aware Top-k Subscription Matching for Publish/Subscribe with Boolean Expressions
inferred← citeshttps://doi.org/10.1007/s11390-016-1632-8openalex-snapshot
Content-Based Publish/Subscribe System for Web Syndication
inferred← citeshttps://doi.org/10.1109/bdcloud.2018.00064openalex-snapshot
Adjusting Matching Algorithm to Adapt to Dynamic Subscriptions in Content-Based Publish/Subscribe Systems
inferred← citeshttps://doi.org/10.1109/icdcs.2013.19openalex-snapshot
Distributed Ranked Data Dissemination in Social Networks
inferred← citeshttps://doi.org/10.1109/icdcs.2017.184openalex-snapshot
Subscription Covering for Relevance-Based Filtering in Content-Based Publish/Subscribe Systems
inferred← citeshttps://doi.org/10.1109/icde.2014.6816665openalex-snapshot
Adaptive parallel compressed event matching
inferred← citeshttps://doi.org/10.1109/percomw.2015.7134041openalex-snapshot
CrumblR: Enabling proxemic services through opportunistic location sharing
inferred← citeshttps://doi.org/10.1109/scc.2012.44openalex-snapshot
Summary Instance: Scalable Event Priority Determination Engine for Large Scale Distributed Event-Based System
inferred← citeshttps://doi.org/10.1109/tkde.2017.2657622openalex-snapshot
Continuous Top-k Monitoring on Document Streams
inferred← citeshttps://doi.org/10.1145/2213598.2213602openalex-snapshot
Towards an extensible efficient event processing kernel
inferred← citeshttps://doi.org/10.1145/2405153.2405162openalex-snapshot
Location-based matching in publish/subscribe revisited
inferred← citeshttps://doi.org/10.1145/2487259.2487260openalex-snapshot
Analysis and optimization for boolean expression indexing
inferred← citeshttps://doi.org/10.1145/2663165.2663326openalex-snapshot
Fast, expressive top-kmatching
inferred← citeshttps://doi.org/10.1145/2675743.2771823openalex-snapshot
Towards prioritized event matching in a content-based publish/subscribe system
inferred← citeshttps://doi.org/10.1145/3135974.3135976openalex-snapshot
Efficient covering for top-k filtering in content-based publish/subscribe systems
inferred← citeshttps://doi.org/10.1155/2015/390329openalex-snapshot
Summary Instance: Scalable Event Priority Determination Engine for Large-Scale Distributed Event-Based System
inferred← citeshttps://doi.org/10.14778/2732296.2732298openalex-snapshot
An efficient publish/subscribe index for e-commerce databases
inferred← citeshttps://doi.org/10.70675/096fe2acz6474z4e10za2b3z181d6f8689f8openalex-snapshot
Indexation pour la recherche par le contenu textuel de flux RSS
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.