Sciweavers

517 search results - page 53 / 104
» Efficient Computation of Diverse Query Results
Sort
View
KDD
1998
ACM
99views Data Mining» more  KDD 1998»
13 years 12 months ago
On the Efficient Gathering of Sufficient Statistics for Classification from Large SQL Databases
For a wide variety of classification algorithms, scalability to large databases can be achieved by observing that most algorithms are driven by a set of sufficient statistics that...
Goetz Graefe, Usama M. Fayyad, Surajit Chaudhuri
VLDB
2004
ACM
119views Database» more  VLDB 2004»
14 years 8 months ago
Evaluating holistic aggregators efficiently for very large datasets
Indatawarehousingapplications,numerousOLAP queries involve the processing of holistic aggregators such as computing the "top n," median, quantiles, etc. In this paper, we...
Lixin Fu, Sanguthevar Rajasekaran
WICON
2008
13 years 9 months ago
Efficient XML usage within wireless sensor networks
Integrating wireless sensor networks in heterogeneous networks is a complex task. A reason is the absence of a standardized data exchange format that is supported in all participa...
Nils Hoeller, Christoph Reinke, Jana Neumann, Sven...
ICDE
2010
IEEE
244views Database» more  ICDE 2010»
14 years 7 months ago
Reliable Storage and Querying for Collaborative Data Sharing Systems
The sciences, business confederations, and medicine urgently need infrastructure for sharing data and updates among collaborators' constantly changing, heterogeneous databases...
Nicholas E. Taylor, Zachary G. Ives
VLDB
2006
ACM
171views Database» more  VLDB 2006»
14 years 8 months ago
Grid-partition index: a hybrid method for nearest-neighbor queries in wireless location-based services
Abstract Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on t...
Baihua Zheng, Jianliang Xu, Wang-Chien Lee, Dik Lu...