Skip to main content

New frontiers in database system research

  • I. Parallel Processing, Databases, Networks, and Distributed Systems
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 653))

Abstract

After many years of development centered around business applications, database systems are now recognized as a key technology in many new application areas being addressed by Computer Science today. We shall mention some of these applications, and the general sorts of advances in technology needed to support these applications. For example, there is a need to deal with databases of progressively larger size, containing data of a wide variety of types, and there is a need to perform operations of nonstandard kinds on this data. There is a need to combine data from widely distributed databases and integrating this data to form a useful whole.

Work supported by NSF grant IRI-90-16358, ARO grant DAAL03-91-0177, and a gift of Mitsubishi Electric Corp.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Abiteboul, S. and P. C. Kanellakis [1989]. “Object identity as a query language primitive,” ACM SIGMOD International Conf. on Management of Data, pp. 159–173.

    Google Scholar 

  • Astrahan, M. M. and D. D. Chamberlin [1975]. “Implementation of a structured English query language,” Comm. ACM 18:10, pp. 580–587.

    Article  MATH  Google Scholar 

  • Astrahan, M. M., et al. [1976]. “System R: a relational approach to data management,” ACM Trans. on Database Systems 1:2, pp. 97–137.

    Article  Google Scholar 

  • Atkinson, M., F. Bancilhon, D. DeWitt, K. Dittrich, D. Maier, and S. Zdonik [1989]. “The object-oriented database system manifesto,” Proc. First Intl. Conf. on Deductive and Object-Oriented Databases, Kyoto, pp. 40–57.

    Google Scholar 

  • Bancilhon, F. [1988]. “Object-oriented database systems,” Proc. Seventh ACM Symposium on Principles of Database Systems, pp. 152–162.

    Google Scholar 

  • Beeri, C. [1992]. “New data models and languages — the challenge,” Proc. Eleventh ACM Symposium on Principles of Database Systems, pp. 1–15.

    Google Scholar 

  • Bernstein, P. A. et al. [1989]. “Future directions in DBMS research,” SIGMOD Record 18:1, pp. 17–30.

    Google Scholar 

  • Bry, F. [1989]. “Query evaluation in recursive databases: bottom-up and top-down reconciled,” Proc. First Intl. Conf. on Deductive and Object-Oriented Databases, Kyoto, pp. 20–39.

    Google Scholar 

  • Carey, M. J., D. J. DeWitt, D. Frank, G. Graefe, J. E. Richardson, E. J. Shekita, and M. Muralikrishna [1986]. “The architecture of the EXODUS extensible DBMS,” Proc. Intl. Workshop on Object-Oriented Database Systems, Asilomar, CA., Sept., 1986.

    Google Scholar 

  • Ceri, S. and J. Widom [1990]. “Deriving production rules for constraint maintainence,” Proc. International Conference on Very Large Data Bases, pp. 566–577.

    Google Scholar 

  • Chen, W., M. Kifer, and D. S. Warren [1989]. “HiLog: a first order semantics for higher order programming constructs,” in Second Intl. Workshop on Database Programming Languages, Morgan-Kaufmann, San Mateo.

    Google Scholar 

  • CODASYL [1971]. CODASYL Data Base Task Group April 71 Report, ACM, New York.

    Google Scholar 

  • Codd, E. F. [1970]. “A relational model for large shared data banks,” Comm. ACM 13:6, pp. 377–387.

    Article  MATH  Google Scholar 

  • Codd, E. F. [1972a]. “Further normalization of the data base relational model,” in Data Base Systems (R. Rustin, ed.) Prentice-Hall, Englewood Cliffs, New Jersey.pp. 33–64.

    Google Scholar 

  • Codd, E. F. [1972b]. “Relational completeness of data base sublanguages,” ibid. pp. 65–98.

    Google Scholar 

  • Date, C. J. [1992]. “Theory is Practical!,” Database Programming and Design 5:9, pp. 21–22.

    Google Scholar 

  • Elmagarmid, A. and C. Pu (eds.) [1990]. ACM Computer Surveys 22:3.

    Google Scholar 

  • Gallaire, H. and J. Minker [1978]. Logic and Databases, Plenum Press, New York.

    Google Scholar 

  • Gelfond, M. and V. Lifschitz [1988]. “The stable model semantics for logic programming,” Proc. Fifth ICLP, MIT Press, Cambridge MA, pp. 1070–1080.

    Google Scholar 

  • Genesereth, M. R., R. E. Fikes et al. [1992]. “Knowledge interchange format version 3.0 reference manual,” Logic-92-1, Stanford University Logic Group, June 1992.

    Google Scholar 

  • Grumbach, S. and V. Vianu [1991]. “Tractable query languages for complex object databases,” INRIA Rapport de Recherche 1573, Dec, 1991.

    Google Scholar 

  • Hartmanis, J. and H. Lin (eds.) [1992]. Computing the Future: A Broader Agenda lor Computer Science and Engineering, National Academy Press, Washington DC.

    Google Scholar 

  • Kemp, D. B., P. J. Stuckey, and D. Srivastava [1991]. “Magic sets and bottom-up evaluation of well-founded models,” Intl. Conf. on Logic Programming, pp. 337–350.

    Google Scholar 

  • Kifer, M. and G. Lausen [1989]. “F-logic: a higher-order logic for reasoning about objects, inheritance, and schemes,” ACM SIGMOD International Conf. on Management of Data, pp. 143–146.

    Google Scholar 

  • Kifer, M. and J. Wu [1989]. “A logic for object-oriented programming,” Proc. Eighth ACM Symposium on Principles of Database Systems, pp. 379–393.

    Google Scholar 

  • Krishnamurthy, R., W. Litwin, and W. Kent [1991]. “Language features for interoperability of databases with schematic dependencies,” ACM SIGMOD International Conf. on Management of Data, pp. 40–49.

    Google Scholar 

  • Lenat, D. B. and R. V. Guha [1990]. Building Large Knowledge-Based Systems, Addison Wesley, Reading, Mass.

    Google Scholar 

  • McCarthy, J. [1980]. “Circumscription — a form of non-monotonic reasoning,” Artificial Intelligence 13:1-2, pp. 27–39.

    Article  MATH  MathSciNet  Google Scholar 

  • Pratt, V. R. [1977]. “The competence/performance dichotomy in programming,” Proc. Fourth ACM Symposium on Principles of Programming Languages, pp. 194–200.

    Google Scholar 

  • Ross, K. A. [1991]. “On negation in HiLog,” Proc. Tenth ACM Symposium on Principles of Database Systems, pp. 206–215.

    Google Scholar 

  • Rusinkiewicz, A., A. Sheth, and G. Karabitis [1991]. “Specifying interdatabase dependencies in a multidatabase environment,” IEEE Computer, Dec., 1991.

    Google Scholar 

  • Sagiv, Y. and O. Shmueli [1986]. “The equivalence of solving queries and producing tree projections,” Proc. Fifth ACM Symposium on Principles of Database Systems, pp. 160–172.

    Google Scholar 

  • Sellis, T. [1989]. (ed.) SIGMOD Record 18:3, pp. 3–77.

    Google Scholar 

  • Shoham, Y. [1992]. “Agent oriented programming, an overview and summary of recent research,” Proc. Workshop on Distributed AI.

    Google Scholar 

  • Silberschatz, A., M. Stonebraker, and J. D. Ullman (eds.) [1990]. “Database systems: achievements and opportunities,” Comm. ACM 34:10, pp. 110–120.

    Google Scholar 

  • Stonebraker, M. et al. [1990]. “Third-generation database system manifesto,” SIG-MOD Record 19:3, pp. 31–44.

    Article  Google Scholar 

  • Stonebraker, M., E. Wong, P. Kreps, and G. Held [1976]. “The design and implementation of INGRES,” ACM Trans. on Database Systems 1:3, pp. 189–222.

    Article  Google Scholar 

  • Tsur, S. [1990]. “Applications of deductive database systems,” IEEE COMPCON, Feb., 1990.

    Google Scholar 

  • Ullman, J. D. [1988]. Principles of Database and Knowledge-Base Systems Vol. I: Classical Database Systems, Computer Science Press, New York.

    Google Scholar 

  • Ullman, J. D. [1989]. Principles of Database and Knowledge-Base Systems Vol. II: The New Technologies, Computer Science Press, New York.

    Google Scholar 

  • Ullman, J. D. [1991]. “A comparison between deductive and object-oriented database systems,” Proc. Second Intl. Conf. on Deductive and Object-Oriented Databases, Munich, pp. 263–277.

    Google Scholar 

  • Van Gelder, A., K. A. Ross, and J. S. Schlipf [1991]. “The well-founded semantics for general logic programs,” J. ACM 38:3, pp. 620–650.

    Article  MATH  Google Scholar 

  • Wiederhold, G. [1991]. “Mediators in the architecture of future information systems,” IEEE Computer, March, 1991.

    Google Scholar 

  • Wiederhold, G. et al. [1986]. “Modularization of an ADA database system,” Advanced Database Symposium, Information Processing Society of Japan, Tokyo, August 1986, pp. 135–142.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

A. Bensoussan J. -P. Verjus

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ullman, J.D. (1992). New frontiers in database system research. In: Bensoussan, A., Verjus, J.P. (eds) Future Tendencies in Computer Science, Control and Applied Mathematics. INRIA 1992. Lecture Notes in Computer Science, vol 653. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56320-2_54

Download citation

  • DOI: https://doi.org/10.1007/3-540-56320-2_54

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56320-4

  • Online ISBN: 978-3-540-47520-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics