734 search results - page 40 / 147 » Efficient join processing over uncertain data |
COMPGEOM
2006
ACM
15 years 1 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
EDBT
2006
ACM
15 years 10 months ago
2006
ACM
Abstract. Data stream systems execute a dynamic workload of longrunning and one-time queries, with the streaming inputs typically bounded by sliding windows. For efficiency, window...
EDBTW
2006
Springer
14 years 11 months ago
2006
Springer
The need for incremental constraint maintenance within collections of semi-structured documents has been ever increasing in the last years due to the widespread diffusion of XML. T...
EDBT
2009
ACM
15 years 1 months ago
2009
ACM
We propose efficient techniques for processing various TopK count queries on data with noisy duplicates. Our method differs from existing work on duplicate elimination in two sign...
161
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
Text documents often embed data that is structured in nature. By processing a text database with information extraction systems, we can define a variety of structured "relati...