Publications by Sandro Blum

×

Status message

The Publications site is currently under construction, as a result some publications might be missing.

2008

Systems Group Master's Thesis, no. ETH Zürich; Department of Computer Science, August 2008
Supervised by: Prof. Donald Kossmann
A Personal Dataspace Management System must be able to handle highly dynamic dataspaces. This requires index structures that are not only capable of efficiently speeding up queries on these dataspaces but that can also be updated on-the-fly. State of the art text-retrieval systems are typically based on inverted file indices that are updated either in-place or with a merge-based approach. In this thesis we present a merge-based dynamic indexing framework for the iMeMex Dataspace Management System. The framework we present is generic, extensible and is based on abstract sub components. We provide several sub component implementations and evaluate the system experimentally. Furthermore we have studied analytically the three best-known merge strategies: No merge, Immediate Merge and Logarithmic Merge. Based on this analysis we propose a cost model for determining the best strategy in a given scenario or as the basis for an adaptive merge strategy.
@mastersthesis{abc,
	abstract = {A Personal Dataspace Management System must be able to handle highly dynamic
dataspaces. This requires index structures that are not only capable of
efficiently speeding up queries on these dataspaces but that can also be updated
on-the-fly. State of the art text-retrieval systems are typically based on
inverted file indices that are updated either in-place or with a merge-based approach.
In this thesis we present a merge-based dynamic indexing framework
for the iMeMex Dataspace Management System. The framework we present is
generic, extensible and is based on abstract sub components. We provide several
sub component implementations and evaluate the system experimentally. Furthermore
we have studied analytically the three best-known merge strategies:
No merge, Immediate Merge and Logarithmic Merge. Based on this analysis
we propose a cost model for determining the best strategy in a given scenario
or as the basis for an adaptive merge strategy.},
	author = {Sandro Blum},
	school = {ETH Z{\"u}rich},
	title = {A Generic Merge-Based Dynamic Indexing Framework for iMeMex},
	year = {2008}
}