메뉴 건너뛰기




Volumn 29, Issue 1 SPEC. ISS., 2004, Pages 2-42

Archiving scientific data

Author keywords

Keys for XML

Indexed keywords

DATA ELEMENTS; HIERARCHICAL FORMATS; HIERARCHICAL STRUCTURES; KEYS FOR XML;

EID: 3042693735     PISSN: 03625915     EISSN: None     Source Type: Journal    
DOI: 10.1145/974750.974752     Document Type: Conference Paper
Times cited : (108)

References (41)
  • 3
    • 0033957834 scopus 로고    scopus 로고
    • The SWISS-PROT protein sequence database and its supplement TrEMBL
    • BAIROCH, A. AND APWEILER, R. 2000. The SWISS-PROT protein sequence database and its supplement TrEMBL. Nucl. Acids Res. 28, 45-48.
    • (2000) Nucl. Acids Res. , vol.28 , pp. 45-48
    • Bairoch, A.1    Apweiler, R.2
  • 16
    • 45149119179 scopus 로고    scopus 로고
    • EMBL-EBI (EUROPEAN BIOINFORMATIONS INSTITUTE). SPTr-XML Documentation, http://www.ebi.ac.uk/swissprot/SP-ML/.
    • SPTr-XML Documentation
  • 17
    • 3042594834 scopus 로고    scopus 로고
    • A delta format for XML: Identifying changes in XML files and representing the changes in XML
    • Berlin, Germany
    • FONTAINE, R. L. 2001. A delta format for XML: Identifying changes in XML files and representing the changes in XML. In XML Europe (Berlin, Germany).
    • (2001) XML Europe
    • Fontaine, R.L.1
  • 21
    • 0022161646 scopus 로고
    • A file comparison program
    • MILLER, W. AND MYERS, E. 1985. A file comparison program. Softw.-Pract. Exp. 15, 11, 1025-1040.
    • (1985) Softw.-pract. Exp. , vol.15 , Issue.11 , pp. 1025-1040
    • Miller, W.1    Myers, E.2
  • 23
    • 0023012946 scopus 로고
    • An O(N D) difference algorithm and its variations
    • MYERS, E. 1986. An O(N D) difference algorithm and its variations. Algorithmica 1, 2, 251-266.
    • (1986) Algorithmica , vol.1 , Issue.2 , pp. 251-266
    • Myers, E.1
  • 27
    • 0003584326 scopus 로고    scopus 로고
    • McGraw-Hill Higher Education, 3rd Ed. McGraw-Hill, Englewood Cliffs, N.J
    • RAMAKRISHNAN, R. AND GEHRKE, J. 2002. Database Management Systems. McGraw-Hill Higher Education, 3rd Ed. McGraw-Hill, Englewood Cliffs, N.J.
    • (2002) Database Management Systems
    • Ramakrishnan, R.1    Gehrke, J.2
  • 28
    • 0016626427 scopus 로고
    • The source code control system
    • ROCHKIND, M. 1975. The source code control system. IEEE Trans. Softw. Eng. 1, 4, 364-370.
    • (1975) IEEE Trans. Softw. Eng. , vol.1 , Issue.4 , pp. 364-370
    • Rochkind, M.1
  • 30
    • 0018491659 scopus 로고
    • The tree-to-tree correction problem
    • TAI, K. C. 1979. The tree-to-tree correction problem. J. ACM 26, 422-433.
    • (1979) J. ACM , vol.26 , pp. 422-433
    • Tai, K.C.1
  • 31
    • 0034133771 scopus 로고    scopus 로고
    • Effective timestamping in databases
    • TORP, K., JENSEN, C. S., AND SNODGRASS, R. T. 2000. Effective timestamping in databases. The VLDB J. 8, 3-4, 267-288.
    • (2000) The VLDB J. , vol.8 , Issue.3-4 , pp. 267-288
    • Torp, K.1    Jensen, C.S.2    Snodgrass, R.T.3
  • 32
    • 2442535662 scopus 로고    scopus 로고
    • Aggregation and accumulation of XML data
    • TUFTE, K. AND MAIER, D. 2001. Aggregation and accumulation of XML data. IEEE Data Eng. Bull. 24, 2, 34-39.
    • (2001) IEEE Data Eng. Bull. , vol.24 , Issue.2 , pp. 34-39
    • Tufte, K.1    Maier, D.2
  • 34
    • 0004290924 scopus 로고    scopus 로고
    • W3C. 1999a. Namespaces in XML. http://www.w3.org/TR/REC-xml-names.
    • (1999) Namespaces in XML
  • 39
    • 84943375340 scopus 로고    scopus 로고
    • XMLTREEDIFF. XML TreeDiff. http://www.alphaworks.ibm.com/formula/ xmltreediff.
    • XML TreeDiff.
  • 40
    • 0024889169 scopus 로고
    • Simple fast algorithms for the editing distance between trees and related problems
    • ZHANG, K. AND SHASHA, D. 1989. Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Comput. 18, 6, 1245-1262.
    • (1989) SIAM J. Comput. , vol.18 , Issue.6 , pp. 1245-1262
    • Zhang, K.1    Shasha, D.2
  • 41
    • 0001495763 scopus 로고
    • Fast algorithms for unit cost editing distance between trees
    • ZHANG, K. AND SHASHA, D. 1990. Fast algorithms for unit cost editing distance between trees. J. Algorithms 11, 6, 581-621.
    • (1990) J. Algorithms , vol.11 , Issue.6 , pp. 581-621
    • Zhang, K.1    Shasha, D.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.