Sciweavers

552 search results - page 86 / 111
» On the Complexity of Join Predicates
Sort
View
RECOMB
2008
Springer
14 years 8 months ago
Perfect DCJ Rearrangement
We study the problem of transforming a multichromosomal genome into another using Double-Cut-and-Join (DCJ) operations. We introduce the notion of DCJ scenario that does not break ...
Sèverine Bérard, Annie Chateau, Cedr...
RECOMB
2004
Springer
14 years 8 months ago
Discovering temporal relations in molecular pathways using protein-protein interactions
The availability of large-scale protein-protein interaction data provides us with many opportunities to study molecular pathways involving proteins. In this paper we propose to mi...
Martin Farach-Colton, Yang Huang, John L. L. Woolf...
VLDB
2002
ACM
157views Database» more  VLDB 2002»
14 years 7 months ago
A formal perspective on the view selection problem
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...
Rada Chirkova, Alon Y. Halevy, Dan Suciu
SIGMOD
2005
ACM
360views Database» more  SIGMOD 2005»
14 years 7 months ago
NaLIX: an interactive natural language interface for querying XML
Database query languages can be intimidating to the nonexpert, leading to the immense recent popularity for keyword based search in spite of its significant limitations. The holy ...
Yunyao Li, Huahai Yang, H. V. Jagadish
SIGMOD
2002
ACM
114views Database» more  SIGMOD 2002»
14 years 7 months ago
Time-parameterized queries in spatio-temporal databases
Time-parameterized queries (TP queries for short) retrieve (i) the actual result at the time that the query is issued, (ii) the validity period of the result given the current mot...
Yufei Tao, Dimitris Papadias