NDLI: Win-move is coordination-free (sometimes)

Please wait, while we are loading the content...

Graph pattern matching revised for social network analysis

On the data complexity of consistent query answering

Highly expressive query languages for unordered data trees

Deciding eventual consistency for a simple class of relational transducer networks

Finding optimal probabilistic generators for XML collections

On the complexity of query answering over incomplete XML documents

Representation systems for data exchange

On the tractability of query compilation and bounded treewidth

Factorised representations of query results: size bounds and readability

Validating XML documents in the streaming model with external memory

Deciding twig-definability of node selecting tree automata

Win-move is coordination-free (sometimes)

Learning twig and path queries

Learning schema mappings

Computing universal models under guarded TGDs

Equivalence and minimization of conjunctive queries under combined semantics

Differentially private summaries for sparse data

Regular path queries on graphs with data

A normal form for preventing redundant tuples in relational databases

Bounded repairability for regular tree languages

Combining dependent annotations for relational algebra

Dynamic definability

Parallel skyline queries

Win-move is coordination-free (sometimes)

Content Provider	ACM Digital Library
Author	Green, Todd J. Zinn, Daniel Ludäscher, Bertram
Abstract	In a recent paper by Hellerstein [15], a tight relationship was conjectured between the number of strata of a $Datalog^{¬}$ program and the number of "coordination stages" required for its distributed computation. Indeed, Ameloot et al. [9] showed that a query can be computed by a coordination-free relational transducer network iff it is monotone, thus answering in the affirmative a variant of Hellerstein's CALM conjecture, based on a particular definition of coordination-free computation. In this paper, we present three additional models for declarative networking. In these variants, relational transducers have limited access to the way data is distributed. This variation allows transducer networks to compute more queries in a coordination-free manner: e.g., a transducer can check whether a ground atom A over the input schema is in the "scope" of the local node, and then send either A or ¬A to other nodes. We show the surprising result that the query given by the well-founded semantics of the unstratifiable win-move program is coordination-free in some of the models we consider. We also show that the original transducer network model [9] and our variants form a strict hierarchy of classes of coordination-free queries. Finally, we identify different syntactic fragments of Datalog∀¬¬, called semi-monotone programs, which can be used as declarative network programming languages, whose distributed computation is guaranteed to be eventually consistent and coordination-free.
Starting Page	99
Ending Page	113
Page Count	15
File Format	PDF
ISBN	9781450307918
DOI	10.1145/2274576.2274588
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2012-03-26
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Datalog Distribution Monotonicity Relational transducer
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Win-move is coordination-free (sometimes).

Win-move is coordination-free (sometimes

Win-move is coordination-free (sometimes (2012)

Win-Move is Coordination-Free (Sometimes)

Relational transducers for declarative networking

Weaker forms of monotonicity for declarative networking: a more fine-grained answer to the calm-conjecture

A relational transducers for declarative networking.

Relational transducers for. [extended abstract] (2011).

Inference of monotonicity constraints in datalog programs

Win-move is coordination-free (sometimes)

Similar Documents

Win-move is coordination-free (sometimes).

Win-move is coordination-free (sometimes

Win-move is coordination-free (sometimes (2012)

Win-Move is Coordination-Free (Sometimes)

Relational transducers for declarative networking

Weaker forms of monotonicity for declarative networking: a more fine-grained answer to the calm-conjecture

A relational transducers for declarative networking.

Relational transducers for. [extended abstract] (2011).

Inference of monotonicity constraints in datalog programs

Win-move is coordination-free (sometimes)