Skip to main content
SpringerLink
Log in

FOCUS: An Index FOr ContinuoUS Subsequence Pattern Queries

  • Conference paper
Advances in Databases and Information Systems (ADBIS 2012)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7503))

Abstract

Recent appearance of the a type of OLAP analysis, the sequential OLAP (or SOLAP) has caused the need for new index structures which support new types of analytical queries. An integral part of processing SOLAP queries is finding sequences which match a user-specified pattern. We call such queries subsequence pattern queries. The contribution of this paper is threefold: first, we propose logical and physical index structure which supports subsequence pattern queries, second, we extend this structure to support aggregation queries and third, we perform performance experiments which show that our solutions offer orders of magnitude improvement over previous state of the art solutions.

This work was supported from the Polish Ministry of Science and Higher Education grant No. N N516 365834.

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

Access this chapter

Log in via an institution
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. Lo, E., Kao, B., Ho, W.S., Lee, S.D., Chui, C.K., Cheung, D.W.: Olap on sequence data. In: Proc. of the SIGMOD 2008 Conf., pp. 649–660. ACM, New York (2008)

    Chapter  Google Scholar 

  2. Keogh, E.J., Chakrabarti, K., Pazzani, M.J., Mehrotra, S.: Locally adaptive dimensionality reduction for indexing large time series databases. In: Proc. of the SIGMOD 2001 Conf, pp. 151–162. ACM Press (2001)

    Google Scholar 

  3. Yi, B.K., Faloutsos, C.: Fast time sequence indexing for arbitrary Lp norms. In: Proc. of the VLDB 2000 Conference, pp. 385–394. Morgan Kaufmann Publishers Inc. (2000)

    Google Scholar 

  4. Keogh, E.J., Lonardi, S., Ratanamahatana, C.A.: Towards parameter-free data mining. In: Proc. of the SIGKDD 2004 Conf., pp. 206–215. ACM Press (2004)

    Google Scholar 

  5. Vlachos, M., Hadjieleftheriou, M., Gunopulos, D., Keogh, E.J.: Indexing multi-dimensional time-series with support for multiple distance measures. In: Proc. of the SIGKDD 2003 Conf. ACM, New York (2003)

    Google Scholar 

  6. Fredkin, E.: Trie memory. Commun. ACM 3, 490–499 (1960)

    Article  Google Scholar 

  7. Ukkonen, E.: On-line construction of suffix trees. Algorithmica 14(3), 249–260 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  8. Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. In: Proc. of the SODA 1990 Conference, pp. 319–327. Society for Industrial and Applied Mathematics (1990)

    Google Scholar 

  9. Gusfield, D.: Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge University Press, New York (1997)

    Book  MATH  Google Scholar 

  10. Andrzejewski, W., Morzy, T., Morzy, M.: Indexing of Sequences of Sets for Efficient Exact and Similar Subsequence Matching. In: Yolum, p., Güngör, T., Gürgen, F., Özturan, C. (eds.) ISCIS 2005. LNCS, vol. 3733, pp. 864–873. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  11. Andrzejewski, W., Morzy, T.: AISS: An Index for Non-timestamped Set Subsequence Queries. In: Tjoa, A.M., Trujillo, J. (eds.) DaWaK 2006. LNCS, vol. 4081, pp. 503–512. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  12. Andrzejewski, W., Morzy, T.: SeqTrie: An index for data mining applications. In: Proc. of the ADMKD 2006 Workshop, pp. 13–25 (2006)

    Google Scholar 

  13. Andrzejewski, W.: Indexing of Sequential Data. PhD thesis, Poznan University of Technology (2008)

    Google Scholar 

  14. Andrzejewski, W., Krolikowski, Z., Morzy, T.: How to improve efficiency of analysis of sequential data? Control and Cybernetics 38(1), 107–126 (2009)

    MATH  Google Scholar 

  15. Chui, C.K., Kao, B., Lo, E., Cheng, R.: I/O-efficient algorithms for answering pattern-based aggregate queries in a sequence olap system. In: Proceedings of the 20th ACM International Conference on Information and Knowledge Management, CIKM 2011, pp. 1619–1628. ACM, New York (2011)

    Google Scholar 

  16. Chui, C.K., Kao, B., Lo, E., Cheung, D.: S-olap: an olap system for analyzing sequence data. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, SIGMOD 2010, pp. 1131–1134. ACM, New York (2010)

    Google Scholar 

  17. Zhou, B., Jiang, D., Pei, J., Li, H.: Olap on search logs: an infrastructure supporting data-driven applications in search engines. In: Proc. of the SIGKDD 2009 Conf., pp. 1395–1404. ACM, New York (2009)

    Google Scholar 

  18. Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press, New York (2007)

    Book  MATH  Google Scholar 

  19. Andrzejewski, W.: RA 04/12: FOCUS: An Index FOr ContinuoUS Subsequence Pattern Queries. Technical report, Poznan University of Technology (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Poznan University of Technology, Poland

    Witold Andrzejewski & Bartosz Bębel

Authors
  1. Witold Andrzejewski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bartosz Bębel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computing Science, Poznań University of Technology, Piotrowo 2, 60-965, Poznań, Poland

    Tadeusz Morzy

  2. Department of Computer Science, AG DBIS, University of Kaiserslautern, Germany, P.O. Box 3049, 67653, Kaiserslautern, Germany

    Theo Härder

  3. Institute of Computing Science, Poznan University of Technology, Piotrowo 2, 60-965, Poznan, Poland

    Robert Wrembel

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Andrzejewski, W., Bębel, B. (2012). FOCUS: An Index FOr ContinuoUS Subsequence Pattern Queries. In: Morzy, T., Härder, T., Wrembel, R. (eds) Advances in Databases and Information Systems. ADBIS 2012. Lecture Notes in Computer Science, vol 7503. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33074-2_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33074-2_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33073-5

  • Online ISBN: 978-3-642-33074-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation