Sciweavers

7576 search results - page 198 / 1516
» On Querying Ontologies and Databases
Sort
View
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
ESWS
2009
Springer
16 years 1 months ago
The Relevance of Reasoning and Alignment Incoherence in Ontology Matching
Abstract. Ontology matching has become an important field of research over the last years. Although many different approaches have been proposed, only few of them are committed t...
Christian Meilicke
SIGMOD
2003
ACM
127views Database» more  SIGMOD 2003»
16 years 6 months ago
Cache-and-Query for Wide Area Sensor Databases
Webcams, microphones, pressure gauges and other sensors provide exciting new opportunities for querying and monitoring the physical world. In this paper we focus on querying wide ...
Amol Deshpande, Suman Kumar Nath, Phillip B. Gibbo...