메뉴 건너뛰기




Volumn 73, Issue 3, 2007, Pages 391-441

On the memory requirements of XPath evaluation over XML streams

Author keywords

Communication complexity; Data stream processing; Space lower bounds; XML; XPath

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; DATA STRUCTURES; INFORMATION THEORY; QUERY LANGUAGES; STORAGE ALLOCATION (COMPUTER); TRANSDUCERS;

EID: 33845956299     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2006.10.002     Document Type: Article
Times cited : (24)

References (29)
  • 3
    • 33845941449 scopus 로고    scopus 로고
    • I. Avila-Campillo, T.J. Green, A. Gupta, M. Onizuka, D. Raven, D. Suciu, XMLTK: An XML toolkit for scalable XML stream processing, in: Proceedings of the 1st Workshop on Programming Languages for XML (PLAN-X), 2002
  • 15
    • 0038504811 scopus 로고    scopus 로고
    • Optimal aggregation algorithms for middleware
    • Fagin R., Lotem A., and Naor M. Optimal aggregation algorithms for middleware. J. Comput. System Sci. 66 4 (2003) 614-656
    • (2003) J. Comput. System Sci. , vol.66 , Issue.4 , pp. 614-656
    • Fagin, R.1    Lotem, A.2    Naor, M.3
  • 21
    • 33845958375 scopus 로고    scopus 로고
    • Z. Ives, A. Levy, D. Weld, Efficient evaluation of regular path expressions on streaming XML data, Technical report, University of Washington, 2000


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