%%% -*-BibTeX-*-
%%% ====================================================================
%%% BibTeX-file{
%%% author = "Nelson H. F. Beebe",
%%% version = "1.16",
%%% date = "25 October 2006",
%%% time = "07:12:38 MDT",
%%% filename = "sigmod.bib",
%%% address = "University of Utah
%%% Department of Mathematics, 110 LCB
%%% 155 S 1400 E RM 233
%%% Salt Lake City, UT 84112-0090
%%% USA",
%%% telephone = "+1 801 581 5254",
%%% FAX = "+1 801 581 4148",
%%% URL = "http://www.math.utah.edu/~beebe",
%%% checksum = "00192 48462 199497 1839056",
%%% email = "beebe at math.utah.edu, beebe at acm.org,
%%% beebe at computer.org (Internet)",
%%% codetable = "ISO/ASCII",
%%% keywords = "BibTeX, bibliography, data base, database,
%%% SIGMOD Record",
%%% license = "public domain",
%%% supported = "yes",
%%% docstring = "This is a BibTeX bibliography for ACM SIGMOD
%%% Record, the newsletter of the ACM Special
%%% Interest Group on Management of Data.
%%%
%%% The journal has a World Wide Web site at
%%%
%%% http://www.acm.org/sigmod/
%%%
%%% with issue tables of contents at
%%%
%%% http://www.acm.org/sigmod/record/index.html
%%%
%%% At version 1.16, the year coverage looked
%%% like this:
%%%
%%% 1977 ( 10) 1987 ( 48) 1997 ( 116)
%%% 1978 ( 0) 1988 ( 81) 1998 ( 138)
%%% 1979 ( 0) 1989 ( 68) 1999 ( 97)
%%% 1980 ( 0) 1990 ( 84) 2000 ( 88)
%%% 1981 ( 57) 1991 ( 99) 2001 ( 127)
%%% 1982 ( 0) 1992 ( 102) 2002 ( 74)
%%% 1983 ( 29) 1993 ( 137) 2003 ( 67)
%%% 1984 ( 34) 1994 ( 128) 2004 ( 98)
%%% 1985 ( 40) 1995 ( 138) 2005 ( 68)
%%% 1986 ( 45) 1996 ( 133) 2006 ( 43)
%%%
%%% Article: 2136
%%% Proceedings: 13
%%%
%%% Total entries: 2149
%%%
%%% This bibliography was initially built from
%%% searches in the OCLC Content1st database.
%%% Additions were then made from all of the
%%% bibliographies in the TeX User Group
%%% collection, from bibliographies in the
%%% author's personal files, from the IEEE
%%% INSPEC CD-ROM database (1989--1995), from
%%% the Compendex database, from the American
%%% Mathematical Society MathSciNet database,
%%% and from the computer science bibliography
%%% collection on ftp.ira.uka.de in
%%% /pub/bibliography to which many people of
%%% have contributed. The snapshot of this
%%% collection was taken on 5-May-1994, and it
%%% consists of 441 BibTeX files, 2,672,675
%%% lines, 205,289 entries, and 6,375
%%% <at>String{} abbreviations, occupying
%%% 94.8MB of disk space.
%%%
%%% Numerous errors in the sources noted above
%%% have been corrected. Spelling has been
%%% verified with the UNIX spell and GNU ispell
%%% programs using the exception dictionary
%%% stored in the companion file with extension
%%% .sok.
%%%
%%% BibTeX citation tags are uniformly chosen as
%%% name:year:abbrev, where name is the family
%%% name of the first author or editor, year is a
%%% 4-digit number, and abbrev is a 3-letter
%%% condensation of important title words.
%%% Citation labels were automatically generated
%%% by software developed for the BibNet Project.
%%%
%%% In this bibliography, entries are sorted in
%%% publication order, with the help of
%%% ``bibsort -byvolume''. The bibsort utility
%%% is available from ftp.math.utah.edu in
%%% /pub/tex/bib.
%%%
%%% The checksum field above contains a CRC-16
%%% checksum as the first value, followed by the
%%% equivalent of the standard UNIX wc (word
%%% count) utility output of lines, words, and
%%% characters. This is produced by Robert
%%% Solovay's checksum utility.",
%%% }
%%% ====================================================================
@Preamble{
"\hyphenation{
}"
}
%%% ====================================================================
%%% Acknowledgement abbreviations:
@String{ack-nhfb = "Nelson H. F. Beebe,
University of Utah,
Department of Mathematics, 110 LCB,
155 S 1400 E RM 233,
Salt Lake City, UT 84112-0090, USA,
Tel: +1 801 581 5254,
FAX: +1 801 581 4148,
e-mail: \path|beebe@math.utah.edu|,
\path|beebe@acm.org|,
\path|beebe@computer.org| (Internet),
URL: \path|http://www.math.utah.edu/~beebe/|"}
%%% ====================================================================
%%% Journal abbreviations:
@String{j-SIGMOD = "SIGMOD Record (ACM Special Interest
Group on Management of Data)"}
%%% ====================================================================
%%% Publishers and their addresses:
@String{pub-ACM = "ACM Press"}
@String{pub-ACM:adr = "New York, NY 10036, USA"}
%%% ====================================================================
%%% Bibliography entries:
@Article{Vineberg:1977:ICS,
author = "Maniel Vineberg",
title = "Implementation of character string pattern matching on
a multiprocessor",
journal = j-SIGMOD,
volume = "9",
number = "2",
pages = "1--7",
month = may,
year = "1977",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Feb 2 14:02:34 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Bird:1977:APP,
author = "R. M. Bird and J. C. Tu and R. M. Worthy",
title = "Associative\slash parallel processors for searching
very large textual data bases",
journal = j-SIGMOD,
volume = "9",
number = "2",
pages = "8--9",
month = may,
year = "1977",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Feb 2 14:02:34 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Lipovski:1977:IFT,
author = "G. J. Lipovski",
title = "On imaginary fields, token transfers and floating
codes in intelligent secondary memories",
journal = j-SIGMOD,
volume = "9",
number = "2",
pages = "17--22",
month = may,
year = "1977",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Feb 2 14:02:34 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Zaky:1977:MNN,
author = "S. G. Zaky",
title = "Microprocessors for non-numeric processing",
journal = j-SIGMOD,
volume = "9",
number = "2",
pages = "23--30",
month = may,
year = "1977",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Feb 2 14:02:34 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Hsiao:1977:ADC,
author = "David K. Hsiao and Krishnamurthi Kannan",
title = "The architecture of a database computer --- a
summary",
journal = j-SIGMOD,
volume = "9",
number = "2",
pages = "31--33",
month = may,
year = "1977",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Feb 2 14:02:34 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Rosenthal:1977:DMM,
author = "Robert S. Rosenthal",
title = "The data management machine, a classification",
journal = j-SIGMOD,
volume = "9",
number = "2",
pages = "35--39",
month = may,
year = "1977",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Feb 2 14:02:34 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{McDonell:1977:TNS,
author = "Ken J. McDonell",
title = "Trends in non-software support for input-output
functions",
journal = j-SIGMOD,
volume = "9",
number = "2",
pages = "40--47",
month = may,
year = "1977",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Feb 2 14:02:34 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Cerretti:1977:UIP,
author = "R. Cerretti and D. Jasilli and D. R. Matteucci",
title = "{Ulisse}: {An Italian} project for a multifunctional
terminal system",
journal = j-SIGMOD,
volume = "9",
number = "2",
pages = "48--50",
month = may,
year = "1977",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Feb 2 14:02:34 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Bray:1977:DMR,
author = "Olin H. Bray",
title = "Data management requirements: {The} similarity of
memory management, database systems, and message
processing",
journal = j-SIGMOD,
volume = "9",
number = "2",
pages = "68--76",
month = may,
year = "1977",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Feb 2 14:02:34 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Landson:1977:CSA,
author = "Barry M. Landson and Robert G. Sargent",
title = "A comparison of sequential and associate computing of
priority queues",
journal = j-SIGMOD,
volume = "9",
number = "2",
pages = "77--78",
month = may,
year = "1977",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Feb 2 14:02:34 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Mylopoulos:1981:OKR,
author = "John Mylopoulos",
title = "An overview of {Knowledge Representation}",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "5--12",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:1981:TAI,
author = "Anonymous",
title = "Tutorial on artificial intelligence research",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "13--18",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{McLeod:1981:AD,
author = "Dennis McLeod and John Miles Smith",
title = "Abstraction in databases",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "19--25",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:1981:TDR,
author = "Anonymous",
title = "Tutorial on database research",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "26--28",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Rowe:1981:DAP,
author = "Lawrence A. Rowe",
title = "Data abstraction from a programming language
viewpoint",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "29--35",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:1981:TPL,
author = "Anonymous",
title = "Tutorial on programming language research",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "36--39",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:1981:WSM,
author = "Anonymous",
title = "What should be modelled?",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "40--42",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:1981:T,
author = "Anonymous",
title = "Types",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "43--52",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:1981:B,
author = "Anonymous",
title = "Behaviour",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "53--61",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:1981:P,
author = "Anonymous",
title = "Presentation",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "62--71",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:1981:CM,
author = "Anonymous",
title = "Consistency of models",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "72--76",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:1981:RBA,
author = "Anonymous",
title = "Relationships between and among models",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "77--82",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:1981:AMT,
author = "Anonymous",
title = "Application of modelling techniques",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "83--87",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:1981:WS,
author = "Anonymous",
title = "Workshop Summary",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "88--90",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Albano:1981:IIS,
author = "Antonio Albano and Renzo Orsini",
title = "An interactive integrated system to design and use
data bases",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "91--93",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Amble:1981:IDB,
author = "Tore Amble",
title = "Integration of data base design in programming
languages",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "94--94",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Balzer:1981:DSS,
author = "Robert M. Balzer",
title = "Dynamic system specification",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "95--97",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Borgida:1981:DAE,
author = "Alexander T. Borgida and Sol Greenspan",
title = "Data and activities: Exploiting hierarchies of
classes",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "98--100",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Brodie:1981:DAD,
author = "Michael L. Brodie",
title = "Data abstraction for designing database-intensive
applications",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "101--103",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Buneman:1981:UDT,
author = "Peter Buneman and Ira Winston",
title = "The use of data type information in an interactive
database environment",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "104--106",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Carbonell:1981:DRI,
author = "Jaime G. Carbonell",
title = "Default reasoning and inheritance mechanisms on type
hierarchies",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "107--109",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Cattell:1981:IDS,
author = "R. G. G. Cattell",
title = "Integrating a database system and programming \slash
information environment",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "110--111",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Codd:1981:DMD,
author = "E. F. Codd",
title = "Data models in database management",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "112--114",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Cristian:1981:SBC,
author = "Flaviu Cristian",
title = "On the specification of behavioural constraints",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "115--117",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Deutsch:1981:CUM,
author = "L. Peter Deutsch",
title = "Constraints: {A} uniform model for data and control",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "118--120",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Feather:1981:SCC,
author = "Martin S. Feather",
title = "Some contrasts and considerations of an approach to
modelling",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "121--123",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Goldstein:1981:INS,
author = "Ira Goldstein",
title = "Integrating a network-structured database into an
object-oriented programming language",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "124--125",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Hardgrave:1981:PDM,
author = "W. Terry Hardgrave and Donald R. Deutsch",
title = "Processing data model abstractions",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "126--127",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Hayes:1981:LVT,
author = "Patrick J. Hayes and Gary G. Hendrix",
title = "A logical view of types",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "128--130",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Hendrix:1981:MVD,
author = "Gary G. Hendrix",
title = "Mediating the views of databases and database users",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "131--132",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Hitchcock:1981:DDO,
author = "Peter Hitchcock",
title = "Data dictionaries in open system communication",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "133--134",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Katz:1981:HDH,
author = "Randy H. Katz",
title = "Heterogeneous databases and high level abstraction",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "135--137",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{King:1981:MCR,
author = "Jonathan J. King",
title = "Modelling concepts for reasoning about access to
knowledge",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "138--140",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Kreps:1981:RVC,
author = "Peter Kreps",
title = "Relativism and views in a conceptual data base model",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "141--143",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Lacroix:1981:ATD,
author = "Michel Lacroix and Alain Pirotte",
title = "Associating types with domains of relational data
bases",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "144--146",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Leavenworth:1981:DAA,
author = "B. Leavenworth",
title = "A data abstraction approach to database modelling",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "147--149",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Levesque:1981:IKB,
author = "Hector J. Levesque",
title = "Incompleteness in knowledge bases",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "150--152",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Lundberg:1981:AIM,
author = "Bengt Lundberg and Janis A. {Bubenko, Jr.}",
title = "Axiomatic information modeling",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "153--154",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Mark:1981:UDO,
author = "William Mark",
title = "Use of database organization in the {Consul} system",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "155--157",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Mayr:1981:MMD,
author = "Heinrich C. Mayr",
title = "Make more of data types",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "158--160",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{McLeod:1981:CDM,
author = "Dennis McLeod",
title = "On conceptual database modelling",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "161--163",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Meyer:1981:TLA,
author = "Bertrand Meyer",
title = "A three-level approach to the description of data
structures, and notational framework",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "164--166",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Mylopoulos:1981:PRC,
author = "John Mylopoulos",
title = "A perspective for research on conceptual modelling",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "167--170",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Paolini:1981:ADT,
author = "Paolo Paolini",
title = "Abstract data types and Data Bases",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "171--173",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Reiter:1981:DBL,
author = "Raymond Reiter",
title = "Data bases: {A} logical perspective",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "174--176",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Rich:1981:MPV,
author = "Charles Rich",
title = "Multiple points of view in modelling programs",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "177--179",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Rowe:1981:IDD,
author = "Lawrence A. Rowe",
title = "Issues in the design of database programming
languages",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "180--182",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{dosSantos:1981:TCA,
author = "C. S. dos Santos and A. L. Furtado and J. M. V. de
Castilho and S. E. R. de Carvalho",
title = "Towards constructive axiomatic specifications",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "183--185",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Schmidt:1981:DAT,
author = "Joachim W. Schmidt",
title = "Data abstraction tools: Design, specification and
application",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "186--188",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Shaw:1981:ADT,
author = "Mary Shaw",
title = "Abstraction, data types, and models for software",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "189--191",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Sibley:1981:DMS,
author = "E. H. Sibley",
title = "Database management systems past and present",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "192--192",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Sowa:1981:CSK,
author = "John F. Sowa",
title = "A conceptual schema for Knowledge-based systems",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "193--195",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Thatcher:1981:DAD,
author = "J. W. Thatcher",
title = "Data abstraction, data bases and conceptual modelling
(Position Paper)",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "196--197",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Wasserman:1981:EDA,
author = "Anthony I. Wasserman",
title = "The extension of data abstraction to database
management",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "198--200",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Weber:1981:DTU,
author = "Herbert Weber",
title = "Are data types universal modelling concepts for data
base systems?",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "201--202",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Wedekind:1981:CAD,
author = "Hartmut H. Wedekind",
title = "{Constructive Abstract Data} types ({CAD})",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "203--206",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Zilles:1981:TAM,
author = "Stephen N. Zilles",
title = "Types, algebras and modeling",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "207--209",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Date:1983:DU,
author = "C. J. Date",
title = "Database usability",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "1--1",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Bernstein:1983:DTW,
author = "Philip A. Bernstein",
title = "Database theory: where has it been? where is it
going?",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "2--2",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Gray:1983:PPD,
author = "Jim Gray",
title = "Practical problems in data management: a position
paper",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "3--3",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Neuhold:1983:VDM,
author = "Erich J. Neuhold",
title = "Views on data management",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "4--5",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Wright:1983:MPD,
author = "David D. Wright",
title = "On merging partitioned databases",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "6--14",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Maier:1983:FR,
author = "David Maier and Jeffrey D. Ullman",
title = "Fragments of relations",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "15--22",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Wong:1983:DDP,
author = "E. Wong and R. H. Katz",
title = "Distributing a database for parallelism",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "23--29",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Yu:1983:DQP,
author = "C. T. Yu and C. C. Chang",
title = "On the design of a query processing strategy in a
distributed database environment",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "30--39",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Christodoulakis:1983:EBT,
author = "Stavros Christodoulakis",
title = "Estimating block transfers and join sizes",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "40--54",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Kambayashi:1983:QPU,
author = "Yahiko Kambayashi and Masatoshi Yoshikawa",
title = "Query processing utilizing dependencies and horizontal
decomposition",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "55--67",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Maier:1983:WW,
author = "David Maier and David Rozenshtein and David S.
Warren",
title = "Windows on the world",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "68--78",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Laver:1983:FDC,
author = "Kent Laver and Alberto O. Mendelzon and Marc H.
Graham",
title = "Functional dependencies on cyclic database schemes",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "79--91",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Honeyman:1983:NCI,
author = "Peter Honeyman and Edward Sciore",
title = "A new characterization of independence",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "92--96",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Carey:1983:AMD,
author = "Michael J. Carey",
title = "An abstract model of database concurrency control
algorithms",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "97--107",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Kohler:1983:ECL,
author = "Walter H. Kohler and Kenneth C. Wilner and John A.
Stankovic",
title = "An experimental comparison of locking policies in a
testbed database system",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "108--119",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Lomet:1983:HPU,
author = "David B. Lomet",
title = "A high performance, universal, key associative access
method",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "120--133",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Stonebraker:1983:DAT,
author = "Michael Stonebraker and Daniel Sagalowicz and Robert
Wilensky",
title = "{DBMS} and {AI}: is there any common point of view?",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "134--134",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Rowe:1983:TSE,
author = "Neil C. Rowe",
title = "Top-down statistical estimation on a database",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "135--145",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Lohman:1983:RSG,
author = "Guy M. Lohman and Joseph C. Stoltzfus and Anita N.
Benson and Michael D. Martin and Alfonso F. Cardenas",
title = "Remotely-sensed geophysical databases: experience and
implications for generalized {DBMS}",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "146--160",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Shu:1983:FAR,
author = "Nan C. Shu and Harry K. T. Wong and Vincent Y. Lum",
title = "Forms approach to requirements specification for
database design",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "161--172",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{DAtri:1983:AQR,
author = "Alessandro D'Atri and Marina Moscarini and Nicolas
Spyratos",
title = "Answering queries in relational databases",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "173--177",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Imielinski:1983:IID,
author = "Tomasz Imielinski and Witold {Lipski, Jr.}",
title = "Incomplete information and dependencies in relational
databases",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "178--184",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Kuck:1983:DGC,
author = "Sharon M. Kuck and Yehoshua Sagiv",
title = "Designing globally consistent network schemas",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "185--195",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Jarke:1983:RNF,
author = "Matthias Jarke and J{\"u}rgen Koch",
title = "Range nesting: a fast method to evaluate quantified
queries",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "196--206",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Zaniolo:1983:DLG,
author = "Carlo Zaniolo",
title = "The database language {GEM}",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "207--218",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Missikoff:1983:RQD,
author = "M. Missikoff and M. Scholl",
title = "Relational queries in a domain based {DBMS}",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "219--227",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Chan:1983:OAC,
author = "Arvola Chan and Umeshwar Dayal and Stephen Fox and
Nathan Goodman and Daniel R. Ries and Dale Skeen",
title = "Overview of an {Ada} compatible distributed database
manager",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "228--237",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Wilms:1983:WWT,
author = "Paul F. Wilms and Bruce G. Lindsay and Patricia G.
Selinger",
title = "``{I} wish {I} were over there'': distributed
execution protocols for data definition in {R}",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "238--242",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Ariav:1983:PTD,
author = "Gad Ariav and Jim Clifford and Matthias Jarke",
title = "Panel on time and databases",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "243--245",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{DeWitt:1984:ITM,
author = "David J. DeWitt and Randy H. Katz and Frank Olken and
Leonard D. Shapiro and Michael R. Stonebraker and David
Wood",
title = "Implementation techniques for main memory database
systems",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "1--8",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "With the availability of very large, relatively
inexpensive main memories, it is becoming possible to
keep large databases resident in main memory. This
paper considers the changes necessary to permit a
relational database system to take advantage of large
amounts of main memory. Authors evaluate AVL vs. B plus
-tree access methods for main memory databases,
hash-based query processing strategies vs. sort-merge,
and study recovery issues when most or all of the
database fits in main memory. As expected, B plus
-trees are the preferred storage mechanism unless more
than 80-90\% of the database fits in main memory. A
somewhat surprising result is that hash based query
processing strategies are advantageous for large memory
situations.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Wisconsin, Computer Sciences Dep, WI, USA",
affiliationaddress = "Univ of Wisconsin, Computer Sciences Dep, WI,
USA",
classification = "722; 723",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "ACCESS METHODS; DATABASE SYSTEMS; JOINT ALGORITHMS;
MAIN MEMORY DATABASES; Management; RECOVERY
MECHANISMS",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Simon:1984:DIE,
author = "Eric Simon and Patrick Valduriez",
title = "Design and implementation of an extendible integrity
subsystem",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "9--17",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "This paper presents a powerful integrity subsystem,
which is implemented in the SABRE database system. The
specification language is simple. The enforcement
algorithm is general; in particular, it handles
referential dependency and temporal assertions.
Specialized strategies efficiently treat each class of
assertions. The system automatically manages integrity
checkpoints. Also, an efficient method is described for
processing assertions involving aggregates. An analysis
exhibits the value of the algorithms. It is shown that,
in general, this method is better than the query
modification method for domain assertions. Measures
have also been done for giving the cost added for
controlling integrity in comparison with the cost of
the request itself.",
acknowledgement = ack-nhfb,
affiliation = "Inst Natl de Recherche en Informatique et en
Automatique, SABRE Project, Le Chesnay, Fr",
affiliationaddress = "Inst Natl de Recherche en Informatique et en
Automatique, SABRE Project, Le Chesnay, Fr",
classification = "723",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "COMPUTER PROGRAMMING LANGUAGES; DATABASE SYSTEMS;
Design; ENFORCEMENT ALGORITHM; QUALITATIVE ANALYSIS;
SABRE DATABASE SYSTEM; SYSTEM ARCHITECTURE",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Boral:1984:TSC,
author = "Haran Boral and Israel Gold",
title = "Towards a self-adapting centralized concurrency
control algorithm",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "18--32",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "The notion is introduced of self-adapting concurrency
control algorithms --- concurrency control algorithms
that consist of several rw and several ww
synchronization techniques, and combinations of the
techniques are applied in a manner that attains a
performance objective. Synchronization techniques are
considered that use locking and certification. A
general proof method for such algorithms is outlined
and applied.",
acknowledgement = ack-nhfb,
affiliation = "Microelectronics \& Computer Technology Corp, Austin,
TX, USA",
affiliationaddress = "Microelectronics \& Computer Technology Corp,
Austin, TX, USA",
classification = "723; 731",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "Computer Applications; COMPUTER PROGRAMMING ---
Algorithms; CONTROL SYSTEMS; DATABASE SYSTEMS ---
Management; INTEGRATED CONCURRENCY CONTROL ALGORITHM;
SYNCHRONIZATION TECHNIQUES; TRANSACTION MANAGER MODEL",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Arnow:1984:ECB,
author = "David M. Arnow and Aaron M. Tenenbaum",
title = "Empirical comparison of {B-trees}, compact {B-trees}
and multiway trees",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "33--46",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "This paper examines general B-trees empirically and
compares them with a less restrictive structure, the
general multiway tree, and a more restrictive
structure, the compact B-tree. The authors compare
search cost, insertion costs, and space costs of these
three structures for both small and large orders and
indicate their relative utility for large and small
data sets. Although there are cases when general
multiway trees are more effective than B-trees, this is
not the case for most practical situations. Compact
B-trees are also shown to degrade rapidly in the
presence of insertions and are therefore only useful
for static data sets. 10 refs.",
acknowledgement = ack-nhfb,
affiliation = "Brooklyn Coll, Dep of Computer \& Information Science,
Brooklyn, NY, USA",
affiliationaddress = "Brooklyn Coll, Dep of Computer \& Information
Science, Brooklyn, NY, USA",
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "B-TREES; COMPACT B-TREES; DATA STRUCTURES; DATABASE
SYSTEMS; INFORMATION RETRIEVAL SYSTEMS; MULTIWAY
TREES",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Guttman:1984:TDI,
author = "Antonin Guttman",
title = "{$R$}-trees: a dynamic index structure for spatial
searching",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "47--57",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "In order to handle spatial data efficiently, as
required in computer aided design and geo-data
applications, a database system needs an index
mechanism that will help it retrieve data items quickly
according to their spatial locations. However,
traditional indexing methods are not well suited to
data objects of non-zero size located in
multi-dimensional spaces. This paper describes a
dynamic index structure called an R-tree which meets
this need, and gives algorithms for searching and
updating it. The author presents the results of a
series of tests which indicate that the structure
performs well, and concludes that it is useful for
current database systems in spatial applications.",
acknowledgement = ack-nhfb,
affiliation = "Univ of California, Berkeley, Berkeley, CA, USA",
affiliationaddress = "Univ of California, Berkeley, Berkeley, CA,
USA",
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "COST ALGORITHMS; DATABASE SYSTEMS; DYNAMIC INDEX
STRUCTURE; INFORMATION RETRIEVAL SYSTEMS; Management;
NODE SPLITTING; R-TREES; SPATIAL SEARCHING",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Diel:1984:DMF,
author = "Hans Diel and Gerald Kreissig and Norbert Lenz and
Michael Scheible and Bernd Schoener",
title = "Data management facilities of an operating system
kernel",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "58--69",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "The paper describes the part of a general operating
system Kernel supporting data management functions. The
operating system Kernel can be imbedded into microcode
and viewed as an extended hardware interface. Four
Kernel instructions are defined to support data
management. They provide a powerful basis for the
implementation of different kinds of access methods and
file systems, including data base systems. Advanced
transaction processing concepts such as concurrency
control, support of back-out, commit and a variety of
share options are included.",
acknowledgement = ack-nhfb,
affiliation = "IBM, EF Lab, Boeblingen, West Ger",
affiliationaddress = "IBM, EF Lab, Boeblingen, West Ger",
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "ACCESS ADMISSION CONTROL PROTOCOL; ACCESS PERSISTENT
OBJECT; CONCURRENCY CONTROL; DATABASE SYSTEMS;
Management; OPERATING SYSTEM KERNELS; TRANSACTION
PROCESSING PRINCIPLES",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Fedorowicz:1984:DEU,
author = "Jane Fedorowicz",
title = "Database evaluation using multiple regression
techniques",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "70--76",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "A model of the inverted file of an automated
bibliographic system is constructed using the Zipf
distribution of word frequency. By ascertaining the
parameters of the Zipfian model of the inverted file
system, one can estimate the minimum data storage
requirements of the database. In addition, given a few
additional system parameters, access time for a
specified query can be estimated. The estimation
procedures are accomplished using logarithmic
transformations and multiple regression techniques.
This paper introduces the Zipfian models, their
regression formulation, and their results and
interpretation for application to database
evaluation.",
acknowledgement = ack-nhfb,
affiliation = "Northwestern Univ, Kellogg Graduate Sch of Management,
Evanston, IL, USA",
affiliationaddress = "Northwestern Univ, Kellogg Graduate Sch of
Management, Evanston, IL, USA",
classification = "723; 901; 922",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "ACCESS TIME MODEL; BIBLIOGRAPHIC TECHNIQUES; DATABASE
SYSTEMS; Evaluation; INFORMATION STORAGE SYSTEMS;
MATHEMATICAL MODELS; MULTIPLE REGRESSION TECHNIQUES;
ZIPFIAN MODEL",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Baru:1984:PES,
author = "C. K. Baru and S. Y. W. Su",
title = "Performance evaluation of the statistical aggregation
by categorization in the {SM3} system",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "77--89",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "To perform a statistical aggregation operation over a
large file often requires that the records of the file
be divided into categories based on the values of the
attribute(s) over which some statistical computation is
to be performed. It is rather inefficient to perform
the necessary data transfer, categorization and
statistical computation using a single processor.
Parallel algorithms designed for multiprocessor systems
have been proposed and their performance improvement
over the conventional systems has been demonstrated. It
is shown in this paper that three to four times
performance improvement can be further gained by using
a dynamically partitionable multicomputer system with
switchable main memory modules (SM3).",
acknowledgement = ack-nhfb,
affiliation = "Univ of Florida, Database Systems Research \&
Development Cent, Gainesville, FL, USA",
affiliationaddress = "Univ of Florida, Database Systems Research \&
Development Cent, Gainesville, FL, USA",
classification = "723; 901; 922",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "Computer Applications; DATA TRANSFER; DATABASE
SYSTEMS; MATHEMATICAL STATISTICS; PARALLEL ALGORITHMS;
PERFORMANCE EVALUATION; SWITCHABLE MAIN MEMORY
MODULES",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Spooner:1984:DSI,
author = "David L. Spooner",
title = "Database support for interactive computer graphics",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "90--99",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "This paper explores these ideas by discussing the
implementation of a prototype interface between a
relational DBMS and an interactive computer graphics
system. It presents both the database structures used
to manage the data and the techniques used to design
the interface. It concludes by discussing an approach
for making the interface portable.",
acknowledgement = ack-nhfb,
affiliation = "Rensselaer Polytechnic Inst, Mathematical Sciences
Dep, Troy, NY, USA",
affiliationaddress = "Rensselaer Polytechnic Inst, Mathematical
Sciences Dep, Troy, NY, USA",
classification = "722; 723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "Computer Applications; COMPUTER GRAPHICS; COMPUTER
INTERFACES; DATABASE SYSTEMS; HIERARCHICAL
ORGANIZATION; MAPPING FUNCTIONS; RELATIONAL DATABASES;
SEMANTIC ATTRIBUTES",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Fogg:1984:LLD,
author = "Dennis Fogg",
title = "Lessons from a `living in a database' graphical query
interface",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "100--106",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "The Living In a Database system (LID) is a
user-friendly interface to an entity-relationship
database. Its underlying ideas are similar to R. G. G.
Cattell's PDB, but its presentation is significantly
different. LID uses a bit-mapped graphics terminal with
mouse pointer to create an attractive interaction
environment. Experience from the implementation
suggests that dynamic graphic displays --- those which
have graphic symbols that change as the data they
present change --- are an important feature in user
interfaces but are difficult to implement with current
technology. The implementation also uncovers an
important inadequacy in the PDB\slash LID idea: the
inability to operate on sets of data instances in the
same way as individual data instances. An extension to
LID is suggested to alleviate the problem.",
acknowledgement = ack-nhfb,
affiliation = "MIT, Artificial Intelligence Lab, Cambridge, MA, USA",
affiliationaddress = "MIT, Artificial Intelligence Lab, Cambridge, MA,
USA",
classification = "722; 723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "COMPUTER GRAPHICS; Computer Interfaces; DATABASE
SYSTEMS; GRAPHIC DISPLAYS; GRAPHICAL QUERY INTERFACES;
LIVING IN A DATABASE SYSTEM; USER-FRIENDLY SYSTEMS",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Valduriez:1984:MHS,
author = "Patrick Valduriez and Yann Viemont",
title = "Multikey hashing scheme using predicate trees",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "107--114",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "A new method for multikey access suitable for dynamic
files is proposed that transforms multiple key values
into a logical address. This method is based on a new
structure, called predicate tree, that represents the
function applied to several keys. A predicate tree
permits to specify in a unified way various hashing
schemes by allowing for different definitions of
predicates. A logical address qualifies a space
partition of a file according to its predicate tree.
This address is seen as a single key by a digital
hashing method which transforms it into a physical
address. This method is used to address records in a
file and to transform a retrieval qualification on a
file into a set of partitions to access. Finally, a
qualitative analysis of the behavior of the method is
given which exhibits its value.",
acknowledgement = ack-nhfb,
affiliation = "Inst Natl de Recherche en Informatique et en
Automatique, SABRE Project, Le Chesnay, Fr",
affiliationaddress = "Inst Natl de Recherche en Informatique et en
Automatique, SABRE Project, Le Chesnay, Fr",
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "Computer Applications; DATABASE SYSTEMS; DYNAMIC
FILES; MULTIKEY HASHING SCHEME; PREDICATE TREES;
SIGNATURE PROFILES",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Lum:1984:DDS,
author = "V. Lum and P. Dadam and R. Erbe and J. Guenauer and P.
Pistor and G. Walch and H. Werner and J. Woodfill",
title = "Designing {DBMS} support for the temporal dimension",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "115--130",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "The information in the data base represents a snapshot
of it at an unspecified instant of time and the
information is deemed to be the `current' data. While
such an approach is satisfactory in many applications,
recent studies in new data base applications have
revealed that it is not satisfactory in many cases. New
functions for new requirements are needed. Among these
new requirements is the need to have temporal, or time
domain, support. This paper deals specifically with
this particular subject. The authors, without
distinction, refer to the support of the time domain as
temporal support, history data support, or simply time
support. They refer to queries with reference to the
time domain as time, temporal or history queries. 23
refs.",
acknowledgement = ack-nhfb,
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "DATABASE SYSTEMS; INDEXING SUPPORT STRUCTURES; LOGICAL
TIME; Management; PHYSICAL TIME; RELATIONAL MODEL;
TEMPORAL DIMENSIONS",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Chen:1984:CRN,
author = "Huei-huang Chen and Sharon McCure Kuck",
title = "Combining relational and network retrieval methods",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "131--142",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "New methods for retrieving records from a database
with links are given so that records are retrieved only
once and not multiple times as happens when using the
traditional method of retrieval. Improvements as great
as 50 percent are expected for queries over databases
containing only many-to-one relationships and much
greater improvements are expected when many-to-many
relationships are embedded in the database.
Furthermore, it is shown how to combine relational and
network retrieval methods. Relations, containing many
tuples, are created during the evaluation of a network
query. Each relation is either joined with other
relations or is used to continue the evaluation of the
network query. The methods given show how to optimize
data retrieval from a relational database that is
implemented using links, where each link represents a
many-to-one relationship.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Illinois at Urbana-Champaign, Urbana, IL,
USA",
affiliationaddress = "Univ of Illinois at Urbana-Champaign, Urbana,
IL, USA",
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "Computer Applications; DATABASE SYSTEMS; INFORMATION
RETRIEVAL SYSTEMS; LOST ACCOUNTING; NETWORK MODELS;
RELATIONAL DATABASES; SORT-OWNER METHOD; TREE QUERIES",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Keller:1984:CIM,
author = "Arthur M. Keller and Jeffrey D. Ullman",
title = "On complementary and independent mappings on
databases",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "143--148",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "The authors define the notion of independent views to
indicate whether the range values of the two views may
be achieved independently. The concept of complementary
views indicates when the domain element can be uniquely
determined by the range values of the two complementary
views. They consider the relationship between
independent and complementary views. In unrestricted
domains, a view (but not the identity or empty view)
can have more than one complementary, independent view.
Databases, however, are more restricted domains: They
are finite power sets. A view is monotonic if it
preserves inclusion. However, in finite power sets when
all views are monotonic, if a given view has another
view which is independent and complementary, then this
view is unique.",
acknowledgement = ack-nhfb,
affiliation = "Stanford Univ, Computer Science Dep, Stanford, CA,
USA",
affiliationaddress = "Stanford Univ, Computer Science Dep, Stanford,
CA, USA",
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "COMPLEMENTARY MAPPINGS; DATABASE SYSTEMS; INDEPENDENT
MAPPINGS; MONOTONIC FUNCTIONS; RELATIONAL DATABASES;
Theory",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Chan:1984:OCT,
author = "Edward P. F. Chan",
title = "Optimal computation of total projections with unions
of simple chase join expressions",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "149--163",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "The representative instance has been proposed as a
query answering device in systems using the Universal
Relation Interface. One approach is to use the total
projections of the representative instance to generate
the answer for a query. Associated with this approach
is the problem of how to generate the total projections
of the representative instance efficiently. A
generalization is proposed of extension joins, called
chase join expressions, as a means to compute the total
projections when functional dependencies are given as
constraints. In particular, an important subclass of
chase join expressions called simple chase join
expressions is identified and it is shown that the
total projections with respect to a set of functional
dependencies can be computed by unions of simple chase
join expressions when an independent scheme is assumed.
Also a simple and efficient algorithm is found that
minimizes the number of join operations in a union of
simple chase join expressions.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Toronto, Computer Systems Research Group,
Toronto, Ont, Can",
affiliationaddress = "Univ of Toronto, Computer Systems Research
Group, Toronto, Ont, Can",
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "CHASE JOIN EXPRESSIONS; CONTAINMENT MAPPINGS; DATABASE
SYSTEMS; QUERY ANSWERING DEVICES; Theory; UNIVERSAL
RELATION INTERFACE",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Willard:1984:EPR,
author = "Dan E. Willard",
title = "Efficient processing of relational calculus
expressions using range query theory",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "164--175",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "In this paper the author defines a language based on a
broad subset of the relational calculus and shows all
expressions in this language can be evaluated in space
O(N) and time O(N log**dN), where d is a small constant
whose value depends on the particular predicate and
where N is the number of records stored in the data
base. Currently there are no hard statistics, but a
reasonable guess seems to be that a standard sequential
random access machine can handle 95\% or more of
commercial requests in time O(N log N) and memory O(N)
using this technique.",
acknowledgement = ack-nhfb,
affiliation = "State Univ of New York at Albany, Albany, NY, USA",
affiliationaddress = "State Univ of New York at Albany, Albany, NY,
USA",
classification = "723; 901; 921",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "AUTOMATA THEORY --- Sequential Machines; DATABASE
SYSTEMS; DECOMPOSABILITY ANALYSIS; RANGE QUERY THEORY;
RELATIONAL CALCULUS; Theory",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Boral:1984:MDS,
author = "Haran Boral and David J. DeWitt",
title = "Methodology for database system performance
evaluation",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "176--185",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "This paper presents a methodology for evaluating the
performance of database management systems and database
machines in a multiuser environment. Three main factors
that affect transaction throughput in a multiuser
environment are identified: multiprogramming level,
degree of data sharing among simultaneously executing
transactions, and transaction mix. It is demonstrated
that only four basic query types are needed to
construct a benchmark that will evaluate the
performance of a system under a wide variety of
workloads. Finally, the results are presented of
applying current techniques to the Britton-Lee IDM 500
database machine.",
acknowledgement = ack-nhfb,
affiliation = "Microelectronics \& Computer Technology Corp, Austin,
TX, USA",
affiliationaddress = "Microelectronics \& Computer Technology Corp,
Austin, TX, USA",
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "COMPUTER SYSTEMS PROGRAMMING --- Multiprogramming;
DATABASE SYSTEMS; DEGREE OF DATA SHARING; HARDWARE
CONFIGURATION; Performance; PORTABILITY ISSUES; QUERY
MIX SELECTION",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Kriegel:1984:PCI,
author = "Hans-Peter Kriegel",
title = "Performance comparison of index structures for
multi-key retrieval",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "186--196",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "This paper reports on a performance comparison of four
software implemented index structures for multi-key
retrieval: the inverted file, the grid file and two
variants of multidimensional B-trees. It turns out that
the recently suggested structures multidimensional
B-tree and grid file outperform the traditional
inverted file.",
acknowledgement = ack-nhfb,
affiliation = "Univ Wuerzburg, Wuerzburg, West Ger",
affiliationaddress = "Univ Wuerzburg, Wuerzburg, West Ger",
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "COMPUTER SOFTWARE; GRID FILE; INDEX STRUCTURES;
INFORMATION RETRIEVAL SYSTEMS; INFORMATION SCIENCE ---
Indexing; INVERTED FILE; MULTIDIMENSIONAL B-TREES;
Performance",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Motro:1984:BLS,
author = "Amihai Motro",
title = "Browsing in a loosely structured database",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "197--207",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "This paper describes an architecture which promotes
databases that are only loosely structured: heaps of
facts instead of highly structured data. This
architecture avoids the traditional dichotomy between
`schema' and `data', and it incorporates a single
mechanism for defining both inference rules and
integrity constraints. As lack of organization will
usually have adverse effect on retrieval, the principal
retrieval method for loosely structured databases is
browsing: exploratory searching which does not assume
any knowledge of the organization (or even the very
existence of organization). Two styles of browsing,
called navigation and probing, are defined. Both are
derived from a standard query language based on
predicate logic.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Southern California, Dep of Computer Science,
Los Angeles, CA, USA",
affiliationaddress = "Univ of Southern California, Dep of Computer
Science, Los Angeles, CA, USA",
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "BROWSING; DATABASE SYSTEMS; INFERENCE RULES;
INFORMATION RETRIEVAL SYSTEMS; LOOSELY STRUCTURED
DATABASES; Management; PREDICATE KNOWLEDGE",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Stonebraker:1984:QDT,
author = "Michael Stonebraker and Erika Anderson and Eric Hanson
and Brad Rubinstein",
title = "{QUEL} as a data type",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "208--214",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "This paper explores the use of commands in a query
language as an abstract data type (ADT) in data base
management systems. Basically, an ADT facility allows
new data types, such as polygons, lines, money, time,
arrays of floating point numbers, bit vectors, etc., to
supplement the built-in data types in a data base
system. This paper demonstrates the power of adding a
data type corresponding to commands in a query
language. Also proposed are three extensions to the
query language QUEL to enhance its power in this
augmented environment.",
acknowledgement = ack-nhfb,
affiliation = "Univ of California, Berkeley, Dep of Electrical
Engineering \& Computer Science, Berkeley, CA, USA",
affiliationaddress = "Univ of California, Berkeley, Dep of Electrical
Engineering \& Computer Science, Berkeley, CA, USA",
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "ABSTRACT DATA TYPE; DATABASE SYSTEMS; DISTRIBUTED
DATABASES; FLOATING POINT NUMBERS; Management; QUERY
LANGUAGE QUEL",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Hogg:1984:AMS,
author = "John Hogg and Stelios Gamvroulas",
title = "Active mail system",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "215--222",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "Conventional electronic mail is passive text that is
created, sent and read. Any further actions must be
initiated by the recipient. By contrast, an
`intelligent message'' (imessage) is an active program
that carries on a dialogue with the recipient. The
imessage may subsequently route itself to other users
as a result of the responses it receives, and it
eventually returns these responses to the original
sender. This paper describes a prototype intelligent
mail system and discusses some of the problems involved
in implementing such a system in a distributed
environment.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Toronto, Computer Systems Research Group,
Toronto, Ont, Can",
affiliationaddress = "Univ of Toronto, Computer Systems Research
Group, Toronto, Ont, Can",
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "ACTIVE MAIL SYSTEMS; DATABASE SYSTEMS --- Distributed;
ELECTRONIC MAIL; IMESSAGE LANGUAGE; INTELLIGENT
MESSAGE; SELF-REPAIRING",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Chang:1984:SDD,
author = "Jo-Mei Chang",
title = "Simplifying distributed database systems design by
using a broadcast network",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "223--233",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "Atomic broadcast and failure detection are powerful
primitives for distributed database systems. In the
distributed database system, LAMBDA, they are provided
as network primitives. This paper shows how atomic
broadcast and failure detection simplify transaction
commitment, concurrency control, and crash recovery.
Specifically, a simple two-phase non-blocking commit
protocol is given; whereas three phases are required in
a point-to-point network. A simplified read-one\slash
write-all update algorithm is also given for replicated
data and an easily implemented log-based recovery
algorithm providing uninterrupted transaction
processing. The benefits of performing the atomic
broadcast and failure detection at the network level
are also discussed. Performing these functions at the
network level not only simplifies database protocols
but also better utilizes the broadcast network: fewer
messages are transmitted. Comparisons between LAMBDA
and existing distributed database systems are also
made.",
acknowledgement = ack-nhfb,
affiliation = "AT\&T Bell Lab, Murray Hill, NJ, USA",
affiliationaddress = "AT\&T Bell Lab, Murray Hill, NJ, USA",
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "ATOMIC BROADCAST; BROADCAST NETWORKS; CONCURRENCY
CONTROL; DATABASE SYSTEM LAMBDA; DATABASE SYSTEMS;
Distributed; FAILURE DETECTION",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Fishman:1984:OJD,
author = "Daniel H. Fishman and Ming-Yee Lai and W. Kevin
Wilkinson",
title = "Overview of the {Jasmin} database machine",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "234--239",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "The Jasmin database machine is being implemented as
part of a research project in distributed processing
and database management. A primary goal of the work is
to demonstrate the feasibility of a practical
multiprocessor database machine suitable for large
database, high transaction-rate applications. Key
features of Jasmin are its configurable performance,
its use of off-the-shelf parts, and its ability to
handle distributed databases. A uniprocessor prototype
of Jasmin has already been completed and the
multiprocessor version is planned for later this year.
This paper describes Jasmin's architecture and
discusses the performance observed in the uniprocessor
prototype.",
acknowledgement = ack-nhfb,
affiliation = "Bell Communications Research",
affiliationaddress = "Bell Communications Research",
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "COMPUTER SOFTWARE; COMPUTER SYSTEMS, DIGITAL ---
Multiprocessing; CONFIGURABLE PERFORMANCE; DATABASE
SYSTEMS; Distributed; JASMIN ARCHITECTURE; JASMIN
DATABASE MACHINE; UNIPROCESSOR PROTOTYPE",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Shmueli:1984:MV,
author = "Oded Shmueli and Alon Itai",
title = "Maintenance of views",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "240--255",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "In relational databases a view definition is a query
against the database, and a view materialization is the
result of applying the view definition to the current
database. A view materialization over a database may
change as relations in the database undergo
modifications. In this paper a mechanism is proposed in
which the view is materialized at all times. The
problem which this mechanism addresses is how to
quickly update the view in response to database
changes. A structure is maintained which provides
information useful in minimizing the amount of work
caused by updates.",
acknowledgement = ack-nhfb,
affiliation = "Technion-Israel Inst of Technology, Computer Science
Dep, Haifa, Isr",
affiliationaddress = "Technion-Israel Inst of Technology, Computer
Science Dep, Haifa, Isr",
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Dat