TY - GEN
T1 - Benchmarking the chase
AU - Benedikt, Michael
AU - Motik, Boris
AU - Konstantinidis, George
AU - Papotti, Paolo
AU - Tsamoura, Efthymia
AU - Mecca, Giansalvatore
AU - Santoro, Donatello
N1 - Funding Information:
The work by Benedikt, Motik, and Konstantinidis was funded by the EPSRC grants PDQ (EP/M005852/1), ED (EP/N014359/1), DBOnto (EP/L012138/1), and MaSI3 (EP/K00607X/1).
Publisher Copyright:
© 2017 ACM.
PY - 2017/5/9
Y1 - 2017/5/9
N2 - The chase is a family of algorithms used in a number of data management tasks, such as data exchange, answering queries under dependencies, query reformulation with constraints, and data cleaning. It is well established as a theoretical tool for understanding these tasks, and in addition a number of prototype systems have been developed. While individual chase-based systems and particular optimizations of the chase have been experimentally evaluated in the past, we provide the first comprehensive and publicly available benchmark - test infrastructure and a set of test scenarios - for evaluating chase implementations across a wide range of assumptions about the dependencies and the data. We used our benchmark to compare chase-based systems on data exchange and query answering tasks with one another, as well as with systems that can solve similar tasks developed in closely related communities. Our evaluation provided us with a number of new insights concerning the factors that impact the performance of chase implementations.
AB - The chase is a family of algorithms used in a number of data management tasks, such as data exchange, answering queries under dependencies, query reformulation with constraints, and data cleaning. It is well established as a theoretical tool for understanding these tasks, and in addition a number of prototype systems have been developed. While individual chase-based systems and particular optimizations of the chase have been experimentally evaluated in the past, we provide the first comprehensive and publicly available benchmark - test infrastructure and a set of test scenarios - for evaluating chase implementations across a wide range of assumptions about the dependencies and the data. We used our benchmark to compare chase-based systems on data exchange and query answering tasks with one another, as well as with systems that can solve similar tasks developed in closely related communities. Our evaluation provided us with a number of new insights concerning the factors that impact the performance of chase implementations.
UR - http://www.scopus.com/inward/record.url?scp=85021227498&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85021227498&partnerID=8YFLogxK
U2 - 10.1145/3034786.3034796
DO - 10.1145/3034786.3034796
M3 - Conference contribution
AN - SCOPUS:85021227498
T3 - Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
SP - 37
EP - 52
BT - PODS 2017 - Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
PB - Association for Computing Machinery
T2 - 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017
Y2 - 14 May 2017 through 19 May 2017
ER -