Sciweavers

389 search results - page 29 / 78
» A Framework for the Investigation of Aggregate Functions in ...
Sort
View
PODS
2008
ACM
129views Database» more  PODS 2008»
14 years 7 months ago
Tree-width and functional dependencies in databases
Conjunctive query (CQ) evaluation on relational databases is NP-complete in general. Several restrictions, like bounded tree-width and bounded hypertree-width, allow polynomial ti...
Isolde Adler
PODS
2008
ACM
109views Database» more  PODS 2008»
14 years 7 months ago
Time-decaying aggregates in out-of-order streams
Processing large data streams is now a major topic in data management. The data involved can be truly massive, and the required analyses complex. In a stream of sequential events ...
Graham Cormode, Flip Korn, Srikanta Tirthapura
DASFAA
2011
IEEE
221views Database» more  DASFAA 2011»
12 years 9 months ago
A Unified Algorithm for Continuous Monitoring of Spatial Queries
Continuous monitoring of spatial queries has gained significant research attention in the past few years. Although numerous algorithms have been proposed to solve specific queries...
Mahady Hasan, Muhammad Aamir Cheema, Xuemin Lin, W...
PKDD
1998
Springer
123views Data Mining» more  PKDD 1998»
13 years 11 months ago
Querying Inductive Databases: A Case Study on the MINE RULE Operator
Knowledge discovery in databases (KDD) is a process that can include steps like forming the data set, data transformations, discovery of patterns, searching for exceptions to a pat...
Jean-François Boulicaut, Mika Klemettinen, ...
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
14 years 7 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang