Sciweavers

4934 search results - page 711 / 987
» complexity 2008
Sort
View
SIGMOD
2008
ACM
129views Database» more  SIGMOD 2008»
16 years 6 months ago
An xml index advisor for DB2
XML database systems are expected to handle increasingly complex queries over increasingly large and highly structured XML databases. An important problem that needs to be solved ...
Iman Elghandour, Ashraf Aboulnaga, Daniel C. Zilio...
SIGMOD
2008
ACM
125views Database» more  SIGMOD 2008»
16 years 6 months ago
Categorical skylines for streaming data
The problem of skyline computation has attracted considerable research attention. In the categorical domain the problem becomes more complicated, primarily due to the partially-or...
Nikos Sarkas, Gautam Das, Nick Koudas, Anthony K. ...
SIGMOD
2008
ACM
136views Database» more  SIGMOD 2008»
16 years 6 months ago
Mining relationships among interval-based events for classification
Existing temporal pattern mining assumes that events do not have any duration. However, events in many real world applications have durations, and the relationships among these ev...
Dhaval Patel, Wynne Hsu, Mong-Li Lee
PODS
2008
ACM
123views Database» more  PODS 2008»
16 years 6 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis
PODS
2008
ACM
250views Database» more  PODS 2008»
16 years 6 months ago
Approximating predicates and expressive queries on probabilistic databases
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
Christoph Koch