Database slicing on relational databases

Tengeri Dávid and Havasi Ferenc: Database slicing on relational databases. In: Acta cybernetica, (21) 4. pp. 629-653. (2014)

[thumbnail of actacyb_21_4_2014_6.pdf]
Cikk, tanulmány, mű

Download (626kB) | Preview


Many software systems today use databases to permanently store their data. Testing, bug finding and migration are complex problems in the case of databases that contain many records. Here, our method can speed up these processes if we can select a smaller piece of the database (called a slice) that contains all of the records belonging to the slicing criterion. The slicing criterion might be, for example, a record which gives rise to a bug in the program. Database slicing seeks to select all the records belonging to a specific slicing criterion. Here, we introduce the concept of database slicing and describe the algorithms and data structures necessary for slicing a given database. We define the Table-based and the Record-based slicing algorithms and we empirically evaluate these methods in two scenarios by applying the slicing to the database of a real-life application and to random generated database content.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2014
Volume: 21
Number: 4
ISSN: 0324-721X
Page Range: pp. 629-653
Language: English
Place of Publication: Szeged
Related URLs:
DOI: 10.14232/actacyb.21.4.2014.6
Uncontrolled Keywords: Számítástechnika
Additional Information: Bibliogr.: p. 652-653. és a lábjegyzetekben ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2016. Oct. 17. 10:37
Last Modified: 2022. Jun. 20. 09:23

Actions (login required)

View Item View Item