Sciweavers

128 search results - page 12 / 26
» Plan Selection Based on Query Clustering
Sort
View
CORR
1999
Springer
222views Education» more  CORR 1999»
13 years 7 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount
VLDB
1997
ACM
142views Database» more  VLDB 1997»
13 years 12 months ago
Algorithms for Materialized View Design in Data Warehousing Environment
Selecting views to materialize is one of the most important decisions in designing a data warehouse. In this paper, we present a framework for analyzing the issues in selecting vi...
Jian Yang, Kamalakar Karlapalem, Qing Li
ICDE
2006
IEEE
178views Database» more  ICDE 2006»
14 years 9 months ago
Declarative Querying for Biological Sequences
The ongoing revolution in life sciences research is producing vast amounts of genetic and proteomic sequence data. Scientists want to pose increasingly complex queries on this dat...
Sandeep Tata, Jignesh M. Patel, James S. Friedman,...
SIGIR
2000
ACM
14 years 2 days ago
Structured translation for cross-language information retrieval
The paper introduces a query translation model that re ects the structure of the cross-language information retrieval task. The model is based on a structured bilingual dictionary...
Ruth Sperer, Douglas W. Oard
EDBT
2002
ACM
125views Database» more  EDBT 2002»
14 years 7 months ago
Estimating Answer Sizes for XML Queries
Abstract. Estimating the sizes of query results, and intermediate results, is crucial to many aspects of query processing. In particular, it is necessary for effective query optimi...
Yuqing Wu, Jignesh M. Patel, H. V. Jagadish