Article

Free access

Pattern matching and pattern discovery in scientific, program, and document databases

Authors:

Jason T. L. Wang,

Kaizhong Zhang,

Dennis ShashaAuthors Info & Claims

SIGMOD '95: Proceedings of the 1995 ACM SIGMOD international conference on Management of data

Page 487

https://doi.org/10.1145/223784.223900

Published: 22 May 1995 Publication History

PDF eReader

Abstract

Over the past several years we have created or borrowed algorithms for combinatorial pattern matching and pattern discovery on sequences [2] and trees.In matching problems, given a pattern, a set of data objects and a distance metric, we find the distance between the pattern and one or more data objects. In discovery problems by contrast, given a set of objects, a metric, and a distance, we seek a pattern that matches many of those objects within the given distance. (So, discovery is a lot like data mining.) Our toolkit performs both matching and discovery with current targeted applications in molecular biology and document comparison.

References

[1]

V. Christophides, S. Abiteboul, S. Cluet, and M. Scholl. From structured documents to novel query facilities. In CoIGMOD, pages 313-324, Minnesota, May 1994.

Digital Library

Google Scholar

[2]

J. T. L. Wang, G.-W. Chirn, T. G. Mart, B. A. Shapiro, D. Shasha, and K. Zhang. Combinatorial pattern discovery for scientific data: Some preliminary results. In SIGMOD, pages 115-125, Minnesota, May 1994.

Digital Library

Google Scholar

Cited By

View all

Stolte Evon Praun CAlonso GGross TIves ZPapakonstantinou YHalevy A(2003)Scientific data repositoriesProceedings of the 2003 ACM SIGMOD international conference on Management of data10.1145/872757.872800(349-360)Online publication date: 9-Jun-2003
https://dl.acm.org/doi/10.1145/872757.872800
Stolte EAlonso G(2003)Approximated trial and error analysis in scientific databasesInformation Systems10.1016/S0306-4379(02)00052-228:1-2(137-157)Online publication date: 1-Mar-2003
https://dl.acm.org/doi/10.1016/S0306-4379%2802%2900052-2
Stolte EAlonso G(2002)Optimizing Scientific Databases for Client Side Data ProcessingAdvances in Database Technology — EDBT 200210.1007/3-540-45876-X_26(390-408)Online publication date: 14-Mar-2002
https://doi.org/10.1007/3-540-45876-X_26
Show More Cited By

Index Terms

Pattern matching and pattern discovery in scientific, program, and document databases

Recommendations

Pattern matching and pattern discovery in scientific, program, and document databases

Over the past several years we have created or borrowed algorithms for combinatorial pattern matching and pattern discovery on sequences [2] and trees.In matching problems, given a pattern, a set of data objects and a distance metric, we find the ...
Hyperclique pattern discovery

Existing algorithms for mining association patterns often rely on the support-based pruning strategy to prune a combinatorial search space. However, this strategy is not effective for discovering potentially interesting patterns at low levels of ...
Pattern-growth methods for frequent pattern mining

Comments

Information & Contributors

Information

Published In

SIGMOD '95: Proceedings of the 1995 ACM SIGMOD international conference on Management of data

June 1995

508 pages

ISBN:0897917316

DOI:10.1145/223784

Editors:
Michael Carey
Univ. of Wisconsin
,
Donovan Schneider
Red Brick Systems

ACM SIGMOD Record Volume 24, Issue 2
May 1995
490 pages
ISSN:0163-5808
DOI:10.1145/568271
Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 May 1995

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMOD/PODS95

Sponsor:

SIGMOD/PODS95: Joint ACM SIGMOD Intl Conference on Management of Data and ACM SIGACT-SIGMOD- SIGART Symposium on Principles of Database Systems

May 22 - 25, 1995

California, San Jose, USA

Acceptance Rates

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
409
Total Downloads

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

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Stolte Evon Praun CAlonso GGross TIves ZPapakonstantinou YHalevy A(2003)Scientific data repositoriesProceedings of the 2003 ACM SIGMOD international conference on Management of data10.1145/872757.872800(349-360)Online publication date: 9-Jun-2003
https://dl.acm.org/doi/10.1145/872757.872800
Stolte EAlonso G(2003)Approximated trial and error analysis in scientific databasesInformation Systems10.1016/S0306-4379(02)00052-228:1-2(137-157)Online publication date: 1-Mar-2003
https://dl.acm.org/doi/10.1016/S0306-4379%2802%2900052-2
Stolte EAlonso G(2002)Optimizing Scientific Databases for Client Side Data ProcessingAdvances in Database Technology — EDBT 200210.1007/3-540-45876-X_26(390-408)Online publication date: 14-Mar-2002
https://doi.org/10.1007/3-540-45876-X_26
Alonso GBausch WPautasso CKahn A(2001)Dependable computing in virtual laboratoriesProceedings 17th International Conference on Data Engineering10.1109/ICDE.2001.914834(235-242)Online publication date: 2001
https://doi.org/10.1109/ICDE.2001.914834
Wang JZhang KChang C(1999)Identifying approximately common substructures in trees based on a restricted edit distanceInformation Sciences: an International Journal10.1016/S0020-0255(99)00100-0121:3-4(367-386)Online publication date: 1-Dec-1999
https://dl.acm.org/doi/10.1016/S0020-0255%2899%2900100-0
Wang JShasha DChang GRelihan LZhang KPatel G(1997)Structural matching and discovery in document databasesACM SIGMOD Record10.1145/253262.25340626:2(560-563)Online publication date: 1-Jun-1997
https://dl.acm.org/doi/10.1145/253262.253406
Wang JShasha DChang GRelihan LZhang KPatel G(1997)Structural matching and discovery in document databasesProceedings of the 1997 ACM SIGMOD international conference on Management of data10.1145/253260.253406(560-563)Online publication date: 1-Jun-1997
https://dl.acm.org/doi/10.1145/253260.253406
Park SO JLee S(2002)Design and Implementation of an HTML Pages Modification Detector for Meta-search EnginesThe KIPS Transactions:PartD10.3745/KIPSTD.2002.9D.3.3459D:3(345-354)Online publication date: 1-Jun-2002
https://doi.org/10.3745/KIPSTD.2002.9D.3.345

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

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

Cited By

Index Terms

Recommendations

Pattern matching and pattern discovery in scientific, program, and document databases

Hyperclique pattern discovery

Pattern-growth methods for frequent pattern mining