Index structures for selective dissemination of information under the Boolean model
ACM Transactions on Database Systems (TODS)
Fast evaluation of structured queries for information retrieval
SIGIR '95 Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval
Matching events in a content-based subscription system
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Managing gigabytes (2nd ed.): compressing and indexing documents and images
Managing gigabytes (2nd ed.): compressing and indexing documents and images
Filtering algorithms and implementation for very fast publish/subscribe systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Expert Systems
Compliance Checking in the PolicyMaker Trust Management System
FC '98 Proceedings of the Second International Conference on Financial Cryptography
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
The many faces of publish/subscribe
ACM Computing Surveys (CSUR)
Forwarding in a content-based network
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
RE-tree: an efficient index structure for regular expressions
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient query evaluation using a two-level retrieval process
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Selection conditions in main memory
ACM Transactions on Database Systems (TODS)
CPOL: high-performance policy evaluation
Proceedings of the 12th ACM conference on Computer and communications security
Inverted files for text search engines
ACM Computing Surveys (CSUR)
High-performance complex event processing over streams
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Cayuga: a high-performance event processing engine
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
A semantic approach to contextual advertising
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Scalable ranked publish/subscribe
Proceedings of the VLDB Endowment
Efficiently evaluating complex boolean expressions
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Efficient online ad serving in a display advertising exchange
Proceedings of the fourth ACM international conference on Web search and data mining
GPX-matcher: a generic boolean predicate-based XPath expression matcher
Proceedings of the 14th International Conference on Extending Database Technology
Efficiently evaluating graph constraints in content-based publish/subscribe
Proceedings of the 20th international conference on World wide web
Enabling fast prediction for ensemble models on data streams
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
RoSeS: a continuous content-based query engine for RSS feeds
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
Efficiently encoding term co-occurrences in inverted indexes
Proceedings of the 20th ACM international conference on Information and knowledge management
Subscription indexes for web syndication systems
Proceedings of the 15th International Conference on Extending Database Technology
Analysis and optimization for boolean expression indexing
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
We consider the problem of efficiently indexing Disjunctive Normal Form (DNF) and Conjunctive Normal Form (CNF) Boolean expressions over a high-dimensional multi-valued attribute space. The goal is to rapidly find the set of Boolean expressions that evaluate to true for a given assignment of values to attributes. A solution to this problem has applications in online advertising (where a Boolean expression represents an advertiser's user targeting requirements, and an assignment of values to attributes represents the characteristics of a user visiting an online page) and in general any publish/subscribe system (where a Boolean expression represents a subscription, and an assignment of values to attributes represents an event). All existing solutions that we are aware of can only index a specialized sub-set of conjunctive and/or disjunctive expressions, and cannot efficiently handle general DNF and CNF expressions (including NOTs) over multi-valued attributes. In this paper, we present a novel solution based on the inverted list data structure that enables us to index arbitrarily complex DNF and CNF Boolean expressions over multi-valued attributes. An interesting aspect of our solution is that, by virtue of leveraging inverted lists traditionally used for ranked information retrieval, we can efficiently return the top-N matching Boolean expressions. This capability enables emerging applications such as ranked publish/subscribe systems [16], where only the top subscriptions that match an event are desired. For example, in online advertising there is a limit on the number of advertisements that can be shown on a given page and only the "best" advertisements can be displayed. We have evaluated our proposed technique based on data from an online advertising application, and the results show a dramatic performance improvement over prior techniques.