964 search results - page 117 / 193 » Efficiently Ordering Query Plans for Data Integration |
242
click to vote
ICDE
2007
IEEE
16 years 5 months ago
2007
IEEE
Recently, there has been significant interest in developing space and time efficient solutions for answering continuous summarization queries over data streams. While these techni...
188
click to vote
DASFAA
2004
IEEE
15 years 8 months ago
2004
IEEE
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...
247
click to vote
ICDE
2008
IEEE
16 years 5 months ago
2008
IEEE
Many applications require finding objects closest to a specified location that contains a set of keywords. For example, online yellow pages allow users to specify an address and a ...
222
Voted
ICDE
1999
IEEE
16 years 5 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...
221
click to vote
ICDE
2006
IEEE
16 years 5 months ago
2006
IEEE
It is well recognized that data cubing often produces huge outputs. Two popular efforts devoted to this problem are (1) iceberg cube, where only significant cells are kept, and (2...