294 search results - page 23 / 59 » Efficiently Processing Queries on Interval-and-Value Tuples ... |
150
click to vote
EDBT
2006
ACM
16 years 6 months ago
2006
ACM
: This work describes a method for processing XPath on a relational back-end that significantly limits the number of SQL joins required, takes advantage of the strengths of modern ...
183
click to vote
PVLDB
2008
15 years 5 months ago
2008
Several real-world applications need to effectively manage and reason about large amounts of data that are inherently uncertain. For instance, pervasive computing applications mus...
160
click to vote
WWW
2006
ACM
16 years 6 months ago
2006
ACM
An important issue arising from large scale data integration is how to efficiently select the top-K ranking answers from multiple sources while minimizing the transmission cost. T...
267
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
Views over probabilistic data contain correlations between tuples, and the current approach is to capture these correlations using explicit lineage. In this paper we propose an al...
182
click to vote
EDBT
2010
ACM
16 years 23 days ago
2010
ACM
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...