294 search results - page 7 / 59 » Efficiently Processing Queries on Interval-and-Value Tuples ... |
83
Voted
DASFAA
2007
IEEE
15 years 1 months ago
2007
IEEE
Abstract. In this paper, we present a novel ordered XPATH evaluation in treeunaware RDBMS. The novelties of our approach lies in the followings. (a) We propose a novel XML storage ...
178
click to vote
ICDE
2006
IEEE
15 years 10 months ago
2006
IEEE
We study the problem of continuous relational query processing in Internet-scale overlay networks realized by distributed hash tables. We concentrate on the case of continuous two...
166
click to vote
ICDE
2008
IEEE
15 years 10 months ago
2008
IEEE
This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a n...
155
click to vote
ICDE
1999
IEEE
15 years 10 months ago
1999
IEEE
Most operations of the relational algebra or SQL require a sorted stream of tuples for efficient processing. Therefore, processing complex relational queries relies on efficient a...
182
click to vote
ICDE
2007
IEEE
15 years 10 months ago
2007
IEEE
Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between score and uncertainty makes traditio...