Indexing boolean expressions

Cited 0 time in webofscience Cited 64 time in scopus
  • Hit : 179
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorWhang, Steven Euijongko
dc.contributor.authorGarcia-Molina, Hectorko
dc.contributor.authorBrower, Chadko
dc.contributor.authorShanmugasundaram, Jayavelko
dc.contributor.authorVassilvitskii, Sergeiko
dc.contributor.authorVee, Erikko
dc.contributor.authorYerneni, Ramanako
dc.date.accessioned2019-04-16T03:50:35Z-
dc.date.available2019-04-16T03:50:35Z-
dc.date.created2018-03-29-
dc.date.created2018-03-29-
dc.date.issued2009-08-
dc.identifier.citation35th International Conference on Very Large Data Bases, VLDB 2009, pp.37 - 48-
dc.identifier.issn2150-8097-
dc.identifier.urihttp://hdl.handle.net/10203/260320-
dc.description.abstractWe 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.-
dc.languageEnglish-
dc.publisherThe VLDB Endowment-
dc.titleIndexing boolean expressions-
dc.typeConference-
dc.identifier.scopusid2-s2.0-77954800255-
dc.type.rimsCONF-
dc.citation.beginningpage37-
dc.citation.endingpage48-
dc.citation.publicationname35th International Conference on Very Large Data Bases, VLDB 2009-
dc.identifier.conferencecountryFR-
dc.identifier.conferencelocationLyon-
dc.identifier.doi10.14778/1687627.1687633-
dc.contributor.localauthorWhang, Steven Euijong-
dc.contributor.nonIdAuthorGarcia-Molina, Hector-
dc.contributor.nonIdAuthorBrower, Chad-
dc.contributor.nonIdAuthorShanmugasundaram, Jayavel-
dc.contributor.nonIdAuthorVassilvitskii, Sergei-
dc.contributor.nonIdAuthorVee, Erik-
dc.contributor.nonIdAuthorYerneni, Ramana-
Appears in Collection
EE-Conference Papers(학술회의논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0