Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 2

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  database searching
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote Query Rewriting Based on Meta-Granular Aggregation
EN
Analytic database queries are exceptionally time consuming. Decision support systems employ various execution techniques in order to accelerate such queries and reduce their resource consumption. Probably the most important of them consists in materialization of partial results. However, any introduction of derived objects into the database schema increases the cost of software development, since programmers must take care of their usage and synchronization. In this article we consider using partial aggregations materialized in additional tables. The idea is based on the concept of metagranules that represent the information on grouping and used aggregations. Metagranules have a natural partial order that guides the optimisation process. We present solutions to two problems. Firstly, we assume that a set of stored metagranules is given and we optimize a query. We present a novel query rewriting method to make analytic queries use the information stored in metagranules. We also describe our proof-of-concept implementation of this method and perform an extensive experimental evaluation using databases of the size up to 0:5 TiB and 6 billions rows. Secondly, we assume that a database workload is given and we want to select the optimal set of metagranules to materialize. Although each metagranule accelerates some queries, it also imposes a significant overhead on updates. Therefore, we propose a cost model that includes both benefits for queries and penalties for updates. We experiment with the complete search in the space of sets of metagranules to find the optimum. Finally, we empirically verify identified optimal sets against database instances up to 0:5 TiB with billions of rows and hundreds millions of aggregated rows.
EN
This paper reports results of experiments carried out in relation with the research devoted to creation and maintenance of a database of telephone calls to emergency services. This database is comprised of concise but unambiguous information about all contained emergency calls and of tools for efficient data searching. We present the tools for real-time data registration, off-line metadata preparation, and searching for particular telephone calls.
PL
Artykuł prezentuje rezultaty eksperymentów związanych z badaniami dotyczącymi tworzenia i zarządzania bazą danych rozmów na telefony alarmowe. Prezentowana baza zawiera spójne, ale równocześnie jednoznaczne informacje na temat przeprowadzonych rozmów. Dodatkowo jest ona wyposażona w mechanizmy szybkiego i efektywnego przeszukiwania, wykorzystujące zróżnicowane metody, w tym metadane. Przedstawiono eksperymentalne stanowisko do zautomatyzowanej rejestracji rozmów, narzędzia do przetwarzania danych, tworzenia metadanych w trybie off-line, a także wyszukiwania zdarzeń i rozmówców.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.