921 search results - page 46 / 185 » New Data Structures for Orthogonal Range Searching |
138
click to vote
ADBIS
2007
Springer
15 years 10 months ago
2007
Springer
The M-tree and its variants have been proved to provide an efficient similarity search in database environments. In order to further improve their performance, in this paper we pro...
139
click to vote
CSL
2010
Springer
15 years 5 months ago
2010
Springer
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
170
click to vote
DEXA
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. There is a significant commercial and research interest in locationbased web search engines. Given a number of search keywords and one or more locations that a user is in...
219
click to vote
ICDE
2005
IEEE
16 years 5 months ago
2005
IEEE
We propose a new ranking paradigm for relational databases called Structured Value Ranking (SVR). SVR uses structured data values to score (rank) the results of keyword search que...
130
click to vote
BMCBI
2008
15 years 4 months ago
2008
Background: Most non-coding RNA families exert their function by means of a conserved, common secondary structure. The Rfam data base contains more than five hundred structurally ...