Sciweavers

861 search results - page 114 / 173
» Relational Completeness of Query Languages for Annotated Dat...
Sort
View
WEBDB
2009
Springer
130views Database» more  WEBDB 2009»
15 years 4 months ago
A Referential Integrity Browser for Distributed Databases
We demonstrate a program that can inspect a distributed relational database on the Internet to discover and quantify referential integrity issues for integration purposes. The pro...
Carlos Ordonez, Javier García-García...
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
15 years 10 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang
ICOODB
2010
129views Database» more  ICOODB 2010»
14 years 8 months ago
Solving ORM by MAGIC: MApping GeneratIon and Composition
Object-relational mapping (ORM) technologies have been proposed as a solution for the impedance mismatch problem between object-oriented applications and relational databases. Exis...
David Kensche, Christoph Quix, Xiang Li 0002, Sand...
BMCBI
2008
75views more  BMCBI 2008»
14 years 10 months ago
Re-searcher: a system for recurrent detection of homologous protein sequences
Background: Sequence searches are routinely employed to detect and annotate related proteins. However, a rapid growth of databases necessitates a frequent repetition of sequence s...
Valdemaras Repsys, Mindaugas Margelevicius, Ceslov...
PLDI
2004
ACM
15 years 3 months ago
Parametric regular path queries
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
Yanhong A. Liu, Tom Rothamel, Fuxiang Yu, Scott D....