Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

SIGMOD
2010
ACM

favoriteEmaildiscussreport

164views Database» more SIGMOD 2010»

Efficiently evaluating complex boolean expressions

13 years 4 months ago

Efficiently evaluating complex boolean expressions

Download fontoura.org

The problem of efficiently evaluating a large collection of complex Boolean expressions

Marcus Fontoura, Suhas Sadanandan, Jayavel Shanmug

Real-time Traffic

Boolean Expressions | Bottom-up Evaluation Techniques | Complex Boolean Expressions | Database | SIGMOD 2010 |

claim paper

Related Content

» Constraint Databases Data Structures and Efficient Query Evaluation

» Rewrite Systems for Symbolic Evaluation of Clike Preprocessing

» Itemset frequency satisfiability Complexity and axiomatization

» Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic

» Translating PseudoBoolean Constraints into SAT

» Flexible and efficient XML search with complex fulltext predicates

» Exact ESCT minimization for functions of up to six input variables

» LTL Path Checking Is Efficiently Parallelizable

» FeatureAdaptive Motion Energy Analysis for Facial Expression Recognition

Post Info
More Details (n/a)

Added	06 Dec 2010
Updated	06 Dec 2010
Type	Conference
Year	2010
Where	SIGMOD
Authors	Marcus Fontoura, Suhas Sadanandan, Jayavel Shanmugasundaram, Sergei Vassilvitskii, Erik Vee, Srihari Venkatesan, Jason Y. Zien

Comments (0)