779 search results - page 89 / 156 » Determining Time of Queries for Re-ranking Search Results |
183
click to vote
SISAP
2009
IEEE
16 years 28 days ago
2009
IEEE
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
181
click to vote
SSDBM
2010
IEEE
15 years 4 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
169
click to vote
VLDB
1997
ACM
15 years 10 months ago
1997
ACM
This paper presents a region splitting strategy for physical database design of multidimensional le organizations. Physical database design is the process of determining the optim...
140
click to vote
ICDT
2005
ACM
15 years 11 months ago
2005
ACM
A common technique for improving performance for database query retrieval is to decluster the database among multiple disks so that retrievals can be parallelized. In this paper we...
269
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
In this article, we propose a new approach for querying and indexing a database of trees with specific applications to XML datasets. Our approach relies on representing both the q...