Antonio Maccioni1, Orlando Cassano2, Yongming Luo3, Juan Castrejón4, and Genoveva Vargas-Solar5*
1 Universitá Roma Tre, Rome, Italy. (e-mail: maccioni@dia.uniroma3.it).
2 Université Libre de Bruxelles, Brussels, Belgium. (e-mail: orlando.cassano@cetic.be).
3 Eindhoven University of Technology, the Netherlands. (e-mail: y.luo@tue.nl).
4 Université de Grenoble, Grenoble, France. (e-mail: juan.castrejon@imag.fr).
5 Centre national de la recherche scientifique (CNRS), LIG-LAFMIA labs, Saint Martin d'Héres, France. *Corresponding author (e-mail: genoveva.vargas-solar@imag.fr).
]]>Manuscript received on May 3, 2014
Accepted for publication on June 10, 2014
Published on November 15, 2014.
Abstract
This paper proposes NoXPERANTO, a novel crowdsourcing approach to address querying over data collections managed by polyglot persistence settings. The main contribution of NoXPERANTO is the ability to solve complex queries involving different data stores by exploiting queries from expert users (i.e. a crowd of database administrators, data engineers, domain experts, etc.), assuming that these users can submit meaningful queries. NoXPERANTO exploits the results of "meaningful queries" in order to facilitate the forthcoming query answering processes. In particular, queries results are used to: (i) help non-expert users in using the multi-database environment and (ii) improve performances of the multi-database environment, which not only uses disk and memory resources, but heavily rely on network bandwidth. NoXPERANTO employs a layer to keep track of the information produced by the crowd modeled as a Property Graph and managed in a Graph Database Management System (GDBMS).
Key words: Polyglot persistence, crowdsourcing, multidatabases, big data, property graph, graph databases.
DESCARGAR ARTÍCULO EN FORMATO PDF
]]>References
[1] P. J. Sadalage and M. Fowler, NoSQL distilled: a brief guide to the emerging world of polyglot persistence. Addison-Wesley, 2012. [ Links ]
[2] B. F. Cooper, "Spanner: Google's globally-distributed database," in Proceedings of the 6th International Systems and Storage Conference. ACM, 2013, p. 9. [ Links ]
[3] D. Borthakur, "Petabyte scale databases and storage systems at facebook," in SIGMOD Conference, 2013, pp. 1267-1268. [ Links ]
[4] M. J. Franklin, D. Kossmann, T. Kraska, S. Ramesh, and R. Xin, "CrowdDB: answering queries with crowdsourcing," in SIGMOD Conference, 2011, pp. 61-72. [ Links ]
]]>[5] R. De Virgilio, A. Maccioni, and R. Torlone, "Converting relational to graph databases," in GRADES, 2013. [ Links ]
[6] A. Marcus, E. Wu, D. Karger, S. Madden, and R. Miller, "Human-powered sorts and joins," Proc. VLDB Endow., vol. 5, no. 1, pp. 13-24, Sep. 2011. [ Links ]
[7] J. Selke, C. Lofi, and W.-T. Balke, "Pushing the boundaries of crowd-enabled databases with query-driven schema expansion," Proc. VLDB Endow., vol. 5, no. 6, pp. 538-549, Feb. 2012. [ Links ]
[8] A. Bozzon, M. Brambilla, and S. Ceri, "Answering search queries with CrowdSearcher," in Proceedings of the 21st international conference on World Wide Web, ser. WWW'12, 2012, pp. 1009-1018. [ Links ]
[9] G. Demartini, B. Trushkowsky, T. Kraska, and M. J. Franklin, "CrowdQ: Crowdsourced query understanding," in CIDR, 2013. [ Links ]
]]>[10] H. Park, R. Pang, A. Parameswaran, H. Garcia-Molina, N. Polyzotis, and J. Widom, "An overview of the deco system: data model and query language; query processing and optimization," SIGMOD Rec, vol. 41, no. 4, pp. 22-27, jan 2013. [ Links ]
[11] J. Wang, T. Kraska, M. J. Franklin, and J. Feng, "CrowdER: crowdsourcing entity resolution," Proc. VLDB Endow., vol. 5, no. 11, pp. 1483-1494, Jul. 2012. [ Links ]
[12] R. De Virgilio and A. Maccioni, "Generation of reliable randomness via social phenomena," in MEDI, 2013, pp. 65-77. [ Links ]
[13] R. Angles and C. Gutiérrez, "Survey of graph database models," ACM Comput. Surv., vol. 40, no. 1, 2008. [ Links ]
[14] M. A. Rodriguez and P. Neubauer, "Constructions from dots and lines," CoRR, vol. abs/1006.2361, 2010. [ Links ]
]]>[15] M. Eysholdt and H. Behrens, "Xtext: implement your language faster than the quick and dirty way," in Proceedings of the ACM international conference companion on Object oriented programming systems languages and applications companion, ser. SPLASH'10. New York, NY, USA: ACM, 2010, pp. 307-309. [Online], Available: http://doi.acm.org/10.1145/1869542.1869625 [ Links ]
[16] D. Pritchett, "BASE: An Acid alternative," Queue, vol. 6, no. 3, pp. 48-55, May 2008. [Online]. Available: http://doi.acm.org/10.1145/1394127.1394128 [ Links ] ]]>