Titlebook: Advances in Databases and Information Systems; Tadeusz Morzy,Theo H?rder,Robert Wrembel Conference proceedings 2013 Springer-Verlag Berlin

沙發(fā)

就職

Complexity of One-Way Cellular Automatallocation pattern queries in a limited memory environment. In this paper we introduce a new method based on iCPI-tree materialization and a spatial partitioning to efficiently discover collocation patterns. We have implemented this new solution and conducted series of experiments. The results show a

路標(biāo)

Exposure

exclusice

Canonical Form of Gray Codes in N-cubes and quantifiers. A less general variant of this method is known from relational systems and SQL as pushing a selection before a join. If a query involves a selection which predicates refer to proper arguments of a structure constructor or a join or a quantifier that occurs at the left-hand subquery

deforestation

Alonso Castillo-Ramirez,Maximilien Gadouleaune promising approach which is applicable especially for the development of parallel databases is expressing algorithms as stream programs, i.e. inputs and outputs of procedures are data streams and these procedures are connected so that they form an oriented graph. In this paper, we introduce highl

使殘廢

cardiopulmonary

Luca Mariot,Enrico Formenti,Alberto Leporatiry of M/G/1 queuing system. Theses solutions are fast and easy to implement but they omit the impact of streams synchronization. In this paper, we introduce a heuristic method which measures the synchronization impact. Then we have used this solution to extend the popular model based on average valu

Vldl379

Lecture Notes in Computer Science profound decisions based on mature EA information. As of today, gathering required information, i.e. documenting the EA, is regarded both, time consuming and error-prone. As a reaction, recent approaches seek to automate EA documentation by extracting information out of productive system environmen

Vldl379

An “almost dual” to Gottschalk’s Conjecturecollections of queries in the future (stage 2), with a given probability of occurrence associated with each collection, so as to minimize the expected value of the corresponding query response time, while keeping the total size of the views within a given limit. We formulate this problem as a two-st