메뉴 건너뛰기




Volumn , Issue , 2003, Pages 141-152

Path queries on compressed XML

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; MODEL CHECKING; QUERY LANGUAGES; TREES (MATHEMATICS);

EID: 85012112309     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1016/b978-012722442-8/50021-5     Document Type: Conference Paper
Times cited : (166)

References (22)
  • 4
    • 0022769976 scopus 로고
    • Graph-based algorithms for boolean function manipulation
    • Aug.
    • R. E. Bryant. "Graph-Based Algorithms for Boolean Function Manipulation". IEEE Transactions on Computers, C-35(8):677-691, Aug. 1986.
    • (1986) IEEE Transactions on Computers , vol.C-35 , Issue.8 , pp. 677-691
    • Bryant, R.E.1
  • 11
    • 0003292107 scopus 로고    scopus 로고
    • Storing and querying XML data using an RDMBS
    • D. Florescu and D. Kossmann. "Storing and Querying XML Data using an RDMBS". IEEE Data Engineering Bulletin, 22(3):27-34, 1999.
    • (1999) IEEE Data Engineering Bulletin , vol.22 , Issue.3 , pp. 27-34
    • Florescu, D.1    Kossmann, D.2
  • 21
    • 85012201324 scopus 로고    scopus 로고
    • Nov.
    • World Wide Web Consortium. XML Path Language (XPath) Recommendation. http://www.w3c.org/TR/xpath/, Nov. 1999.
    • (1999)
  • 22
    • 0017493286 scopus 로고
    • A universal algorithm for sequential data compression
    • May
    • J. Ziv and A. Lempel. "A Universal Algorithm for Sequential Data Compression". IEEE Transactions of Information Theory, 23(3):337-349, May 1977.
    • (1977) IEEE Transactions of Information Theory , vol.23 , Issue.3 , pp. 337-349
    • Ziv, J.1    Lempel, A.2


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