IIT Home Page CNR Home Page

Efficient Strategies for Partitioning and Querying a Hirerchical Document Space

We consider a problem arising in the efficient management of a Hierachical Document Space, i,e.,partitioning the leaves of a tree among a set of servers in such a way that it is possible to take full advantage of the hierarchical system to efficiently answer user's queries. After providing that the problem is NP-Hard, we devise efficient approximate solutions, and we make a number of experiments which show that allowing for very little space inefficiency can be instrumental to acheiving a significant improvement in the query efficiency.


2002

Autori: Codenotti B., De Marco G., Leoncini M., Montangero M., Santini F.
Autori IIT:

Tipo: Rapporti tecnici, manuali, carte geologiche e tematiche e prodotti multimediali
Area di disciplina: Information Technology and Communication Systems
Technical report 2002-TR-25