Abstract
Similarity based retrieval is of major importance for querying sequence databases. We consider formalisms based on automata, temporal logics and regular expressions for querying such databases. We define two different types of similarity measures–syntax based and semantics based. These measures are divided into a spectrum of measures based on the vector distance function that is employed. We consider norm vector distance functions and give efficient query processing algorithms when these measures are employed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agarwal R., Faloutsis C, Swaini A: Efficient Similarity Search in Sequence Databases, In FODO Conference, Evanston, Illinois, Oct. 1993.
J. Chomicki, History-less Checking of Dynamic Integrity Constraints, IEEE International Conference on Data Engineering, Phoenix, Arizona, February 1992.
Dayal U., Active Database Management Systems, Proc. of 3rd Intnl. Conf. on Data and Knowledge bases–Improving usability and Responsiveness, Jerusalem, June 1988.
Durbin R., et al.: Biological Sequence Analysis, Cambridge University Press, 1998.
E. A. Emerson, A. P. Sistla: Triple Exponential Decision Procedure for the Logic CTL*, Workshop on Logics of Programs, Carnegie-Mellon University, Pittsburgh, Pennsylvania, June 1983.
Faloutsos F., Ranganathan M., Manolopoulos: Fast Subsequence Matching in Time-Series Databases, Proc. of the 1994 ACM SIGMOD Intnl. Conf. on Management of Data, Minneapolis, MN, May 1994.
Gehani N., Jagadish H., Shmueli O.: Composite Event Specification in Active Databases: Models and Implementation, Proc. 18th Intnl. Conference on Very Large Databases, Aug. 1992.
Garofalakis, M. N., Rastogi R., Shim K.: SPIRIT: Sequential Pattern Mining with Regular Expression Constraints, Proc, of the 25th Intnl Conf. on Very Large Databases, Edinburgh, Scotlanad,UK, 1999.
Tao Hu, A. Prasad Sistla: Similarity based Retrieval from Sequence Databases using Automata as Specifications, Technical report, Dept of Electrical Engg and Computer Sciejce, 2000.
H. Lewis and C. Papadimitriou: Elements of the Theory of Computation, Prentice-Hall, 1998.
Z. Manna and A. Pnueli, The Temporal Logic of Reactive and Concurrent SystemsχSpecification, Springer-Verlag 1992.
A. P. Sistla, T. Hu, V. Chowdhry Similarity based Retrieval from Sequence Databases Using Automata as Queries 11th ACM Intnl Conference on Information and Knowledge Management, Virginia, Nov 2002.
A. P. Sistla and O. Wolfson, Temporal Triggers in Active Databases, IEEE Transactions on Knowledge and Data Engineering, Vol 7, No 3, June 1995, pp 471–486.
Sistla A. P., Yu C, Venkatasubramanian R.: Similarity based Retrieval of Videos, 13th International Conference on Data Engineering, April, 1997, Birmingham, U.K.
M. Vardi, P. Wolper, A. P. Sistla, Reasoning about Infinite Computations, IEEE FOCS 1983.
Wu S., Manber U.,: Fast Text Searching: Allowing Errors, CACM Oct. 1992, pp 83–91.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sistla, A.P. (2002). Formal Languages and Algorithms for Similarity Based Retrieval from Sequence Databases. In: Agrawal, M., Seth, A. (eds) FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2002. Lecture Notes in Computer Science, vol 2556. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36206-1_29
Download citation
DOI: https://doi.org/10.1007/3-540-36206-1_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00225-3
Online ISBN: 978-3-540-36206-7
eBook Packages: Springer Book Archive