Databases in Telecommunications II

An embedded control program can be viewed as a small main-memory database system tailored to suit the needs of a particular application. For performance reasons, the program will usually define concrete low level data structures to encode the database, which in turn must be understood by anyone who needs to develop or modify the program. This is in contrast with the data independence that can be achieved by using a database system. However, because of space and performance requirements, the use of current database technology is not likely to be feasible in this setting. To explore one obstacle to this, we have developed a query optimizer that compiles queries on a conceptual schema to native Java or C code that navigates low level data structures. Of crucial significance is that an arbitrary collection of such structures, perhaps already devised for an earlier version of the control program, can be given as a part of the input to the optimizer. We present an overview of the underlying algorithms that are used to accomplish this. The algorithms are based on a novel resource bounded plan generation mechanism in which integrity constraints abstracting the definition of stored views are applied to source queries to extend the search space of possible query plans. We also report on some preliminary experimental results that suggest generated code navigates concrete data structures with an efficiency comparable to code written directly by expert programmers.

[1]  Anja Feldmann,et al.  Measurement and analysis of IP network usage and behavior , 2000 .

[2]  Vitaliy L. Khizder,et al.  Reasoning about Duplicate Elimination with Description Logic , 2000, Computational Logic.

[3]  Theodore Johnson,et al.  The MD-join: an operator for complex OLAP , 2001, Proceedings 17th International Conference on Data Engineering.

[4]  Carlo Zaniolo,et al.  User defined aggregates in object-relational systems , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).

[5]  Konstantinos Sagonas,et al.  XSB as an efficient deductive database engine , 1994, SIGMOD '94.

[6]  Laura M. Haas,et al.  Capabilities-based query rewriting in mediator systems , 1996 .

[7]  Surajit Chaudhuri,et al.  On the Efficient Gathering of Sufficient Statistics for Classification from Large SQL Databases , 1998, KDD.

[8]  Ramez Elmasri,et al.  Fundamentals of Database Systems , 1989 .

[9]  Joann J. Ordille,et al.  Querying Heterogeneous Information Sources Using Source Descriptions , 1996, VLDB.

[10]  Alin Deutsch,et al.  A chase too far? , 2000, SIGMOD '00.

[11]  Kenneth A. Ross,et al.  Querying Multiple Features of Groups in Relational Databases , 1996, VLDB.

[12]  Divesh Srivastava,et al.  CORAL - Control, Relations and Logic , 1992, VLDB.

[13]  Damianos Chatziantoniou,et al.  Ad hoc OLAP: expression and evaluation , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).

[14]  Jeffrey D. Ullman,et al.  Information integration using logical views , 1997, Theor. Comput. Sci..

[15]  Damianos Chatziantoniou Evaluation of ad hoc OLAP: in-place computation , 1999, Proceedings. Eleventh International Conference on Scientific and Statistical Database Management.

[16]  Anand Rajaraman,et al.  Answering queries using templates with binding patterns (extended abstract) , 1995, PODS.