 		<<<<<<  THIS IS THE MASTER COPY    >>>>>>

Homebase  is [db.stanford.edu]u/kbms/biblio/biblio.txt

Master copy, containing all entries

For format see below or biblio.info


BIBLIOINSTRUCTIONS  
------------------
FORMAT SPECIFICATION OVERVIEW:

+------------------------------------------------------------------------------
| \type  f Author, ordered by lastname of first author, then chronologically
| @ organization, site, dept affiliation (address)
| " title of paper or book "
| / publication information: journal abbreviation from biblio.info, date, pages
| = short abstract or description of content --- signature
| > DBCategory><location
+------------------------------------------------------------------------------

FORMAT SPECIFICATION DETAIL:
----------------------------
AUTHOR INFORMATION 
 type:	\pp = paper in journal, \pr = paper in proceedings, \pb = paper in book
	\bk = book,    \rp = report,    \mn = manual with corporate author,
	\wp = working paper.
   old entries:\.. 0*! used in Database Design, f,d+! use in new edition
   -------------------------
! Authors: Lastname,First M. for single author; 
!	   Lastname,F.M. and Second,L.M. for two;
!	   Lastname,F.M., Second,L.M., ..., and Final,L.M. for more.
   -----------------------------

 ----------------------------------
AFFILIATION of first author
@    general
@	Main units, Divisions, Departments, separated by commas.
@	(City ST, Country) = City, State;  field is omitted in repetitions.
@	Multiple entries seperated by semicolons
@    general abbreviations
@	   CIS = Computer and Information Science
@	   Corp = Corporation, Co = Company
@	   CSD = Computer Science Dep.
@	   Ctr = Center or Centre,
@	   DCS = Dep.Computer Science
@	   Dep. = Department (no `of'), 
@	   Div  = Division
@	   EECS = Dep.EE and CS 
@      	   EE = Electrical Engineering Dep.
@ 	   Inst. = Institute
@	   Lab. = Laboratory
@	   Math = Mathematics Dep.
@	   Res. = Research
@	   TU = Technical Un.
@	   Un. = University (no `of', no space betweeen Un. and the name).
@ When a state Un. has subparts (e.g. Un.Texas at Austin), indicate it by
@ Un.Texas, Austin. If you simply want to indicate the address, do so
@ between brackets.

@  Author location
@		(the same abbreviations are used for sources of Tech.Reports)
@    specific abbreviations, no dots.
@	ADL = Arthur D. Little, Inc. (Cambridge MA)
@	AIDS = Artifical Intelligence adn Decision Systems (Mountain View CA)
@	ATT = American Telephone and Telegraph (needs City ST)
@	BBN = Bolt Beranek Newman Inc. (Cambridge MA)
@	Burroughs = Burroughs Corp. (city)
@	Caltech = California Inst of Technology (Pasadena CA)
@	CCA = Computer Corp of America (Cambridge MA)
@	CDC = Control Data Corp (needs City ST, Country)
@	CMU = Carnegie-Mellon Un. (Pittsburg PA)
@	CNRS = Ctr National de la Recherche Scientifique (Paris, France)
@	CSRG = Computer Systems Research Group, Un.(Toronto, Canada)
@	CUNY = City Un., of (New York NY)
@	ECRC = European Computer-Industry Research Center (Munich, FRG)
@	GMD = Gesellschaft fur Mathematik und Datenverarbeitung (City, FRG)
@	IASI =  Istituto di Analisi dei Sistemi e Informatica del CNR
@	 (Rome Italy).
@	IBM = International Business Machines, needs div. (City ST, Country)
@	IfAIuBV = Inst.fur Angewandte Informatik u.Beschreibungsverfahren
@ 	 (Karlsruhe, FRG).
@	INRIA = Institut National de Recherche en Informatique et Automatique
@	LBL = Lawrence Berkeley Lab, UCB (Berkeley CA)
@	LCS = Lab.for Computer Science, MIT (Cambridge MA)
@	LLL = Lawrence Livermore Lab, UC (Livermore CA)
@	MCC = Microelectronics and Computer Technology Corp (Austin TX) 
@	MIT = Massachussets Inst. of Technology (Cambridge MA)
@	NPGS = Naval Postgraduate School (Monterey CA)
@	NIH = National Inst.s of Health (Bethesda MD)
@	NYU = New York Un. (New York NY)
@	PGE = Pacific Gas and Electric (San Francisco CA)
@	Polit.Milano = Politecnico di Milano (Milano, Italy)
@	Rand = The Rand Corp (Santa Monica CA)
@	TJWRC = T.J.Watson Research Ctr, IBM (Yorktown Heights NY)
@	SDC= System Development Corp (Santa Monica CA)
@	SRI = SRI International (Menlo Park CA)
@	SUNY = State Un.of New York (needs City)
@	SYSLAB = Un.Stockholm, Systems Development Lab.
@	UCB = Un.California (Berkeley CA)
@	UCD = Un.California (Davis CA)
@	UCI = Un.California (Irvine CA)
@	UCLA = Un.California (Los Angeles CA)
@	UCSB = Un.California (Santa Barbara CA)
@	UCSD = Un.California (San Diego CA)
@	U.Penn = Un.Pennsylvania
@	USC = Un.Southern California (Los Angeles, other sites)
@	UkSSR Acad.Sci. = Ukranian Academy of Science (Kiev, USSR)
@	USSR Acad.Sci. = USSR Academy of Science (Moscow, Leningrad, ...)
@	VU = Vrije Un. (Amsterdam, Holland)
@	Wang = Wang Inst. of Graduate Studies (1970?-1988)

Retrieved in biblio by search on BIBLIOINSTRUCTIONS
  ------------------------
PUBLISHING REFERENCES:
/	   For \pp or \pr, an abbreviation may be available.
/	   For \pb `Title' Editor(ed) or (eds)	for editor or editors.
/	   More reference data can often be found with the editor.
/	     
/	   Abbreviate months: Jan., Feb., Mar., Apr., May., Jun., Jul., Aug., 
/						      Sep., Oct., Nov., Dec. 
/	   Abbreviate seasons: Win., Spr., Sum., Fal.
/	   Volume xx, number nn of a journal or proceedings: Vol.xx No.nn 
/	   Pagenumbers: pp.bbb--fff for paper, pagecount sss: ssspp. for book.
/
/	   Publisher City is omitted for well known publishers.
/
/	   For reports: organization, dep, report no., date (location)
/
/ PhD Th. = PhD dissertation
/ ... TR = Technical Report (TR-xxxx)
/ ... Res.R. = Research Report (Res.R. No.xxx or Res.R. yyxxx)
/
/	   Standard terms for frequently used publications: 
/ A-W = Addison-Wesley (Reading MA).
/ AAAI x = Proc.xth Natl. Conf. of the American Association for Artifical Int.
/ Academic = Academic Press (New York NY)
/ ACL = American Journal of Computational Linguistics.
/ ACM C.Surveys = ACM Computing Surveys
/ ACM CR yymm-xxxx = ACM Computing Reviews, follows main entry after ;
/ ACM CA NNP = ACM Workshop on Computer Architecture for Non-Numeric Processing
/ ACM COIS =  ACM Conf.on Office Information Systems.(>1988?)
/ ACM DAC n = Proc.Design Automation Conf.No.n
/ ACM NC yy=  Proc.19yy Annual ACM National Conf.
/ ACM OOPSLA yy = 19yy Proc. Conf. on Object-Oriented Programming
   Systems, Languages, and Applications.
/ ACM OSR = ACM SIGOPS quarterly Operating Systems Review.
/ ACM PODC = ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing
/ ACM PODS = ACM SIGACT-SIGMOD Symp. on Principles of Database Systems (>1982)
/ ACM POPL = Conf.Record Annual ACM Symp. Principles of Programming Languages
/ ACM SIGARCH = ACM SIG Architecture (> 1972)
/ ACM SIGART ISMIS = International Symp.on Methodologies for Intelligent 
   Systems; Un.Tennessee.
/ ACM SIGMOD yy = 19yy ACM SIGMOD Conf. on the Management of Data.
/ ACM SOSP xx = Annual ACM Symposium on Operating Systems Principles
/ ACM STOC xx = Annual ACM SIGACT Symposium on Theory of Computing (>1968)
/ ACM TCS = ACM Transactions on Computer Systems
/ ACM TODS = ACM Transactions on Database Systems (>1976)
/ ACM TOIS = ACM Transactions on Office Automation Systems
/ ACM TOPLAS = ACM Transactions on Programming Languages and Systems
/ Acta Inf. = Acta Informatica, Springer Verlag (>1963)
/ AIM = Artificial Intelligence in Medicine.
/ ARAP = The Annual Review in Automatic Programming, Pergamon Press.
/ ARIST = Annual Review of Information Science and Technology, ASIS.
/ ASCA n = Proc.nth Annual Symposium on Computer Architecture.
/ B-C = Benjamin/Cummings Publishers.
/ BCS-WS = British Computer Society Workshop series, Cambridge Un.Press.
/ BNCOD y = Proceedings of the yth British National Conference on Databases.
/ Berkeley Workshop i = Proc.of the ith Berkeley Workshop/conference on
/      Distributed Data Management and Computer Networks, LBL
/ BIT = Tidskrift for Informations Behandeling, Denmark.
/ BSTJ = Bell System Technical Journal.
/ CACM = Communications of the ACM (>1958).
/ CBR = Computers and Biomedical Research, Academic.
/ CIKM-yy, Int. Conf. on INFORMATION AND KNOWLEDGE MANAGEMENT (>1992)
/ CIPS	= Canadian Information Processing Society.
/ CIS = Conference on Information Systems, sponsored by SMIS, TIMS, ACM SIGBDP.
/ CLP = International Conference on Logic Programming, BCS (<1984).
/ CMCS = Ctr for Math.and Computer Science, Kruislaan Amsterdam, was MC.
/ CNR = Consiglio Nazionale delle Ricerche. (Rome, Italy).
/ COINS n = Proc.of the n Symp. on Computer and Information Sciences, Tou(Ed).
/ Computing = publisher is Springer-Verlag.
/ Computer J.= The (British) Computer Journal
/ CSEM = Computer Science in Economics and Management
/ CSM = Control Systems and Machines; translation of Upravlyayushchiye 
  sistemy i mashiny (Kiev, UkSSR) (>1986)
/ CSP = Computer Science Press.
/ DASFAA n = Proc. of the n Intern. Symp.on Database Systems for Advanced
  Applications (>1989).
/ DBPD = Database Programming and Design.
/ DBRC = Database Systems Res. and Dvlpt. Ctr, Un.Florida (Gainesville FL)
/ DKE = Data and Knowledge Engineering, N-H (>1985).
/ DOOD89 = First Int. Conf. on Deductive and Object-Oriented Databases 
/ DPDS = Int. Symp. on Databases in Parallel and Distributed Systems, IEEE.
/ DSS = Decision Support Systems, N-H (>1985)
/ EDS n = nth Conference on Expert Database Systems (>1986) Kerschberg (ed)
/ EDSW = Workshop on Expert Database Systems, Un.South Carolina, 1984.
/ ER Conf.x = Proc.of the x Entity-Relationship conference, North-Holland. 
/ 5GCS = Fifth Generations Computer Systems, ICOT, pub. North-Holland.
/ FGCS = Future Generations Computer Systems, pub. North-Holland.
/ FODO n = / Int.Conf.on Foundations of Data Org. and Algorithms.
/ Hawaii x = Proc.xth Hawaii Int. Conf. on System Sciences.
/ HPTS = High Performance Transaction Systems workshop, IEEE,ACM. 
/ IBM JRD = IBM Journal of Research and Development.
/ IBM Sys.J. = IBM Systems Journal.
/ ICDCS x = Proc.xth Intern.Conference on Distributed Computing Systems (IEEE).
/ ICDT yy = Internat.Conference on Database Theory (yy=>86).
/ ICMOD = Intl. Conf. on Management of Data, Milano, Sep.1978, Sibley(ed).
/ ICOD x = Proc.xth Intern.Conference on Databases, British Computer Society.
/ ICOT = Inst. for New Generation Computer Technology, MITI, Japan.
/ ICS = Intern. Conf. on Supercomputing.
/ IEEE CAIA = IEEE Conference on Artificial Intelligence Applications (>1985)
/ IEEE Computer = Computer Magazine of the IEEE Computer Society.
/ IEEE Computer = (<1970:) Computer Group News of the IEEE Computer Group.
/ IEEE CSE = IEEE Conference on Software Engineering.
/ IEEE CS Press = IEEE Computer Society Press (Washington DC, Los Alomitos CA) 
/ IEEE DandT = IEEE Design and Test Magazine, (> 1985).
/ IEEE DB Eng.Bull. = IEEE CS Technical Com. on Database Engineering Bulletin.
/ IEEE DE x = Proc.IEEE CS Intl.Conf. No.x on Data Engineering (=1984,1986,...)
/ IEEE DistCS = Proc.IEEE Conf.on Distributed Computing Systems (1980, ...)
/ IEEE FOCS = Proc.IEEE Symposium On Foundations of Computer Science.
/ IEEE RIDE-IMS yy = Proc.IEEE Workshop on Research Issues on DE: 
  	   Interoperability in Multidatabase Systems
/ IEEE TC = IEEE Transactions on Computers.
/ IEEE TKDE = IEEE Transactions on Knowledge and Data Engineering (>1989).
/ IEEE TSE = IEEE Transactions on Software Engineering (SE).
/ IEEE SLP yy = IEEE Symp.on Logic Programming.
/ IFIP DS-x = IFIP SEMANTICS OF INTEROPERABLE DATABASE SYSTEMS 
/ IJCAI = Proc.International Joint Conferences on Artificial Intelligence,
	   Morgan Kaufman pubs. (Los Altos CA).
/ IJofCIS = International Journal of Computer and Information Sciences
/ IJofCSS = International Journal of Computer and System Sciences. [1971]
/ ILPC n = Proc.of n International Logic Programming Conference (>1982). 
/ IMS-yy International Workshop on Interoperability in Multidatabase Systems.
/ INFOCOM yy = Proc.of nth Joint Conf. of the IEEE Comp. and Comm. Soc.
/ Information Processing yyyy = Proceedings of the tri-annual IFIP Conf.
/ Inf.Stor.and Retrieval = Information Storage and Retrieval, (>1964?)
/ Inf.Manag = Information and Management, N-H (>1975).
/ Inf.Sys. = Information Systems, Pergamon Press (>1975)
/ Inf.Sys.Manag. = Information Systems Management (>1984)
/ INRIA = Institut National de la Recherche en Informatique et Automatique.
/ INRIA Bull. = Bull.de Liason de la Recherche en Informatique et Automatique.
/ IRIA = Institut de la Recherche en Informatique et Automatique, now INRIA.
/ IPL = Information Processing Letters, North-Holland. (>1972)
/ ISDDB = Proc.Int. Symposium on Distributed Data Bases.
/ ISDDSS = Proc.Int. Seminar on Distributed Data Sharing Systems.
/ ISDM = Information Systems Design Methodologies, IFIP, N-H (>1982)
/ IWNAD = Proc. Internat.Workshop on New Applications of Databases, Cambridge.
/ JACL = Journal of the Association of Computational Linguistics.
/ JACM = Journal of the ACM.
/ JAMA = Journal of the American Med. Ass.
/ JCSS = Journal of Computer and System Sciences, Academic. (>1965)
/ JCST = Journal of Computer Science and Technology.
/ Jerusalem Conf.x = xth Intl.Conf.on Data and Knowledge Bases, Jerusalem.
/ J.IPSJ = Journal of the Information Processing Society of Japan.
/ JMS = Journal of Medical Systems, Plenum Pub.
/ JPAM = Journal of Pascal, Ada, and Modula-2, Wiley (>1987).
/ JVLDB = Journal of Very Large Data Bases, Kluwer Academic Publishers (>1990).
/ MC = Mathematisch Centrum (Amsterdam), now CMCS
/ MD Computing = M.D. Computing, Springer Verlag.
/ MFCS = Mathematical Foundations of Computer Science, Poland, Springer Verlag.
/ MFDBS = Symposium on Mathematical Fundamentals of Database Systems (>1988).
/ McG-H = MacGraw-Hill (New York NY)
/ MI = Machine Intelligence, eds: Meltzer o.o., and Michie, vars. Publishers.
/ MIE n = nth Int. Congress on Medical Informatics, since 1980?
/ MS = Management Science, Journal of TIMS (>1954).
/ NBS = National Bureau of Standards, US Dep.Commerce (Washington DC). 
/ NBS CH-FSTI = National Bureau of Standards, Clearing House for Federal 
	Scientific and Technical Information.
/ NEJM = New England Journal of Medicine.
/ NCAI yy = Proc. Annual National Conferences on Artificial Intelligence.
/ NTIS = Nat.Technical Information Service, US Dep.Commerce (Springfield VA).
/ RDIR = Research and Development in Information Retrieval, in BCS-WS.
/ PCS = Programming and Computer Software; translation of Programmirovaniye,
	(Moscow, USSR) Plenum (>1975)
/ P-H = Prentice-Hall publishers.
/ NCC 19yy = Proc. of the 19yy National Computer Conference,
    earlier also Spring Joint (SJCC), Fall Joint(FJCC), Western(WCC) and 
    Eastern(ECC), published through AFIPS Press, now (Arlington VA).
/ rcvd. date = date received. (for undated working papers)
/ ScandRSIMD = Proc.Scandinavian Research Sem.on Inf.Modelling and DBMS (1981)
/ SCAMC x = Proc.of the xth Annual Symp. on Computer Applications in 
    Medical Care (Washington DC), IEEE (>1977).
/ SEMI = IMIA Working conference on Software Eng. and Medical Informatics.
/ SIAM J.Comp. = SIAM Journal of Computing, Soc.for Industr.and Applied Math.
/ SPE = Software Practice and Experience.
/ SPOT = ?, conferences in Sweden, since 1980.
/ Springer = Springer Verlag (Heidelberg, FRG and NewYork NY, USA).
/ Springer LNCS = Springer Verlag Lecture Notes on Computer Science.
/ Springer LNMI = Springer Verlag Lecture Notes on Medical Informatics.
/ SRDSDS = Symp. on Reliability in Distributed Software and Database Systems, 
    IEEE CS.
/ VanN-R = Van Norstrand Reinhold (New York NY)
/ VLDB x, Eeeee(ed) = Proceedings of the Conferences on Very Large Databases,
	   (>1975)  Morgan Kaufman pubs. (Los Altos CA)
/ VLDB J = The VLDB Journal, The Boxwood Press.
/ Wiley = John Wiley & Sons Publishers, (New York NY).
/ WOOBTG = Workshop on OODB Standardization
/ WSDM = Workshops in Statistical Database Management, LBL (Berkeley CA)(>1981)

   ______________________________________________________________________


Retrieved in biblio by search on BIBLIOINSTRUCTIONS
  ------------------------
= indicates a comment, either based on an abstract, on selected terms from
  the paper, a on review (published or directly submitted). 
  Reviews may be signed as: fdfdd. ---name.(Note the blankspace after the dot)

> References with Chap.section.subsection refer to 2nd edition of DBDdesign.
  Reference to chapters-section-subsection refer to F or D volume. 
  DBFpreface=0		  DBDpreface=0
  DBFintro=1		  DBDintro=1,9.0,1	 DBappl=1.8
  DBFtrans=2.7		  DBDsupport=2		 DBDdist=16 distributed
  DBFhard=3		  DBDmodel=7		 DBFdist
  DBFseq=4.0,.1,.2	  DBDtheory=7.2		 DBDlang=18 languages, 
  DBFindex=5.3,.4	  DBDops=7.4		 DBDstat=19 statistics,
  DBFhash=6.5,.6	  DBDdesign.7=7.5	 DBDtheory-fd,-mvd=7.2.2,.4
  DBFhybrid=7.0,.6,.7	  DBDschema=8		 DBDtheory-trans=7.2.5
  DBFimpl=8.2,.3,.9	  DBDdesign-7=9.7	 DBDdesign=20 methodology
  DBFtrees=9.1,.4,.5,.8	  DBDrel=9.2,.3		 DBDeval=10
  DBFsyseval=10		  DBDbound=9.4,.5,.6	 DBDparallel
  DBFarchitecture=14	  DBDimpl=Ada paper	 EIS=22 CAD CAM or VLSI design
  DBFrealtime					 MAT= Materials databases
  DBFrealtime=14	  DBDperf=9.3.3		 
  DBFmethods=12		  DBDobject		 Image=23 geographic, image
  DBFrepresent=13	  DBDnewDBMS=9.7	 DBDnat=10.4.4		
  DBFrepresent-2=13.1,.2  DBDquery=10		 DBDbiblio=10.1.1part
  DBFrepresent-3=11.2	  DBDprivacy=12		 DBDoffice=25
  DBFrepresent-4=13.3	  DBDprivacy-10=Stat.security
  DBFrepresent-5=12.7	  DBDtrans=11.3,.4	 DBDlogic
  DBFreliab=11.1	  DBDconc=13		 DBDarch
  DBFprotect		  DBDintegrity=13.x	 DBDactive
  DBFstorage-1=6.5	  DBDadmin=15		 DBFmach=24 database machines
  DBFstorage-2=2.3.5,.6	  DBDkb=17		 KBMS
  DBFstorage-3=2.4				 KSYS
  DBFstorage-4=5.4
  DBFuse-2,-3=5.2,.5	  DEng Data Engineering	 MCSNU nursing
  DBFuse-4=11.1		  UNCERTAIN uncertainty	 MCS=21 medical
  DBFmaint(16)=15	  Statistics		 MIS=medical information system
  DBFadvindex=8					 GENE
  DBFsecurity					 MEGA
						 VOD=views,objects,databases


< FILING INFORMATION
  <DBFile and <box xxxx are in MJH438
  <x bookshelf or thesis shelf or home
  <Lib.of Congress no. in Math/CS library, often QA76....


   Edited for Database Design, 
   Updated for File Organization and Database Design, Implementation.
   Copyright 1980, 1985, 1988. Gio Wiederhold.

BIBLIOGRAPHY,  Copyright 1980, 1985, 1990  Gio Wiederhold.
For explanation of format, see BIBLIO.INFO


%  ------- A ------biblio------recent-----------

\pr ! Aalbersberg,I. and Sijstermans,F.  
" High-Quality and High-Performance Full-Text Document Retrieval: the
  Parallel InfoGuide System " 
/ PDIS-91, Miami Beach, FL, Dec.1991. Garcia-Molina and Jagadish (eds)
> DBDbib>

\rp ! Abadi,Martin
@ Stanford Un., CSD
" Temporal-Logic Theorem Proving "
/ Stanford, CSD, PhD Th., TR-CS-87-1151, Mar.1987.
= A temporal logic programming language. Proofs in modal logic.
  The resolution system required for them. ---Gio.
> DBDlogic><DBfile

\pr ! Abarbanel,Robert
@ Intellicorp
" Connections, Perspective and Reformation "
/ ACM SIGMOD 87, May.1987.
> DBDkb> 

\rp ! Abarbanel,R.M. and Williams,M.D.
@ IntelliCorp
" A Relational Representation for Knowledge Bases "
/ EDS 1, Apr.1986, not in proceedings, rcvd Oct.1985.
= KEE extended with access to a relational databases. Frames are assigned to
  normalized files according to their slots. Due to multiple inheritance
  many relations are needed. 
= I3
> DBDkb>

\pp ! Abate,J., Dubner,H., and Weinberg,S. 
" Queuing Analysis of the IBM 2314 Disk Storage Facility "
/ JACM, Vol.15 No.4, Oct.1969, pp.577--589.
> DBFtechn.3>

\pp ! Abate,J. and Dubner,H.
" Optimizing Performance of a Drum-Like Storage "
/ IEEE TC, Vol.C-18, Nov.1964, pp.992--997.
> DBFtechn.3>

\pr ! Abbod,T., Brown,K., and Noble,H.
" Providing Time-Related Constraints for Conventional Database Systems "
/ VLDB 13, Brighton UK, Sep.1987.
= extend SQL with temporal predicates.
> DBDnewDBMS>

\pr ! Abbott,K.R. and McCarthy,D.R.
@ CCA
" Administration and Autonomy in a Replication-Transparent Distributed DBMS "
/ VLDB 14, Bancilhon and DeWitt (eds), Los Angeles, Aug.1988, pp.195--205.
= Single-site DBMS solutions to administrative problems do not scale up to the
  distributed case.
= Ref. FAUVE.
> DBDdist>

\bk ! Abbott,Russell J.
" An Integrated Approach to Software Development "
/ Wiley, 1986.
> DEng>

\pp ! Abbott,Russell J.
@ Silogic; Aerospace Corp; CSU Chatsworth
" Knowledge Abstraction "
/ CACM, Vol.30 No.8, Aug.1987, pp.664--671.
= high level discussion, makes a link to database principles as a solution.
> DEng>

\pr ! Abbott,R. and GarciaMolina,H.
@ Princeton Un., DCS
" Scheduling Real-Time Transactions: A Performance Evaluation "
/ VLDB 14, (Los Angeles, Aug.1988), Bancilhon and DeWitt (eds), pp.1--12.
/ ACM SIGMOD Record, Vol.17, No.1, Mar.1988, pp.71--81.
/ Princeton Un., TR-CS-146-88, Feb.1988.
= best paper, ref.FAUVE.
= Transactions with deadlines? Algorithms which produce serializable schedules
  on a single processor memory resident database system. Includes aborts.
  Priority policies, Earliest Deadline (ED) is the best overall. Concurrency
  control policies, Conditional Restart (CR) is the best; it needs a run time
  estimate.
> DBDperform> DBFperform> DBFtrans><DBfile Garcia, 2 reports 

\pr ! Abbott,R. and GarciaMolina,H.
@ DCS, Princeton Un. (Princeton NJ)
" Scheduling Real-Time Transactions with Disk Resident Data "
/ VLDB 15, Amsterdam, Aug.1989.
= Real-time requirements schedule transactions with deadlines.
> DBFrealtime> DBFmethods> DBDperf>

\rp ! Abbott,R. and GarciaMolina,H.
" Scheduling I/O requests with deadlines: a performance evaluation "
/ Princeton Un., CS-TR-287-90.
= real-time
> DBFperf><DBfile

\pp ! Abbott,R. and GarciaMolina,H.
" Scheduling Real-Time Transactions: a Performance Evaluation "
/ ACM TODS, Vol.17 No.3, Sep.1992.
= real-time
> DBFperf>

\pr ! AbdelGhaffer,K. and ElAbbadi,A. 
" On the Optimality of Disk Allocation for Cartesian Product Files "
/ ACM PODS, Nashville, Apr.1990.
> DBFhybrid>

\pp ! AbdelGhaffer,K. and ElAbbadi,A.
" Optimal Disk Allocation for Partial Match Queries "
/ ACM TODS, Vol.18 No.1, Mar.1993.
> DBFhybrid>

\pr ! Abdelguerfi,M.
@ Detroit Un.
" Special Function Unit for Statistical Aggregation OPerations "
/ IWDM 89, (Deauville France), Jun.1989.
> DBFmach>

\pr ! Abdelguerfi,M. and Sood,A.
" Sorting and Joining Relations with Duplicate Values "
/ Parbase-90, Miami Beach, Mar.1990.
> DBDops>

\wp ! Abdellatif,A., Litwin,W., Nicolas,B., Vigier,P., and Zeroual,A.(eds.)
@ INRIA
" MRDSM Demonstration "
/ rcvd. Nov.1987.
= Example of querying a federated system.
> DBDdist><L.deMichiel

\pp ! AbdelWahab,H. and Jamison,B.
@ Old Dominion Un., Norfolk, VA
" The Tole of Linkage-graphs in Prolog relational databases "
/ ACM SIGMOD RECORD, Vol.18 No.1, Mar.1989, pp.43--53.
= prolog is used to represent the database schema
= connection defined in prolog
> DBDmodel> DBDkb>

\pr ! Abel,D.J.
@ Australia
" A spatial database shell for relational database management systems "
/ FODO 3, Paris, Jun.1989.
> DBDimpl>

\pr ! Abel,S. and Dourandish,R.
@ Expert-EASE systems (Belmont CA)
" Application of Evidential reasoning to Helicopter Flight Path Control "
/ Uncertainty in Artificial Intelligence, Workshop at Un.Penn, AAAI, 
  Aug.1986, pp.1--5.
= Uncertainty in data fusion. Sensor data and descriptive databases.
  Relates database schema to Dempster-Shafer theory!
> DBDkb> DBDdist>

\pr ! Aberg,P. and Neches,R. 
" Supporting Implementation of Semantic-Level User Interaction Paradigms "
/ INTERCHI'93, Amsterdam, Apr.1993.
= I3
> unknown>

\rp ! Abiteboul,S. and Bidoit,N.
" Non-First Normal Form Relations to Represent Hierarchically Organized 
  Data " 
/ ACM PODS 1984.
= Presents a nested relation database model VERSO formats.
  The extended relational algebra operations plus a restructuring operation
  achieves the relational completeness of the Verso operations.
  Updated version in INRIA report `Non First Normal Form Relations: An Algebra
  Allowing Data Restructuring' better organized.  ---BSLee.
> DBDtheory.2>

\pp ! Abiteboul,S. and Bidoit,N.
" Non First Normal Form Relations: An Algebra Allowing Data Restructuring "
/ JCSS, Vol.33, 1986, pp.361--393.
/ INRIA, TR-347, Nov.1984.
= An internal report version of `Non First Normal Form Relations To Represent
  Hierarchically Organized Data', ACM POD, 1984 under different title, using
  more readable syntax for selection operation, with better detail for super
  selection.  Published in the Journal of Computer and System Sciences,
  Sep.1986. ---BSLee.
> DBDtheory.2><DBfile

\pp ! Abiteboul,S. and Hull,R.
@ USC
" IFO: A Formal Semantic Database Model "
/ ACM TODS, Vol.12 no.4, Dec.1987, pp.525--565; ACM CR 8807-0535.
/ ACM PODS, 1984 (short version).
/ USC CSD, TR-84-304, Apr.1984.
= A graph-based formal semantic database model. Well written. The model
  appears to be well founded. ---E.Unger.
> DBDops.4> DBDmodel>

\pr ! Abiteboul,S. and Vianu,V.
@ INRIA; UCSD
" Equivalence and Optimization of Relational Transactions "
/ VLDB 10, Singapore, 1984. 
= Original title was Transactions in Relational Databases.
> DBFtrans><DBfile

\pp f! Abiteboul,S. 
" Disaggregation in Databases "
/ JACM, Vol.32 No.1, Jan.1985, pp.79--101.
> DBDtheory.2> 

\pp ! Abiteboul,S. and Vianu,V.
@ INRIA; UCSD
" Transactions and Integrity Constraints "
/ ACM PODS 4, Mar.1985.
> DBFtrans.7> DBFrepresent-4>

\rp ! Abiteboul,Serge
" Cocktail de Dependances "
/ Un.Paris-Sud, Ctr d'Orsay, PhD Th., Aug.1985.
= Synthesis
 of dependencies. 
> DBDtheory><x

\pp ! Abiteboul,S. and Vianu,V.
@ INRIA
" Properties of Transactional Schemas "
/ ACM PODS, Cambridge MA, Mar.1986.  
= a study of optimization for insert/delete operations.
> DBDops.3>

\pp ! Abiteboul,S. and Ginsburg,S.
" Tuple Sequences and Lexicographic Indexes "
/ JACM, Vol.33 No.3, Jul.1986, pp.409--422.
= ordered relations and indexes.  Reference constraint. 
> DBDmodel>

\pp ! Abiteboul,S. and Ginsburg,S.
@ USC, Los Angeles
" Logical Design:  Data Models "
/ JACM, Vol.33 No.3, Jul.1986, pp.409--422; ACM CR 8708-0697.
= Relational model with tuple sequencing; mathematical rigor.
> DBDdesign><thesis

\pr ! Abiteboul,S. and Hull,R.B. 
@ INRIA; USC
" Restructuring of Complex Objects and Office Forms "
/ ICDT 86, Rome, Sep.1986.
= Restructuring between different object types. Introduce `rewrite' operation
  and its algebra handling aggregation, grouping, and generalization of typed
  hierarchical objects.  Rewrite operation is more powerful than `nest' and
  `unnest' operations.  Generally applicable to equivalent and
  augmenting structural transformations.  An updated version appears in INRIA
  report `Restructuring hierarchical database objects', 1987. ---BSLee.
> DBDobject> DBDtheory>

\rp ! Abiteboul,S. and Hull,R.
" Restructuring Hierarchical Database Objects "
/ INRIA, Jan.1987.
= An updated version of `Restructuring of Complex Objects and Office Forms',
  ICDT 86, 1986. ---BSLee.
> DBDobject>

\pr ! Abiteboul,S. and Vianu,V.
" A Transaction Language Complete for Database Update and Specification "
/ ACM PODS, San Diego, Mar.1987, pp.260--268.
> DBDlang> DBDtheory>

\pr ! Abiteboul,S., Kanellakis,P.C., and Brahne,G.
@ INRIA
" On the Representation and Querying of Sets of Possible Worlds "
/ ACM SIGMOD 87, May.1987.
= complexity of null management
> DBDquery>

\wp ! Abiteboul,S. and Vianu,V.
@ INRIA; UCSD
" A Transaction-based Approach to Relational DB Specification "
/ rcvd. Nov.1987
> DBDtrans><DBfile

\pp ! Abiteboul,S. and Vianu,V.
@ INRIA; UCSD
" Equivalence and Optimization of Relational Transactions "
/ JACM, Vol.35 No.1, Jan.1988, pp.70--120.
= Equivalence can be decided in polynomial time. Algorithms for transactions
  and normalization.  A strongly acyclic TX have particularly desirable
  properties.
> DBDquery> DBFtrans>

\pr ! Abiteboul,S. and Vianu,V.
@ INRIA; UCSD
" Procedural and Declarative Database Update Languages "
/ ACM PODS 7, Mar.1988, pp.240--250.
= Includes looping.
> DBFtrans> DBDlang> DBDtheory>

\rp ! Abiteboul,S. and Beeri,C.
" On the Power of Languages for the Manipulation of Complex Objects "
/ INRIA TR-846, May.1988.
> DBDlang> DBDobject><DBfile

\pp ! Abiteboul,S. and Hull,R.
" Update Propagation in a Formal Semantic Model "
/ IEEE DB Eng.Bull., Vol.11 No.2, Jun.1988, pp.3--12.
> DBDmodel>

\pr ! Abiteboul,S. and Vianu,V.
" The Connection of Static Constraints with Determinism and Boundedness of 
  Dynamic Specifications "
/ Jerusalem Conf.3, Jun.1988.
> DBDkb>

\pp ! Abiteboul,S. and Scholl,M.
@ INRIA
" From Simple to Sophisticated Languages for Complex Objects "
/ IEEE DB Eng.Bull., Vol.11 No.3, Sep.1988, (Special issue on Nested
  Relations), pp.15--22.
> DBDmodel>

\pp ! Abiteboul,S. and Kanellakis,P.C.
" Object Identity as a Query Language Primitive "
/ ACM SIGMOD RECORD, Vol.18 No.2, Jun.1989, pp.159--173.
/ ACM SIGMOD 89, (Portland OR), May.-Jun.1989.
= Model permits cycles in instances as well as schemas. ---Gio
= IQL uses oid's to represent data structures with sharing and cycles, to 
  manipulate sets and to express computable database query. IQL can be
  statically type checked, can be evaluated bottom-up, and naturally
  generalizes most rule-based database languages.  
= PCK
= Another value-based Object-Oriented data model. Sets of OIDs manipulated. 
  ---T.Risch.
> DBDobject>

\pp ! Abiteboul,S. and Vianu,V.
@ INRIA
" A transaction based approach to relational database specification "
/ JACM, Vol.36 No.4, Oct.1989, pp.758--789; ACM CR 9102-0097.
= can generate functional and acyclic inclusion dependencies, not join
  dependencies.
= database is updated only by a fixed set of encapsulated transactions
  defined in the schema;  constraints can be automatically maintained;
  preserve constraints and soundness; preservation and soundness are
  unsolvable for arbitrary first-order constraints. ---Chomicki.
> DBDmodel> DBFtrans>

\pr ! Abiteboul,S.
" Boundedness is undecidable for Datalog programs with a single
  recursive rule "
/ Inf.Processing Letters, Vol.32, 1989.
= one predicate (relation)
> DBDlogic>

\pr ! Abiteboul,S.
" Towards a Deductive Object-Oriented Database Language "
/ DOOD89, Kyoto, Dec.1989.
> DBDlang

\pr ! Abiteboul,S., Kanellakis,P., and Waller,E.
" Method Schemas "
= only the methods of objects are visible; method names are bound late and
  can be overloaded; operational semantics are defined by SMALLTALK
  interpreter; undecidability is caused by recursion with change of context
  due to overloading
/ ACM PODS, Nashville, Apr.1990.
> DBDobject>

\pp ! Abiteboul,S. and Grumbach,S.
" A Rule-Based Language with Functions and Sets "
/ ACM TODS, Vol.16 No.1, Mar.1991.
= the COL language uses base and derived data functions
> DBDlang>

\pr ! Abiteboul,S. and Bonner,A.
" Objects and Views "
/ ACM SIGMOD 91, Boulder, May.1991.
> DBDobject> VOD>

\pp ! Abiteboul,S. and Kanellakis,P.
" The Two Facets of Object-Oriented Data Models "
/ IEEE DB Eng.Bull, Vol.14 No.2, Jun.1991.
= the structural data model, the behavioural data model.
> DBDobject>

\pr ! Abiteboul,S., Compton,K., and Vianu,V.
" Queries are easier than you thought (probably) "
/ ACM PODS, San Diego, Jun.1992.			
> DBDquery>

\pr ! Abiteboul,S., Vardi,M., and Vianu,V.
" Computing with Infinitary Logic "
/ ICDT 92, Berlin, Oct.1992.
> DBDtheory>

\pr ! Abiteboul,S. and VanGelder,A.
" Optimizing Active Databases using the Split Technique "
/ ICDT 92, Berlin, Oct.1992.
> DBDtheory>

\pr ! Abiteboul,S., Lausen,G., Uphoff,H., and Waller,E. 
" Methods and Rules "
/ ACM SIGMOD 93, Washington,DC, May.1993.
> unknown>

\pr ! Abiteboul,S., Cluet,S., and Milo,T.
" Querying and Updating the File "
/ VLDB 19, Dublin, Aug.1993.
> unknown>

\pp ! Abraham,C.T. and Ghosh,S.P. 
" Application of Finite Geometry in File Organization for Records with 
  Multiple-Valued Attributes "
/ IBM JRD, Vol.12 No.2, Mar.1968, pp.180--187.
= Combinatorial access to records having limited valued attributes with 
  redundant storage.
> DBFhybrid.6.4>

\pp ! Abraham,C.T., Ghosh,S.P., and RayChaudhury,D.K. 
" File Organization Schemas Based on Finite Geometrics "
/ Information and Control, Vol.12, Feb.1968, pp.143--163.
= Combinatorial access to records having only binary valued attributes with 
  redundant storage.
> DBFhybrid.6.4>%Abraham68

\pp ! Abrahamson,David M.
@ Trinity Coll., Dublin Ireland
" An Adaptative Dependency Source Model for Data Compression "
/ CACM, Vol.32 No.1, Jan.1989, pp.77--83.
> DBFrepresent>

\rp ! Abrial,J.R., Bas,J., Beaume,G., Henneron,G., Morin,R., and Vigliano,G. 
" Data Base Structure (Design and Implementation) "
/ International Summer School, Copenhagen, 1970, pub.IMAG, Dep.
  Mathematique Applique, Grenoble, France.
= Detailed description of SOCRATE schema driven data base system under CP67, 
  and concepts and techniques suitable for data bases.
> DBDschema><x7book, <HF5548.2 D325f at Math Science Lib.

\pr ! Abrial,Jean-Raymond
@ IMAG (Grenoble)
" Data Semantics "
/ Klimbie74 and Koffeman (IFIP TC-2), Mar.1974.
= Database model and concepts.	Binary relations.  of relationships 
= It seems amazing that a lot of concepts in modeling which are only now being
  implemented (or even discussed) were in this paper back in 1973. A must for
  anyone interested in data models. Only pages 1-17 are relevant to database 
  modeling. The rest of the paper deals manily with specifying procedures in 
  databases. To quote the author ... this paper belongs to the 'structured
  programming' area more than to the 'Database' literature... . The first part
  brings out the need for independence of querying from the mechanism used to
  get the answer -- semantic data independence. Notions of binary relations and
  objects and access functions. The idea of constraints associated 
  with operations on objects seems a lot like the ideas of Abstract Data 
  Types.---Maier
> DBDobject> DBDschema>%Abrial74

\pr ! AbuHakima,S. and Oppacher,F.
" RATIONALE: Developing Expert Systems that Reason by Explaining "
/ IEEE DE 4, Feb.1988, Los Angeles.
> DBDkb>

\rp 0! Accetta,M., Robertson,G., Satyanatayanan,M., and Thompson,M.
" The Design of a Network Based Central File System "
/ CMU, TR.80-123, Aug.1980.
> DBDdist> DBFsyseval>

\pp 0! Achubue,J.O. and Chin,F.Y.
" The Effectiveness of Output Modification by Rounding for
  Protection of Statistical Data Bases "
/ Auerbach Annual 1980, N-H 1981.
> DBDprivacy.2> DBDprivacy-10>

\pp f11f! Acker,R.D. and Seaman,P.H.
" Modelling Distributed Processing across Multiple CICS/VS Sites "
/ IBM Sys.J., Vol.24 No.4, 1982.
> DBFdist>

\pb 0! Ackoff,R.L. 
" Towards A System of Systems Concepts "
/ Management Information Systems, Riley(ed.), 1981.
> DBFintro>

\mn ! ACL
@ russell.stanford.edu
" On-line Bibliography for NLP and Computational Linguistics "
/ ACL Dec.1987.
 = A bibliographic database of more than 1700 literatures in 1980's is
  available for on-line access.  (It's distributed by ACL.) You may access the
  database by EMail with: subject field: a seq of conjunctively interpreted
  keywords.  TO field: clbib at russell.stanford.edu . If you fill the subject
  field with `HELP', you'll get a msg explaining about the database itself.  
> DBDnat>

\mn ! ACM Curriculum Committee
" Curriculum 68, Recommendations for Academic Programs in Computer Science "
/ CACM, Vol.2 No.3, Mar.1968, pp.151--197.
= Specification for a comprehensive Academic Computer Science program.
> DBDintro>%ACM68

\bk *f! Acton,Forman S. 
" Numerical Methods That {\ss Usually} Work "
/ Harper and Row, 1970, 541pp.
= Computer-oriented presentation of numerical analysis with many 
  relevant exhortations.
> DBFtechn> %Acton70

\rp ! Adair,R.J., Bayles,R.U., Comeau,L.W., and Creasy,R.J.
@ IBM, Data Processing Division
" A Virtual Machine System for the 360/40 "
/ IBM, Cambridge Sci. ctr  Report, May 1966.
= ABEND module of OS at SSC
> DBFhard>

\pp ! Adam,N.R. and Wortmann,J.C.
@ Rutgers; Eindhoven Un.
" Security-Control Methods for Statistical Databases: a Comparative Study "
/ ACM C.Surveys, Vol.25 No.4, Dec.1989; ACM CR 9012-0978.
= Control methods, conceptual, query restriction, data perturbation, and
  output perturbation; conditions are positively compromised and partially
  compromised; new threats: logical inference, diophantine inference,
  regression methodology
= Survey examines different approaches; no single method is adequate.
> DBDstat> DBDsec>

\pr ! Adam,N., Gangopadhyay,A., and Geller,J.
@ Rutgers Un.
" Knowledge Based Query Processing Using Preoptimized Queries "
/ CIKM-92, Baltimore, Nov.1992.
> DBDkb>

\pr ! Adam,N. and Gangopadhyay,A.
@ Rutgers Un.
" Integrating Functional and Data Modeling in a Computer Integrated 
  Manufacturing System " 
/ IEEE DE 9, Vienna, Apr.1993.
> DBDdist>

\pr ! Adams,E. and Popovici,G.
@ Hood College; Wyatt, Inc.
" On Using a Relational Database to Store Full Text for Information Retrieval
  with a Trigram Based Index "
/ CIKM-92, Baltimore, Nov.1992.
> DBDkb>

\pp ! Adams,S. 
" The MEDLARS System "
/ Fed.Proc., Vol.22, pp.1018--1021, 1963.
> DBDquery>

\pp ! Adams,S. 
" MEDLARS and the Library Community "
/ Bulletin of the Medical Library Association, Vol.52, pp.171--177, Jan.1964.
> DBDquery>

\pp ! Adams,S. and Taine,S. 
" Searching the Medical Literature, MEDLARS "
/ JAMA, Vol.188, pp.251--254, 1964.
> DBDquery>

\pr ! Addanki,S. and Nigam,A.
@ IBM, TJWRC 
" KL-DB: Towards a Unified Approach to Kowledge Representation "
/ DS-2, IFIP TC-2 conf.on Knowledge and Data, Nov.1986, Portugal.
= semantically augmented database systems based on SDM and KL-ONE
> DBDkb> DBDmodel>

\pp 0f! Addis,T.R.
@ Brunel Un., DCS (Uxbridge Middlesex, UK)
" A Relation-Based Language Interpreter for a Content Addressable File Store "
/ ACM TODS, Vol.7 No.2, Jun.1982, pp.125--163.
= ICL CAFS is used.
> DBFmach> DBDrel.3>

\bk ! Addis,T.R.
" Designing Knowledge-based Systems "
/ P-H, 1986, 322pp.; ACM CR 8801-0014.
= Augmentation to the relational model, a technique called extended relational
  analysis (ERA) for representing the entity sets perceived by users in a 
  task  domain.
> DBDdesign> DBDkb><MCS library.

\pp ! AdelsonVelski,G.M. and Landis,Y.M. 
" An Information Organization Algorithm "
/ DAN SSSR 146, 1962, pp.263--266.
/ Translation in NASA document n63-11777, 1963.
= Balanced binary trees (AVL trees)
> DBFtrees.4>

\pr ! Adiba,M., Delobel,C., and Leonard,M.
" A Unified Approach for Modelling Data in Logical Data Base Design"
/ Modelling in Data Base Management Systems, Nijssen(ed), N-H 1976, 
  pp.311--338.
= Describes a means of translating somewhat restricted network schemas
  to relational schemas, using a relation to represent each record
  (including migrated keys) and a relation to represent each set.
> DBDtheory>

\pr ! Adiba,M. and Delobel,C.
" The Cooperation Problem Between Different Data Base Management Systems "
/ Architecture and Models in Data Base Management Systems, 
  Nijssen(ed) (IFIP TC-2) Nice France 1977.
/ Res.R. Grenoble no.42, Jan.1976.
> DBFhash> DBDdist><DBfile (in French)

\pr ! Adiba,M.E., Chupin,J.C., Demolombe,R., Gardarin,G., and LeBihan,J.
" Issues in Distributed Data Base Management Systems "
/ VLDB 4, Bubenko and Yao(eds), W.Berlin, FRG, 1978, pp.89--110.
= Short notes and a comprehensive bibliography. Relates communication to
  CCITT ISO multi-level protocol.
> DBDdist>

\pr ! Adiba,M.E., Caleca,J-I., and Euzet,C.
" A Distributed Data Base System Using Logical Relational Machines "
/ VLDB 4, Bubenko and Yao(eds), 1978, pp.450--461.
= Description of SIRIUS POLYPHEME project.
  databases are heterogeneous (IMS, IDS-II, SOCRATE) but there is 
  a common relational interface package.
> DBDdist>

\rp ! Adiba,M. and Andrade,J-M.
" Distributed Databases "
/ Un.Grenoble RR 193, Dec.1979.
= partitioning and migration
> DBDdist><DBfile

\pr 0! Adiba,M., Andrade,J.M., Decitre,P., Fernandez,F., and Nguyen,T.G.
" POLYPHEME: An experience in distributed database system design and 
  implementation "
/ ISDDB 1, Delobel and Litwin(eds), Mar.1980, Paris, France, pp.67--84.
> DBDdist>

\pr 0*! Adiba,M.E. and Lindsay,B.G.
@ Grenoble Un., Laboratoire IMAG, France ; IBM, (San Jose CA)
" Database Snapshots "
/ VLDB 6, Lochovsky and Taylor(eds), Montreal, Oct.1980, pp.86--91.
/ IBM, Res.R. RJ1771(35327), Mar.1980.
= Access to obsolete versions of the database.	We discuss snapshots,
  and implementations and we show the importance of the snapshot concept.  
  System supported snapshots periodically reflect selected portions 
  of the database to view the database `as of' a specific time.	 
> DBDtrans-3.2><DBfile

\pr 0*f! Adiba,Michel E.
@ Grenoble Un., IMAG-LGI, France
" Derived Relations:  A Unified Mechanism for Views, Snapshots and
  Distributed Data "
/ VLDB 7, Zaniolo and Delobel(eds), Sep.1981, pp.293--305.
= DEREL can be used to define base relations and to derive different
  classes of views, snapshots, partitioned and replicated data.
  DEREL is intended to be part of a general purpose distributed
  relational database management system.
= I3
> DBDschema.3.4> DBFhybrid.5.2>

\pr ! Adiba,M. and Nguyen,G.T.
@ Un.Grenoble, IMAG-LGI, France
" Handling Constraints and Meta-Data on a Generalized Data Management System "
/ EDSW, Vol.2, 1984, pp.342--359.
= PROLOG implementation of a Meta-model of TIGRE.  Tigre runs on 
  another node of the local net.
> DBDschema.3>

\pr ! Adiba,M. and Quang,N.B.
@ Grenoble Un., IMAG-LGI, (France)
" Historical Multimedia Databases "
/ VLDB 12, Aug.1986.
= temporal
> DBDnewDBMS>

\pr ! Adiba,M. and Collet,C.
" Management of Complex Objects as Dynamic Tools "
/ VLDB 14, Bancilhon and DeWitt (eds), Los Angeles, Aug.1988, pp.134--147.
> DBDquery>

\pp ! Adiba,Michel E.
" Histories and Versions for Multimedia Complex Objects "
/ IEEE DB Eng.Bull., Vol.11 No.4, Dec.1988, pp.3--10.
= Semantics of the evolution of multimedia complex objects. Temporal
  histories and versions.
> DBDmodel>

\wp ! Adiba,M., Lecluse,C., and Richard,P.
@ LGI-IMAG, Grenoble; Altair
" Rationale and Design of SDL90, a Database Programming Language "
/ rcvd Mar.1990.; submitted to DEXA Mar.1991.
= designed to provide features from semantic data models and from programming
  languages; pre and post conditions; a declarative way of spefifying data, 
  integrity contraints, (ISA, classification and membership, and views).
= defines domains by complex views composed of relations; implementation
  types with private properties and operations; update is programmed.
> DBDlang> DBDobject> VOD><DBfile

\pp ! Adlassnig,K-P., Kolarz,G., Scheithauer,W., Effenberger,H., and Grabner,G.
@ U.Vienna, Dep. MCS, (Garnisongasse 13, A-1090 Vienna, Austria)
" CADIAG: Approaches to Computer-Assisted Medical Diagnosis "
/ Comput.Biol.Med., Pergamon Press, Vol.15 No.5, 1985, pp.315--335.
= CADIAG-1 is based on a symbolic logic representation of relationships, as 
  confirming, excluding or obligatory occurence are versus facultative and not
  confirming relationships. CADIAG-2 is a medical expert system based on a 
  fuzzy set theory.
> MIS><DBfile

\pp ! Adlassnig,K-P., and Kolarz,G.
@ UCB, CSD; UCB EE 
" Representation and Semiautomatic Acquisition of Medical Knowledge in
  CADIAG-1 and CADIAG-2 "
/ CBR, Vol.19, pp.63--79, 1986.
> MIS><DBfile

\pp ! Adlassnig,K-P., Kolarz,G., Scheithauer,W., and Grabner,H.
@ UCB, CSD; UCB EE 
" Approach to a hospital-based application of a medical expert system "
/ Med.Inf., Vol.11 No.3, pp.205--223, 1986.
= CADIAG-2
> MIS><DBfile

\rp f! Adler,Paul
" New Technologies, New Skills "
/ Harvard Business School, HBS Case services, work.paper 9-784-076, May.1984.
= effect of automation, specifically on banking
> DBappl>

\pp ! Afek,I., Attiya,H., Dolev,D., Gafni,E., Merritt,M., and Shavit,N.
@ TelAviv Un.
" Atomic Snapshots of Shared Memory "
/ ACM PODC, 1990.
= memory based temporal
> DBDconc><DBfile Dolev

\pr ! Afrati,Foto, Papadimitriou,C., Papageorgiou,G., Roussou,A., Sagiv,Y.,
  and Ullman,J.D.
@ National TU.Athens
" Convergence of Sideways Query Evaluation "
/ ACM PODS, Cambridge MA, Mar.1986.
> DBDtheory>

\pp ! Afrati,F. and Papadimitriou,C.
@ National TU.Athens
" The Parallel Complexity of Simple Chain Queries "
/ ACM PODS, San Diego, Mar.1987.
> DBDtheory>

\pr ! Afrati,F., Cosmadakis,S.S. and Yannakakis,M.
" On Datalog versus Polynomial Time "
/ ACM-PODS 91, Denver CO, May.1991.
> DBDlogic>

\rp ! Afsarmanesh,H., McLeod,D., Knapp,D., and Parker,A.
@ USC
" An Extensible Object-Oriented Approach to Databases for VLSI/CAD "
/ USC, TR.CRI-85-09, Oct.1985.
> EIS><DBfile Parker

\pb ! Afsarmanesh,H. and McLeod,D..
" A Framewpork for Semantic Database Models " 
/ New Directions for Database Systems, Ariav and Clifford(eds), Ablex, 1986.
> EIS> DBDdesign>

\rp ! Afsarmanesh,H., Knapp,D., McLeod,D., and Parker,A.
" An Extensible Object-Oriented Approach to Databases for VLSI/CAD " 
/ USC, CSD, TR-85-330, Apr.1985.
/ VLDB, 1985.
/ In 'Readings in Object-Oriented Database Systems" edited by S.Zdonik and 
  D.Maier, Morgan Kaufman, 1990.
> DBDobject> EIS> DBDdesign>

\rp ! Afsarmanesh,Hamidah
" 3DIS: An Extensible Object-Oriented Information Model " 
/ USC CSD, TR-85-21, Oct.1985.
> DBDobject> EIS> DBDdesign>

\rp ! Agarwal,Shailesh
" Flexible Relations "
/ Stanford PhD thesis, to appear
= Views,objects
> DBDrel> EIS> VOD>

\pp *f! Agarwala,A.K. 
" Learning with a Probabilistic Teacher "
/ IEEE Trans.Information Theory, Vol.IT16 No.4, May.1970.
> DBFtechn.1> %Agarwala70

\bk ! Agosti,Maristella
@ Un.Padova,Italy
" Database Design:  a Classified and Annotated Bibliography " 
/ Cambridge Un.Press, NY, 1986, 92pp.; ACM CR 8712-0975
= 275 articles and books from prior to 1985 are (mostly) annotated.
  --- Armstrong.
> DBDdesign>

\pp ! Agha,G.
" A Message-Passing Paradigm for Object Management "
/ IEEE DB Eng.Bull., Vol.8 No.4, Dec.1985.
> DBDobject>

\pr ! Agha,Gul
@ Yale Un.
" The Relation between Problems in Large-Scale Concurrent Systems and 
  Distributed Databases "
/ ISPDS, IEEE CS, Austin TX, Dec.1988.
> PARADATA> DBDdist>

\pp ! Aghili,H. and Severance,D.G.
" Practical guide to the Design of Differential Files for Recovery of On-Line
  Databases "
/ ACM TODS, Vol.7 No.4, Dec.1982, pp.540-565.
> DBDtrans-3>

\pr ! Agrawal,D. and ElAbbadi,A.
@ UCSB, DCS
" Reducing Storage for Quorum Consensus Algorithms "
/ VLDB 14, Bancilhon and DeWitt(eds), Los Angeles, Aug.1988, pp.419--430.
> DBDconc> DBDdist>

\pp ! Agrawal,D. and Sengupta,S.
@ UCSB, DCS
" Modular Synchronization in Multiversion Databases: Version Control and
  Concurrency Control "
/ ACM SIGMOD RECORD, Vol.18 No.2, Jun.1989, pp.408--417.
/ ACM SIGMOD 89, (Portland OR), May.-Jun.1989.
> DBDconc>

\pp ! Agrawal,D. and ElAbbadi,A.
" Integrating security with fault-tolerant distributed databases "
/ Computing J., Vol.33 No.1, Feb.1990; ACM CR 9102-0096.
= when data are stored redundantly, data can be compromised more
  easily; two issues: confidentiality and resiliency, the number that
  can be destroyed by an adversary
> DBDreliab>

\pr ! Agrawal,D. and ElAbbadi,A.
@ UCSB
" Locks with Constrained Sharing "
/ ACM PODS, Nashville, Apr.1990.
> DBDconc>

\pr ! Agrawal,D. and ElAbbadi,A.
" The Tree Quorum Protocol: An Efficient Approach for Managing Replicated 
  Data "
/ VLDB 16, Brisbane, Aug.1990.
> DBDdist>

\pp ! Agrawal,D. and ElAbbadi,A.
" Storage Efficient Replicated Databases "
/ IEEE TKDE. Vol.2 No.3, Sep.1990.
= fragmentation reduces the storage overhead of replicated objects;
  generalization of quorum algorithms.
> DBDreliab> DBDdist>

\pr ! Agrawal,Divyakant	
" Performance Characteristics of Protocols with Ordered Shared Locks "
/ IEEE DE 7, 1991.
> DBDperf>

\pr ! Agrawal,D and ElAbbadi,A.
" Using Data Migration for Heterogeneous Databases "
/ IMS-91, Kyoto, Apr.1991.
> DBDdist>

\pr ! Agrawal,D. and Krishnaswamy,V.
@ UCSB
" Using Multiversion Data for Non-interfering Execution of 
  Write-only Transactions "
/ ACM SIGMOD 91, Boulder, May.1991.
> DBDconc> DBDtrans>

\pr ! Agrawal,D., ElAbbadi,A., and Jeffers,R.
" Using Delayed Commitment in Locking Protocols for Real-Time Databases "
/ ACM SIGMOD 92, San Diego, Jun.1992.
> DBDconc>

\pr ! Agrawal,D., ElAbbadi,A., and Jeffers,R. 
" An Approach to Eliminate Transaction Blocking in Locking Protocols "
/ ACM PODS, San Diego, Jun.1992.				
> DBDintegrity>

\pr ! Agrawal,D. and ElAbbadi,A.
" Resilient Logical Structures for Efficient Management of Replicated Data "
/ VLDB 18, Vancouver, Aug.1992.
= high availability at low communication cost for read operations
> DBDdist>

\pp ! Agrawal,D. and ElAbbadi,A.
" The Generalized Tree Quorum Protocol: an Efficient Approach for
  Managing Replicated Data "
/ ACM TODS, Vol.17 No.4, Dec.1992.
> DBDdist>

\pr ! Agrawal,P., Bitton,D., Guh,K., Liu,C., and Yu,C.  
@ Un.Illinois, Chicago
" Case Study for Distributed Query Processing "
/ ISPDS, IEEE CS, Austin TX, Dec.1988.
> DBFdist>

\pp ! Agrawal,R., Carey,M.J., and DeWitt,D.J.
@ Un.Wisconsin, Madison
" Deadlock Detection is Cheap "
/ UCB, Elec.Res.Lab, M83/5, Jan.1983.
/ ACM SIGMOD Record, Vol.13 No.2, Jan.1983, pp.19--34.
> DBDintegrity.2><DBfile

\pr ! Agrawal,Rakesh
@ Un.Wisconsin
" A Parallel Logging Algorithm for Multiprocessor Database Machines "
/ IWDM 4, DeWitt and Boral(eds.), Springer, Bahamas, Mar.1985.
> DBFmach> DBDprivacy.3>

\pp ! Agrawal,R. and Carey,M.
" The Performance of Concurrency Control and Recovery Algorithms for
  Transaction-oriented Database Systems "
/ IEEE DB Eng.Bull., Vol.8 No.2, Jun.1985, pp.50--57.
> DBDtrans-3> DBDdist>

\pp ! Agrawal,R. and DeWitt,D.J.
" Integrated Concurrency Control and Recovery Mechanisms:
  Design and Performance Evaluation "
/ ACM TODS, Vol.10 No.4, Dec.1985, pp.529--564; ACM CR 8610-0934.
> DBDtrans> DBDintegrity>

\wp ! Agrawal,R. and Jagadish,H.V.
" On Bounded Linear Recursion "
/ rcvd.Nov.1986.
= Observes that since the classes on which Ioannidis' algorithm and
  Naughton's algorithm work are incommensurate, you can get a larger
  class by taking the union. ---jeff
> DBDkb>

\pp ! Agrawal,Rakesh
@ ATT Bell Labs.  
" ALPHA: An Extension of Relational Algebra to Express a Class of 
  Recursive Queries "
/ IEEE TSE, Vol.14 No.7, Jul.1988, pp.879--885.
/ IEEE DE 3, Los Angeles, Feb.1987.
= [Ahad,Yao,Choi87] D.1.
= The alpha operator takes transitive closures, but also produces a
  record of the path taken.  Works wonderfully when your graph is a
  straight line. ---jeff
= An alpha operator allows a large class of recursive queries. ---gio
> DBDkb> DBDlogic> DBDrel> DBDops><DBfile

\pr ! Agrawal,R., and Jagadish,H.V.
" Direct Algorithms for Computing the Transitive Closure of Database 
  Relations "
/ VLDB 13 (Brighton, UK), Sep.1987.
> DBDtheory> DBDquery> DBDlogic>

\pp ! Agrawal,R., Carey,M., and Livney,M.
" Concurrency Control Performance-Modeling: Alternatives and Implications "
/ ACM TODS, Vol.12 No.4, Dec.1987, pp.609--654; ACM CR 8807-0537.
/ ACM SIGMOD 1985.
= This paper is unique in that it studies the implications of fundamental
  assumptions regarding system resources, transactions restarts, and 
  predeclarations of writes. Essential reading. ---H.Korth.
> DBDtrans-3> DBDdist> DBtechm>

\pp ! Agrawal,R., Carey,M.J., and McVoy,L.W.
" The Performance of Alternative Strategies for Dealing with Deadlocks in 
  Database Management Systems "
/ IEEE TSE, Vol.SE-13 No.12, Dec.1987, pp.1348--1363.
= A. Continuous detection, periodic detection, delecting to break deadlock 
  cycles. 1) Current Blocker. 2) Random Blocker. 3) Min Locks. 4) Youngest. 
  5) Min Work. B. Prevention: Wound-Wait, Wait-Die, Immediate-Restart, 
  Running-Priority. C. Timeout.
> DBDconc>

\pr ! Agrawal,R. and Devanbu,P.
" Moving Selections into Linear Least Fixpoint Queries "
/ IEEE DE 4, Feb.1988, Los Angeles.
> DBDlogic>

\wp ! Agrawal,R., Dar,S., and Jagadish,H.V.
@ ATT Bell Labs, (Murray Hill NJ)
" Transitive Closure Algorithms Revisited: The Case of Path Computation "
/ rcvd.Feb.1988.
= Implementation considerations for practical DBMS.
= These guys invented `closed semirings', but they haven't got the
  `closed' part, so they can only handle acyclic paths.
  They also noticed, as in AHU-1974, that Floyd's and WArshall's algorithms
  are really the same idea, and perhaps in their next paper, they'll
  notice that Kleene's algorithm is too. ---Jeff.
> DBDops> DBDquery> DBDlogic><DBfile home

\wp ! Agrawal,R. and Jagadish,H.V.
@ ATT Bell Labs, (Murray Hill NJ)
" Efficient Search in Expert Database Systems "
/ rcvd. Apr.1984.
= Levels versus storage structure in minimum path closure computation.
> DBDkb><DBfile

\pr ! Agrawal,R. and Jagadish,H.V.
" Materialization and Incremental Update of Path Information "
/ IEEE DE 5, Los Angeles, Feb.1989.
> DBDperform>

\pr ! Agrawal,R. and Jagadish,H.V.
@ ATT Bell Labs, (Murray Hill NJ)
" Efficient Search in Very Large Databases "
/ VLDB 14, Bancilhon and DeWitt(eds), Los Angeles, Aug.1988, pp.407--418.
= Partial derivation, useful for mediation. ---Gio
> DBDperform> DBDkb>

\pp ! Agrawal,R., Valduriez,P., and Jagadish,H.V.  
@ ATT Bell Labs
" Multiprocessor Transitive Closure Algorithms "
/ IEEE DB Eng.Bull., Vol.12 No.1, Mar.1989, pp.30--36.
/ ISPDS, IEEE CS, Austin TX, Dec.1988.
= Paradata.
> DBDlogic> DBDdist> DBDarchitecture>

\pr! Agrawal,R., Dar,S., and Jagadish,H.V.
" Composition of Database Relations "
/ IEEE DE 5, Los Angeles, Feb.1989.
> DBDmodel>

\pp ! Agrawal,R. and Gehani,N.H.
@ ATT Bell Labs, (Murray Hill NJ)
" ODE (Object Database and Environment): The Language and the Data Model "
/ ACM SIGMOD RECORD, Vol.18 No.2, Jun.1989, pp.36--45.
/ ACM SIGMOD 89, (Portland OR), May.-Jun.1989.
= Presents the facilities provided in O++ and the data model it supports.
  O++ is a database programming language based on C++ (extending C++ classes).
  ---BSLee.
= Describes a persistent object extension to C++. Static type checking.
  Compiler, Versions, Constraints as procedures called when object created,
  I don't think the constraints are checked when the DB is updated, though.
  Triggers as procedures to be called when condition over object becomes
  true. ---T.Risch.
> DBDobject> DBDlang>

\pp ! Agrawal,R., Borgida,A., and Jagadish,H.V.
" Efficient Management of Transitive Relationships in Large Data and Knowledge 
  Bases "
/ ACM SIGMOD RECORD, Vol.18 No.2, Jun.1989, pp.253--262.
/ ACM SIGMOD 89, (Portland OR), May.-Jun.1989.
> DBDlogic>

\pr ! Agrawal,R. and Jagadish,H.V.
@ ATT Bell Labs
" Recovery Algorithms for Database Machines with Non-Volatile Memory "
/ IWDM 89, (Deauville France), Jun.1989.
> DBFmach>

\pr ! Agrawal,Rakesh
@ ATT Bell Labs (Murray Hill NJ)
" On Correctly Configuring Versioned Objects "
/ VLDB 15, Amsterdam, Aug.1989.
= Object management; a system comprising a set of objects is configured by
  selecting a version for each of the objects that constitute the system.
  A configuration is also a versioned object.  
> DBDobject> EIS> DBDdesign>

\pp ! Agrawal,R. and Devanbu,P.
" Moving Selections into Linear Least Fixpoint Queries "
/ IEEE TKDE, Vol.1 No.4, Dec.1989, pp.424--432.
= selection transposition rules for relational algebra are incorrect
  when the LEP operator is added; moves the strongest selection.
> DBDquery>

\pr ! Agrawal,R., Gehani,N.H. and Srinivasan,J. 
" OdeView:  The Graphical Interface to Ode " 
/ ACM SIGMOD 90, Atlantic City, May.1990.
= multimedia
> DBDquery> DBDobject>

\pr ! Agrawal,R. and Jagadish,H.
" Directed Transitive Closure Algorithms "
/ VLDB 16, Brisbane, Aug.1990.
> DBDops>

\pp ! Agrawal,R., Dar,S., and Jagadish,H.
" Directed Transitive Closure Algorithms: Design and Performance Evaluation "
/ ACM TODS, Vol.15 No.3, Sep.1990.
> DBDops>

\pr ! Agrawal,R., Cochrane,R.J., and Lindsay,B.G.
" On Maintaining Priorities in a Production Rule System "
/ VLDB 17, Barcelona, Sep.1991.
> DBDkb>

\pr ! Agrawal,R., Ghosh,A., Imielinski,T., Iyer,B., and Swami,A.
" An Interval Classifier for Database Mining Applications "
/ VLDB 18, Vancouver, Aug.1992.
= marketing example; creates decision rules; compared with CART and ID3;
  splits continuous values into weak and strong intervals
> DBDkb>

\pr ! Agrawal,R., Dar,S., and Gehani,N.
@ IBM; ATT Bell Labs
" The O++ Database Programming Language: Implementation and Experience " 
/ IEEE DE 9, Vienna, Apr.1993.
> DBDobject>

\pr ! Agrawal,R. and Kiernan,J.
@ IBM Almaden
" An Access Structure for Generalized Transitive Closure Queries " 
/ IEEE DE 9, Vienna, Apr.1993.
> DBDops>

\pr ! Agrawal,R., Imielinski,T., and Swami,A. 
" Mining Association Rules between Sets of Items in Large Databases "
/ ACM SIGMOD 93, Washington,DC, May.1993.
> DBDkb>

\wp ! Ahad,R., Bingyao,S., and Hwa,C.J.
@ Un.Maryland, Dep.Information Systems
" Modeling and Classification of Recursive Queries "
/ Rcvd Oct.1987.
= Classification, with subsumption hierarchy. Correctness is questionable.
> DBDlogic>

\pp ! Ahad,R., BapaRao,K.V., and McLeod,D.
@ Un.Maryland
" On Estimating the Cardinality of the Projection of a Database Relation "
/ ACM TODS, Vol.14 No.1, Mar.1989, pp.28--40; ACM CR 9005-0418.
= A technique when some information about the number of objects that
  participate in a relationship is known.
= Uses normal distribution estimates.
> DBDquery>

\pr ! Ahad,Rafiul	
" ESQL: A Query Language for the Relation Model Supporting Image Domains "
/ IEEE DE 7, 1991.
> DBDquery>

\pp ! Ahamad,M. and Ammar,M.
@ GIT, Athens
" Performance Characterization of Quorum-consensus algorithms for
  Replicated Data "
/ IEEE TSE, Vol.15 No.4, Apr.1989, pp.492--495.
= measures the proportion of successfull transactions in systems which
  aborts if data are not available and the mean response time in which systems
  wait
> DBDconc> DBDdist>

\pr ! Ahamed,S. and Lawrence,V.
@ City Un.of NY; Bell Labs
" Interoperability of Multiple DBs for the Design and Simulation of
  High-Speed Digital Subscriber Lines "
/ IEEE RIDE-IMS 93, Vienna, Apr.1993.
> DBDdist> 

\pp ! Ahituv,N., Yeheskel,L., and Neumann,S.
@ Tel Aviv Un., Israel
" Processing Encrypted Data "
/ CACM, Vol.30 No.9, Sep.1987, pp.777--780; ACM CR 8812-0933.
= Processing while the data are still encrypted.
= Limit to operation is integer modular addition. ---Meadows.
> DBFprotect> DBFrepresent>

\pp ! Ahituv,Niv
@ Tel Aviv Un., Israel; Claremont Grad.School.
" A Metamodel of Information Flow: A Tool to Support Information Systems 
  Theory "
/ CACM, Vol.30 No.9, Sep.1987, pp.781--791; ACM CR 8901-0028
= States along the flow of data:  physical events, language(data), stored data,
  human data processing, and decision making.
= Basis for different data flow models. Is set-theoretical. Illustrative
  examples. Data processing is decomposed into selection, manipulation, and
  delay. Value of data is obtained when data are perceived. ---Krejci
> DEng> DBDmodel>

\pp ! Ahlsen,M., Bjornerstedt,A., Britts,S., Hulten,C., and Soderland,L.
" An Architecture for Object Management in OIS "
/ ACM TOIS, Vol.2 No.3, 1984.
/ In 'Readings in Object-Oriented Database Systems" edited by S.Zdonik and 
  D.Maier, Morgan Kaufman, 1990.
> DBDobject>

\pp ! Ahlsen,M., Bjornerstedt,A., and Hulten,C.
@ Chalmers Un.Tech., CSD; Un.Goteborg (Goteborg, Sweden)
" OPAL: An Object-Based System for Application Development "
/ IEEE DB Eng.Bull., Vol.8 No.4, Dec.1985.
/ Syslab Report No.38, Oct.1985.
> DBDobject><DBfile Syslab

\wp ! Ahmed,R. and Rafi,A.
" Relational Schema Mapping and Query Translation in Pegasus "
/ COSI Workshop, Tulsa, Nov.1990.
= objects in heterogeneous languages can be mapped to relational systems
  as well
> DBDdist> DBDquery>

\pr ! Ahmed,R. and Navathe,S.
" Version Management of Composite Objects in CAD Databases "
/ ACM SIGMOD 91, Boulder, May.1991.
> EIS> DBDobject>

\pp ! Ahmed,R. et al.
@ HP, Palo Alto
" The Pegasus Heterogeneous Multidatabase System "
/ IEEE Computer, Vol.24 No.12, Dec.1991.
= object-oriented data modeling and programming; Pegasus uses both type
  and function abstractions to resolve mapping and integration
= uses a heterogemous Object SQL, maintains object information,  
  derived functions, limited optimization 
> DBDdist> DBDobject> DEng>

\pr ! Ahmed,R., Albert,J., Ketabchi,M., and Shan,M.
@ HP Labs
" Automatic Importation of Relational Schemas in Pegasus "
/ IEEE RIDE-IMS 93, Vienna, Apr.1993.
> DBDdist> DBDrel>

pr ! Ahmed,R. et al.
" An Overview of Pegasus "
/ IEEE RIDE-IMS 93, Vienna, Apr.1993.
> DBDdist> 

\pr ! Ahn,Ilsoo
@ Un.North Carolina
" Towards an Implementation of Database Management Systems with Temporal 
  Support "
/ IEEE DE 2, Los Angeles, Feb.1986.
= Discusses file organization strategies for time variant databases with tuple
  or attribute versioning.  Considers performance characteristics of proposed
  file organizations.  Emphasis on CD-ROM (optical) technology  ---Downs.
= Two schemes to store temporal information of data in database systems 
  are discussed. Tuple versioning: each tuple is augmented with an interval
  while the tuple is valid.  Updating one attribute requires to copy the whole
  tuple. Attribute versioning : Each dynamic attribute is augmented with an 
  interval.  Each attribute has to have its own time information.
  File organizations for time variant database systems are also discussed.
  Two-level storage structure: use two storage areas to separate history data
  from current data, is proposed.  History data may be stored in write once
  media, but index schemes on write-once media are not considered. ---H.Shima.
> DBDnewDBMS>

\pr ! Ahn,I. and Snodgrass,R.
" Performance Evaluation of a Temporal Database Management System "
/ ACM SIGMOD, May.1986.
> DBDnewDBMS>

\pp ! Ahn,I. and Snodgrass,R.
" Partitioned Storage for Temporal Databases "
/ Inf.Sys, Vol.13 No.4, 1988.
= Current and historical data are stored distinctly to avoid ISAM problems,
  joint indexes, snapshots may require both.  Performance in INGRES.
> DBDops> DBFrepresent><DBfile Snodgrass

\pp ! Ahn,I. and Snodgrass,R.
" Performance Analysis of Temporal Queries "
/ Information Sciences, Vol.49 No.1,2,3, 1989.
= model takes a temporal query and a database schema as input, and outputs
  the estimated cost; validates the actual cost measured witjh TQUEL,
  and INGRES extension
> DBDops> DBDperf><DBfile Snodgrass

\bk *! Aho,A.V., Hopcroft,E., and Ullman,J.D.
" The Design and Analysis of Computer Algorithms "
/ A-W, 1974.
= Chapter 5 has deadlock detection algorithms.
> DBDintegrity.2>

\pp ! Aho,A.V., Johnson,S.C., and Ullman,J.D.
" Code Generation for Expressions with Common Subexpressions "
/ JACM, Vol.24 No.1, Jan.1977, pp.146--160.
> DBFeval.4><Shel

\pp ! Aho,A.V., Sagiv,Y., and Ullman,J.D.
" Equivalences among Relational Expressions "
/ SIAM J. Comptg., Vol.8 No.2, May.1979, pp.218--246.
> DBDtheory.3>

\pp ! Aho,A.V., Beeri,C., and Ullman,J.
@ Bell Labs; Princeton Un.
" The Theory of Joins in Relational Databases "
/ IEEE-FOCS 19, 1977.
/ ACM TODS, Vol.4 No.3, Sep.1979, pp.297--314.
= Losslessnes of joins is explored.  The examples have suprising dependencies.
> DBDtheory.3>

\pr ! Aho,A.V. and Ullman,J.D.
" Universality of Data Retrieval Languages "
/ ACM POPL 6, San Antonio TX, Jan.1979, pp.110--117
= Parallel execution of loops in first order. Complexity.
> DBDlogic> DBFindex.3> DBDquery> DBDtheory>

\pr **f! Aho,A.V. and Ullman,J.D.
@ Bell Labs; Princeton Un.
" Optimal Partial-Match Retrieval When Fields Are Independently Specified "
/ ACM TODS, Vol.4 No.2, Jun.1979, pp.168--179.
> DBFindex.5.5> DBFimpl.6>

\pp *! Aho,A.V., Sagiv,Y., and Ullman,J.D.
@ Bell Labs; Princeton Un.
" Efficient Optimization of a Class of Relational Expressions "
/ ACM TODS, Vol.4 No.4, Dec.1979, pp.435--454.
= Optimizing queries based on select, project, and join.
> DBFindex.3> DBFeval.4> DBDrel.2> DBDquery>

\bk 0*! Aho,A.V.(ed)
" Proceedings of the ACM Symposium on Principles of Database Systems "
/ ACM 1982, order No.475820, 305pp.
= ACM-PODS 1, Mar.1982, Los Angeles, sponsored by ACM-SIGACT and ACM-SIGMOD.
> DBDintro>

\pp 0! Aho,A.V.
@ Bell Labs
" Database Systems:  Database Work at Bell Labatories "
/ Bell System Technical J., Vol.61 No.9 Part 2, Nov.1982, pp.2383--2385.
> DBDintro>

\pr ! Ahuga,S. and Roberts,C.S.
@ Bell Labs
" Superimposed Codes "
/ ASCA 7, La Baule, France, May.1980, pp.218--227.
= Recommended. ---Miya.
> DBFtree> DBFconc>

\pr ! Ahuja,M.L. and Browne,J.C.
" Concurrency Control by Preordering Entities in 
  Distributed Databases with Multi-Versioned Entities "
/ IEEE DE 3, LA, Feb.1987.
= combines existing algorithms for consistency maintenance, ordering imposes
  constraints on users
> DBDdist> DBDintegrity><DBfile

\pr ! Ahuja,M.L. and Browne,J.C. 
" Performance evaluation of two concurrency control protocols for distributed
  databases with multiversioned entities " 
/ IEEE DE 4, Feb.1988, Los Angeles.
> DBDdist>

\rp ! Aiello,N., Bock,C., Nii,H.P., and White,W.C.
@ Stanford Un., CSD
" The Joy of AGE-ing: An Introduction to AGE-1 System "
/ Stanford Un., CSD, Heuristic Programming Project, Jun.1980.
> DBDkb><DBfile Nii

\rp ! AitKaci,Hassan
@ U.Pennsylvania, Moore School
" A Lattice Theoretic Approach to Computation based on a Calculus of
  Partially Ordered Type Structures "
/ U.Penn, PhD Th., 1984.
= Formalization of semantic nets, including inheritance lattices.
> DBDschema.1> DBDmodel.3><Thesis shelf

\pb ! AitKaci,Hassan
@ MCC (Austin TX)
" Type Subsumption as a Model of Computation "
/ `Expert Database Systems', Kerschberg(ed), B-C, 1985.
/ EDSW, Vol.1, Oct.1984, pp.124--150.
= semantic extensions of logical algebra.
> DBDschema.1> DBDmodel.3> DBDkb> 

\rp ! AitKaci,H. and Nasr,R.
" LOGIN: a logic programming language with built-in inheritance"
/ MCC, TR-AI-068-85, Jul.1985.
> DBDkb><DBFile 

\pp ! AitKaci,H., Boyer,R., Lincoln,P., and Nasr,R.
@ MCC, ACA Program
" Efficient Implementation of Lattice Operations "
/ ACM TOPLAS, Vol.11 No.1, Jan.1989, pp.115--146.
> DBDtheory>

\pr ! Ajitomi,N. and Kurose,H.
@ Ricoh Co., Software Res.Ctr, (Tokyo Japan)
" An Enhanced RETE Algorithm for Large Scale Data Access "
/ DASFAA 1, Seoul Korea, Apr.1989, pp.117--124.
= Change forward chaining of RETE to trigger selected nodes for processing
  via 3 message types.
> DBDquery>

\pp ! Akima,Noboru
@ Information-Technology Promotion Agency, SIGMA Project, (Tokyo Japan)
" The SIGMA Project and Database Issues "
/ Database Engineering, Vol.6, 1987, pp.32--36.
> DEng>

\pr ! Akinyokun,O.C., Stocker,P.M., and Borges,M.R.S.
@ Un.East Anglia, Norwich
" Bidirectional mapping between a user-oriented conceptual schema and
  a target logical schema: the ACS "
/ BNCOD 4, Jul.1985; ACM CR 8608-??.
> DBDschema>

\pb ! Akoka,J. 
" Design of Optimal Distributed Database Systems "
/ Distributed Databases, Delobel and Litwin(eds), N-H, 1982.
= considered the problem of database allocation rather than file allocation 
  with a simpler model of transaction execution than Casey and without 
  considering horizontal partitioning.
> DBFmethods.4.4> DBDdist>

\pp ! Akopyan,K.A., Vartapetov,E.A., and Vel'bitskii,I.V.
" Description of a Methodology for the Design of Automated Information
  Systems "
/ Cybernetics, (translation of Kibernetika, Vol.15 No.3, May-Jun.1979),
  Jan.1980.
= Represent objects and processes of the real world, and develop standard
  structures for the storage of data and methods for their processing by
  means of a procedure-independent user language. The advent of the
  R-technology.
> DEng><FASAC 151

\pp ! Akscyn,R., McCracken,D., and Yoder,E.
@ Knowledge Systems, PA
" KMS: a distributed hypermedia system for managing knowlege in organizations "
/ CACM, Vol.31 No.7, Jul.1988; ACM CR 8908--575.
= elaboration of ZOG (CMU); simple model: frames and links; emphasis on the
  user interface; KMS lacks graphic view of the hypertext structure. ---Bolter.
> DBDkb>

\pr ! Akyuerek,S. and Salem,K.
@ Un.Maryland
" Adaptive Block Rearrangement " 
/ IEEE DE 9, Vienna, Apr.1993.
> DBDschema

\bk ! Alagic,Suad
@ Un.Sarajevo (Yugoslavia)
" Relational Database Technology "
/ Springer, 1986, 259pp.
> DBDintro> DBDrel>

\bk ! Alagic,Suad
" Object-Oriented Database Programming "
/ Springer, 1989, 320pp.
> DBDobject><x

\pr ! Alashqur,A.M., Su,S.Y.W., and Lam,H.
@ DSRD, Un.Florida (Gainesville FL)
" OQL: A Query Language for Manipulating Object-Oriented Database "
/ VLDB 15, Amsterdam, Aug.1989.
= Languages for OODB; algebra so that results are structured using the same
  data model.
> DBDobject> DBDquery><DBfile Su 

\pr ! Alashqur,A.M., Su,S.Y., and Lam,H.
@ Un.Florida
" A Rule-based Language for Deductive Object-Oriented Database "
/ IEEE DE 6, Feb.1990.
> DBDquery>

\pp ! Alavi,M.
" An Assessment of the Prototyping Approach to Information Systems 
  Development "
/ CACM, Vol.27 No.6 Jun.1984.
> DBDdesign>

\pr ! Albano,A. and Orisini,R.
" A Prototyping Approach to Database Applications Development "
/ IEEE DB Eng.Bull., Vol.7 No.4, Dec.1984, pp.64--69.
> DBDdesign> DBDschema.5>

\pr ! Albano,A., Giannotti,F., Orsini,R. and Pedreschi,D. 
@ Universita di Pisa, Italy
" Data Types and Objects in Conceptual Modeling "
/ EDSW, Vol.2, Oct.1984.
> DBDobject> DBDkb> 

\pp ! Albano,A., Cardelli,L., and Orisini,R.
" GALILEO: A Strongly Typed, Interactive Conceptual Language "
/ ACM TODS, Vol.10 No.2, Jun.1985, pp.230--260.
/ In 'Readings in Object-Oriented Database Systems" edited by S.Zdonik and
  D.Maier, Morgan Kaufman, 1990.
> DBDdesign> DBDschema.5>

\bk ! Albano,A., deAntonellis,V., and diLeva,A.
" Computer-Aided Database Design: The DATAID Project "
/ 1985.
> DBDdesign.7.5>< QA76.9.D3C66 

\pr ! Albano,A., Ghelli,G., and Orsini,R.
" A Relationship Mechanism for a Strongly Typed Object-Oriented Database
  Programming Language "
/ VLDB 17, Barcelona, Sep.1991.
> DBDobject>

\pr ! Albano,A., Bergamini,R., Ghelli,G., and Orsini,R.
" An Object Data Model with Roles "
/ VLDB 19, Dublin, Aug.1993.
> DBDobject> 

\pr ! Albert,J.
" Algebraic Properites of Bag Data Types "
/ VLDB 17, Barcelona, Sep.1991.
= union and intersection semantics match set semantics, as does boolean
  selection; by defining bag difference complement is defined as well;
  crossproduct and join is not mentioned
> DBDschema> DBDmodel>

\pp ! Albert,T.M.
@ U.S. Geological Survey, Reston VA
" Geoscience Data Management "
/ Computers and Geosciences, Pergamon Press, 1983.
= The volume of USGS data in digital form at this time is the equivalent
  of between 10**10and 10**14 characters. NAS suggests a national geophysical 
  data policy.  Earth Science Information System (ESIS) which is an
  interactive, computerized referral system that contains data about our data.
  The USGS signed an agreement with NBS for Federal earth-science data
  standards in hydrology, geology, geography, and cartography.  Model 204 
  seems to be the most powerful for general scientific work.
> DBappl> DBFrepresent.2><CODMAC

\pp ! Albridge,K.M., Standish,J. and Fries,J.F.
@ Stanford Un., Dep.of Medicine
" Hierarchical Time-Oriented Approaches to Missing Data Inference "
/ CBR, Vol.21 No.4, Aug.1988, pp.349--366
= Temporal
> MIS> DBDstat>

\rp ! Aldred,B.K. and Smedley,B.S.
" An Urban Management System--General Overview "
/ IBM, UK Scientific Ctr, TR.UKSC-53 (Peterlee UK), May.1974.
> DBDrel.2>

\pp ! AlFedaghi,S. and Scheuermann,P.
" Mapping considerations in the design of schemas for the relational model " 
/ IEEE TSE, Vol.7 No.1, Jan.1981.
> DBDrel>

\pp *f! Alford,M.W.
" A Requirements Engineering Methodology for Real-Time Processing 
  Requirements "
/ IEEE TSE, Vol.SE-3 No.1, 1977, pp.60--69.
> DBFuse-2> DBDdesign>

\bk ! Aleksander,Igor (ed)
" Advanced Digital Information Systems "
/ 1985.
> DBFintro><TK7885.A625

\pb ! Aleksandrov,V.V., Alekseyev,A.I., and Gorskiy,N.D.
@ USSR Acad.Sci., Leningrad Sci.Res.Comp.Ctr 
" Compatibility of Data Structures in DBMS and Data Processing Systems (SOD) "
/ Problemno-oriyentirovannyye informatsionnyye sistemy, 1984, Leningrad,
  pp.27--30.
> DBDimpl<FASAC 32a

\pr ! Aleliunas,Romas	
" A Knowledge-Based Subsystem for a Natural Language Interface to a Database 
  that Predicts and Explains Query Failures "
/ IEEE DE 7, 1991.
> DBDnat>

\pr ! Alford,M.
@ TRW
" Derivation of Database/Management Design from System Requirements "
/ IEEE DE 1, Los Angeles, Apr.1984.
> DBDdesign.7.5>

\pr ! AlHajj,R. and Arkun,M.
@ Bilkent University, Turkey
" Queries in Object-Oriented Database Systems "
/ CIKM-92, Baltimore, Nov.1992.
> DBDkb> DBDobject>

\pr ! AlHajj,R. and Arkun,M. 
@ Bilkent Un.
" A Query Model for Object-Oriented Databases " 
/ IEEE DE 9, Vienna, Apr.1993.
> DBDobject>

\pp ! Allchin,J., Keller,A., and Wiederhold,G.
" FLASH: A Language-Independent Portable File Access System "
/ ACM SIGMOD 80, May.1980, pp.151--156.
> DBFindex.4>

\pp 0! Allchin,J.E.
@ Stanford Un., DCS
" Modula and a Question of Time "
/ IEEE TSE, Vol.SE-6 No.4, Jul.1980, pp.390--391.
= Importance of proper management of this abstract concept in real-time
  systems; experience with Modula and suggestion for ADA.
> DBFrealtime> DBFuse-2.1> DBFhybrid.3>

\rp ! Allchin,J.E. and McKendry,M.S.
" Object-based Synchronization and Recovery "
/ GIT Tech.R. 82/15, Sep.1982.
> DBDobject> DBFreliab><DBfile

\pr 0! Allchin,James E.
" A Suite of Algorithms for Maintaining Replicated Data Using Weak Correctness
  Conditions "
/ 3rd Symp. on Reliability in Distributed Software and Database Systems, 1983.
/ Tech.Rep. GIT-ICS-82/18, Georgia Inst.of Tech, Dec.1982.
= Weak is simply less than serializability.  Synchronization sets are local
  logs that guarantee recovery.  Fauve.
> DBDdist> DBDconc> DBDreliab><DBfile

\rp 0! Allchin,J.E.
" An Architecture for Reliable Distributed Systems "
/ PhD Th., Georgia Inst.of Tech, School of Info.and Comp.sci., Sep.1983.
> DBDdist> DBFrepresent>

\pp *f! Allen,A.O. 
" Elements of Queuing Theory for System Design "
/ IBM Sys.J., Vol.14 No.2, 1975, pp.161--187.
/ IBM, G3321-5009, 1975.
= Compact collection of queuing formulae with examples.
> DBFtechn.4> %Allen75

\pp ! Allen,Franklin
@ Un.Penn, Wharton School
" Discovering Personal Probabilities when Utility Functions are Unknown "
/ MS, Vol.33 No.4, Apr.1987, pp.542--544.
= random sampling from a distribution is used to elicit values.
> MIS> DBDutil>

\pp ! Allen,F.W., Loomis,M.E.S., and Mannino,M.V.
" The Integrated dictionary/directory system "
/ ACM C.Surveys, Vol.14 No.2, Jun.1982, pp.245--286.
= A comprehensive survey of dictionary/directory system features with
  examples from commercial systems
> DBFmaint>

\pr ! Allen,J.F.
" An interval-based representation of temporal knowledge "
/ IJCAI, Vancouver BC, 1981, pp.221--226.
> DBDmodel>

\pp d! Allen,James F.
" Maintaining Knowledge about Temporal Intervals "
/ CACM, Vol.21 No.11, Nov.1983, pp.832--843.
= a calculus of convex intervals. Defines operations.
> DBDkb>

\pp ! Allen,J.F.
" Toward a General Model of Action and Time "
/ Artificial Intelligence, Vol.23 No.2, 1984.
> DBDops>

\pr ! Allen,J.R. and Walker,Verdon R. 
@ Management Systems Corp (Salt Lake City UT)
" Data Integrity in the GIANT System "
/ Proc.1973 NCC, AFIPS Vol.42, pp.M60 to M62.
= A short note on key matching in a genealogical data base
> DBFuse-4>

\pr *f! Allen,Roy P. 
@ Fireman's Fund (San Francisco)
" Omnibus, A Large Data Base Management System "
/ Proc.1968 FJCC, AFIPS Vol.33, Thompson Books, pp.157--164.
= Description of large insurance policy filing system, using an indexed seq. 
  org..
> DBFindex.3>  %Allen68

\pp *f! Allen,S.I., Barnett,G.O., and Castleman,P.A. 
" Use of a Time-shared General Purpose File Handling System in Hospital Res. "
/ Proc.IEEE, Vol.54, 1966, pp.1641--1648.
= Early MUMPS paper.
> DBFtrees.5>

\pr f! Allgeyer,K. and Kratzer,K.
" Expert System Based Configuration of VSAM Files "
/ IEEE DE 3, LA, Feb.1987.
> DBFimpl>

\rp ! Allman,Eric, Stonebraker,M., and Held,G.
" Embedding a Relational Data Sublanguage in a General Purpose Programming 
  Language "
/ UCB, Elec.Res.Lab, Memo No.ERL-M564, Oct.1975.
= QUEL language for INGRES in UNIX-C.
> DBDrel.2><xUC>

\pp 0! Allman,E. and Stonebraker,M.
@ UCB
" Observations on the Evolution of a Software System "
/ IEEE Computer, Jun.1982, pp.27--32.
= INGRES encompasses about 75,000 lines of code in 'C' and runs on Unix. Over 
  the past six years, Ingres has evolved into a functionally complete and 
  usable prototype.  Development required 25 to 30 programmer-years by a total
  of 19 people and the system is now in use at over 125 sites around the world.
> DBDrel.2>

\pr ! Almarode,J. and Anderson,T.L.
@ Servio Logic Corp, Beaverton, OR
" EasyObjects Designer: A Tool for Object-Oriented Database Design "
/ DS4, Jul.1990, Windermere.
= a window-based, graphical schema editor for Gemstone
= rules for enforcing correctness of schema models and evolution
  (see Kim et al TOIS paper)
> DBDdesign> DBDobject>

\pr ! Alonso,R., Barbara,D., Cordon,R., GarciaMolina,H., Kent,J.,
  and Pitelli,F.
" Distributed Database Research at Princeton "
/ IEEE DB Eng.Bull.,Vol.8 No.2, Jun.1985, pp.68--75.
> DBDdist>

\pp ! Alonso,R., GarciaMolina,H., and Salem,K.
@ Princeton Un., CSD
" Concurrency Control and Recovery for Global Procedures in Federated
  Database Systems "
/ Database Engineering, Vol.6, 1987, pp.129--135.
/ IEEE DB Eng.Bull., Vol.10 No.3, Sep.1987, pp.5--11.
> DBDintegrity> DBDdist>

\pb ! Alonso,R., Barbara,D., GarciaMolina,H., and Abad,S.
" Quasi-copies: Efficient data sharing for information retrieval systems "
/ in J.W. Schmidt, S. Ceri, and M. Missikoff, editors, Advances in
  Database Technology EDBT in Springer LNCS, No.303, Mar,1988. 
/ Princeton Un., CS-TR-101-87, Sep.1987.
= FAUVE replication at local sites.
> DBDbiblio> DBDperf> DBDdist><DBfile

\pr ! Alonso,R. and Barbara,D.
" Negotiating Data Access in Federated Database Systems "
/ IEEE DE 5, Los Angeles, Feb.1989.
> DBDdist>

\pb ! Alonso,R., Barbara,D., and Cova,L.L.
@ Princeton Un., CSD
" Data Sharing in Large Heterogeneous Information Networks "
/ in Yu(ed) 1989 Workshop on heterogenous databases, Dec.1989.
= Federated architecture sketched includes a Resource Discovery Manager,
  a Negotiation Manager and a Bookkeeper.
> DBDdist>

\pr ! Alonso,R. and Cova,L.
@ Princeton; Florida Int.Un.
" Managing Replicated Copies in Very Large Distributed Systems "
/ IEEE Workshop on the Management of Replicated Data, Houston, Nov.1990.
= quasi-copies; specification example
> DBDdist>

\pp ! Alonso,R., Barbara,D., and GarciaMolina,H.
" Data caching issues in an information retrieval system "
/ ACM TODS, Vol.15 No.3, Sep.1990.
= focus: cache coherency in distributed information retrieval systems
  one central server site, data cached at client site.  Less response time, but
  more overhead in maintaining multiple copies.
  To reduce overhead, allow copies to diverge in a controlled fashion - notion
  of "quasi copies" and quasi-caching.
  - users can precisely define limits for divergence of quasi-copies.
  - reduces update propagation overhead
  - main difference with materialized views is that here user can establish 
    degree of coherency
  - implementation possibilities: invalidate/refresh out-of-date data, include
    automatic expiration date etc.   Paper surveys various implementation
    strategies and their tradeoffs.
  users give two types of conditions on quasi-caches: selection and coherency.
  - selection conditions specify which object images will be cached at the
    user site.
    - modifiers: 
      - Add/drop (add to cache or remove)
      - compulsory or advisory (whether caching is to be enforced or to be
        taken as a hint)
        - query optimizer can take advantage if caching is compulsory
        - advisory selection gives greater system flexibility
      - static / dynamic ( static => objects selected once when the condition
        is issued by a user, dynamic => changes in data cause objects to be
	added/dropped dynamically).      
  - triggering delay: specifies acceptable delay for dynamic selections
  - coherency conditions define the allowable deviations between an object and
    its images.  
    - default: image must have a valid value (though out-of-date)
    - delay: how much time an image may lag behind an object
    - version: acceptable lag of how many versions 
    - periodic: image to be refreshed periodically
    - arithmetic: deviations limited by the difference between the values of
      the object and its image. 
    - can also have inter-object consistency constraints.
  implementation issues
  - transmission delays and failures: "null" messages sent out by central site 
    to check if client is alive etc.
  - what to propagate:
    - data message: contains new values to overwrite old ones in cache
    - invalidation message: only identifies invalid object to be purged from
      the cache, but does not contain new values. 
    - version number message: provides new version numbers only - no new data
    - implicit invalidation: no message from central site, cache images
      automatically invalidated after a certain time.
  - when to propagate:  
    - last minute: delayed until a selection/coherency condition is about to be
                   violated. 
    - immediately: as soon as updates occur
    - delayed update at central site, so no cache conditions are violated.
  - collapsing conditions:
    - possible to collapse several coherency conditions on same object into one
  - load balancing: central site can partially off-load enforcement of
    consistency to clients
  describes a probabilistic performance model and simulation results
  - simulation parameters are network traffic, query processing time, update
    installation time etc. 
  conclusions:
  - quasi-caching can potetially improve performance and availability
  - problems if:
    - selection and consistency constraints are complex
    - large number of updates at central site
  - open issues:
    - how much data to cache
    - how does choice of when to propagate updates affect performance  etc.
= I3
> DBDbiblio> DBDperf>

\pr ! Alonso,Rafael	
" Data Sharing in a Large Heterogeneous Environment "
/ IEEE DE 7, 1991.
> DBDdist>

\pr ! Alonso,R. and Tal,A.
" Dealing with Failures in Heterogeneous Databases "
/ IMS-91, Kyoto, Apr.1991.
> DBDdist>

\pr ! Alonso,R., Haber,E., and Korth,H.
@ Matsushita Information Technology Laboratory
" A Mobile Computer Interface for Heterogeneous Databases "
/ IEEE RIDE-IMS 93, Vienna, Apr.1993.
> DBDdist> 

\pp ! Alonzo
" He's his own Grandpa "
/ record, 1948
= counterexample to Gardarin 87.
> DBDmodel>
  
\pp ! Alsberg,P.A.
@ Un.Illinois, Ctr for Advanced Computation (Urbana-Champaign)
" Space and Time Savings through Large Data Base Compression and
  Dynamic Restructuring"
/ Proc.IEEE, Vol.63 No.8, Hoagland(ed), Aug.1975, pp.1114--1122.
> DBFeval.4> DBFrepresent-4><Shel

\rp ! Alsberg,P.A., Belford,G.G., Day,J.D., and Grapa,E.
" Multi-copy Resiliency Techniques "
/ Un.Illinois, Ctr for Advanced Computation, Urbana-Champaign, May.1976.
> DBDdist> DBDtrans.4>

\pr ! Alsberg,P.A. and Day,J.D.
@ Un.Illinois, Ctr for Advanced Computation (Urbana-Champaign)
" A Principle for Resilient Sharing of Distributed Resources "
/ 2nd International Conf. on Software Eng., San Francisco, 1976, pp.562--570.
= A technique is presented which permits distributed resources to be
  shared in a resilient manner.	 One of the hosts is declared a priori
  the primary and the others the backups.
> DBFeval.4> DBDintegrity.1> DBDdist><Shel x2, filebox

\pp 0! AlSuwaiyel,M. and Horowitz,E.
@ UCLA
" Algorithms for Trie Compaction "
/ ACM TODS, Vol.9 No.2, Jun.1984, pp.243--263.
> DBFimpl.2.2><DBfile

\pb 0! Alter,S.
" A Taxonomy of Decision Support Systems "
/ Management Information Systems, Riley(ed), 1981, pp.26--35. 
= with a recent bibliography by Riley,M.J. 
> DBappl>

\pr ! Altman,E.B., Astrahan,M.M., Fehder,P. L., and Senko,M.E. 
@ IBM
" Specifications in a Data Independent Accessing Model " and
" Concepts of a Data Independent Architecture Model "
/ ACM SIGFIDET 1972, Dean(ed), pp.363--382.
= An integrated description for schema entries (A-strings), 
  rings (E-strings), and indexes (L-strings)
> DBDschema>

\pr ! Altshuler,Gene and Plagman,Bernard 
@ SRI; Federal Reserve Bank of NY (NY)
" User/System Interface within the Context of an Integrated Corporate Data 
  Base "
/ Proc.1974 NCC, AFIPS Vol.43, pp.27--33.
= Review of user-system interface requirements.
> DBDschema>

\rp ! Alvey (chairman British committee)
" A Programme for Advanced Information Technology " 
/ 1982.
> DBDkb><HD9696.C63G76

\rp ! Aly,H. and Ozsoyoglu,Z.M.
@ Case Western Reserve Un.
" Non-deterministic Modelling of Logical Queries in Deductive Databases "
/ ACM SIGMOD 87, May.1987.
> DBDlogic>

\pr ! Aly,H. and Ozsoyoglu,Z.M.
" Synchronized Counting Method "
/ IEEE DE 5, Los Angeles, Feb.1989.
> DBDlogic>

\pp ! AlZobaidie,A. and Grimson,J.B.
" An Expert Clinical Database "
/ Medinfo, 1986.
> MIS><DBfile 


%  ------ AM ------biblio------recent-------

\pp ! Amano,K. and Mochida,A.
@ Hokkaido Un. Comp. Ctr, Sapporo, Japan
" A Supporting System for Effective Construction and Sharing of Scientific
  Databases by General Researchers " 
/ Inf. Process. Manage., Vol.21 No.6, Dec.1985, pp.535--544; ACM CR 8610-0935.
= ORION and ADABAS and a supporting system called COMDBS.
> DBappl>

\pp ! Amarel,Saul
" Panel discussion on machine learning "
/ Proc. 2nd  Internat.Machine Learning Workshop, Michalski et al. (eds.), 1983.
> DBDkb>

\pr ! Amato,G., Giannotti,F., and Mainetto,G.
" Data Sharing Analysis for a Database Programming Language via Abstract 
  Interpretation "
/ VLDB 19, Dublin, Aug.1993.
> DBDlang>

\pp f6! Amble,O. and Knuth,D.E. 
" Ordered Hash Tables "
/ Computer J., Vol.17 No.2, Feb.1974, pp.135--142.
> DBDdesign.7.5>

\pp ! Ambrosetti,R., Ciriani,T.A., and Pennacchi,R.
@ IBM, Rome
" An Application Analyzer "
/ IBM Sys.J., Vol.23 No.4, Dec.1984, pp.336--350.
= Interactive design using APAX. Lists all functions.
> DBappl> DBDquery.3>

\pr ! Amdahl,Gene M.
@ IBM, Sunnyvale CA
" Validity of the Single Processor Approach to Achieving Large Scale
  Computing Capabilities "
/ SJCC, 1967, pp.483--485.
> DBFdist><DBfile

\pr ! Amer,H.H. and McCluskey,E.J.
" Modeling the Effect of the Chip Failures and Cache Memory Systems "
/ IEEE DE 3, Los Angeles, Feb.1987.
> DBDreliab>

\mn ! American National Standards Inst.
" Guide for the Development, Implementation, and Maintenance
  of Standards for the Reorganization of Computer Processed Data Elements "
/ Management of Data Elements in Inf. Processing,
  NBS, COM74-100700, Apr.1974, pp.355--418
= Comprehensive guide to coding with bibliography and associated papers.
> DBFrepresent><x14 book>

\rp ! Ames,Kathy R.
" A Relational Approach to the Development of Expert Diagnostic Systems "
/ NASA Tech.Memo No.86288, Oct.1984.
= Application is robot jaw. The `Relational Knowledge-Base Machine'(RKBM) is 
  a LISP database in relational form to model structure and function. Error
  conditions are enumerated.
> DBDkb> EIS><DBfile

\pp ! Amikam,A.
@ Un.Queensland (St.Lucia, Australia 4067)
" On the Automatic Generationof Optimal Internal Schemata "
/ Inf.Sys., Vol.10 No.1, 1985, pp.37--45.
= A method for deriving automatically the optimal Internal Schema from the
  Conceptual and External Schemata.  Many assumptions.
> DBDdesign><x issue

\pp ! Amir,A. and Roussopoulos,N.
" Optimal View Caching "
/ Inf.Sys, Vol.15 No.2, 1990.
> DBDdist><DBfile Roussopoulos

\pr ! Ammann,A.C., Hanrahan,M., and Krishnamurthy,R.
" Design of a Memory Resident Database Management System "
/ Proc. IEEE COMPCON, 1985, pp.54--57.
> DBDnewDBMS>

\pp ff! Ammon,G.J., Calabria,J.A., and Thomas,D.T.
@ RCA, NASA
" A High-Speed, Large Capacity, `Jukebox' Optical Disk System "
/ IEEE Computer, Vol.18 No.7, Jul.1985, pp.36--45.
> DBFhard>

\pr ! An,H. and	Henschen,L.
@ Northwestern Un.
" Knowledge based semantic query optimization "
/ ISMIS-91, Charlotte, NC, Oct.1991.
= precompiling integrity contraints and gathering information
> DBDquery>

\pr ! Analyti,A. and Pramanik,S.
" Fast Search in Main Memory Databases "
/ ACM SIGMOD 92, San Diego, Jun.1992.
> DBFhard>

\rp ! Anand,J., et al.
@ NPGS
" A Res.R. on the Laboratory for Database Systems Research: Past,
  Present and Future "
/ NPGS, TR-NPS52-86-013, May.1986.
> DBFarchitecture><DBfile Hsiao

\pr ! Ananthanarayanan,R., et al.
" Using the Coexistence Approach to Achieve Combined Functionality of 
  Object-Oriented and Relational Systems "
/ ACM SIGMOD 93, Washington,DC, May.1993.
> DBDobject> DBDrel>

\pr ! Andany,J., Leonard,M., and Palisser,C.
" Management of Schema Evolution in Data Bases "
/ VLDB 17, Barcelona, Sep.1991.
= handled with revision notions; defines contexts similar to views
> DBDschema>

\pp **f! Anderson,H.D. and Berra,P.B.
" Minimum Cost Selection of Secondary Indexes for Formatted Files"
/ ACM TODS, Vol.2 No.1, Mar.1977, pp.68--90.
> DBFindex.4> DBDdesign>

\pp ! Anderson,Jerome, Donaghy,Donald A., and Young,Howard W. 
" Controlling Errors in Timesharing "
/ Software Age, Jun.1969, pp.8--16
= Description of error logging for TSS 360/67.
> DBDtrans.4><xB11>

\pr ! Anderson,N.D. and Burkhard,W.A.
@ UCSD
" MINI SEQUEL -- Relational Data Management System "
/ Databases, Shneiderman(ed), Academic, Aug.1978, pp.57--76.
> DBDrel.2>

\pp ! Anderson,R.E. and Fagerlund,Ed 
@ Un.Minnesota
" Privacy and the Computer; An Annotated Bibliography "
/ ACM CR, Nov.1972, pp.551--559.
= Well annotated bibliography, much from literature not commonly accessed by 
  computer professionals "
> DBDprivacy>

\pp **! Anderson,T., Lee,P.A., and Shrivastava,S.K.
@ Un.Newcastle upon Tyne, Computing Lab (England)
" A Model of Recoverability in Multilevel Systems "
/ IEEE TSE, Vol.SE-4 No.6, Nov.1978, pp.486-494.
= Backward error recovery can be complex, discusses two distinct
  categories of multilevel system, and issues involved.
> DBFuse-4.4>

\rp ! Anderson,T.L.
@ Un.Washington
" The Database Semantics of Time "
/ Un.Washington, PhD Th., Jan.1981.
= temporal.
> DBDmodel> DBDschema.2> DBFhard.1.4>

\pb ! Anderson,T.L.
" Modeling Time at the Conceptual Level "
/ `Improving Database Usability and Responsiveness', Shneiderman,
  Academic, 1982, pp.273--297.
/ Burroughs, Austin Res.Ctr, TR., 1982.
= temporal integrity maintenance.
> DBDnewDBMS> DBDintegrity> DBDmodel>

\wp ! Anderson,T.L., Ecklund,E.F.Jr., and Maier,D.
@ Tektronix Inc., Computer Res.Lab.
" PROTEUS: Objectifying the DBMS User Interface "
/ Rcvd. Aug.1986.
= All components are objects, schemes, commands, representations, display 
  formats, etc... Now the database manages all information, the object 
  represenations can be changed via database updates, and the representations 
  mappings can be expressed as database commands or rules.
> EIS> DBDobject><DBfile

\pb ! Anderson,T.L., Ohkawa,H., Gjovaag,J., Maier,D., and Shulman,S.
@ Servio Logic Development Corp
" Representing CSG Solids Using a Logic-Based Object Data Model "
/ 'Visual Database Systems', T.L.Kunii(ed), Proc. IFIP TC-2.6, Tokyo
  Apr.1989, N-H 1989, pp.183--216.
= Composed of planes, spheres, double cones, cylinders, torus. Objects have
  types. Views, constraints. Composition uses reference axes and points.
  TEDM, Tektronix Engineering Model.
> EIS> DBDimage> DBDobject> VOD>

\pp ! Anderson,T.Lougenia
@ Servio Logic Corp.
" The Tektronix Engineering Database Benchmark "
/ ACM SIGMOD RECORD, Vol.18 No.2, Jun.1989, pp.2.
/ ACM SIGMOD 89, (Portland OR), May.-Jun.1989.
= Panel on DB System Performance Metrics. Includes nested objects, recursion,
  and  complex operations, such as text and bitmap editing.
> DBDperf>

\pr ! Andersson,M. et al.
@ Lausanne
" The FEMUS Approach in Building a Federated Multilingual Database System "
/ IEEE RIDE-IMS 93, Vienna, Apr.1993.
> DBDdist>

\pr 0*f! Andler,S., et al.
" System-D Distributed System for Availability " 
/ VLDB 8, McLeod and Villasenor(eds), Mexico City, 1982, pp.33--44.
/ IBM, Res.R. RJ3313, Nov.1981.
= SYSTEM D is an experimental research vehicle prototyped on a local 
  network. It provides high availability by diagnosing and taking corrective
  actions against software-induced crashes, the two-phase Direct
  Commit protocols require fewer messages and I-Os than conventional
  two-phase commit protocols, datagram-based communications architecture,
  and a modular storage system.
> DBDtrans-4> DBDdist>

\pp ! Andon,F.I., Kuksa,A.I., and Polyachenko,B.E.
" Efficient Implementation of a Class of Data-linked Programs "
/ PCS, Vol.6 No.3, May.-Jun.1980, pp.153--159.
> DBDimpl><FASAC 311

\pp ! Andon,F.I., Maryanchik,A.M., et al.
" Basic Propositions and Architecture of Relational Data Manipulation
  System "
/ CSM, Kiev, No.2, Feb.1986, pp.195--206.
= Relational Algebra for OKA.
> DBDrel> DBDlang><FASAC 203d<FASAC 78 page 195

\rp 0! Andrade,J.M.
@ l'Institut National Polytechnique (Grenoble, France)
" L'Integrite et la Mise a Jour dans un Systeme de Gestion de 
  Bases de Donnees Reparties "
/ PhD Th., INP, Projet Polypheme, Nov.1980.
> DBDintegrity> DBDdist>

\pp 0! Andre,E. and Bogo,G.
" Ada, Abstract Datatype, Distributed Database Transaction "
/ Proc.of IEEE-COMPSAC, Chicago, Oct.1980, pp.33--79.
> DBDdist> DBDlang><Shel

\bk ! Andre,F. et al
@ CORNAFION Group (France)
" Distributed Computing Systems "
/ N-H, 1986, 344pp.; translation from French source 1981.
= Transactions. Weak consistency: After bounded time all copies become 
  identical.
> DBDdist>

\pp ! Andreassen,A.A., Leighton III,W.J. and Schreiber,D.F.
@ ATT Federal Systems Division, (Washington DC)
" Information Security: An Overview "
/ AT&T Tech.Journal, Vol.67 No.3, May.-Jun.1988, pp.2--8.
= Special issue on security, focusing on networks and access.
> DBFsecurity>

\rp ! Andrews,Fred et al.
@ Board on Telecommunications and Computer Applications, NRC
" Crossroads of Information Technology Standards "
/ National Academy Press, 1990.
= includes review of Japanese and European processes; recommendation:
  the director of the Office of Science and Technology Policy should
  arrange for an ad hoc blue-ribbon study by top-level people from industry
  and government to establish a vision and high-level architecture for
  an information technology infrastructure.
> DBFintro><DBfile

\pp ! Andrews,R. and Beauchamp,C.
" A Clinical Database Management System for Improved Integration of the
  Veterans Affairs Hospital Information System "
/ JMS, Vol.13 No.6, Dec.1989.
= data from separate ancillary services are difficult to integrate and 
  hence partially replicated, although the DHCP is very integrated
  operating on the same system hardware and language (MUMPS)
> MIS> HIS>

\pr ! Andrews,Robert
@ VA Information Systems Center, Salt Lake City
" A Common Data Structure for Complex Clinical Data "
/ MUMPS Users Group Meeting, 1990.
= model for querying multiple types of federated databases
> DBDdist> MIS>

\pr ! Andrews,T. and Harris,C.
" Combining Language and Database Advances in an Object-Oriented Development
  Environment "
/ OOPSLA 87.
/ In 'Readings in Object-Oriented Database Systems" edited by S.Zdonik and
  D.Maier, Morgan Kaufman, 1990.
= A brief overview of VBASE. The schema definition language is block structured
  support for one-to-one, one-to-many, and many-to-many relationships. Provides
  an inverse mechanism, the ability to cluster objects and support for
  triggers and multiple inheritance.
> DBDobject> VOD>

\rp ! Andrews.T.
@ Ontologic
" Vbase Integrated Object System: Functional Specification "
/ Ontologic, Nov.1986.
> DBDobject><DBfile

\rp ! Andrews.T.
@ Ontologic
" Vbase Integrated Object System: Technical Overview "
/ Ontologic, Mar.1987.
> DBDobject><DBfile

\pp ! Angell,T. and Randell,T.M. 
@ Computer and Control Company
" Generalized Data Management Systems "
/ IEEE Computer Group News Nov.1969, pp.5--12.
= Concise summary of objectives and existing file systems.
> DBFseq>

\pr ! Annevelink,J.
@ HP
" Database Programming Languages: A Functional Approach "
/ ACM SIGMOD 91, Boulder, May.1991.
> DBDlang>

\pp ! Anonymous et al
" A Measure of Transaction Processing Power "
/ Datamation, Vol.31 No.7, Apr.1985, pp.112--118.
= Benchmarks and their performance on typical but unnamed systems.
= et al includes Jim Gray, Dina Bitton, Stefano Ceri, Bruce Lindsay, Dieter 
  Gawlick, 
> DBFtrans.7.5>

\pr ! Ansari,M., Ness,L., Rusinkiewicz,M., and Sheth,A.
" Using Flexible Transactions to Support Multi-System Telecommunication
  Applications "
/ VLDB 18, Vancouver, Aug.1992.
> DBDdist>

\mn f! ANSI
" Medium and System-independent File and Data Record Formats for Information 
  Interchange "
/ ANSI-ISO Standard 8211-1985, ANSI, New York, 1982
> DBFrepresent>

\mn ! ANSI
" American National Standard Database Language SQL "
/ ANSI X3H2,.135, ANSI, NY, 1984, 1986.
= The FIPS specifications for the SQL database language 
> DBFmaint> DBDrel>

\mn ! ANSI
" American National Standard information resource dictionary system: 
  Part 1-- Core Standard "
/ ANSI X3H4, ANSI, NY, 1985.
= The FIPS specifications for the core system-standard schema "
> DBFmaint>

\mn ! ANSI
" American National Standard information resource dictionary system:
  Part 2-- Entity-level security "
/ ANSI X3H4, ANSI, NY, 1985.
= The FIPS specifications for the entity level security module "
> DBFmaint>

\mn ! ANSI
" American National Standard information resource dictionary system:
  Part 3-- Application program interface "
/ ANSI X3H4, ANSI, NY, 1985.
= The FIPS specifications for the application program interface module.
> DBFmaint>

\mn ! ANSI
" American National Standard information resource dictionary system:
  Part 4-- Support of standard data models "
/ ANSI X3H4, ANSI, NY, 1985.
= The FIPS specifications for the data model support module
> DBFmaint>

\mn ! ANSI
" Specification for a Data Descriptive File for Information Interchange "
/ ANSI ISO TC 97, NY, 1986.
= Specifications for moving data among computers.
> DBFmaint>

\mn d! ANSI
" Database Language -- SQL "
/ ANSI X3.135, CBEMA, Oct.1986.
= Specifications for SQL-DDL and SQL-DML, at two levels. Annex on embedding 
  in host languages.
> DBDrel><x

\mn ! ANSI
" Representation of Geographic Point Locations "
/ ANSI, 1986.
= ANSI standard X3.61-1986.
> Image>

\pp ! Antonacci,F., Russo,M., Pazienza,M., and Velardi,P.
" A System for Text Analysis and Lexical Knowledge Acquisition "
/ DKE, Vol.4 No.1, 1989.
= Full coverage over the 5000 press agency releases with about 100,000
  different words; the parser can analyze 80 percent of the sentences;
  lexicon has 10,000 elementary lemmata and the grammar 100 rules.
> DBDnat>

\pr ! Antoshenkov,G.
" Random Sampling from Pseudo-Ranked B+ Trees "
/ VLDB 18, Vancouver, Aug.1992.
= for auditing or quality control; efficient sampling by using low-level
  access with 50% acceptance rate
> DBFindex>

\pr ! Antoshenkov,Gennady
@ DEC
" Dynamic Optimization in RDB/VMS "
/ IEEE DE 9, Vienna, Apr.1993.
> DEng>

\pr ! Anwar,T., Beck,H. and Navathe,S.
@ Georgia Inst of Tech 
" Imprecise Querying in Classification Systems " 
/ IEEE DE 8, Tempe, AZ, Feb.1992.
> DBDquery>

\pr ! Anwar,E., Maugis,L., and Chakravarthy,S.
" A New Perspective on Rule Support for Object-Oriented Databases "
/ ACM SIGMOD 93, Washington,DC, May.1993.
> DBDobject>

\pp ! Anyanwu,J.A.
@ Un.Newcastle (UK)
" A reliable stable storage system for UNIX "
/ SPE, Vol.15 No.10, Oct.1985, pp.973--990; ACM CR 8605-??.
> DBFreliab>

\pp ! Anyanwu,J.A. and Marshall,L.F.
@ Un.Newcastle (UK)
" A crash resistant UNIX file system "
/ SPE, Vol.16 No.2, Feb.1986 8609-??.
= Information is replicated on disks and the kernel is modified.
> DBFreliab>

\pp *f! Anzelmo,Frank D. 
@ Chemical Abstracts
" A Data Format for Information System Files "
/ IEEE TC, Jan.1971, Vol.C20, pp.39--43.
= Application Description
> DBFhybrid> %Anzelmo71

\pb ! Aonuma,H., Imai,H., and Kambayashi,Y.
@ Kyushu Un., DCS and Communication Eng.
" A Visual System of Placing Characters Appropriately in Multimedia Map
  Databases "
/ 'Visual Database Systems', T.L.Kunii(ed), Proc. IFIP TC 2-6, Tokyo
  Apr.1989, N-H 1989, pp.525--546.
= Very nice work on output generation. Consider type, scale, density in label
  placement of geographical output.
> DBDquery> DBDimage>

\pr ! Apers,P.M.G.
" Distributed Query Processing with Inverted File Organization "
/ IR 43, Dec.1978, VU (Amsterdam).
> DBDdist>

\pr ! Apers,P.M.G.
" Distributed Query Processing: Minimum Response Time Schedules for Relations "
/ IR 50, Mar.1979, VU (Amsterdam).
> DBDdist>

\pr ! Apers,P.M.G.
" Critique on and Improvement of Hevner and Yao's Distributed Query 
  Processing Algorithm "
/ VU, TR.48, VU, Feb.1979 (Amsterdam).
> DBDdist>

\pp 0! Apers,P.M.G.
@ VU (Amsterdam)
" Data Allocation and Distributed Query Processing "
/ ACM Pacific '80, San Francisco, Nov.1980, pp.48--54.
> DBDquery.2> DBDbound.5>

\pr 0f! Apers,Peter M.G.
" Centralized or Decentralized Data Allocation "
/ ISDDSS 1, vandeRiet and Litwin(eds.) (Amsterdam), Jun.1981, pp.101--116.
> DBDdist>

\pr 0! Apers,Peter M.G.
" Redundant Allocation of Relations in a Communication Network "
/ Berkeley 5, San Francisco, Feb.1981, pp.245--258.
> DBDdist>

\rp 0! Apers,P.M.G.
@ VU (Amsterdam)
" Query Processing and Data Allocation in Distributed Database Systems "
/ PhD Th., Mathematical Centrum, Amsterdam, Sep.1982
> DBDdist> DBDrel.2> DBFsyseval.4><Thesis shelf

\pp 0! Apers,P.M.G., Hevner,A.R., and Yao,S.B.
@ VU; Un.Maryland
" Optimization Algorithms for Distributed Queries "
/ IEEE TSE, Vol.SE-9 No.1, Jan.1983, pp.57--68.
> DBDdist> DBDquery.2>

\rp 0! Apers,P.M.G.
" Minimizing the Response Time of a Query in a Distributed Database "
/ VU (Amsterdam), Dec.1983.
> DBDdist><x

\pr 0! Apers,P.M.G. and Jockin,N.
" The Usage of Simulation in Distributed Databases "
/ VU (Amsterdam), Dec.1983.
> DBDdist> DBFmethods>

\rp 0! Apers,P.M.G. and Wiederhold,G.
" How to Survive a Network Partition "
/ Stanford CSD, Stan-CS-85-1053, Apr.1984.
= approach to maximixe transaction processing in partitioned networks.
> DBFrepresent> DBDdist>

\pr ! Apers,P.M.G. and Wiederhold,Gio
" Expert Database System in a Loosely Coupled Environment "
/ EDSW, Vol.2, Kiawah Island SC, Oct.1984, pp.611--617.
> DBDdist> DBDdesign>

\pr f! Apers,P.M.G. and Wiederhold,G.
" Transaction Handling in a Loosely Coupled Environment "
/ Proc.ACM-ICS Conf.1985, Florence, Italy: `Computing 85, A Broad Perspective
  of Current Developments' Bucci and Valle(eds), pp.25--36, N-H 1985.
> DBDdist> DBFhard.7.5>

\pr ! Apers,P.M.G., Houtsma,M.A.W., and Brandse,F.
" Extending a relational interface with recursion "
/ Proc. 6h Advanced Database Symposium, Aug.1986.
/ Memo Un.Twente INF-86-10, 1986
= closure joins
> DBDops><DBfile Houtsma

\pr ! Apers,Peter M.G.
@ Vrije Un., The Netherlands
" Geavanceerde Informatiesystemen "
/ Un.Twente, Oct.1986.
= Survey of Advanced Information Systems: Alice in Wonder informatics land 
> DBDintro><DBfile

\pp ! Apers,Peter M.G.
" Data Allocation in Distributed Database Systems "
/ ACM TODS, Vol.13 No.3, Sep.1988, pp.263--304; ACM CR 8904-0252.
= Fragments are allocated. The strength of the paper is its rigor, the
  weakness is in the applicability of the model. ---Tufts.
> DBFdist>

\bk ! Appelrath,Hans-Juergen
@ ETH Zuerich, now Un.Oldenburg (FRG)
" Von Datenbanken zu Expertensystemen " in German.
/ Springer Informatik Fachberichte 102, 1985.
/ PhD Th., Un.Dortmund, 1983.
= DEDUDAB, extends DML and accesses UNIX INGRES through pipes. Tests on
  a small Parts  (43 tuples) and larger Family demo (up to 9600 tuples). 
  With inferences up to length 2 reports times from 23s to 7h (for ancestor) 
  on DEC PDP11/60. Increases in time appear to be O(nlogn). Effect of 
  interference was small (15pct).  Surveys Minker's MRPPS, Chang's DEDUCE.
> DBDkb> KSYS>

\pp ! Appleton,Daniel S.
" The Technology of Data Integration "
/ Datamation, Vol.31 No.21, Nov.1985, pp.106--116.
= How to share data among heterogeneous applications
> DBDdesign>

\pp ! Appleton,D.S.
@ DACOM (Manhattan Beach CA)
" Business Rules: the Missing Link "
/ Datamation, Vol.30 No.16, 15Oct.1984, pp.145--150.
= semantic database constraints define the business policies.
> DBDtheory.2>

\pp ! Appleton,Daniel S.
" Rule-based Data Resource Management "
/ Datamation, Vol.32 No.9, May.1986, pp.86--99.
= identifies 4 layers: Database architecture, business rules, conceptual 
  schema, internal schemas.
> DBDkb> DBftrans>

\rp ! Apt,K.R., Blair,H., and Walker,A. 
@ IBM, TJWRC 
" Towards a Theory of Declarative Knowledge "
= This talks about 'stratified negation', as in NAIL!, where negated terms 
  may not be connected recursively to the rule head. ---Ullman
> DBDlogic> DBDkb><DBfile Walker

\pr ! Apt,K. and Pugin,J-M.
@ Ecole Normal Superieure and BULL
" Maintenance of Stratified Databases Viewed as a Belief Revision System "
/ ACM PODS, San Diego, Mar.1987.
/ Un.Texas, TR-87-41, rcvd.Nov.1987.
= They discuss maintaining the `perfect model' of a stratified DB
  in instantiated form, while updates are made to the EDB. ---jdu
> DBDlogic> DBDtheory>

\wp ! Apt,Krzysztof R.
@ Ctr.for Mathematics and CS, Amsterdam and Un.Texas at Austin, DCS
" Efficient Computing of Least Fixpoints in Deductive Databases "
/ 1989.
> DBDkb><DBfile

\pb ! Arapis,C. and Kappel,G.
" Organizing objects in an object software base "
/ In: Active Object Environments (Ed. by D. Tsichritzis), 1988.
> DEng> DBDobject>
 
\pp ! Arbadi,A.E. and Toueg,S.
@ UCSB
" Maintaining availability in partitioned replicated databases "
/ ACM TODS, Vol.14 No.2, Jun.1989, 64.264--290; ACM CR 8911-0827.
= accessing data in spite of site failures and network partioning
> DBDdist> DBDreliab>

\rp ! Arbanel,R.M. and Williams,M.D.
@ Intellicorp
" A Relational Representation for Knowledge Bases "
/ presented at EDBS-2, Oct.1985
= Kee storage, each slot is a value. Due to multiple inheritance too many 
  relations are needed in normalized form. Shows infeasibilty of this scheme.
> DBDkb><DBfile

\pp **f! Arden, Bruce W.(ed).
" Interactive Computer Systems "
/ IEEE Proc., Vol.63 No.6, Jun.1975, pp.883--979.
> DBFuse-2>

\pr *! Arditi,J. and Zukovsky,E.
@ Weizmann Inst.Science (Rehovot, Israel)
" An Authorization Mechanism for a Data-Base "
/ Databases, Shneiderman(ed), Academic, Aug.1978, pp.193--213.
= A schema oriented model, avoids use of a database administrator.
> DBDprivacy.2> DBDadmin>

\pr ! Aref,W.G. and Samet,H
" Optimization Strategies for Spatial Query Processing "
/ VLDB 17, Barcelona, Sep.1991.
= in SAND (Spatial and Non-Spatial Data) objects' spatial information is
  stored in separate spatial data structures and their non-spatial information
  is stored in database relations maintaining links
> DBDimage>

\rp ! Arens,Gail
" Recovery of the SWALLOW Repository "
/ SM TH., MIT LCS TR.252, Jan.1981.
> DBDdist> DBFrepresent-3>

\pr ! Arens,Y. and Knoblock,C.
@ USC/ISI
" Planning and Reformulating Queries for Semantically Modeled Multidatabase 
  Systems "
/ CIKM-92, Baltimore, Nov.1992.
= Description of the planning and reformulation components of of the SIMS
  systems, which enable it to translate a query in the Loom knowledge
  representation language into a retrieval plan consisting of database and
  knowledge base queries to multiple heterogeneous information sources.
= I3
> DBDdist> DBDkb>

\pr ! Arens,Y., Chee,C.Y., Hsu,C.-N., and Knoblock,C.A.
@ USC/ISI
" Retrieving and Integrating Data from Multiple Information Sources "
/ International Journal of Intelligent and Cooperative Information 
  Systems, Vol. 2 No. 2, to appear Jun.1993.
= Description of the SIMS system for retrieval of information from
  multiple databases and knowledge bases.  SIMS uses AI knowledge 
  representation and planning techniques to describe the contents of the
  information sources, enable uniform querying independent of the
  distribution of the requested information, and plan the series of
  queries that will obtain it.  This paper provides a detailed description
  of the SIMS system and the existing prototype, including its learning,
  reformulation and interface components.
= I3
> DBDdist> DBDkb>

\pb ! Argyris,C.
" Management Information Systems:  The Challenge to Rationality and 
  Emotionality "
/ MIS in Action, Murdick(ed), 1975, pp.107--129. 
/ Management Science, Feb.1971.
> DBDadmin>

\pr ! Ariav,G., Clifford,J. and Jarke,M. 
" Panel abstract on time and databases "
/ ACM SIGMOD, San Jose, May.1983. pp.143--145.
= ---Kung
> DBDmodel>

\pp ! Ariav,Gad
@ NYU
" A Temporally Oriented Data Model"
/ ACM TODS, Vol.11 No.4, Dec.1986, pp.499-527.
= at least one timestamp, time of record, plus other temporal --- event stamps.
> DBDnewDBMS> DBDmodel>

\bk ! Ariav,G. and Clifford,J.
" New Directions for Database Systems "
/ Ablex Pub., 1986, 272pp.
= Proc. NYU Symp.on New Directions for Database Systems, May.1984.
> DBDnewDBMS>

\pr ! Arie,Z. and Chen,P.
" Entity-Relationship Modeling of Fuzzy Data "
/ IEEE DE 2, Los Angeles, Feb.1986. 
> DBDkb>

\pr ! Arisawa,H., Moriya,K., and Miura,T.
" Operations and the Properties of Non-First-Normal Form Relational Databases "
/ VLDB 9, 1983, pp.197--204.
= Nested relations.
> DBDmodel>

\pr ! Arisawa,H. and Miura,T.
@ Yokohama National Un., Japan
" On the Properties of Extended Inclusion Dependencies "
/ VLDB 12, Aug.1986.
> DBDtheory>

\pp ! Arisawa,H., Nagae,H., and Mochizuki,Y.
@ Yokohama Un.
" Representation of Complex Objects in Semantic Data Model "AIS" and
  Implementation of Set Operators "
/ IEICE Transactions, Vol.E74 No.1, Jan.1991.
= the model covers entities and associations between entity sets; three
  kinds of association: existential, cartesian aggregation and referential
> DBDops> DBDobject>

\pr ! Aristides,P. and Abbadi,A.
@ UCSB
" Fast Read-Only Transactions in Replicated Databases " 
/ IEEE DE 8, Tempe, AZ, Feb.1992.
> DBDdist>

\pp ! Ariwasa,Makota 
" Residue Hash Method "
/ J.IPSJ, Vol.12, Feb.1968, pp.163--167.
> DBDdesign.7.5>

\pr ! Arizio,R. et al.
@ CSELT
" Managing Inter-Database Dependencies with 'Rules + Quasi-transactions' "
/ IEEE RIDE-IMS 93, Vienna, Apr.1993.
> DBDdist>

\pp ! Arkin,C.F. and Wachtel,M.S.
" How Many Patients are Necessary to Assess Test Performance "
/ JAMA, Vol.263 No.2, Jan.1990
> MIS> DBDstat><DBfile

\pp ! Armenakis,A.C., Garey,L.E., and Gupta,R.D.
@ Un.New Brunswick (Canada)
" An Adaptation of a Root Finding method to Searching Ordered disk files "
/ BIT Vol.25 No.4, 1985, pp.562--568; ACM CR 8703-0181.
> DBFseq>
 
\pp ! Armenti,A., et al
" LISTAR, the LINCOLN Information Storage and Associative Retrieval System "
/ Proc.1970 SJCC, AFIPS Vol.36, pp.313--322.
> DBFhybrid>

\pr 0f! Armisen,J.P. and Caleca,J.Y.
" A Commercial Back-End Data Base System "
/ VLDB 7, 1981.
= This article is interesting in that it presents a commercial product,
  and coming from France, represents an European effort in the field of
  Database Machine.  However, what mars the reading of this paper are
  the bad spelling and unnatural sentence structure.  (Kitty Shih comment)
> DBFmach>

\pr *xq! Armstrong,W.W.
" Dependency Structures of Database Relationships "
/ Information Processing 74, N-H (Amsterdam), 1974, pp.580--583.
/ Proc.1974 IFIP Congress, pp.998--1006.
= Axioms characterizing functional dependencies.
> DBDtheory> %Armstrong74

\pp 0! Armstrong,W.W. and Delobel,C
@ U.Montreal; U.Scientifique et Medicale de Grenoble
" Decompositions and Functional Dependencies in Relations "
/ ACM TODS, Vol.5 No.4, Dec.1980, pp.404--430.
= A general study is made of two basic integrity constrains, functional
 and multivalued dependencies, via an equivalent concept: decompositions.
> DBDtheory.2>

\mn ! Army Headquaters, Dep.of the Army
" Army Data Management Program "
/ Pentagon Document, Jun.1988
= Data dictionary
> DBDschema><DBfile

\pp ! Arnaurov,D.D., Naidenov,N.V., and Tasev,A.G.
" Organization of Data Files for Document Retrieval Systems "
/ PCS, Vol.11 No.3, May.-Jun.1985, pp.170--175.
= construction of a hierarchy for hash access to documents
> DBDbiblio><FASAC 331

\pr ! Arni,N., Greco,S., and Sacca,D.
@ Universita della Calabria, Rende, Italy
" Set-Term Matching in Logic Programming "
/ ICDT 92, Berlin, Oct.1992.
> DBDtheory>

\pp ! Arnold, Barry C.
" Schwarz, Regression, and Extreme Deviance "
/ The American Statistician, vol.28 no.1, Feb.1974.
> DBFtechn>

\pp *f! Aron,J.D. 
@ IBM (Gaithersburg MD)
" Information Systems in Perspective "
/ ACM C. Surveys, Vol.1 No.4, Dec.1969, pp.213--235.
= Introduction to the present and future capabilities of management 
  information systems in the context of file handling, system design, 
  and management use.
> DBFintro>

\pp 0! Arora,S.K. and Smith,K.C.
" A Graphical Interpretation of Dependency Structures in Relational Databases "
/ Int.J. Comput. Inf. Sci., Vol.10 No.3, Jun.1981, pp.187--213.
= A subclass of dependencies, root-dependencies and a common graphical
  (S-diagram) for all of them.  Also automatic constraint checking
 and recovery of data.
> DBDtheory.2> DBDmodel.3> DBDtrans>

\pp *f! Arora,S.R. and Dent,W.T. 
@ Un.Minnesota
" Randomized Binary Search Techniques "
/ CACM, Vol.12 No.2, Feb.1969, pp.77--80.
= Analysis of search through tree with two branches per node.
> DBFtrees.4> %Arora69

\pr *f! Arora,S.R. and Gallo,A. 
@ Un.Minnesota; UNIVAC
" Optimal Sizing, Loading and Re-loading in a Multi-Memory Hierarchy System "
/ Proc.1971 SJCC, AFIPS Vol.38, pp.337--344.
= Optimal allocation indirectly addressable memories of different 
  speeds, with consideration of reorganization frequencies.
> DBFeval>  %Arora71

\pr ! Arora,S.R. and Jain,G.P. 
@ Un.Minnesota; UNIVAC
" Drum Queuing Model "
/ Proc.1971 SJCC, AFIPS Vol.38, pp.319--324
= Analysis of multiple drum queues.
> DBFtechn.3>

\pb ! Arsenteva,A.V. and Yepifanov,G.V.
@ USSR Acad.Sci., Leningrad Sci.Res.Comp.Ctr  
" Prospects for the Use and Organization of an Associative Recursive Data
  Base "
/ Problemno-oriyentirovannyye informatsionnyye sistemy, 1984, Leningrad,
  pp.59--71.
> DBDimpl><FASAC 32b

\rp 0! Arthur Young and Co.
" Assessment of the NINCDS Data Bank Network "
/ report to the National Inst.Neurological and Communicative 
  Disorders and Stroke, Aug.1980, 143 pp.
= Evaluation of a number of database systems, especially TOD, CLINFO, and
  MERLIN recommending adoption of TOD.			     
> DBappl> MCS>

\bk ! Arthur,Lowell J.
" Rapid Evolutionary Development: Requirements, Prototyping, and
  Software Creation "
/ Wiley, 1992, 221pp; ACM CR 9211-0860.
= a fast-paced romp extols prototyping, the natural laws, law of
  7 plus/minus 2
> DEng>

\mn 0! Artificial Intelligence Corp
" Intellect Query System User's Guide "
/ Release 101, Artifical Intelligence Corp, Waltham MA, 1981. 
= ACL
> DBDquery.3.4> 

\rp ! Arvidson,R., Wiederhold,G., et al.
" Issues and Recommendations Associated with Distributed Computation and 
  Data Management Systems for the Space Sciences, Volume 2 "
/ Committee on Data Management and Computation, Space Sciences Board, Nat.
  Academy of Sciences, Jan.1985.
= contains projections on future computation and storage demands and 
  capability to satisfy them.
> DBDone> DBFhard>

\pp ! Aschim,F. and Bonne,P. 
" SIBAS, an Implementation of the CODASYL Data Base Concept "
/ Management Informatics, Vol.2 No.3, Jun.1973, pp.101--104.
> DBDschema>

\pp ! Aschim,F.
" Data Base Networks --- An Overview "
/ Management Informatics, Vol.3 No.1, Feb.1974, pp.12--28.
> DBDdist> DBFstorage>

\rp ! Aschim,F.
" Some Design and Analysis Tools for Design of Databases for Database
  Oriented Information Systems "
/ Central Inst. for Industrial Res., Oslo, Norway, Feb.1975
> DBDadmin.1> DBDdesign>

\pb ! Aschim,F. and Mostue,B.M. 
" IFIP WG8.1 case solved using the SYSDOC methodology and SYSTEMATOR "
/ ISDM: A Comparative Review, Olle et al(eds), N-H, 1982. 
= --- Kung
> DBDdesign>

\pr *! Ash,W. and Sibley,E.H. 
" TRAMP, An Interpretive Associative Processor with Deductive Capabilities "
/ ACM NC 23, 1968, pp.5--12.
= Deductive inference on binary relations.
> DBDquery> DBFhybrid.7.5><x10>	 %Ash68

\pr ! Ashany,R.
" Application of Sparse Matrix Techniques to Search, Retrieval, 
  Classification and Relationship Analysis in Large Database Systems "
/ VLDB 4, Bubenko and Yao(eds), ACM, 1978, pp.499--516.
> DBDdesign>

\pp *! Ashenhurst,R. L.(ed)
" Curriculum Recommendations for Graduate Professional Programs in 
  Information Systems "
/ CACM, Vol.15 No.5, May.1972, pp.303--398.
= With bibliographies.
> DBDintro>  %Ashenhurst72

\pp ! Ashfield,J.C. and Cybrynski,D.B.
" System-independent file management and distribution services "
/ IBM Sys.J., Vol.28 No.2, 1989, pp.241--259.
= identifying, fetching, moving, and storage functions are the same
  for all applications and can be most efficiently provided by a common
  process.
> DBFdist>

\pr 0! Ashok,V., McKnight,W., and Ramanathan,J.
@ Ohio State Un.
" Integrated Environment for Information Management in VLSI Design "
/ IEEE DE 1, Los Angeles, Apr.1984.
> EIS>

\pp u! Askerov,T.M. and Agaev,A.A.
" Description Language for Cartographic Data "
/ PCS, Vol.11 No.2, Mar.-Apr.1985, pp.102--106.
= geographic primitives are AREA, CONTOUR, BORDER, GRID, CELL, POINT
> Image><FASAC 328

\pp ! Aspinall,L. 
@ IBM, UK Scientific Ctr
" Improving Disk Drive Performance by Intelligent Record Placement "
/ Software, 1972.
/ IBM, Res.R. No.UKSC-11 Feb.1972.
> DBFhard.2>

\pr ! Aspnes,J., Fekete,A., Lynch,N., Merritt,M., and Weihl,W.
@ CMU
" A Theory of Timestamp-Based Concurrency Control for Nested Transactions "
/ VLDB 14, Bancilhon and DeWitt(eds), Los Angeles, Aug.1988, pp.431--444.
> DBDconc> DBDdist>

\pr ! Asthana,A., Jagadish,H.V., and Knauer,S.C.
@ ATT Bell Labs
" An Intelligent Memory Transaction Engine "
/ IWDM 89, (Deauville France), Jun.1989.
> DBFmach>

\mn ! ASTM
" Standard Specification for Transferring Clinical Laboratory Data Messages
  Between Independent Computer Systems "
/ ASTM 1238-88
> MIS> DBDdist> DBFrepresent><DBfile

\pr ! Astrahan,M.M., Altman,E.B., Fehder,P.L., and Senko,M.E. 
" Concepts of a Data Independent Accessing Model "
/ ACM SIGFIDET 1972, Dean(ed.), pp.349--362.
> DBDschema>

\pr ! Astrahan,M.M. and Ghosh,S.P. 
" A Search Path Selection Algorithm for the Data Independent Accessing 
  Model (DIAM) "
/ ACM SIGMOD 1974, Rustin(ed), pp.367--388.
> DBDschema>

\pr ! Astrahan,M.M. and Lorie,R.A.
" SEQUEL-XRM, A Relational System "
/ Proc. ACM Pacific Regional Conf., Apr.1975, pp.34--38.
> DBDrel.2>

\pp ! Astrahan,M.M. and Chamberlin,D.
@ IBM, San Jose
" Implementation of a Structured English Query Language "
/ CACM, Vol.18 No.10, Oct.1975, pp.580--588.
/ ACM SIGMOD 75, King(ed), May.1975
= Description of implementation of SEQUEL interpreter, especially
  optimizer, which uses indexes to simplify queries.
> DBFeval.4> DBDrel.2>

\pp **! Astrahan,M.M., et al.
@ IBM, San Jose
" System R:  Relational Approach to Database Management "
/ ACM TODS, Vol.1 No.2, Jun.1976, pp.97--137.
/ IBM, San Jose, Res.R. No.RJ-1738, Feb.1976.
> DBDrel.2> DBFeval.4><DBfile <Shel

\pp **! Astrahan,M.M., et al.
" System R:  A Relational Data Base Management System "
/ IEEE Computer, Vol.12 No.5, May.1979, pp.42--48.
= overview and some history, SQL, UFI
> DBDrel.2>

\pp f5f! Astrahan,M.M., Schkolnick,M., and Whang,K-Y.
" Approximating the Number of Unique Values without Sorting "
/ to appear in Information Systems, Vol.12 No.1, 1987.
/ IBM Res.Lab, CS Res.R. No.RJ-4960 (51972), Dec.1985.
= Estimates of value instance count obtained various way, typically using 
  hashing or projection. Was called `Counting Unique Values of An Attribute 
  Without Sorting'.
= The idea is to estimate the size of a projection of a relation without 
  looking at the entire relation.  Still needed are techniques for estimating 
  the size of a join (of many relations) without actually computing the join.  
  That's what we need if we are going to decide on the proper order in which to
  join *large* numbers of relations.---jeff
> DBDperf> DBFindex> DBDrel.2.3> DBDperf><DBfile

\pr ! Atchan,H., Bell,R., and Thuraisingham,B.
" Knowledge-based Support for the Development of Database-centered 
  Applications "
/ IEEE DE 5, Los Angeles, Feb.1989.
> DBDkb>

\pp D! Atkins,John
@ West Virginia Un., Dep.Statistics and CS, (Morgantown WV)
" A Note on Minimal Covers "
/ ACM SIGMOD Record, Vol.17 No.4, Dec.1988, pp.16--21
= corrected algorithms
> DBDmodel> DBDdesign>

\pp ! Atkins,Richard
@ Honeywell Systems and Res.Ctr, (Minneapolis MN)
" Tool Attachment in EIS "
/ IEEE COMPCON 89, San Francisco, Feb.-Mar.1989, IEEE CS, pp.410--414
> EIS>

\pr 0! Atkinson,M.P., Chisholm,K., and Cockshott,P.
@ Un.Edinburgh, DCS (Scotland)
" PS-Algol:  An Algol with a Persistent Heap "
/ ACM SIGPLAN Notices, Vol.17 No.7, Jul.1982, pp.24--31.
= PS-algol supports a persistent heap, and an associative store to support 
  tasks normally carried out by filing systems or database management systems.
> DBDnewDBMS> DBFstorage-3.2

\pp ! Atkinson,M.P., Baily,P., Chisholm,K., Cockshott,P., and Morrison,R.
" An Approach to Persistent Programming "
/ The Computer Journal, Vol.24 No.4, 1983.
/ In 'Readings in Object-Oriented Database Systems" edited by S.Zdonik and
  D.Maier, Morgan Kaufman, 1990.
> unknown>

\pp 0! Atkinson,M.P., Fiddian,N.J., Gray,P.M.D., Stocker,P.M., et al.
" The PROTEUS Distributed Database System "
/ Proc.BCS BNCOD3 (Leeds)1985?, Longstaff(ed), Cambridge Un.Press, pp.225--245.
= Heterogenous multi-university system. Network query language NQL and
  tranfer language NTL are based on the relational Algebra. No update.
> DBDdist> DBDnewDBMS><DBfile

\pp ff! Atkinson,M.P. and Morrison,M.
@ Un.Glasgow, Scotland
" Procedures as Persistent Objects "
/ ACM TOPLAS, Vol.7 No.4, Oct.1985, pp.539--559.
= PS-algol; First Class Functions; Versions. 
> DBDobject> DBFintro> DBDnewDBMS> DBFstorage-3.2>

\pp ! Atkinson,M.P. and Buneman,O.Peter
@ Un.Glasgow, Scotland
" Types and Persistence in Database Programming Languages "
/ ACM C.Surveys, Vol.19 No.2, Jun.1987, pp.105--190.
= Illustrated with 4 tasks. Polymorphism, type inheritance, object identity,
  and the choice of structures to represent sets of similar values.
> DBDlang>

\pr ! Atkinson,M., Bancilhon,F., DeWitt,D., Maier,D., Dittrich,K., and Zdonik,S
" The Object-Oriented Database System Manifesto "
/ DOOD89, Kyoto, Dec.1989.
/ provided at SIGMOD May.1990.
= characteristics are separated into mandatory (complex objects, object
  identity, encapsulation, types or classes, inheritance, overriding 
  combined with late binding, extensibility, computational completeness,
  secondary storage management, concurrency, recovery and an ad hoc
  query facility), optional (multiple inheritance, type checking and
  inferencing, distribution, design transactions and versions), and open
  (the programming paradigm, the representation system, the type system,
  and uniformity)
> DBDobject><DBfile

\bk ! Atkinson,W. and DeSanctis,P.
" Introduction to VSAM "
/ Hayden Book Co., 1983.
> DBFimpl>

\bk 0**f! Atre,S.
" Structured Techniques for Design Performance and Management "
/ Business Data Processing:  A Wiley Series, 1980, 442pp.
> DBFintro><DB book shelf

\bk ! Atre,Shaku
" Data Base Management Systems for the Eighties "
/ QED Inf. Sciences., 1983.
= details of eight major commercially available packages.
> DBDimpl>

\bk ! Atre,Shaku
@ Atre International Consultants (Rye NY)
" Information Center: Strategies and Case Studies Vol.1 "
/ Atre Int. Consultants, Rye NY, 1986, 251pp.
= I3
> DBDadmin><x

\bk ! Atre,Shaku
" Database: Structured Techniques for Design, Performance, and Management
  (2nd ed) "
/ Wiley, 1988, 430pp.; ACM CR 8812-0906.
= Seriously outdated. Detailed discussions of IMS--VS. References are old.
  ---Hoffman.
> DBDdesign>

\pp 0! Atwood,J.William, MacLeod,Alexander, and Yu,Keh-Chiang
@ Concordia Un., Montreal; Un.Texas Austin
" An Empirical Study of a CDC 844-41 Disk Subsystem "
/ Perform.Eval., Vol.2 No.1, May.1982, pp.29--56.
= The authors confirm the oft-suspected ineffectuality of seek time
  scheduling.  They warn the reader of the dangers of applying the conclusions
  reached in the study to other systems, applications, and environments
  but do give guidance with respect to what might have to be changed
  in their simulation to make such applications possible.  The entire
  situation studied and so clearly presented is far beyond the
  analytical state of the art, and thus their use of a combination of
  measurement and simultation was the approach of choice.
> DBFmethods.3>

\pp **f! Atwood,R.C.
" Effects of Secondary Storage I/O Contention on the Performance of an 
  Interactive Information Management System "
/ ACM NC 1972, Aug.1972, pp.670--679.
> DBFuse-3>  

\pr ! Atwood,T. and Orenstein,J.
@ Object Design, Inc.
" Notes toward a Standard Object-Oriented DDL and DML "
/ WOOBTG 1, May.1990, Atlantic City.
= C++ allows the programmer to create objects with either of two lifetimes 
  limited to the life of the procedure in which the object was created or with
  the process in which the object was created; support for persistent objects
  easily added to each
= relational mistakes: single language for interactive and as a data
  manipulation sublanguage for programming languagues; single DML for
  different programming languages
= propose to add to C++ and Ada: the key word persistent; an inverse clause
  on relationship declarations, associative retrieval expressions; the
  transaction statement.
> DBDobject> DBDlang>

\rp 0! Attar,R., Bernstein,P.A., and Goodman,N.
@ Harvard Un., Aiken Computation Lab
" Site Initialization, Recovery, and Back-Up in a Distributed Database System "
/ Harvard Un., Aiken Lab., TR.13-81, Aug.1981.
/ IEEE TSE, Vol.SE-10 No.6, Nov.1983, pp.645--650.
> DBDdist> DBDprivacy.4><DBfile

\pr ! Attie,P., Singh,M., Sheth,A., and Rusinkiewicz,M.
" Specifying and Enforcing Intertask Dependencies "
/ VLDB 19, Dublin, Aug.1993.
> DBDdist>

\rp 0! Atzeni,P., Ausiello,G., Batini,C. and Moscarini,M.
@ Un. di Roma, Inst.Automatica
" Conceptual Relations Among Data Base Schemata "
/ Rpt. 80-32, Dec.1980.
= Such conceptual relations compare the conceptual content of schemata
  according to the following criteria:
  - ability to represent objects and relations among objects of the real world
  - ability to "filter" incorrect representations of the real world
  - ability to represent transformations of the real world
  - ability to 'filter' incorrect transactions which represent
  transformations of the real world.
  In section 2, two different types of conceptual inclusion and
  equivalence between schemata are defined in our approach in terms
  of a query language Q and an integrity constraints language IC.
> DBDobject> DBDdesign> DBDmodel.3><Th.file

\rp 0! Atzeni,P., Batini,C., De Antonellis,V., Lenzerini,M., Villanelli,F., 
  and Zonta,B.  
@ Un.Studi, Roma, Inst.Automatica, 
" Computer Aided Tool for Conceptual Data Base Design "
/ Un.Studi, Inst.Automatica, TR., 1983.
> DBDmodel><DBfile

\pp ! Atzeni,P. and Chan,E.P.F.
@ Un.Toronto
" Efficient Query Answering in the Representative Instance Approach "
/ ACM PODS 4, Mar.1985.
> DBDquery>

\pp ! Atzeni,P. and Parker,D.S.Jr.
" Formal Properties of Net Based Knowledge Representation Schemes "
/ DKE, Vol.3 No.3, 1988.
/ IEEE DE 2, Los Angeles, Feb.1986, pp.700--706.
= Representation of types, is-a-relationships and disjointness constraints.
  Consistency and redundancy are characterized by constraints.
> DBDkb>

\pr ! Atzeni,P. and Parker,D.S. 
@ CNR, IASI (Italy); UCLA (USA)
" Set Containment Inference "
/ ICDT 86, Rome, Sep.1986.
> DBDtheory>

\pr ! Atzeni,P. and DeBernardis,M.C. 
@ Un.La Sapienza, Roma, CNR
" A New Basis for the Weak Instance Model "
/ ACM PODS, San Diego, Mar.1987.
> DBDtheory>

\pr ! Atzeni,P. and Chan,E.
" Independent Database Schemes Under Functional and Inclusion Dependencies "
/ VLDB 13, Brighton, UK, Sep.1987.
> DBDtheory>

\pp ! Atzeni,P. and Parker,D.Stott
" Set Containment Inference and Syllogisms "
/ Theoretical Computer Science, Vol. 62m 1988.
> DBDlogic><DBfile

\pr !  Atzeni,P. and Torlone,R.
" Updating Databases in the Weak Instance Model "
/ ACM PODS, Philadelphia, Mar.1989.
> DBDops>

\pp ! Atzeni,P. and Chan,E.P.F.
@ IASI-CNR, Roma, Italy
" Efficient Optimization of Simple-Chase Join Expressions "
/ ACM TODS, Vol.14 No.2, Jun.1989, pp.212--230.
> DBDops>

\pr ! Atzeni,P. and Torlone,R.   
" Efficient Updates to Independent Schemes in the
  Weak Instance Model " 
/ ACM SIGMOD 90, Atlantic City, May.1990.
= More efficient way for PODS89 model
> DBDtheory> DBDmodel>

\pp ! Atzeni,P. and Torlone,R.
" Updatiing Relational Databases through Weak Instance Interfaces "
/ ACM TODS, Vol.17 No.4, Dec.1992.
> DBDops>

\pr ! Atzeni,P., Cabibbo,L. and Mecca,G.
@ Un.di Roma
" ISALOG: A declarative language for complex objects with hierarchies " 
/ IEEE DE 9, Vienna, Apr.1993.
> DBDquery>

\rp ! Auddino,A., Dennebouy,Y., Dupont,Y., Fontana,E., Spaccapietra,S.,
  and Tari,Z.
@ Laboratoire de bases de donnees (CH-1015 Lausanne-Ecublens, Suisse)
" SUPER: A comprehensive Approach to DBMS Visual User Interfaces "
= A visual interface for editing database schema and queries
  based on a variation of the E-R model.  The added semantics to the E-R 
  such as ISA and maybe-a (with no inclusion constraint)
  do not have a special effect on the interface.  In my opinion,
  visual editing of E-R shema is a sound idea.  On the other hand,
  visual editing of queries by copying a subset visual schema may
  confuse users, if the copied subschema containes cycles -- a potential
  source of the user's misunderstanding.  SUPER forces users to break cycles, 
  but it is not clear how intuitive this cycle-breaking semantics will
  be to the user. --- Cha.
> DBDquery

\pr ! Auddino,A., Dennebouy,Y., Dupont,Y., Fontana,E., Spaccapietra,S., and 
  Tari,Z.
" Super-Visual Interaction with an Object-Based ER Model "
/ ER Conf.11, Karlsruhe, Oct.1992.  
> DBDobject> DBDquery>

\rp 0! Auer,H.
" RDBM --- A Relational Data Base Machine "
/ Un.Braunschweig, TR.8005, Jun.1980.  
> DBFmach> DBappl>

\bk 0! Auerbach,I.L.(ed) 
" The Auerbach Annual: Best Computer Papers "
/ N-H 1980, 1981.
= Selected papers, often in databases and information processing
> DBDintro>

\mn 0! Auerbach Staff
" Practical Data Base Management " 
/ Reston, 1981, 430pp.
> DBDintro><DBfile

\rp 0! Ausiello,G., D'Atri,A., and Sacca',D.
@ Universita di Roma, Instituto di Automatica, Rome, et al
" Graph Algorithms for Functional Dependencies Manipulation "
/ Un.Roma, Inst.Automatica, TR.R.81-09, Nov.1981.
= Graph theoretic approach allows a homogeneous treatment of closure,
  minimization which leads to simpler proofs and more efficient algorithms.
> DBDtheory.2><DBfile

\pr 0! Ausiello,G., D'Atri,A., and Moscarini,M.
" Minimal Coverings of Acyclic Databas