Team NETQUEST

Members
Overall Objectives
Scientific Foundations
Application Domains
Software
New Results
Contracts and Grants with Industry
Other Grants and Activities
Dissemination
Bibliography

Bibliography

Major publications by the team in recent years

[1]
M. Koubarakis, T. K. Sellis, A. U. Frank, S. Grumbach, R. H. Güting, C. S. Jensen, N. A. Lorentzos, Y. Manolopoulos, E. Nardelli, B. Pernici, H.-J. Schek, M. Scholl, B. Theodoulidis, N. Tryfona (editors)
Spatio-Temporal Databases: The CHOROCHRONOS Approach, Lecture Notes in Computer Science, Springer, 2003, vol. 2520.
[2]
S. Grumbach, Z. Lacroix, P. Rigaux, L. Segoufin.
Optimization Techniques, Springer, 2000, p. 319-334.
[3]
S. Grumbach, T. Milo.
Towards Tractable Algebras for Bags., in: J. Comput. Syst. Sci., 1996, vol. 52, no 3, p. 570-588.
[4]
S. Grumbach, M. Rafanelli, L. Tininini.
On the equivalence and rewriting of aggregate queries., in: Acta Inf., 2004, vol. 40, no 8, p. 529-584
http://dx.doi.org/10.1007/s00236-004-0101-y.
[5]
S. Grumbach, P. Rigaux, L. Segoufin.
Handling Interpolated Data., in: Comput. J., 2003, vol. 46, no 6, p. 664-679
http://comjnl.oxfordjournals.org/content/vol46/issue6/index.dtl.
[6]
S. Grumbach, P. Rigaux, L. Segoufin.
The DEDALE System for Complex Spatial Queries., in: Proceedings ACM SIGMOD International Conference on Management of Data, June 2-4, 1998, Seattle, Washington, USA, 1998, p. 213-224
http://portal.acm.org/citation.cfm?doid=276304.276324.
[7]
S. Grumbach, J. Su.
Finitely Representable Databases., in: J. Comput. Syst. Sci., 1997, vol. 55, no 2, p. 273-298.
[8]
S. Grumbach, L. Tininini.
On the content of materialized aggregate views., in: J. Comput. Syst. Sci., 2003, vol. 66, no 1, p. 133-168
http://dx.doi.org/10.1016/S0022-0000(02)00033-8.

Publications of the year

International Peer-Reviewed Conference/Proceedings

[9]
S. Grumbach, F. Wang.
Netlog, a Rule-based Language for Distributed Programming, in: PADL'10, Twelfth International Symposium on Practical Aspects of Declarative Languages, Madrid, Spain, january, 2010.
[10]
S. Grumbach, F. Wang, Z. Wu.
On the distributed evaluation of recursive queries on graphs, in: NOTERE 2009, the 9th annual international conference on New Technologies of Distributed Systems, Montreal, Canada, july, 2009.
[11]
S. Grumbach, Z. Wu.
Logical locality entails frugal distributed computation over graphs, in: WG 2009, the 35th International Workshop on Graph-Theoretic Concepts in Computer Science, Montpellier, june, 2009.
[12]
W. Qu.
Declarative Composition Routing Protocols Adaptation in MANET Using Rough Set Theory, in: WiCOM 2009, the 5th International Conference on Wireless Communications, Networking and Mobile Computing, Beijing, China, September, 2009.
[13]
Z. Wu, S. Grumbach.
Feasibility of Motion Planning on Directed Graphs, in: Theory and Applications of Models of Computation, 6th Annual Conference, TAMC 2009, Changsha, China, May 18-22, 2009, p. 430-439.

Workshops without Proceedings

[14]
M. Bauderon, C. Bobineau, S. Grumbach, A. Henry, X. Qi, W. Qu, K. Suo, F. Wang, Z. Wu.
Netquest: An Abstract Model for Pervasive Applications, in: Pervasive 2009, the 7th International Conference on Pervasive Computing, Nara, Japan, may, 2009.

Other Publications

[15]
S. Grumbach, Z. Wu.
On Distributed Model Checking of MSO on Graphs, 2009, CoRR abs/0904.1902.
[16]
Z. Wu, S. Grumbach.
Feasibility of motion planning on acyclic and strongly connected directed graphs, 2009, CoRR abs/0904.1920.

References in notes

[17]
S. Abiteboul, Z. Abrams, S. Haar, T. Milo.
Diagnosis of asynchronous discrete event systems: datalog to the rescue!, in: Proceedings of the Twenty-fourth ACM SIGACT-SIGMOD- SIGART Symposium on Principles of Database Systems, Baltimore, Maryland, USA, 2005.
[18]
S. Abiteboul, R. Hull, V. Vianu.
Foundations of Databases., Addison-Wesley, 1995.
[19]
M. M. Astrahan, M. W. Blasgen, D. D. Chamberlin, K. P. Eswaran, J. Gray, P. P. Griffiths, W. F. King III, R. A. Lorie, P. R. McJones, J. W. Mehl, G. R. Putzolu, I. L. Traiger, B. W. Wade, V. Watson.
System R: Relational Approach to Database Management, in: ACM Trans. Database Syst., 1976, vol. 1, no 2, p. 97-137.
[20]
H. Attiya, J. Welch.
Distributed Computing: Fundamentals, Simulations and Advanced Topics, Wiley-Interscience, 2004.
[21]
F. Bancilhon.
Naive evaluation of recursively defined relations, Springer-Verlag New York, Inc., New York, NY, USA, 1986.
[22]
F. Bancilhon, D. Maier, Y. Sagiv, J. D. Ullman.
Magic sets and other strange ways to implement logic programs (extended abstract), in: PODS '86: Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems, New York, NY, USA, ACM, 1986, p. 1–15
http://doi.acm.org/10.1145/6012.15399.
[23]
M. Caesar, M. Castro, E. B. Nightingale, G. O'Shea, A. Rowstron.
Virtual ring routing: network routing inspired by DHTs, in: SIGCOMM Comput. Commun. Rev., 2006, vol. 36, no 4, p. 351–362.
[24]
A. Cerpa, D. Estrin.
ASCENT: Adaptive Self-Configuring sEnsor Network Topologies, in: SIGCOMM Comput. Commun. Rev., 2002, vol. 32, no 1, p. 62–62.
[25]
E. F. Codd.
A Relational Model of Data for Large Shared Data Banks, in: Commun. ACM, 1970, vol. 13, no 6, p. 377-387
http://doi.acm.org/10.1145/362384.362685.
[26]
B. Courcelle.
Graph Rewriting: An Algebraic and Logic Approach, in: Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), Elsevier and MIT Press, 1990, p. 193-242.
[27]
H. Ebbinghaus, J. Flum.
Finite model theory, Springer-Verlag, Berlin, 1999.
[28]
H. Gaifman.
On local and non-local properties, in: Proceedings of the Herbrand Symposium, Logic Colloquium'81, North Holland, 1982.
[29]
N. Immerman.
Expressibility and Parallel Complexity, in: SIAM J. Comput., 1989, vol. 18, no 3, p. 625-638.
[30]
P. Jacquet, P. Muhlethaler, T. Clausen, A. Laouiti, A. Qayyum, L. Viennot.
Optimized link state routing protocol for ad hoc networks, in: Multi Topic Conference, 2001. IEEE INMIC 2001. Technology for the 21st Century. Proceedings. IEEE International, 2001, p. 62–68.
[31]
F. Kuhn, R. Wattenhofer.
Constant-time distributed dominating set approximation, in: Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing, PODC, 2003.
[32]
N. Linial.
Locality in Distributed Graph Algorithms., in: SIAM J. Comput., 1992, vol. 21, no 1, p. 193-201.
[33]
B. T. Loo, T. Condie, M. N. Garofalakis, D. E. Gay, J. M. Hellerstein, P. Maniatis, R. Ramakrishnan, T. Roscoe, I. Stoica.
Declarative networking: language, execution and optimization., in: Proceedings of the ACM SIGMOD International Conference on Management of Data, Chicago, Illinois, USA, June 27-29, 2006.
[34]
B. T. Loo, T. Condie, J. M. Hellerstein, P. Maniatis, T. Roscoe, I. Stoica.
Implementing declarative overlays, in: SIGOPS Oper. Syst. Rev., 2005, vol. 39, no 5, p. 75–90
http://doi.acm.org/10.1145/1095809.1095818.
[35]
B. T. Loo, J. M. Hellerstein, I. Stoica, R. Ramakrishnan.
Declarative routing: extensible routing with declarative queries, in: SIGCOMM '05: Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications, New York, NY, USA, ACM, 2005, p. 289–300
http://doi.acm.org/10.1145/1080091.1080126.
[36]
J.-L. Lu, F. Valois, D. Barthel, M. Dohler.
FISCO: A Fully Integrated Scheme of Self-Configuration and Self-Organization for WSN., in: IEEE/WCNC, 2007.
[37]
C. H. Papadimitriou, P. Raghavan, M. Sudan, H. Tamaki.
Motion planning on a graph, in: FOCS'94, 1994, p. 511-520.
[38]
C. E. Perkins, P. Bhagwat.
Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers, in: ACM SIGCOMM'94 Conference on Communications Architectures, Protocols and Applications, 1994, p. 234–244.
[39]
C. E. Perkins.
Ad-hoc on-demand distance vector routing, in: In Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, 1999, p. 90–100.
[40]
R. Ramakrishnan, J. D. Ullman.
A survey of research on deductive database systems, in: Journal of Logic Programming, 1993, vol. 23, p. 125–149.
[41]
D. Seese.
Linear time computable problems and logical descriptions, in: Electr. Notes Theor. Comput. Sci., 1995, vol. 2.
[42]
M. Y. Vardi.
The complexity of relational query languages (Extended Abstract), in: STOC '82: Proceedings of the fourteenth annual ACM symposium on Theory of computing, New York, NY, USA, ACM, 1982, p. 137–146
http://doi.acm.org/10.1145/800070.802186.
[43]
L. Vieille.
Recursive Axioms in Deductive Databases: The Query/Subquery Approach, in: Expert Database Conf., 1986, p. 253-267.

previous
next