Sciweavers

154 search results - page 26 / 31
» Verifying Completeness of Relational Query Results in Data P...
Sort
View
ICDE
1998
IEEE
108views Database» more  ICDE 1998»
14 years 9 months ago
Efficient Discovery of Functional and Approximate Dependencies Using Partitions
Discovery of functionaldependencies from relations has been identified as an important database analysis technique. In this paper, we present a new approach for finding functional...
Ykä Huhtala, Juha Kärkkäinen, Pasi ...
ICDE
2003
IEEE
120views Database» more  ICDE 2003»
14 years 9 months ago
PBiTree Coding and Efficient Processing of Containment Joins
This paper addresses issues related to containment join processing in tree-structured data such as XML documents. A containment join takes two sets of XML node elements as input a...
Wei Wang 0011, Haifeng Jiang, Hongjun Lu, Jeffrey ...
SIGIR
2012
ACM
11 years 10 months ago
Automatic suggestion of query-rewrite rules for enterprise search
Enterprise search is challenging for several reasons, notably the dynamic terminology and jargon that are specific to the enterprise domain. This challenge is partly addressed by...
Zhuowei Bao, Benny Kimelfeld, Yunyao Li
BMCBI
2007
154views more  BMCBI 2007»
13 years 7 months ago
Inferring biological networks with output kernel trees
Background: Elucidating biological networks between proteins appears nowadays as one of the most important challenges in systems biology. Computational approaches to this problem ...
Pierre Geurts, Nizar Touleimat, Marie Dutreix, Flo...
BMCBI
2002
129views more  BMCBI 2002»
13 years 7 months ago
SeqHound: biological sequence and structure database as a platform for bioinformatics research
Background: SeqHound has been developed as an integrated biological sequence, taxonomy, annotation and 3-D structure database system. It provides a high-performance server platfor...
Katerina Michalickova, Gary D. Bader, Michel Dumon...