On the Size of Full Element-Indexes for XML Keyword Search

  • Duygu Atilgan
  • Ismail Sengor Altingovde
  • Özgür Ulusoy
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7224)


We show that a full element-index can be as space-efficient as a direct index with Dewey ids, after compression using typical techniques.


Space Complexity Query Processing Conjunctive Query Direct Index Ancestor Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Guo, L., Shao, F., Botev, C., Shanmugasundaram, J.: XRANK: Ranked keyword search over XML documents. In: Proc. ACM SIGMOD, pp. 16–27 (2003)Google Scholar
  2. 2.
    Lalmas, M.: XML Retrieval. Synthesis Lectures on Information Concepts, Retrieval, and Services. Morgan & Claypool Publishers (2009)Google Scholar
  3. 3.
    Witten, I.H., Moffat, A., Bell, T.C.: Managing Gigabytes: Compressing and Indexing Documents and Images, 2nd edn. Morgan Kaufmann (1999)Google Scholar
  4. 4.
    Xu, Y., Papakonstantinou, Y.: Efficient keyword search for smallest LCAs in XML databases. In: Proc. ACM SIGMOD, pp. 537–538 (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Duygu Atilgan
    • 1
  • Ismail Sengor Altingovde
    • 2
  • Özgür Ulusoy
    • 1
  1. 1.Computer Engineering DepartmentBilkent UniversityAnkaraTurkey
  2. 2.L3S Research CenterHannoverGermany

Personalised recommendations