11. Assignment - XML Technologies - Winter Term 2015 (Release date: Jan 21 - Date due: Jan 27, 8:00 am)
1. Task - Value Index

Value indexes can be expensive, yet there are a few techniques to reduce the overall memory consumption. For the hexadecimal values 499, 3FF7AB, 35ABC283, 77A9E3AC, 77A9E3CC:

  1. Provide the bit-compressed values and the compressed distances in hexadecimal representation
  2. How many bytes can you save with the two compression techniques compared to the naive approach? (consider an integer to consume 4 bytes)
2. Task - Index Application

Given the following indexes

  • Name Index
  • Path Summary
  • Value Index
  • Full-Text Index

  1. Which index structures can be utilized?
    1. //city
    2. //city[@name = "Munich"]
    3. //chapter/title[. contains text "foo"]
    4. /book/chapter[1]/section/title
    5. count(//chapter)
  2. Which indexes get outdated by the following updates?
    1. replace node //chapter[@author = "ben"]/@modification-date with current-dateTime()
    2. rename node /book as "article"
    3. delete node //paragraph[. contains text "bar"]
Discussion of 11. Assignment - XML Technologies - Winter Term 2015