1416 search results - page 197 / 284 » Optimizing Write Performance for Read Optimized Databases |
163
click to vote
SIGMOD
2005
ACM
16 years 23 hour ago
2005
ACM
We present a method to evaluate path queries based on the novel concept of partial path instances. Our method (1) maximizes performance by means of sequential scans or asynchronou...
ICDE
2005
IEEE
15 years 5 months ago
2005
IEEE
Abstract— Logical reorganization of data and requirements of differentiated QoS in information systems necessitate bulk data migration by the underlying storage layer. Such data ...
VLDB
2005
ACM
15 years 5 months ago
2005
ACM
Popular XML languages, like XPath, use “treepattern” queries to select nodes based on their structural characteristics. While many processing methods have already been propose...
ISMIR
2004
Springer
15 years 5 months ago
2004
Springer
Time series representations are common in MIR applications such as query-by-humming, where a sung query might be represented by a series of ‘notes’ for database retrieval. Whi...
101
click to vote
STDBM
2004
Springer
15 years 5 months ago
2004
Springer
This paper introduces the Dynamic Cascade Tree (DCT), a structure designed to index query regions on multi-dimensional data streams. The DCT is designed for a stream management sy...