Istituto di Informatica e Telematica     
Codenotti B., De Marco G., Leoncini M., Montangero M., Santini F. Efficient Strategies for Partitioning and Querying a Hirerchical Document Space. Technical report, 2002.
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.
Subject Algorithm analysis
Information storage and retrieval
Approximation algorithms
Hierachical document collections

Icona documento 1) Download Document PDF

Icona documento Open access Icona documento Restricted Icona documento Private


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional