메뉴 건너뛰기




Volumn 2476, Issue , 2002, Pages 11-26

From searching text to querying XML streams

Author keywords

[No Author keywords available]

Indexed keywords

FINITE AUTOMATA; INFORMATION RETRIEVAL; INFORMATION SERVICES; PATTERN MATCHING; PIPELINE PROCESSING SYSTEMS;

EID: 23044532293     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45735-6_2     Document Type: Conference Paper
Times cited : (1)

References (25)
  • 1
    • 0016518897 scopus 로고
    • Efficient string matching: An aid to bibliographic search
    • A. Ahoand M. Corasick. Efficient string matching: an aid to bibliographic search. Communications of the ACM, 18:333–340, 1975.
    • (1975) Communications of the ACM , vol.18 , pp. 333-340
    • Ahoand, A.1    Corasick, M.2
  • 2
    • 84877335908 scopus 로고    scopus 로고
    • Efficient filtering of XML documents for selective dissemination
    • Cairo, Egipt, September
    • M. Altinel and M. Franklin. Efficient filtering of XML documents for selective dissemination. In Proceedings of VLDB, pages 53–64, Cairo, Egipt, September. 2000
    • (2000) In Proceedings of VLDB , pp. 53-64
    • Altinel, M.1    Franklin, M.2
  • 7
    • 84994092452 scopus 로고    scopus 로고
    • DataGuides: Enabling query formulation and optimization in semistructured databases
    • R. Goldman and J. Widom. DataGuides: enabling query formulation and optimization in semistructured databases. In Proceedings of Very Large Data Bases, pages 436–445, September 1997.
    • (1997) In Proceedings of Very Large Data Bases , pp. 436-445
    • Goldman, R.1    Widom, J.2
  • 8
    • 0002155190 scopus 로고
    • Lexicographical indices for text: Inverted files vs. PAT trees
    • W.B. Frakes and R.A. Baeza-Yates, editors, Prentice-Hall
    • G. Gonnet, R. Baeza-Yates, and T. Snider. Lexicographical indices for text: inverted files vs. PAT trees. In W.B. Frakes and R.A. Baeza-Yates, editors, Information Retrieval: Data Structures & Algorithms, pages 66–82. Prentice-Hall, 1992.
    • (1992) Information Retrieval: Data Structures & Algorithms , pp. 66-82
    • Gonnet, G.1    Baeza-Yates, R.2    Snider, T.3
  • 14
  • 17
    • 0039785296 scopus 로고    scopus 로고
    • XMill: An efficent compressor for XML data
    • Dallas, TX
    • H. Liefke and D. Suciu. XMill: an efficent compressor for XML data. In Proceedings of SIGMOD, pages 153–164, Dallas, TX, 2000.
    • (2000) Proceedings of SIGMOD , pp. 153-164
    • Liefke, H.1    Suciu, D.2
  • 19
    • 84936931604 scopus 로고    scopus 로고
    • NASA’s astronomical data center
    • NASA’s astronomical data center. A DC XML resource page. http://xml.gsfc.nasa.gov/.
    • A DC XML Resource Page
  • 20
    • 0031248710 scopus 로고    scopus 로고
    • Proximal nodes: A model to query document databases by content and structure
    • October
    • G. Navarro and R. Baeza-Yates. Proximal nodes: a model to query document databases by content and structure. ACM Transactions on Information Systems, 15(4):400–435, October 1997.
    • (1997) ACM Transactions on Information Systems , vol.15 , Issue.4 , pp. 400-435
    • Navarro, G.1    Baeza-Yates, R.2
  • 24
    • 0001119132 scopus 로고
    • Pat expressions: An algebra for text search
    • A. Salminen and F.W. Tompa.: Pat expressions: An algebra for text search. Acta Linguistica Hungarica, 41(1-4):277–306, 1994.
    • (1994) Acta Linguistica Hungarica , vol.41 , Issue.1-4 , pp. 277-306
    • Salminen, A.1    Tompa, F.W.2


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