The view selection problem for regular path queries

Автор: Sergey Afonin
Сборник: Proceedings of the 8th Latin American conference on Theoretical informatics
Серия: Lecture Notes in Computer Science
Том: 4957
Год издания: 2008
Место издания: Springer-Verlag Berlin, Heidelberg
Первая страница: 121
Последняя страница: 132
DOI: 10.1007/978-3-540-78773-0_11
Аннотация: The view selection problem consists of finding a set of views to materialize that can answer the given set of workload queries and is optimal in some sense. In this paper we study the view selection problem for regular path queries over semistructured data and two specific view-based query rewriting formalisms, namely single-word and arbitrary regular rewritings. We present an algorithm that for a given finite set of workload queries, i.e. for a set of regular languages, computes a set of views that can answer every query in the workload and has minimal possible cardinality. If, in addition, a database instance is given then one can construct a viewset such that its size, i.e. amount of space required to store results, is minimal on the database instance.

	ИСТИНА	Войти в систему Регистрация
	ИСТИНА ЦЭМИ РАН
	Главная Поиск Статистика О проекте Помощь

ИСТИНА