Reflective Relational Machines were introduced by S. Abiteboul, C. Papadimitriou and V. Vianu in 1994, as variations of Turing machines which are suitable for the computation of ...
Flavio Antonio Ferrarotti, Jose Maria Turull Torre...
Mining frequent patterns with an FP-tree avoids costly candidate generation and repeatedly occurrence frequency checking against the support threshold. It therefore achieves bette...
We propose a new client-side data-caching scheme for relational databases with a central server and multiple clients. Data are loaded into each client cache based on queries execut...
Database indices provide a non-discriminative navigational infrastructure to localize tuples of interest. Their maintenance cost is taken during database updates. In this paper, w...
Stratos Idreos, Martin L. Kersten, Stefan Manegold
Within the field of databases that are deployed in distributed environments there is a need to guarantee consistency among replicas and availability among nodes despite of networ...