2859 search results - page 246 / 572 » Querying Complex Structured Databases |
194
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
Increasing popularity of XML in recent years has generated much interest in query processing over graph-structured data. To support efficient evaluation of path expressions, many ...
278
click to vote
PODS
2009
ACM
16 years 7 months ago
2009
ACM
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
200
click to vote
ISAAC
2007
Springer
16 years 20 days ago
2007
Springer
In this paper, we present two linear-size external memory data structures for approximate range searching. Our first structure, the BAR-B-tree, stores a set of N points in Rd and ...
154
click to vote
ADBIS
1997
Springer
15 years 10 months ago
1997
Springer
A graphical formalized language is proposed for specifying systems of views over database schemas. The language is based on the notion of arrow (mapping) between data schemas and ...
185
click to vote
SSDBM
2003
IEEE
15 years 11 months ago
2003
IEEE
The growing interest in genomic research has caused an explosive growth in the size of DNA databases making it increasely challenging to perform searches on them. In this paper, w...