Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Database Management Systems
The Cougar Project: a work-in-progress report
ACM SIGMOD Record
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Distributed Computing: Fundamentals, Simulations and Advanced Topics
TinyDB: an acquisitional query processing system for sensor networks
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Operator placement for in-network stream query processing
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Algorithms for computing QoS paths with restoration
IEEE/ACM Transactions on Networking (TON)
Declarative routing: extensible routing with declarative queries
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Implementing declarative overlays
Proceedings of the twentieth ACM symposium on Operating systems principles
Declarative networking: language, execution and optimization
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Worldsens: from lab to sensor network application development and deployment
Proceedings of the 6th international conference on Information processing in sensor networks
Towards a declarative language and system for secure networking
NETB'07 Proceedings of the 3rd USENIX international workshop on Networking meets databases
A declarative perspective on adaptive manet routing
Proceedings of the ACM workshop on Programmable routers for extensible services of tomorrow
Operational Semantics for Declarative Networking
PADL '09 Proceedings of the 11th International Symposium on Practical Aspects of Declarative Languages
Declarative support for sensor data cleaning
PERVASIVE'06 Proceedings of the 4th international conference on Pervasive Computing
Applying prolog to develop distributed systems
Theory and Practice of Logic Programming
A rule-based language for web data management
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Maintaining distributed logic programs incrementally
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
A framework for verifying data-centric protocols
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
Maintaining distributed logic programs incrementally
Computer Languages, Systems and Structures
Deciding eventual consistency for a simple class of relational transducer networks
Proceedings of the 15th International Conference on Database Theory
UBIQUEST, for rapid prototyping of networking applications
Proceedings of the 16th International Database Engineering & Applications Sysmposium
Modeling datalog fact assertion and retraction in linear logic
Proceedings of the 14th symposium on Principles and practice of declarative programming
Messages with implicit destinations as mobile agents
Proceedings of the 2nd edition on Programming systems, languages and applications based on actors, agents, and decentralized control abstractions
Datalog 2.0'12 Proceedings of the Second international conference on Datalog in Academia and Industry
Relational transducers for declarative networking
Journal of the ACM (JACM)
Adaptive atomic capture of multiple molecules
Journal of Parallel and Distributed Computing
Model-based, event-driven programming paradigm for interactive web applications
Proceedings of the 2013 ACM international symposium on New ideas, new paradigms, and reflections on programming & software
Developers' social networks - tools analysis based on the 3Cs model
International Journal of Networking and Virtual Organisations
| Hi-index | 0.00 |
We propose a rule-based language, Netlog, to express distributed applications such as communication protocols or P2P applications in a declarative manner. The language extends Datalog with communication primitives, as well as aggregation and non-deterministic constructs, standard in network applications. Our contribution is twofold. First we define a sound distributed fixpoint semantics, which takes explicitly into account the in-node behavior as well as the communication between nodes, and solves semantic problems raised in declarative networking. Second, we show that syntactic restrictions over the programs can ensure polynomial bounds on the complexity (time and message) of the distributed execution. The language has been implemented and runs over a virtual machine, Netquest, which relies on a DBMS. Netlog programs are partly compiled into SQL queries, which makes them portable over heterogeneous architecture.