2121 search results - page 96 / 425 » Indexing Incomplete Databases |
140
click to vote
SIGMOD
2003
ACM
16 years 5 months ago
2003
ACM
A Query by Humming system allows the user to find a song by humming part of the tune. No musical training is needed. Previous query by humming systems have not provided satisfacto...
142
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
Personalized PageRank, related to random walks with restarts and conductance in resistive networks, is a frequent search paradigm for graph-structured databases. While efficient ba...
127
click to vote
VLDB
2007
ACM
15 years 11 months ago
2007
ACM
In this paper we observe that k-anonymizing a data set is strikingly similar to building a spatial index over the data set, so similar in fact that classical spatial indexing tech...
124
click to vote
VLDB
2000
ACM
15 years 8 months ago
2000
ACM
Fast indexing in time sequence databases for similarity searching has attracted a lot of research recently. Most of the proposals, however, typically centered around the Euclidean...
254
click to vote
ICDE
2003
IEEE
16 years 6 months ago
2003
IEEE
XML documents are typically queried with a combination of value search and structure search. While querying by values can leverage traditional database technologies, evaluating st...