Map-reduce extensions and recursive queries

Afrati, FN; Borkar, V; Carey, M; Polyzotis, N; Ullman, JD

dc.contributor.author	Afrati, FN	en
dc.contributor.author	Borkar, V	en
dc.contributor.author	Carey, M	en
dc.contributor.author	Polyzotis, N	en
dc.contributor.author	Ullman, JD	en
dc.date.accessioned	2014-03-01T02:47:24Z
dc.date.available	2014-03-01T02:47:24Z
dc.date.issued	2011	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33124
dc.subject	Datalog	en
dc.subject	Map-reduce	en
dc.subject	Polynomial fringe	en
dc.subject	Recursion	en
dc.subject	Task migration	en
dc.subject	Transitive closure	en
dc.subject.other	Datalog	en
dc.subject.other	Map-reduce	en
dc.subject.other	Recursions	en
dc.subject.other	Task migration	en
dc.subject.other	Transitive closure	en
dc.subject.other	Technology	en
dc.subject.other	Database systems	en
dc.title	Map-reduce extensions and recursive queries	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1145/1951365.1951367	en
heal.identifier.secondary	http://dx.doi.org/10.1145/1951365.1951367	en
heal.publicationDate	2011	en
heal.abstract	We survey the recent wave of extensions to the popular map-reduce systems, including those that have begun to address the implementation of recursive queries using the same computing environment as map-reduce. A central problem is that recursive tasks cannot deliver their output only at the end, which makes recovery from failures much more complicated than in map-reduce and its nonrecursive extensions. We propose several algorithmic ideas for efficient implementation of recursions in the map-reduce environment and discuss several alternatives for supporting recovery from failures without restarting the entire job.	en
heal.journalName	ACM International Conference Proceeding Series	en
dc.identifier.doi	10.1145/1951365.1951367	en
dc.identifier.spage	1	en
dc.identifier.epage	8	en