1042 search results - page 17 / 209 » Constraint Databases, Data Structures and Efficient Query Ev... |
SISAP
2008
IEEE
14 years 2 months ago
2008
IEEE
Similarity search has been proved suitable for searching in very large collections of unstructured data objects. We are interested in efficient parallel query processing under si...
VLDB
2004
ACM
14 years 7 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...
ADBIS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Caching data reduces user-perceived latency and often enhances availability in case of server crashes or network failures. DB caching aims at local processing of declarat...
ICDE
2007
IEEE
14 years 2 months ago
2007
IEEE
Retrieval queries that combine structural constraints with keyword search represent a significant challenge to XML data management systems. Queries are expected to be answered as...
ICDT
1995
ACM
13 years 11 months ago
1995
ACM
Abstract. Extension of the relational database model to represent complex data has been a focus of much research in recent years. At the same time, an alternative extension of the ...