2001 search results - page 168 / 401 » Indexing in a Hypertext Database |
221
Voted
ICDE
2009
IEEE
16 years 2 months ago
2009
IEEE
Due to the structural heterogeneity of XML, queries are often interpreted approximately. This is achieved by relaxing the query and ranking the results based on their relevance to ...
196
Voted
ICDE
1999
IEEE
16 years 2 months ago
1999
IEEE
We study similarity queries for time series data where similarity is defined in terms of a set of linear transformations on the Fourier series representation of a sequence. We hav...
181
Voted
VLDB
2004
ACM
16 years 1 months ago
2004
ACM
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...
189
Voted
SIGMOD
2007
ACM
16 years 1 months ago
2007
ACM
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
106
Voted
ICDE
2010
IEEE
16 years 26 days ago
2010
IEEE
A supergraph containment search is to retrieve the data graphs contained by a query graph. In this paper, we study the problem of efficiently retrieving all data graphs approximate...