Efficient temporal counting with bounded error

This paper studies aggregate search in transaction time databases. Specifically, each object in such a database can be modeled as a horizontal segment, whose y-projection is its search key, and its x-projection represents the period when the key was valid in history. Given a query timestamp qt and a key range qk, a count-query retrieves the number of objects that are alive at qt, and their keys fall in qk. We provide a method that accurately answers such queries, with error less than 1 + ? Nalive(qt), where Nalive(qt) is the number of objects alive at time qt, and is any constant in (0, 1]. Denoting the disk page size as B, and n = N/B, our technique requires O(n) space, processes any query in O(logB n) time, and supports each update in O(logB n) amortized I/Os. As demonstrated by extensive experiments, the proposed solutions guarantee query results with extremely high precision (median relative error below 5%), while consuming only a fraction of the space occupied by the existing a...

• Type: Conference
• Year: 2008
• Where: VLDB
• Authors: Yufei Tao, Xiaokui Xiao
• Keywords: Database, Median Relative Error, Query Timestamp Qt, Solutions Guarantee Query, VLDB 2008