Sciweavers

6740 search results - page 979 / 1348
» Querying Databases with Taxonomies
Sort
View
KDD
2004
ACM
134views Data Mining» more  KDD 2004»
16 years 7 months ago
Exploiting a support-based upper bound of Pearson's correlation coefficient for efficiently identifying strongly correlated pair
Given a user-specified minimum correlation threshold and a market basket database with N items and T transactions, an all-strong-pairs correlation query finds all item pairs with...
Hui Xiong, Shashi Shekhar, Pang-Ning Tan, Vipin Ku...
VLDB
2007
ACM
138views Database» more  VLDB 2007»
16 years 7 months ago
CADS: Continuous Authentication on Data Streams
We study processing and authentication of long-running queries on outsourced data streams. In this scenario, a data owner (DO) constantly transmits its data to a service provider ...
Stavros Papadopoulos, Yin Yang, Dimitris Papadias
VLDB
2007
ACM
143views Database» more  VLDB 2007»
16 years 7 months ago
OLAP over Imprecise Data with Domain Constraints
Several recent papers have focused on OLAP over imprecise data, where each fact can be a region, instead of a point, in a multidimensional space. They have provided a multiple-wor...
Douglas Burdick, AnHai Doan, Raghu Ramakrishnan, S...
SIGMOD
2009
ACM
214views Database» more  SIGMOD 2009»
16 years 7 months ago
DDE: from dewey to a fully dynamic XML labeling scheme
Labeling schemes lie at the core of query processing for many XML database management systems. Designing labeling schemes for dynamic XML documents is an important problem that ha...
Liang Xu, Tok Wang Ling, Huayu Wu, Zhifeng Bao
SIGMOD
2005
ACM
154views Database» more  SIGMOD 2005»
16 years 7 months ago
Lazy XML Updates: Laziness as a Virtue of Update and Structural Join Efficiency
XML documents are normally stored as plain text files. Hence, the natural and most convenient way to update XML documents is to simply edit the text files. But efficient query eva...
Barbara Catania, Wen Qiang Wang, Beng Chin Ooi, Xi...