1042 search results - page 1 / 209 » Constraint Databases, Data Structures and Efficient Query Ev... |
CDB
2004
Springer
13 years 8 months ago
2004
Springer
Abstract. Constraint databases that can be described by boolean combinations of polynomial inequalities over the reals have received ample research attention. In particular, the ex...
ICDE
1999
IEEE
14 years 6 months ago
1999
IEEE
We develop a data integration approach for the efficient evaluation of queries over autonomous source databases. The approach is based on some novel applications and extensions of...
WWW
2007
ACM
14 years 5 months ago
2007
ACM
Many applications in analytical domains often have the need to "connect the dots" i.e., query about the structure of data. In bioinformatics for example, it is typical t...
DASFAA
2007
IEEE
13 years 8 months ago
2007
IEEE
Abstract. We have defined an XML structural index called the Structure Index Tree (SIT), which eliminates duplicate structures arising from the equivalent subtrees in an XML docume...
SSDBM
2007
IEEE
13 years 11 months ago
2007
IEEE
We consider pedigree data structured in the form of a directed acyclic graph, and use an encoding scheme, called NodeCodes, for expediting the evaluation of queries on pedigree gr...