Sciweavers

167 search results - page 9 / 34
» Optimization of Query Plans in the presence of Access Limita...
Sort
View
ICDE
2010
IEEE
295views Database» more  ICDE 2010»
14 years 2 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
DASFAA
2008
IEEE
168views Database» more  DASFAA 2008»
14 years 2 months ago
SemanticTwig: A Semantic Approach to Optimize XML Query Processing
Twig pattern matching (TPM) is the core operation of XML query processing. Existing approaches rely on either efficient data structures or novel labeling/indexing schemes to reduce...
Zhifeng Bao, Tok Wang Ling, Jiaheng Lu, Bo Chen
CIDR
2011
401views Algorithms» more  CIDR 2011»
12 years 11 months ago
DBease: Making Databases User-Friendly and Easily Accessible
Structured query language (SQL) is a classical way to access relational databases. Although SQL is powerful to query relational databases, it is rather hard for inexperienced user...
Guoliang Li, Ju Fan, Hao Wu, Jiannan Wang, Jianhua...
SIGMOD
2009
ACM
201views Database» more  SIGMOD 2009»
14 years 7 months ago
Cost based plan selection for xpath
We present a complete XPath cost-based optimization and execution framework and demonstrate its effectiveness and efficiency for a variety of queries and datasets. The framework i...
Haris Georgiadis, Minas Charalambides, Vasilis Vas...
SAC
1997
ACM
13 years 12 months ago
Query Planning in Infomaster
Infomaster is an information integration system. It provides integrated access to distributed, heterogeneous information sources, thus giving its users the illusion of a centraliz...
Oliver M. Duschka, Michael R. Genesereth