Sciweavers

620 search results - page 32 / 124
» Algorithms for Rewriting Aggregate Queries Using Views
Sort
View
131
Voted
SIGIR
1996
ACM
15 years 7 months ago
Retrieval of Complex Objects Using a Four-Valued Logic
The aggregated structure of documents plays a key role in full-text, multimedia, and network Information Retrieval (IR). Considering aggregation provides new querying facilities a...
Thomas Rölleke, Norbert Fuhr
KDD
2004
ACM
624views Data Mining» more  KDD 2004»
15 years 9 months ago
Programming the K-means clustering algorithm in SQL
Using SQL has not been considered an efficient and feasible way to implement data mining algorithms. Although this is true for many data mining, machine learning and statistical a...
Carlos Ordonez
135
Voted
LCPC
2004
Springer
15 years 9 months ago
Supporting SQL-3 Aggregations on Grid-Based Data Repositories
There is an increasing trends towards distributed and shared repositories for storing scientific datasets. Developing applications that retrieve and process data from such reposit...
Li Weng, Gagan Agrawal, Ümit V. Çataly...
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
16 years 3 months ago
Sharing aggregate computation for distributed queries
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
Ryan Huebsch, Minos N. Garofalakis, Joseph M. Hell...
VLDB
2004
ACM
101views Database» more  VLDB 2004»
15 years 9 months ago
Taming XPath Queries by Minimizing Wildcard Steps
This paper presents a novel and complementary technique to optimize an XPath query by minimizing its wildcard steps. Our approach is based on using a general composite axis called...
Chee Yong Chan, Wenfei Fan, Yiming Zeng