Sciweavers

3225 search results - page 154 / 645
» Query Optimization by Stored Queries
Sort
View
BIOINFORMATICS
2011
14 years 7 months ago
RINQ: Reference-based Indexing for Network Queries
We consider the problem of similarity queries in biological network databases. Given a database of networks, similarity query returns all the database networks whose similarity (i...
Günhan Gülsoy, Tamer Kahveci
BTW
2005
Springer
113views Database» more  BTW 2005»
15 years 9 months ago
A Learning Optimizer for a Federated Database Management System
: Optimizers in modern DBMSs utilize a cost model to choose an efficient query execution plan (QEP) among all possible ones for a given query. The accuracy of the cost estimates de...
Stephan Ewen, Michael Ortega-Binderberger, Volker ...
WWW
2006
ACM
16 years 4 months ago
Optimizing scoring functions and indexes for proximity search in type-annotated corpora
We introduce a new, powerful class of text proximity queries: find an instance of a given "answer type" (person, place, distance) near "selector" tokens matchi...
Soumen Chakrabarti, Kriti Puniyani, Sujatha Das
ISAAC
2007
Springer
156views Algorithms» more  ISAAC 2007»
15 years 10 months ago
Approximate Range Searching in External Memory
In this paper, we present two linear-size external memory data structures for approximate range searching. Our first structure, the BAR-B-tree, stores a set of N points in Rd and ...
Micha Streppel, Ke Yi
DASFAA
2003
IEEE
115views Database» more  DASFAA 2003»
15 years 9 months ago
The BofS Solution to Limitations of Approximate Summaries
Data warehouses are of crucial importance to decision-making in competitive organizations. The fact that they store enormous quantities of data is a challenge in what concerns per...
Pedro Furtado, João Pedro Costa