Sciweavers

6740 search results - page 122 / 1348
» Querying Databases with Taxonomies
Sort
View
DEXA
2003
Springer
108views Database» more  DEXA 2003»
15 years 11 months ago
Exploiting Similarity of Subqueries for Complex Query Optimization
Query optimizers in current database management systems (DBMS) often face problems such as intolerably long optimization time and/or poor optimization results when optimizing compl...
Yingying Tao, Qiang Zhu, Calisto Zuzarte
SIGMOD
1999
ACM
136views Database» more  SIGMOD 1999»
15 years 10 months ago
Query Rewriting for Semistructured Data
We address the problem of query rewriting for TSL, a language for querying semistructured data. We develop and present an algorithm that, given a semistructured query q and a set ...
Yannis Papakonstantinou, Vasilis Vassalos
VLDB
2002
ACM
126views Database» more  VLDB 2002»
15 years 6 months ago
Plan Selection Based on Query Clustering
Query optimization is a computationally intensive process, especially for complex queries. We present here a tool, called PLASTIC, that can be used by query optimizers to amortize...
Antara Ghosh, Jignashu Parikh, Vibhuti S. Sengar, ...
VLDB
1991
ACM
122views Database» more  VLDB 1991»
15 years 10 months ago
An Iterative Method for Distributed Database Design
The development of a distributed database systemrequires effective solutions to many complex and interrelated design problems. The cost dependenciesbetween query optimization and ...
Rex Blankinship, Alan R. Hevner, S. Bing Yao
ICDE
2010
IEEE
295views Database» more  ICDE 2010»
16 years 1 months ago
K nearest neighbor queries and kNN-Joins in large relational databases (almost) for free
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
Bin Yao, Feifei Li, Piyush Kumar