short-paper

UBIQUEST, for rapid prototyping of networking applications

Authors:

Ahmad Ahmad-Kassem,

Christophe Bobineau,

Christine Collet,

Etienne Dublé,

Stéphane Grumbach,

Lourdes Martinez, and

Stéphane UbédaAuthors Info & Claims

IDEAS '12: Proceedings of the 16th International Database Engineering & Applications Sysmposium

August 2012

Pages 187 - 192

https://doi.org/10.1145/2351476.2351498

Published: 08 August 2012 Publication History

Abstract

An UBIQUEST system provides a high level programming abstraction for rapid prototyping of heterogeneous and distributed applications in a dynamic environment. Such a system is perceived as a distributed database and the applications interact through declarative queries including declarative networking programs (e.g. routing) and/or specific data-oriented distributed algorithms (e.g. distributed join). Case-Based Reasoning is used for optimization of distributed queries when as there is no prior knowledge on data (sources) in networking applications, and certainly no related metadata such as data statistics.

References

[1]

A. Ahmad-Kassem, C. Bobineau, C. Collet, E. Dublé, S. Grumbach, F. Ma, L. Martinez, S. Ubéda. A data-centric approach for networking applications. In: DATA, (2012), Rome, Italy.

[2]

G. Alonso, E. Kranakis, C. Sawchuk, R. Wattenhofer and P. Widmayer. Probabilistic protocols for node discovery in ad hoc @multi-channel broadcast networks. In: Pierre, S., Barbeau, M., Kranakis, E. (eds.) ADHOC-NOW 2003. LNCS, vol. 2865, Springer, Heidelberg, 2003.

[3]

Y. Bejerano, Y. Breitbart, M. Garofalakis and R. Rastogi. Physical topology discovery for large multi-subnet networks. In: INFOCOM, 2003.

[4]

Y. Bejerano, Y. Breitbart, A. Orda, R. Rastogi and Alexander Sprintson. Algorithms for computing QoS paths with restoration, IEEE/ACM Transactions on Networking (TON), v. 13, n. 3, p. 648--661, June 2005

Digital Library

[5]

X. Chen, Y. Mao, Z. M. Mao, and J. Van der Merwe. Decor: Declarative network management and operation. SIGCOMM Comput. Commun. Rev., 40:61--66, January 2010.

Digital Library

[6]

Z. Cheng, M. Perillo, and W. B. Heinzelman. General Network Lifetime and Cost Models for Evaluating Sensor Network Deployment Strategies. IEEE Transactions on Mobile Computing, 7(4):484--497, April 2008.

Digital Library

[7]

T. Condie, D. Chu, J. M. Hellerstein, and P. Maniatis. Evita raced: metacompilation for declarative networks. Proc. VLDB Endow., 1:1153--1165, August 2008.

Digital Library

[8]

A. J. Demers, J. Gehrke, R. Rajaraman, A. Trigoni, and Y. Yao. The cougar project: a work-in-progress report. SIGMOD Record, 32(4):53--59, 2003.

Digital Library

[9]

A. Deshpande, C. Guestrin, S. R. Madden, J. M. Hellerstein, and W. Hong. Model-driven data acquisition in sensor networks. In Proceedings of the Thirtieth International conference on Very Large Data Bases. Volume 30 (VLDB "04), 588--599, 2004.

Digital Library

[10]

G. Graefe. Query evaluation techniques for large databases. ACM Computing Surveys, vol. 25, Issue 2, June, 1993.

Digital Library

[11]

S. Grumbach and F. Wang. NetLog, a rule-based language for distributed programming. In M. Carro and R. Pea, editors, PADL, volume 5937 of Lecture Notes in Computer Science, pages 88--103. Springer, 2010.

Digital Library

[12]

W. Hoschek, F. J. Jaén-Martinez, A. Samar, H. Stockinger, and K. Stockinger. 2000. Data Management in an International Data Grid Project. In Proceedings of the First IEEE/ACM International Workshop on Grid Computing (GRID "00), Rajkumar Buyya and Mark Baker (Eds.). Springer-Verlag, London, UK, 77--90.

Digital Library

[13]

Y. Ioannidis. Query optimization. ACM Comput. Surv., 28(1):121--123, 1996.

Digital Library

[14]

S. R. Jeffery, G. Alonso, M. J. Franklin, W. Hong and J. Widom. Declarative support for sensor data cleaning. In: Fishkin, K. P., Schiele, B., Nixon, P., Quigley, A. (eds.) PERVASIVE 2006. LNCS, vol. 3968, pp. 83--100. Springer, Heidelberg, 2006.

Digital Library

[15]

B. T. Loo, T. Condie, M. N. Garofalakis, D. E. Gay, J. M. Hellerstein, P. Maniatis, R. Ramakrishnan, T. Roscoe, and I. Stoica. Declarative networking: language, execution and optimization. In ACM SIGMOD International Conference on Management of Data, Chicago, Illinois, USA, 2006.

Digital Library

[16]

B. T. Loo, T. Condie, J. M. Hellerstein, P. Maniatis, T. Roscoe, and I. Stoica. Implementing Declarative Overlays. In 20th ACM Symposium on Operating Systems Principles (SOSP), 2005.

Digital Library

[17]

B. T. Loo, J. M. Hellerstein, I. Stoica, and R. Ramakrishnan. Declarative Routing: Extensible Routing with Declarative Queries. In SIGCOMM, 2005.

Digital Library

[18]

S. Madden, M. J. Franklin, J. M. Hellerstein, and W. Hong. Tinydb: an acquisitional query processing system for sensor networks. ACM Trans. Database Syst., 30(1), 2005.

Digital Library

[19]

Y. Mao. On the declarativity of declarative networking. SIGOPS Oper. Syst. Rev., 43:19--24, January 2010.

Digital Library

[20]

L. Martinez, C. Collet, C. Bobineau, E. Dublé, The QOL approach for optimizing distributed queries without complete knowledge. In: IDEAS, 2012.

Digital Library

[21]

Microsoft, "Execution plan caching and reuse," {Online}. Available: http://technet.microsoft.com/en-us/library, 2008.

[22]

M. Stillger, G. Lohman, V. Markl, and M. Kandil. Leo - db2's learning optimizer. In: Proceedings of the 27th International Conference on Very Large Data Bases (VLDB 2001), Morgan Kaufmann Publishers Inc., 19--28, San Francisco, CA, USA, 2001.

Digital Library

[23]

D. Subramanian and K. Subramanian. Query optimization in multidatabase systems. Distrib. Parallel Databases, 6(2):183--210, 1998.

Digital Library

[24]

Y. Yu, D. Estrin, and R. Govindan, Geographical and Energy-Aware Routing: A Recursive Data Dissemination Protocol for Wireless Sensor Networks. UCLA Computer Science Department Technical Report, UCLA-CSD TR-01-0023, May 2001.

Cited By

Martinez LCollet CBobineau CDublé EDesai BPokorny JBernardino J(2012)The QOL approach for optimizing distributed queries without complete knowledgeProceedings of the 16th International Database Engineering & Applications Sysmposium10.1145/2351476.2351487(91-99)Online publication date: 8-Aug-2012
https://dl.acm.org/doi/10.1145/2351476.2351487

Index Terms

UBIQUEST, for rapid prototyping of networking applications
1. Information systems

Recommendations

Datalog and emerging applications: an interactive tutorial
SIGMOD '11: Proceedings of the 2011 ACM SIGMOD International Conference on Management of data

We are witnessing an exciting revival of interest in recursive Datalog queries in a variety of emerging application domains such as data integration, information extraction, networking, program analysis, security, and cloud computing. This tutorial ...
Read More
Declarative secure distributed information systems

We present a unified declarative platform for specifying, implementing, and analyzing secure networked information systems. Our work builds upon techniques from logic-based trust management systems and declarative networking. We make the following ...
Read More
Programming iMote Networks Made Easy
SENSORCOMM '10: Proceedings of the 2010 Fourth International Conference on Sensor Technologies and Applications

In this paper, we report on our experiment with the deployment of a virtual machine, Netquest, which evaluates protocols written in a declarative language, over iMote devices. Netquest offers a new programming model for sensor networks with a high level ...
Read More

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

IDEAS '12: Proceedings of the 16th International Database Engineering & Applications Sysmposium

August 2012

261 pages

ISBN:9781450312349

DOI:10.1145/2351476

General Chair:
Bipin C. Desai
Concordia University, Canada
,
Program Chairs:
Jaroslav Pokorny
Charles University Prague, Czech Repubilc
,
Jorge Bernardino
Instituto Politecnico de Coimbra, Portugal

Copyright © 2012 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Charles University: Charles University
BytePress
Concordia University: Concordia University

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 08 August 2012

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Short-paper

Conference

IDEAS '12

Sponsor:

Charles University
Concordia University

IDEAS '12: 16th International Database Engineering & Applications Symposium

August 8 - 10, 2012

Prague, Czech Republic

Acceptance Rates

Overall Acceptance Rate 74 of 210 submissions, 35%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
72
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Other Metrics

View Author Metrics

Citations

Cited By

Martinez LCollet CBobineau CDublé EDesai BPokorny JBernardino J(2012)The QOL approach for optimizing distributed queries without complete knowledgeProceedings of the 16th International Database Engineering & Applications Sysmposium10.1145/2351476.2351487(91-99)Online publication date: 8-Aug-2012
https://dl.acm.org/doi/10.1145/2351476.2351487

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents