486 search results - page 57 / 98 » An Efficient Path Index for Querying Semi-structured Data |
230
click to vote
VLDB
2002
ACM
16 years 2 days ago
2002
ACM
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
WWW
2005
ACM
16 years 15 days ago
2005
ACM
We consider the problem of indexing high-dimensional data for answering (approximate) similarity-search queries. Similarity indexes prove to be important in a wide variety of sett...
ICDE
2010
IEEE
15 years 11 months ago
2010
IEEE
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
CPM
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Protein structure analysis is one of the most important research issues in the post-genomic era, and faster and more accurate query data structures for such 3-D structure...
KDD
2001
ACM
16 years 7 days ago
2001
ACM
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...