70 search results - page 13 / 14 » Cost-Based Fragmentation for Distributed Complex Value Datab... |
ICDE
2000
IEEE
14 years 8 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
SIGMOD
2005
ACM
14 years 7 months ago
2005
ACM
We consider the problem of joining data streams using limited cache memory, with the goal of producing as many result tuples as possible from the cache. Many cache replacement heu...
DEXA
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Bitmap indices are popular multi-dimensional data structures for accessing read-mostly data such as data warehouse (DW) applications, decision support systems (DSS) and o...
EDBT
2010
ACM
14 years 2 months ago
2010
ACM
Although keyword query enables inexperienced users to easily search XML database with no specific knowledge of complex structured query languages or XML data schemas, the ambigui...
DBPL
1999
Springer
13 years 11 months ago
1999
Springer
Semistructured databases are treated as dynamically typed: they come equipped with no independent schema or type system to constrain the data. Query languages that are designed fo...