Skip to main content

Efficient Interval Query of Genome Alignment and Interval Databases in Cloud Environment

  • Conference paper
Communications and Information Processing

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 288))

Abstract

Interval overlap query has become a fundamental tool for biomedical researches. However, existing methods are either not efficient or hardly to extend. In this paper, cloud computing is applied to solving the limited speed and scalability problems of interval overlap query. First, the NCList algorithm based on centralized environment is applied to cloud computing in order to improve the query efficiency, and the CNCList algorithm is presented. Second, two optimization strategies are proposed to further enhance the query efficiency of CNCList and an advanced algorithm named CNCList +  is formed. Third, detailed comparison experiments between CNCList +  and CNCList prove the better performance of CNCList +  both on query time and scalability, thus demonstrating the excellent capability of CNCList +  on solving the limited query speed and scalability problems of interval overlap query.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alekseyenko, A.V., Lee, C.J.: Nested Containment List (NCList): a new algorithm for accelerating interval query of genome alignment and interval databases. Bioinformatics 23(11), 1386–1393 (2007)

    Article  Google Scholar 

  2. Kent, W.J., Sugnet, C.W., Furey, T.S., et al.: The human genome browser at UCSC. Genome Res. 12, 996–1006 (2002)

    Google Scholar 

  3. Giardine, B., Elnitski, L., Riemer, C., et al.: GALA, a database for genomic sequence alignments and annotations. Genome Res. 13, 732–741 (2003)

    Article  Google Scholar 

  4. Kolovson, C.P., Stonebraker, M.: Segment indexes: dynamic indexing techniques for multi-dimensional interval data. SIGMOD, 138–147 (1991)

    Google Scholar 

  5. Kriegel, H.P., Pötke, M., Seidl, T.: Managing intervals efficiently in object-relational databases. VLDB, 407–418 (2000)

    Google Scholar 

  6. Enderle, J., Hampel, M., Seidl, T.: Joining interval data in relational databases. SIGMOD, 683–694 (2004)

    Google Scholar 

  7. Tao, Y., Papadias, D.: Mv3r-tree: a spatio-temporal access method fortimestamp and interval queries. VLDB, 431–440 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, Z., Gong, K., Jin, S., Li, W., Liu, Z. (2012). Efficient Interval Query of Genome Alignment and Interval Databases in Cloud Environment. In: Zhao, M., Sha, J. (eds) Communications and Information Processing. Communications in Computer and Information Science, vol 288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31965-5_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31965-5_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31964-8

  • Online ISBN: 978-3-642-31965-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics