Worst case optimal union-intersection expression evaluation

Authors:
Ehsan Chiniforooshan;Arash Farzan;Mehdi Mirzazadeh
Affiliations:
School of Computer Science, University of Waterloo;School of Computer Science, University of Waterloo;School of Computer Science, University of Waterloo
Venue:
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Year:
2005

Citing 6
Cited 3

A skip list cookbook

A skip list cookbook
The anatomy of a large-scale hypertextual Web search engine

WWW7 Proceedings of the seventh international conference on World Wide Web 7
A Fast Merging Algorithm

Journal of the ACM (JACM)
Adaptive set intersections, unions, and differences

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Managing Gigabytes: Compressing and Indexing Documents and Images

Managing Gigabytes: Compressing and Indexing Documents and Images
Introduction to Algorithms

Introduction to Algorithms

Fast evaluation of union-intersection expressions

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Fast set intersection in memory

Proceedings of the VLDB Endowment
Workload-aware indexing for keyword search in social networks

Proceedings of the 20th ACM international conference on Information and knowledge management

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of evaluating an expression consisting of unions and intersections of some sorted sets. Given the expression and the sizes of the sets, we are interested in the worst-case complexity of evaluating the expression in terms of the sizes of the sets. We assume no set is repeated in the expression. We show a lower bound on this problem and present an algorithm that matches the lower bound asymptotically.