Sciweavers

958 search results - page 114 / 192
» Efficient data structures for range-aggregate queries on tre...
Sort
View
143
Voted
SSDBM
1999
IEEE
135views Database» more  SSDBM 1999»
15 years 8 months ago
Query Processing in the TAMBIS Bioinformatics Source Integration System
Conducting bioinformatic analyses involves biologists in expressing requests over a range of highly heterogeneous information sources and software tools. Such activities are labor...
Norman W. Paton, Robert Stevens, Patricia G. Baker...
ISCI
2006
96views more  ISCI 2006»
15 years 3 months ago
A comparison of classification accuracy of four genetic programming-evolved intelligent structures
We investigate the effectiveness of GP-generated intelligent structures in classification tasks. Specifically, we present and use four context-free grammars to describe (1) decisi...
Athanasios Tsakonas
128
Voted
WWW
2009
ACM
16 years 4 months ago
Exploiting web search engines to search structured databases
Web search engines often federate many user queries to relevant structured databases. For example, a product related query might be federated to a product database containing thei...
Arnd Christian König, Dong Xin, Kaushik Chakr...
EDBT
2004
ACM
172views Database» more  EDBT 2004»
16 years 3 months ago
Content-Based Routing of Path Queries in Peer-to-Peer Systems
Peer-to-peer (P2P) systems are gaining increasing popularity as a scalable means to share data among a large number of autonomous nodes. In this paper, we consider the case in whic...
Georgia Koloniari, Evaggelia Pitoura
229
Voted
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
16 years 3 months ago
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
Elke Achtert, Christian Böhm, Peer Kröge...