2859 search results - page 305 / 572 » Querying Complex Structured Databases |
147
click to vote
VLDB
1994
ACM
15 years 10 months ago
1994
ACM
This paper introduces a new data structure, called V-trees, designed to store long sequences of points in 2D space and yet allow efficient access to their fragments. They also opt...
174
click to vote
KDID
2003
15 years 8 months ago
2003
We introduce generalized version space trees, a novel data structure that serves as a condensed representation in inductive databases for graph mining. Generalized version space tr...
148
click to vote
ADBIS
2003
Springer
15 years 12 months ago
2003
Springer
In this paper we present a new compression scheme for signature tree structures. Beyond the reduction of storage space, compression attains significant savings in terms of query pr...
189
click to vote
DEBU
2010
15 years 6 months ago
2010
Databases supporting time dependent and continuously changing geometries, called moving objects databases, have been studied for about 15 years. The field has been flourishing and...
210
click to vote
BMCBI
2011
14 years 10 months ago
2011
Background: Although homology-based methods are among the most widely used methods for predicting the structure and function of proteins, the question as to whether interface sequ...