Efficient Interval Indexing and Searching on Cloud

Interval queries are widely used in social networks, information retrieval and database domains. As an important query type, interval query has been explored in depth by researchers long ago. However, the works to study interval indexing and querying on cloud platform are few. The paper analyzes the shortcomings of existing work of interval indexing and searching on key-value store. To reduce the space overhead and respond time, we propose a new index structure and corresponding searching algorithms. The index structure takes full advantage of the features of key-value store to improve the query performance. The extensive experiments based on real and simulated data sets show that our approach is effective and efficient.

[1]  Michael Stonebraker,et al.  Segment indexes: dynamic indexing techniques for multi-dimensional interval data , 1991, SIGMOD '91.

[2]  Christian S. Jensen,et al.  Light-weight indexing of general bitemporal data , 2000, Proceedings. 12th International Conference on Scientific and Statistica Database Management.

[3]  Ramez Elmasri,et al.  The time index+: an incremental access structure for temporal databases , 1994, CIKM '94.

[4]  Christos Faloutsos,et al.  Designing Access Methods for Bitemporal Databases , 1998, IEEE Trans. Knowl. Data Eng..

[5]  Prashant Malik,et al.  Cassandra: a decentralized structured storage system , 2010, OPSR.

[6]  Werner Vogels,et al.  Dynamo: amazon's highly available key-value store , 2007, SOSP.

[7]  Shipeng Li,et al.  Distributed Segment Tree: Support of Range Query and Cover Query over DHT , 2006, IPTPS.

[8]  Wilson C. Hsieh,et al.  Bigtable: A Distributed Storage System for Structured Data , 2006, TOCS.

[9]  Ramez Elmasri,et al.  The Time Index: An Access Structure for Temporal Data , 1990, VLDB.

[10]  Peter Triantafillou,et al.  Interval indexing and querying on key-value cloud stores , 2013, 2013 IEEE 29th International Conference on Data Engineering (ICDE).

[11]  Abdul Sattar,et al.  Advanced indexing technique for temporal data , 2010, Comput. Sci. Inf. Syst..

[12]  Chuan-Heng Ang,et al.  The Interval B-Tree , 1995, Inf. Process. Lett..

[13]  Hans-Arno Jacobsen,et al.  PNUTS: Yahoo!'s hosted data serving platform , 2008, Proc. VLDB Endow..

[14]  Vassilis J. Tsotras,et al.  Comparison of access methods for time-evolving data , 1999, CSUR.