Sciweavers

649 search results - page 92 / 130
» Improved and Optimized Partitioning Techniques in Database Q...
Sort
View
214
Voted
ICDE
2008
IEEE
132views Database» more  ICDE 2008»
16 years 5 months ago
Greedy List Intersection
A common technique for processing conjunctive queries is to first match each predicate separately using an index lookup, and then compute the intersection of the resulting rowid li...
Robert Krauthgamer, Aranyak Mehta, Vijayshankar Ra...
128
Voted
MM
2005
ACM
172views Multimedia» more  MM 2005»
15 years 9 months ago
Learning the semantics of multimedia queries and concepts from a small number of examples
In this paper we unify two supposedly distinct tasks in multimedia retrieval. One task involves answering queries with a few examples. The other involves learning models for seman...
Apostol Natsev, Milind R. Naphade, Jelena Tesic
133
Voted
HICSS
2003
IEEE
171views Biometrics» more  HICSS 2003»
15 years 9 months ago
Improving the Efficiency of Interactive Sequential Pattern Mining by Incremental Pattern Discovery
The discovery of sequential patterns, which extends beyond frequent item-set finding of association rule mining, has become a challenging task due to its complexity. Essentially, ...
Ming-Yen Lin, Suh-Yin Lee
EDBT
2009
ACM
175views Database» more  EDBT 2009»
15 years 10 months ago
Towards materialized view selection for distributed databases
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...
Leonardo Weiss Ferreira Chaves, Erik Buchmann, Fab...
139
Voted
ICDT
2005
ACM
128views Database» more  ICDT 2005»
15 years 9 months ago
The Pipelined Set Cover Problem
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Je...