Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
34
click to vote
SIGMOD
2010
ACM
favorite
Email
discuss
report
164
views
Database
»
more
SIGMOD 2010
»
Efficiently evaluating complex boolean expressions
13 years 11 months ago
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
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)
Researcher Info
Database Study Group
Computer Vision