Titlebook: Database Systems for Advanced Applications; 11th International C Mong Lee,Kian-Lee Tan,Vilas Wuwongse Conference proceedings 2006 Springer-

LITHE

聯(lián)想記憶

Using Multiple Indexes for Efficient Subsequence Matching in Time-Series Databasesrformed in a target application and a set of window sizes for building multiple indexes, we devise a formula that estimates the overall cost of all the subsequence matchings. By using this formula, we propose an algorithm that determines the optimal window sizes for maximizing the performance of ent

Musculoskeletal

Carbon-Monoxide

daredevil

Subitizing: The Neglected QuantifierL documents is presented which captures the structure given by branching path expressions, a very important class of queries. By leveraging existing infrastructure, the structure can handle updates both to the underlying data, and to itself, with little additional cost.

Outwit

CLEFT

intoxicate

青石板

返老還童

Jarmila Novotná,Bernard Sarrazypts of data and query enlargement are introduced for addressing inaccuracy. As proof of concepts of the benchmark, the paper covers the application of the benchmark to three spatio-temporal indexes—the TPR-, TPR*-, and B.-trees. Representative experimental results and consequent guidelines for the usage of these indexes are reported.