{6} R. A. Baeza-Yates and C. H. Perleberg. Fast and practical approximate string matching. In Combinatorial Pattern Matching, Third Annual Symposium, pages 185-192, 1992.

Digital Library

Google Scholar

[7]

{7} D. A. Benson, M. S. Boguski, D. J. Lipman, J. Ostell, and B. F. Ouellette. Genban. Nucleic Acids Research, 26(1):1-7, 1998.

Crossref

Google Scholar

[8]

{8} D. A. Benson, I. Karsch-Mizrachi, D. J. Lipman, J. Ostell, B. A. Rapp, and D. L. Wheeler. Genbank. Nucleic Acids Research, January 2000.

Crossref

Google Scholar

[9]

{9} P. Ferragina and G. Manzini. An experimental study of an opportunistic index. In SODA, pages 269-278, Washington, DC, 2001.

Digital Library

Google Scholar

[10]

{10} E. Giladi, M. G. Walker, J. Z. Wang, and W. Volkmuth. Sst: An algorithm for searching sequence databases in time proportional to the logarithm of the database size. In RECOMB, Japan, 2000.

Google Scholar

[11]

{11} D. Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, 1 edition, January 1997.

Digital Library

Google Scholar

[12]

{12} S. Henikoff and J. G. Henikoff. Amino acid substitution matrices from protein blocks. In PNAS, pages 10915-10919, 1989.

Google Scholar

[13]

{13} T. Kahveci and A. Singh. Variable length queries for time series data. In ICDE, Heidelberg, Germany, 2001.

Digital Library

Google Scholar

[14]

{14} F. Korn, N. Sidiropoulos, C. Faloutsos, E. Siegel, and Z. Protopapas. Fast nearest neighbor search in medical databases. In VLDB, pages 215-226, India, 1996.

Digital Library

Google Scholar

[15]

{15} U. Manber and E. Myers. Suffix arrays: A new method for on-line string searches. SIAM Journal on Computing, 22(5):935-948, 1993.

Digital Library

Google Scholar

[16]

{16} S. Muthukrishnan and S. C. Sahinalp. Approximate nearest neighbors and sequence comparison with block operations. In STOC, Portland, Or, 2000.

Digital Library

Google Scholar

[17]

{17} E. Myers. An O(ND) difference algorithm and its variations. Algorithmica , pages 251-266, 1986.

Google Scholar

[18]

{18} E. Myers. A sublinear algorithm for approximate keyword matching. Algorithmica, pages 345-374, 1994.

Google Scholar

[19]

{19} T. Seidl and H. P. Kriegel. Optimal multi-step k-nearest neighbor search. In SIGMOD, 1998.

Digital Library

Google Scholar

[20]

{20} T. F. Smith and M. S. Waterman. Identification of common molecular subsequences. Journal of Molecular Biology, March 1981.

Crossref

Google Scholar

[21]

{21} S. Uliel, A. Fliess, A. Amir, and R. Unger. A simple algorithm for detecting circular permutations in proteins. Bioinformatics, 15(11):930-936, 1999.

Crossref

Google Scholar

[22]

{22} S. Wu and U. Manber. Fast text searching allowing errors. Communications of the ACM, 35(10):83-91, 1992.

Digital Library

Google Scholar

Cited By

View all

Patil MShah RDyreson CLi FÖzsu M(2014)Similarity joins for uncertain stringsProceedings of the 2014 ACM SIGMOD International Conference on Management of Data10.1145/2588555.2612178(1471-1482)Online publication date: 18-Jun-2014
https://dl.acm.org/doi/10.1145/2588555.2612178
Barbar AIsmail A(2013)Stochastically Balancing Trees for File and Database SystemsInternational Journal of Green Computing10.4018/jgc.20130101044:1(58-70)Online publication date: 1-Jan-2013
https://dl.acm.org/doi/10.4018/jgc.2013010104
Qin JWang WXiao CLu YLin XWang H(2013)Asymmetric signature schemes for efficient exact edit similarity query processingACM Transactions on Database Systems10.1145/2508020.250802338:3(1-44)Online publication date: 5-Sep-2013
https://dl.acm.org/doi/10.1145/2508020.2508023
Show More Cited By

Efficient Index Structures for String Databases
1. Information systems
  1. Information retrieval
    1. Search engine architectures and scalability
2. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features

Recommendations

Multidimensional Index Structures in Relational Databases
Data warehousing and knowledge discovery

Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient query processors being able to deal with high-dimensional data. Inside such a ...
Index structures for xml databases
Space-Efficient Index Scheme for PCM-Based Multiversion Databases in Cyber-Physical Systems
Special Issue on VIPES, Special Issue on ICESS2015 and Regular Papers

In this article, we study the indexing problem of using PCM as the storage medium for embedded multiversion databases in cyber-physical systems (CPSs). Although the multiversion B⁺-tree (MVBT) index has been shown to be efficient in managing multiple ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

VLDB '01: Proceedings of the 27th International Conference on Very Large Data Bases

September 2001

709 pages

ISBN:1558608044

Publisher

Morgan Kaufmann Publishers Inc.

San Francisco, CA, United States

Publication History

Published: 11 September 2001

Qualifiers

Article

Conference

VLDB01

VLDB01: 27th International Conference on Very Large Data Bases

September 11 - 14, 2001

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

33
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 19 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Patil MShah RDyreson CLi FÖzsu M(2014)Similarity joins for uncertain stringsProceedings of the 2014 ACM SIGMOD International Conference on Management of Data10.1145/2588555.2612178(1471-1482)Online publication date: 18-Jun-2014
https://dl.acm.org/doi/10.1145/2588555.2612178
Barbar AIsmail A(2013)Stochastically Balancing Trees for File and Database SystemsInternational Journal of Green Computing10.4018/jgc.20130101044:1(58-70)Online publication date: 1-Jan-2013
https://dl.acm.org/doi/10.4018/jgc.2013010104
Qin JWang WXiao CLu YLin XWang H(2013)Asymmetric signature schemes for efficient exact edit similarity query processingACM Transactions on Database Systems10.1145/2508020.250802338:3(1-44)Online publication date: 5-Sep-2013
https://dl.acm.org/doi/10.1145/2508020.2508023
Bast HCelikik M(2013)Efficient fuzzy search in large text collectionsACM Transactions on Information Systems10.1145/2457465.245747031:2(1-59)Online publication date: 17-May-2013
https://dl.acm.org/doi/10.1145/2457465.2457470
Qin JZhou XWang WXiao CGuerrini G(2013)Trie-based similarity search and joinProceedings of the Joint EDBT/ICDT 2013 Workshops10.1145/2457317.2457389(392-396)Online publication date: 18-Mar-2013
https://dl.acm.org/doi/10.1145/2457317.2457389
Patil MCai XThankachan SShah RPark SFoltz DGuerrini G(2013)Approximate string matching by position restricted alignmentProceedings of the Joint EDBT/ICDT 2013 Workshops10.1145/2457317.2457388(384-391)Online publication date: 18-Mar-2013
https://dl.acm.org/doi/10.1145/2457317.2457388
Matsubara YSakurai YPrakash BLi LFaloutsos CYang QAgarwal DPei J(2012)Rise and fall patterns of information diffusionProceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining10.1145/2339530.2339537(6-14)Online publication date: 12-Aug-2012
https://dl.acm.org/doi/10.1145/2339530.2339537
Dai DXie JZhang HDong J(2012)Efficient range queries over uncertain stringsProceedings of the 24th international conference on Scientific and Statistical Database Management10.1007/978-3-642-31235-9_5(75-95)Online publication date: 25-Jun-2012
https://dl.acm.org/doi/10.1007/978-3-642-31235-9_5
Liu YGao BZhang X(2011)An improved sequential clustering algorithmProceedings of the Third international conference on Artificial intelligence and computational intelligence - Volume Part I10.5555/2045625.2045689(444-449)Online publication date: 24-Sep-2011
https://dl.acm.org/doi/10.5555/2045625.2045689
Qin JWang WLu YXiao CLin XSellis TMiller RKementsietsidis AVelegrakis Y(2011)Efficient exact edit similarity query processing with the asymmetric signature schemeProceedings of the 2011 ACM SIGMOD International Conference on Management of data10.1145/1989323.1989431(1033-1044)Online publication date: 12-Jun-2011
https://dl.acm.org/doi/10.1145/1989323.1989431
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Recommendations

Multidimensional Index Structures in Relational Databases

Index structures for xml databases

Space-Efficient Index Scheme for PCM-Based Multiversion Databases in Cyber-Physical Systems

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations