On the public citation graph
Efficiently evaluating complex boolean expressions
0 signed · 48 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/10722620_17openalex-snapshot
Efficient Matching for Web-Based Publish/Subscribe Systems
inferredcites →https://doi.org/10.1007/s00778-003-0094-0openalex-snapshot
RE-tree: an efficient index structure for regular expressions
inferredcites →https://doi.org/10.1109/icdcsw.2002.1030823openalex-snapshot
Predicate matching and subscription matching in Publish/Subscribe systems
inferredcites →https://doi.org/10.1109/icde.2002.994755openalex-snapshot
A fast regular expression indexing engine
inferredcites →https://doi.org/10.1145/1266894.1266938openalex-snapshot
The arbitrary Boolean publish/subscribe model
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/331983.331992openalex-snapshot
The SIFT information dissemination system
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/564691.564715openalex-snapshot
Storing and querying ordered XML using a relational database system
inferredcites →https://doi.org/10.1145/857076.857078openalex-snapshot
The many faces of publish/subscribe
inferredcites →https://doi.org/10.1145/863955.863975openalex-snapshot
Forwarding in a content-based network
inferredcites →https://doi.org/10.1145/956863.956944openalex-snapshot
Efficient query evaluation using a two-level retrieval process
inferredcites →https://doi.org/10.1145/974750.974755openalex-snapshot
Selection conditions in main memory
inferredcites →https://doi.org/10.14778/1687627.1687633openalex-snapshot
Indexing Boolean expressions
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-031-00123-9_23openalex-snapshot
HEM: A Hardware-Aware Event Matching Algorithm for Content-Based Pub/Sub Systems
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/978-3-319-59746-1_2openalex-snapshot
AErlang: Empowering Erlang with Attribute-Based Communication
inferred← citeshttps://doi.org/10.1007/978-981-95-8414-7_11openalex-snapshot
LIEM: A Learned Interval-Based Event Matching Algorithm for Content-Based Publish/Subscribe Systems
inferred← citeshttps://doi.org/10.1007/s11390-016-1674-yopenalex-snapshot
A Feature Model Based Framework for Refactoring Software Product Line Architecture
inferred← citeshttps://doi.org/10.1007/s40012-015-0070-zopenalex-snapshot
Recursive optimization on converting CNF to DNF using grid computing
inferred← citeshttps://doi.org/10.1016/j.comnet.2024.110561openalex-snapshot
OEM: An operation-aware event matching algorithm for content-based Pub/Sub systems
inferred← citeshttps://doi.org/10.1016/j.future.2016.10.020openalex-snapshot
DEXIN: A fast content-based multi-attribute event matching algorithm using dynamic exclusive and inclusive methods
inferred← citeshttps://doi.org/10.1109/icact.2013.6710522openalex-snapshot
High dimension CNF to DNF conversion using grid computing
inferred← citeshttps://doi.org/10.1109/icdcs.2011.67openalex-snapshot
Towards Approximate Event Processing in a Large-Scale Content-Based Network
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.2012.38openalex-snapshot
Relevance Matters: Capitalizing on Less (Top-k Matching in Publish/Subscribe)
inferred← citeshttps://doi.org/10.1109/icraie.2014.6909117openalex-snapshot
High dimension CNF to DNF conversion using grid computing in parallel
inferred← citeshttps://doi.org/10.1109/infocom.2016.7524338openalex-snapshot
GEM: An analytic geometrical approach to fast event matching for multi-dimensional content-based publish/subscribe services
inferred← citeshttps://doi.org/10.1109/tkde.2019.2916860openalex-snapshot
Scalable Multiway Stream Joins in Hardware
inferred← citeshttps://doi.org/10.1109/tpds.2014.2323262openalex-snapshot
H-Tree: An Efficient Index Structurefor Event Matching in Content-BasedPublish/Subscribe Systems
inferred← citeshttps://doi.org/10.1109/wsc.2014.7019952openalex-snapshot
Match-Ladder: An efficient event matching algorithm in large-scale content-based publish/subscribe system
inferred← citeshttps://doi.org/10.1145/1963405.1963476openalex-snapshot
Efficiently evaluating graph constraints in content-based publish/subscribe
inferred← citeshttps://doi.org/10.1145/1995441.1995445openalex-snapshot
Towards highly parallel event processing through reconfigurable hardware
inferred← citeshttps://doi.org/10.1145/2213598.2213602openalex-snapshot
Towards an extensible efficient event processing kernel
inferred← citeshttps://doi.org/10.1145/2487259.2487260openalex-snapshot
Analysis and optimization for boolean expression indexing
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.1145/3448016.3457266openalex-snapshot
A-Tree: A Dynamic Data Structure for Efficiently Indexing Arbitrary Boolean Expressions
inferred← citeshttps://doi.org/10.1145/3654961openalex-snapshot
Optimizing Disjunctive Queries with Tagged Execution
inferred← citeshttps://doi.org/10.1145/3736756openalex-snapshot
Efficient Parallel Boolean Expression Matching
inferred← citeshttps://doi.org/10.14778/3291264.3291270openalex-snapshot
PS-tree-based efficient boolean expression matching for high-dimensional and dense workloads
inferred← citeshttps://doi.org/10.14778/3402755.3402756openalex-snapshot
Evaluation strategies for top-k queries over memory-resident inverted indexes
inferred← citeshttps://doi.org/10.18255/1818-1015-2016-2-153-163openalex-snapshot
On the Effectiveness of the Minimization Approach to the Query Optimization
inferred← citeshttps://doi.org/10.3929/ethz-a-007313911openalex-snapshot
Elastic, Reliable, and Robust Storage and Query Processing with Crescando/RB
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.