%%% -*-BibTeX-*-
%%% ====================================================================
%%% BibTeX-file{
%%% author = "Nelson H. F. Beebe",
%%% version = "2.09",
%%% date = "02 July 2009",
%%% time = "15:15:09 MDT",
%%% filename = "pods.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 = "59137 48339 232202 2469008",
%%% email = "beebe at math.utah.edu, beebe at acm.org,
%%% beebe at computer.org (Internet)",
%%% codetable = "ISO/ASCII",
%%% keywords = "bibliography; database systems; Management of
%%% Data; Principles of Database Systems (PODS);
%%% SIGACT; SIGMOD",
%%% license = "public domain",
%%% supported = "yes",
%%% docstring = "This is a BibTeX bibliography for the ACM
%%% SIGACT-SIGMOD Symposia on Principles of
%%% Database Systems (PODS 'xx) (1982--date), and
%%% the ACM SIGMOD Conferences on Management of
%%% Data (SIGMOD 'xx) (1975--date). These
%%% conferences are generally held together, and in
%%% several cases, the SIGMOD 'xx proceedings
%%% have been published as an issue of the
%%% journal SIGMOD Record.
%%%
%%% Version 1.00 of this bibliography covered only
%%% the PODS 'xx symposia; at version 2.00,
%%% entries for the SIGMOD 'xx conferences were
%%% added.
%%%
%%% The companion bibliography tods.bib covers
%%% the ACM Transactions on Database Systems, and
%%% the companion bibliography vldb.bib covers
%%% the International Conferences on Very Large
%%% Data Bases.
%%%
%%% The publisher maintains a World Wide Web site
%%% for these conference proceedings at
%%%
%%% http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/
%%%
%%% with entries for 1985--date. PDF files with
%%% full text of articles are available to
%%% qualified subscribers. All of the papers
%%% listed at that Web site are included in this
%%% bibliography.
%%%
%%% Although all proceedings volumes onward from
%%% the first in 1982 are included here, the
%%% proceedings contents are not yet available
%%% for all years: most of the entries for
%%% 1975--1984 are still missing.
%%%
%%% At version 2.09, the year coverage looked
%%% like this:
%%%
%%% 1975 ( 1) 1987 ( 91) 1999 ( 123)
%%% 1976 ( 2) 1988 ( 90) 2000 ( 85)
%%% 1977 ( 1) 1989 ( 89) 2001 ( 115)
%%% 1978 ( 1) 1990 ( 90) 2002 ( 111)
%%% 1979 ( 1) 1991 ( 83) 2003 ( 117)
%%% 1980 ( 1) 1992 ( 136) 2004 ( 119)
%%% 1981 ( 0) 1993 ( 123) 2005 ( 36)
%%% 1982 ( 4) 1994 ( 117) 2006 ( 40)
%%% 1983 ( 3) 1995 ( 142) 2007 ( 32)
%%% 1984 ( 6) 1996 ( 95) 2008 ( 32)
%%% 1985 ( 57) 1997 ( 98) 2009 ( 31)
%%% 1986 ( 36) 1998 ( 124)
%%%
%%% Article: 1
%%% InProceedings: 2174
%%% Proceedings: 57
%%%
%%% Total entries: 2232
%%%
%%% 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{
}"
# "\ifx \undefined \TM \def \TM {${}^{\sc TM}$} \fi"
}
%%% ====================================================================
%%% 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-SIGACT-SIGMOD-SYMP-PODS = "ACM SIGACT-SIGMOD Symposium on Principles
of Database Systems"}
@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"}
@String{pub-AP = "Academic Press"}
@String{pub-AP:adr = "New York, USA"}
@String{pub-WORLD-SCI = "World Scientific Publishing Co."}
@String{pub-WORLD-SCI:adr = "Singapore; Philadelphia, PA, USA; River
Edge, NJ, USA"}
%%% ====================================================================
%%% Bibliography entries:
@Article{Lin:1976:DRA,
author = "C. S. Lin and D. C. P. Smith and J. M. Smith",
title = "The Design of a Rotating Associative Array Memory for
a Relational Database Management Application",
journal = j-SIGACT-SIGMOD-SYMP-PODS,
volume = "1",
number = "1",
pages = "??--??",
month = mar,
year = "1976",
bibsource = "Database/Wiederhold.bib",
note = "Also published in/as: Proceedings of the First
Conference on Very Large Databases, Morgan Kaufman
pubs. (Los Altos CA), Kerr (ed.), 1975, pp. 453--455.",
annote = "Data analysis in the file control unit.",
}
@InProceedings{Kuck:1982:URD,
author = "S. M. Kuck and Y. Sagiv",
title = "A Universal Relation Database System Implemented Via
the Network Model",
crossref = "ACM:1982:PPA",
pages = "??--??",
year = "1982",
bibsource = "Database/Wiederhold.bib",
annote = "A Subset of a CODASYL implementation is used to
provide for universal relations. Lossless joins are
related to automatic, mandatory sets. Both schema
design and access path optimization is presented.",
}
@InProceedings{Chandra:1983:HCF,
author = "A. K. Chandra and D. Harel",
title = "{Horn} clauses and the fixpoint query hierarchy",
crossref = "ACM:1983:PPS",
pages = "??--??",
year = "1983",
bibsource = "Database/Wiederhold.bib",
annote = "on the complexity of answering queries defined by
logical rules",
}
@InProceedings{Cosmadakis:1984:FID,
author = "S. S. Cosmadakis and P. C. Kanellakis",
title = "Functional and Inclusion Dependencies: {A}
graph-theoretic Approach",
crossref = "ACM:1984:PPT",
pages = "??--??",
year = "1984",
bibsource = "Database/Wiederhold.bib",
annote = "Ownership.",
}
@InProceedings{Lehman:1984:KCK,
author = "D. Lehman",
title = "Knowledge, Common Knowledge, and Related Puzzles",
crossref = "ACM:1984:PPT",
pages = "??--??",
year = "1984",
bibsource = "Database/Wiederhold.bib",
}
@InProceedings{Pitelli:1984:IBA,
author = "F. Pitelli and H. Garc{\'\i}a-Molina and S. Davidson",
title = "Is {Byzantine} Agreement Useful in a Distributed
Database System",
crossref = "ACM:1984:PPT",
pages = "??--??",
year = "1984",
bibsource = "Database/Wiederhold.bib",
note = "Also published in/as: to appear in ACM Transactions on
Database Systems 1985.",
}
@InProceedings{Stemple:1984:SVA,
author = "D. Stemple and T. Sheard",
title = "Specification and Verification of Abstract Database
Types",
crossref = "ACM:1984:PPT",
pages = "??--??",
year = "1984",
bibsource = "Database/Wiederhold.bib",
annote = "All integrity constraints are Schema declarations",
}
@InProceedings{Ozsoyoglu:1985:LPO,
author = "Gultekin Ozsoyoglu and Z. Meral Ozsoyoglu and
Francisco Mata",
title = "A language and a physical organization technique for
summary tables",
crossref = "Navathe:1985:PAS",
pages = "3--16",
year = "1985",
bibdate = "Wed Oct 25 08:47:38 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/318898/p3-ozsoyoglu/p3-ozsoyoglu.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/318898/p3-ozsoyoglu/",
acknowledgement = ack-nhfb,
}
@InProceedings{Roussopoulos:1985:DSS,
author = "Nick Roussopoulos and Daniel Leifker",
title = "Direct spatial search on pictorial databases using
packed {R}-trees",
crossref = "Navathe:1985:PAS",
pages = "17--31",
year = "1985",
bibdate = "Wed Oct 25 08:47:38 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/318898/p17-roussopoulos/p17-roussopoulos.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/318898/p17-roussopoulos/",
acknowledgement = ack-nhfb,
}
@InProceedings{Christodoulakis:1985:IAD,
author = "S. Christodoulakis",
title = "Issues in the architecture of a document archiver
using optical disk technology",
crossref = "Navathe:1985:PAS",
pages = "34--50",
year = "1985",
bibdate = "Wed Oct 25 08:47:38 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/318898/p34-christodoulakis/p34-christodoulakis.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/318898/p34-christodoulakis/",
acknowledgement = ack-nhfb,
}
@InProceedings{Barbic:1985:TMO,
author = "F. Barbic and B. Pernici",
title = "Time modeling in office information systems",
crossref = "Navathe:1985:PAS",
pages = "51--62",
year = "1985",
bibdate = "Wed Oct 25 08:47:38 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/318898/p51-barbic/p51-barbic.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/318898/p51-barbic/",
acknowledgement = ack-nhfb,
}
@InProceedings{Faloutsos:1985:SFD,
author = "Chris Faloutsos",
title = "Signature files: design and performance comparison of
some signature extraction methods",
crossref = "Navathe:1985:PAS",
pages = "63--82",
year = "1985",
bibdate = "Wed Oct 25 08:47:38 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/318898/p63-faloutsos/p63-faloutsos.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/318898/p63-faloutsos/",
acknowledgement = ack-nhfb,
}
@InProceedings{Eick:1985:ATK,
author = "Christoph F. Eick and Peter C. Lockemann",
title = "Acquisition of terminological knowledge using database
design techniques",
crossref = "Navathe:1985:PAS",
pages = "84--94",
year = "1985",
bibdate = "Wed Oct 25 08:47:38 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/318898/p84-eick/p84-eick.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/318898/p84-eick/",
acknowledgement = ack-nhfb,
}
@InProceedings{Shin:1985:PRD,
author = "D. G. Shin and K. B. Irani",
title = "Partitioning a relational database horizontally using
a knowledge-based approach",
crossref = "Navathe:1985:PAS",
pages = "95--105",
year = "1985",
bibdate = "Wed Oct 25 08:47:38 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/318898/p95-shin/p95-shin.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/318898/p95-shin/",
acknowledgement = ack-nhfb,
}
@InProceedings{Agrawal:1985:MSC,
author = "Rakesh Agrawal and Michael J. Carey and Miron Livny",
title = "Models for studying concurrency control performance:
alternatives and implications",
crossref = "Navathe:1985:PAS",
pages = "108--121",
year = "1985",
bibdate = "Wed Oct 25 08:47:38 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/318898/p108-agrawal/p108-agrawal.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/318898/p108-agrawal/",
acknowledgement = ack-nhfb,
}
@InProceedings{Robinson:1985:FGP,
author = "John T. Robinson",
title = "A fast general-purpose hardware synchronization
mechanism",
crossref = "Navathe:1985:PAS",
pages = "122--130",
year = "1985",
bibdate = "Wed Oct 25 08:47:38 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/318898/p122-robinson/p122-robinson.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/318898/p122-robinson/",
acknowledgement = ack-nhfb,
}
@InProceedings{Agrawal:1985:RAM,
author = "Rakesh Agrawal and David J. DeWitt",
title = "Recovery architectures for multiprocessor database
machines",
crossref = "Navathe:1985:PAS",
pages = "131--145",
year = "1985",
bibdate = "Wed Oct 25 08:47:38 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/318898/p131-agrawal/p131-agrawal.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/318898/p131-agrawal/",
acknowledgement = ack-nhfb,
}
@InProceedings{Batini:1985:DDM,
author = "Carlo Batini and Stefano Ceri and Al Hershey and
George Gardarin and David Reiner",
title = "Database design: methodologies, tools, and
environments (panel session)",
crossref = "Navathe:1985:PAS",
pages = "148--150",
year = "1985",
bibdate = "Wed Oct 25 08:47:38 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/318898/p148-batini/p148-batini.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/318898/p148-batini/",
acknowledgement = ack-nhfb,
}
@InProceedings{Hsu:1985:ICM,
author = "Arding Hsu and Tomasz Imielinski",
title = "Integrity checking for multiple updates",
crossref = "Navathe:1985:PAS",
pages = "152--168",
year = "1985",
bibdate = "Wed Oct 25 08:47:38 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/citations/proceedings/mod/318898/p152-hsu/",
acknowledgement = ack-nhfb,
}
@InProceedings{Kung:1985:VDT,
author = "C. H. Kung",
title = "On verification of database temporal constraints",
crossref = "Navathe:1985:PAS",
pages = "169--179",
year = "1985",
bibdate = "Wed Oct 25 08:47:38 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/318898/p169-kung/p169-kung.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/318898/p169-kung/",
acknowledgement = ack-nhfb,
}
@InProceedings{Kuper:1985:EPL,
author = "Gabriel M. Kuper and Moshe Y. Vardi",
title = "On the expressive power of the logical data model:
preliminary report",
crossref = "Navathe:1985:PAS",
pages = "180--187",
year = "1985",
bibdate = "Wed Oct 25 08:47:38 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/318898/p180-kuper/p180-kuper.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/318898/p180-kuper/",
acknowledgement = ack-nhfb,
}
@InProceedings{Larson:1985:EPH,
author = "Per-Ake Larson and M. V. Ramakrishna",
title = "External perfect hashing",
crossref = "Navathe:1985:PAS",
pages = "190--200",
year = "1985",
bibdate = "Wed Oct 25 08:47:38 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/318898/p190-larson/p190-larson.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/318898/p190-larson/",
acknowledgement = ack-nhfb,
}
@InProceedings{Kawagoe:1985:MDH,
author = "Kyoji Kawagoe",
title = "Modified dynamic hashing",
crossref = "Navathe:1985:PAS",
pages = "201--213",
year = "1985",
bibdate = "Wed Oct 25 08:47:38 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/318898/p201-kawagoe/p201-kawagoe.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/318898/p201-kawagoe/",
acknowledgement = ack-nhfb,
}
@InProceedings{Otoo:1985:MDH,
author = "Ekow J. Otoo",
title = "A multidimensional digital hashing scheme for files
with composite keys",
crossref = "Navathe:1985:PAS",
pages = "214--229",
year = "1985",
bibdate = "Wed Oct 25 08:47:38 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/318898/p214-otoo/p214-otoo.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/318898/p214-otoo/",
acknowledgement = ack-nhfb,
}
@InProceedings{Sibley:1985:PDM,
author = "Edgar H. Sibley and Matthias Jarke and Cecil S. McMinn
and John Murray and Randall Rustin and Ken Sloan",
title = "Pragmatics of database management (panel session)",
crossref = "Navathe:1985:PAS",
pages = "232--234",
year = "1985",
bibdate = "Wed Oct 25 08:47:38 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/318898/p232-sibley/p232-sibley.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/318898/p232-sibley/",
acknowledgement = ack-nhfb,
}
@InProceedings{Snodgrass:1985:TTD,
author = "Richard Snodgrass and Ilsoo Ahn",
title = "A taxonomy of time databases",
crossref = "Navathe:1985:PAS",
pages = "236--246",
year = "1985",
bibdate = "Wed Oct 25 08:47:38 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/318898/p236-snodgrass/p236-snodgrass.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/318898/p236-snodgrass/",
acknowledgement = ack-nhfb,
}
@InProceedings{Clifford:1985:AHR,
author = "James Clifford and Abdullah Uz Tansel",
title = "On an algebra for historical relational databases: two
views",
crossref = "Navathe:1985:PAS",
pages = "247--265",
year = "1985",
bibdate = "Wed Oct 25 08:47:38 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/318898/p247-clifford/p247-clifford.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/318898/p247-clifford/",
acknowledgement = ack-nhfb,
}
@InProceedings{Copeland:1985:DSM,
author = "George P. Copeland and Setrag N. Khoshafian",
title = "A decomposition storage model",
crossref = "Navathe:1985:PAS",
pages = "268--279",
year = "1985",
bibdate = "Wed Oct 25 08:47:38 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/318898/p268-copeland/p268-copeland.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/318898/p268-copeland/",
acknowledgement = ack-nhfb,
}
@InProceedings{Yu:1985:AIS,
author = "C. T. Yu and C. H. Chen",
title = "Adaptive information system design: one query at a
time",
crossref = "Navathe:1985:PAS",
pages = "280--290",
year = "1985",
bibdate = "Wed Oct 25 08:47:38 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/318898/p280-yu/p280-yu.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/318898/p280-yu/",
acknowledgement = ack-nhfb,
}
@InProceedings{Beckley:1985:MRK,
author = "D. A. Beckley and M. W. Evens and V. K. Raman",
title = "Multikey retrieval from {K-d} trees and {QUAD-trees}",
crossref = "Navathe:1985:PAS",
pages = "291--301",
year = "1985",
bibdate = "Wed Oct 25 08:47:38 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/318898/p291-beckley/p291-beckley.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/318898/p291-beckley/",
acknowledgement = ack-nhfb,
}
@InProceedings{Christodoulakis:1985:MDM,
author = "Starvos Christodoulakis and D. Badal and A. Cardenas
and P. Mantey and F. Tompa and D. Tsichritzis",
title = "Multimedia database management (panel session)",
crossref = "Navathe:1985:PAS",
pages = "304--305",
year = "1985",
bibdate = "Wed Oct 25 08:47:38 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/318898/p304-christodoulakis/p304-christodoulakis.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/318898/p304-christodoulakis/",
acknowledgement = ack-nhfb,
}
@InProceedings{Fushimi:1985:APE,
author = "Shinya Fushimi and Masaru Kitsuregawa and Masaya
Nakayama and Hidehiko Tanaka and Tohru Moto-oka",
title = "Algorithm and performance evaluation of adaptive
multidimensional clustering technique",
crossref = "Navathe:1985:PAS",
pages = "308--318",
year = "1985",
bibdate = "Wed Oct 25 08:47:38 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/318898/p308-fushimi/p308-fushimi.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/318898/p308-fushimi/",
acknowledgement = ack-nhfb,
}
@InProceedings{Kamel:1985:MDD,
author = "Nabil Kamel and Roger King",
title = "A model of data distribution based on texture
analysis",
crossref = "Navathe:1985:PAS",
pages = "319--325",
year = "1985",
bibdate = "Wed Oct 25 08:47:38 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/318898/p319-kamel/p319-kamel.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/318898/p319-kamel/",
acknowledgement = ack-nhfb,
}
@InProceedings{Goldman:1985:IIS,
author = "Kenneth J. Goldman and Sally A. Goldman and Paris C.
Kanellakis and Stanley B. Zdonik",
title = "{ISIS}: interface for a semantic information system",
crossref = "Navathe:1985:PAS",
pages = "328--342",
year = "1985",
bibdate = "Wed Oct 25 08:47:38 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/318898/p328-goldman/p328-goldman.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/318898/p328-goldman/",
acknowledgement = ack-nhfb,
}
@InProceedings{Vossen:1985:HLU,
author = "Gottfried Vossen and Volkert Brosda",
title = "A high-level user interface for update and retrieval
in relational databases--language aspects",
crossref = "Navathe:1985:PAS",
pages = "343--353",
year = "1985",
bibdate = "Wed Oct 25 08:47:38 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/318898/p343-vossen/p343-vossen.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/318898/p343-vossen/",
acknowledgement = ack-nhfb,
}
@InProceedings{Demo:1985:ACD,
author = "G. Barbara Demo and Sukhamay Kundu",
title = "Analysis of the context dependency of {CODASYL}
find-statements with application to a database program
conversion",
crossref = "Navathe:1985:PAS",
pages = "354--361",
year = "1985",
bibdate = "Wed Oct 25 08:47:38 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/318898/p354-demo/p354-demo.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/318898/p354-demo/",
acknowledgement = ack-nhfb,
}
@InProceedings{Acharya:1985:TRP,
author = "Shridhar Acharya and Gael Buckley",
title = "Transaction restarts in {Prolog} database systems",
crossref = "Navathe:1985:PAS",
pages = "364--373",
year = "1985",
bibdate = "Wed Oct 25 08:47:38 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/318898/p364-acharya/p364-acharya.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/318898/p364-acharya/",
acknowledgement = ack-nhfb,
}
@InProceedings{Page:1985:GDD,
author = "Thomas W. Page and Matthew J. Weinstein and Gerald J.
Popek",
title = "Genesis: a distributed database operating system",
crossref = "Navathe:1985:PAS",
pages = "374--387",
year = "1985",
bibdate = "Wed Oct 25 08:47:38 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/318898/p374-page/p374-page.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/318898/p374-page/",
acknowledgement = ack-nhfb,
}
@InProceedings{Klahold:1985:TMS,
author = "P. Klahold and G. Schlageter and R. Unland and W.
Wilkes",
title = "A transaction model supporting complex applications in
integrated information systems",
crossref = "Navathe:1985:PAS",
pages = "388--401",
year = "1985",
bibdate = "Wed Oct 25 08:47:38 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/citations/proceedings/mod/318898/p388-klahold/",
acknowledgement = ack-nhfb,
}
@InProceedings{Sinha:1985:TBC,
author = "Mukul K. Sinha and P. D. Nandikar and S. L.
Mehndiratta",
title = "Timestamp based certification schemes for transactions
in distributed database systems",
crossref = "Navathe:1985:PAS",
pages = "402--411",
year = "1985",
bibdate = "Wed Oct 25 08:47:38 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/318898/p402-sinha/p402-sinha.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/318898/p402-sinha/",
acknowledgement = ack-nhfb,
}
@InProceedings{Kerschberg:1985:EDS,
author = "Larry Kerschberg and Michael Brodie and Charles
Kellogg and D. Stott Parker and Gio Wiederhold and
Carlo Zaniolo",
title = "Expert database systems (workshop review)",
crossref = "Navathe:1985:PAS",
pages = "414--417",
year = "1985",
bibdate = "Wed Oct 25 08:47:38 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/318898/p414-kerschberg/p414-kerschberg.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/318898/p414-kerschberg/",
acknowledgement = ack-nhfb,
}
@InProceedings{Bhargava:1985:RDD,
author = "Bharat Bhargava",
title = "Reliability in distributed database systems (panel
discussion)",
crossref = "Navathe:1985:PAS",
pages = "420--422",
year = "1985",
bibdate = "Wed Oct 25 08:47:38 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/318898/p420-bhargava/p420-bhargava.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/318898/p420-bhargava/",
acknowledgement = ack-nhfb,
}
@InProceedings{Sellis:1985:OED,
author = "Timos K. Sellis and Leonard Shapiro",
title = "Optimization of extended database query languages",
crossref = "Navathe:1985:PAS",
pages = "424--436",
year = "1985",
bibdate = "Wed Oct 25 08:47:38 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/318898/p424-sellis/p424-sellis.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/318898/p424-sellis/",
acknowledgement = ack-nhfb,
}
@InProceedings{Gray:1985:EPA,
author = "P. M. D. Gray",
title = "Efficient {Prolog} access to {CODAYSL} and {FDM}
databases",
crossref = "Navathe:1985:PAS",
pages = "437--443",
year = "1985",
bibdate = "Wed Oct 25 08:47:38 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/318898/p437-gray/p437-gray.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/318898/p437-gray/",
acknowledgement = ack-nhfb,
}
@InProceedings{Blain:1985:MPC,
author = "Tomas Blain and Michael Dohler and Ralph Michaelis and
Emran Qureshi",
title = "Managing the printed circuit board design process",
crossref = "Navathe:1985:PAS",
pages = "447--456",
year = "1985",
bibdate = "Wed Oct 25 08:47:38 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/318898/p447-blain/p447-blain.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/318898/p447-blain/",
acknowledgement = ack-nhfb,
}
@InProceedings{Abiteboul:1985:TIC,
author = "S. Abiteboul and V. Vianu",
title = "Transactions and Integrity Constraints",
crossref = "ACM:1985:PPF",
pages = "??--??",
month = mar,
year = "1985",
bibsource = "Database/Wiederhold.bib",
}
@InProceedings{Atzeni:1985:EQA,
author = "P. Atzeni and E. P. F. Chan",
title = "Efficient Query Answering in the Representative
Instance Approach",
crossref = "ACM:1985:PPF",
pages = "??--??",
month = mar,
year = "1985",
bibsource = "Database/Wiederhold.bib",
}
@InProceedings{Ausiello:1985:CPG,
author = "G. Ausiello and A. D'Atri",
title = "Chordality Properties on Graphs and Minimal Conceptual
Connections in Semantic Data Models",
crossref = "ACM:1985:PPF",
pages = "??--??",
month = mar,
year = "1985",
bibsource = "Database/Wiederhold.bib",
}
@InProceedings{Bancilhon:1985:AVP,
author = "F. Bancilhon and M. Spyratos",
title = "Algebraic Versus Probabilistic Independence in Data
Bases",
crossref = "ACM:1985:PPF",
pages = "??--??",
month = mar,
year = "1985",
bibsource = "Database/Wiederhold.bib",
}
@InProceedings{Casanova:1985:CLR,
author = "M. A. Casanova and A. V. Moura and L. Tucherman",
title = "On the Correctness of a Local Recovery Subsystem",
crossref = "ACM:1985:PPF",
pages = "??--??",
month = mar,
year = "1985",
bibsource = "Database/Wiederhold.bib",
}
@InProceedings{Cosmadakis:1985:PSR,
author = "S. S. Cosmadakis and P. C. Kanellakis and N.
Spyratos",
title = "Partition Semantics for Relations",
crossref = "ACM:1985:PPF",
pages = "??--??",
month = mar,
year = "1985",
bibsource = "Database/Wiederhold.bib",
}
@InProceedings{GarciaMolina:1985:EEC,
author = "H. Garc{\'\i}a-Molina and J. Kent",
title = "An Experimental Evaluation of Crash Recovery
Mechanism",
crossref = "ACM:1985:PPF",
pages = "??--??",
month = mar,
year = "1985",
bibsource = "Database/Wiederhold.bib",
}
@InProceedings{Gyssens:1985:EJD,
author = "Marc Gyssens",
title = "Embedded Join Dependencies as a Tool for Decomposing
Full Join Dependencies",
crossref = "ACM:1985:PPF",
pages = "??--??",
month = mar,
year = "1985",
bibsource = "Database/Wiederhold.bib",
}
@InProceedings{Keller:1985:ATV,
author = "A. M. Keller",
title = "Algorithms for Translating View Updates to Database
Updates for Views Involving Selections, Projections,
and Joins",
crossref = "ACM:1985:PPF",
pages = "??--??",
month = mar,
year = "1985",
bibsource = "Database/Wiederhold.bib",
}
@InProceedings{Mannila:1985:SAR,
author = "H. Mannila and K-J. Raiha",
title = "Small {Armstrong} Relations for Database Design",
crossref = "ACM:1985:PPF",
pages = "??--??",
month = mar,
year = "1985",
bibsource = "Database/Wiederhold.bib",
}
@InProceedings{Page:1985:DDM,
author = "T. W. {Page, Jr.} and G. J. Popek",
title = "Distributed Data Management in Local Area Networks",
crossref = "ACM:1985:PPF",
pages = "??--??",
month = mar,
year = "1985",
bibsource = "Database/Wiederhold.bib",
}
@InProceedings{Sagiv:1985:COB,
author = "Yehoshua Sagiv",
title = "Concurrent Operations on {B}*-Trees with Overtaking",
crossref = "ACM:1985:PPF",
pages = "??--??",
month = mar,
year = "1985",
bibsource = "Database/Wiederhold.bib",
}
@InProceedings{Sagiv:1985:CRP,
author = "Yehoshua Sagiv",
title = "On Computing Restricted Projections of Representative
Instances",
crossref = "ACM:1985:PPF",
pages = "??--??",
month = mar,
year = "1985",
bibsource = "Database/Wiederhold.bib",
}
@InProceedings{Skeen:1985:EFA,
author = "D. Skeen and F. Cristian and A. ElAbbadi",
title = "An Efficient Fault-Tolerant Algorithm for Replicated
Data Management",
crossref = "ACM:1985:PPF",
pages = "??--??",
month = mar,
year = "1985",
bibsource = "Database/Wiederhold.bib",
}
@InProceedings{Stein:1985:RUS,
author = "J. Stein and D. Maier",
title = "Relaxing the Universal Scheme Assumption",
crossref = "ACM:1985:PPF",
pages = "??--??",
month = mar,
year = "1985",
bibsource = "Database/Wiederhold.bib",
}
@InProceedings{Vardi:1985:QLD,
author = "Moshe Vardi",
title = "Querying Logical Databases",
crossref = "ACM:1985:PPF",
pages = "??--??",
month = mar,
year = "1985",
bibsource = "Database/Wiederhold.bib",
}
@InProceedings{Yannakakis:1985:CRC,
author = "Mihalis Yannakakis and C. H. Papadimitriou",
title = "The Complexity of Reliable Concurrency Control",
crossref = "ACM:1985:PPF",
pages = "??--??",
month = mar,
year = "1985",
bibsource = "Database/Wiederhold.bib",
}
@InProceedings{Bancilhon:1986:MSO,
author = "Fran{\c{c}}ois Bancilhon and David Maier and Yehoshua
Sagiv and Jeffrey D. Ullman",
title = "Magic sets and other strange ways to implement logic
programs (extended abstract)",
crossref = "ACM:1986:PPF",
pages = "1--15",
year = "1986",
bibdate = "Wed Oct 25 08:47:35 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/6012/p1-bancilhon/p1-bancilhon.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/6012/p1-bancilhon/",
acknowledgement = ack-nhfb,
keywords = "algorithms; languages; performance; theory",
subject = "{\bf I.2.2} Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Automatic Programming, Program
transformation. {\bf I.2.3} Computing Methodologies,
ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving,
Logic programming. {\bf I.2.4} Computing Methodologies,
ARTIFICIAL INTELLIGENCE, Knowledge Representation
Formalisms and Methods, Representations (procedural and
rule-based). {\bf I.2.4} Computing Methodologies,
ARTIFICIAL INTELLIGENCE, Knowledge Representation
Formalisms and Methods, Predicate logic. {\bf I.2.5}
Computing Methodologies, ARTIFICIAL INTELLIGENCE,
Programming Languages and Software, Prolog. {\bf H.2.3}
Information Systems, DATABASE MANAGEMENT, Languages,
Query languages. {\bf H.2.4} Information Systems,
DATABASE MANAGEMENT, Systems, Query processing. {\bf
H.2.1} Information Systems, DATABASE MANAGEMENT,
Logical Design.",
}
@InProceedings{Sacca:1986:ISC,
author = "Domenico Sacc{\`a} and Carlo Zaniolo",
title = "On the implementation of a simple class of logic
queries for databases",
crossref = "ACM:1986:PPF",
pages = "16--23",
year = "1986",
bibdate = "Wed Oct 25 08:47:35 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/6012/p16-sacca/p16-sacca.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/6012/p16-sacca/",
acknowledgement = ack-nhfb,
keywords = "algorithms; languages; performance; theory",
subject = "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
Languages, Query languages. {\bf F.4.1} Theory of
Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES,
Mathematical Logic, Logic and constraint programming.
{\bf I.2.4} Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Knowledge Representation Formalisms and
Methods, Predicate logic. {\bf E.1} Data, DATA
STRUCTURES, Graphs and networks. {\bf I.2.3} Computing
Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and
Theorem Proving, Answer/reason extraction. {\bf H.2.1}
Information Systems, DATABASE MANAGEMENT, Logical
Design.",
}
@InProceedings{Afrati:1986:CSQ,
author = "Foto Afrati and Christos Papadimitriou and George
Papageorgiou and Athena Roussou and Yehoshua Sagiv and
Jeffrey D. Ullman",
title = "Convergence of sideways query evaluation",
crossref = "ACM:1986:PPF",
pages = "24--30",
year = "1986",
bibdate = "Wed Oct 25 08:47:35 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/6012/p24-afrati/p24-afrati.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/6012/p24-afrati/;
http://www.acm.org:80/pubs/citations/proceedings/pods/6012/p24-afrati/",
acknowledgement = ack-nhfb,
keywords = "algorithms; languages; theory",
subject = "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
Languages, Query languages. {\bf H.2.1} Information
Systems, DATABASE MANAGEMENT, Logical Design, Data
models. {\bf G.2.2} Mathematics of Computing, DISCRETE
MATHEMATICS, Graph Theory, Graph algorithms. {\bf
F.4.3} Theory of Computation, MATHEMATICAL LOGIC AND
FORMAL LANGUAGES, Formal Languages, Classes defined by
grammars or automata.",
}
@InProceedings{Weikum:1986:TFM,
author = "Gerhard Weikum",
title = "A theoretical foundation of multi-level concurrency
control",
crossref = "ACM:1986:PPF",
pages = "31--43",
year = "1986",
bibdate = "Wed Oct 25 08:47:35 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/6012/p31-weikum/p31-weikum.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/6012/p31-weikum/;
http://www.acm.org:80/pubs/citations/proceedings/pods/6012/p31-weikum/",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; theory",
subject = "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
Systems, Transaction processing. {\bf D.4.1} Software,
OPERATING SYSTEMS, Process Management, Concurrency.
{\bf D.4.1} Software, OPERATING SYSTEMS, Process
Management, Scheduling. {\bf D.4.1} Software, OPERATING
SYSTEMS, Process Management, Deadlocks.",
}
@InProceedings{Hadzilacos:1986:DCT,
author = "Thanasis Hadzilacos and Mihalis Yannakakis",
title = "Deleting completed transactions",
crossref = "ACM:1986:PPF",
pages = "43--46",
year = "1986",
bibdate = "Wed Oct 25 08:47:35 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/6012/p43-hadzilacos/p43-hadzilacos.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/6012/p43-hadzilacos/;
http://www.acm.org:80/pubs/citations/proceedings/pods/6012/p43-hadzilacos/",
acknowledgement = ack-nhfb,
keywords = "design; theory; verification",
subject = "{\bf D.4.1} Software, OPERATING SYSTEMS, Process
Management, Concurrency. {\bf D.4.1} Software,
OPERATING SYSTEMS, Process Management, Deadlocks. {\bf
D.4.1} Software, OPERATING SYSTEMS, Process Management,
Scheduling. {\bf G.2.2} Mathematics of Computing,
DISCRETE MATHEMATICS, Graph Theory, Graph algorithms.
{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models.",
}
@InProceedings{Su:1986:SNT,
author = "Jianwen Su",
title = "Safety of non-well-locked transaction systems",
crossref = "ACM:1986:PPF",
pages = "47--52",
year = "1986",
bibdate = "Thu Mar 12 18:39:01 MST 1998",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pods/6012/p47-su/",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; performance; security; theory",
subject = "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
Systems, Transaction processing. {\bf D.4.1} Software,
OPERATING SYSTEMS, Process Management, Concurrency.
{\bf D.4.1} Software, OPERATING SYSTEMS, Process
Management, Deadlocks. {\bf D.4.1} Software, OPERATING
SYSTEMS, Process Management, Scheduling. {\bf H.2.2}
Information Systems, DATABASE MANAGEMENT, Physical
Design, Access methods. {\bf H.2.1} Information
Systems, DATABASE MANAGEMENT, Logical Design, Data
models.",
}
@InProceedings{Su:1986:SNW,
author = "Jianwen Su",
title = "Safety of non-well-locked transaction systems",
crossref = "ACM:1986:PPF",
pages = "47--52",
year = "1986",
bibdate = "Wed Oct 25 08:47:35 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/6012/p47-su/p47-su.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/6012/p47-su/",
acknowledgement = ack-nhfb,
}
@InProceedings{Bancilhon:1986:CCO,
author = "Fran{\c{c}}ois Bancilhon and Setrag Khoshafian",
title = "A calculus for complex objects",
crossref = "ACM:1986:PPF",
pages = "53--60",
year = "1986",
bibdate = "Wed Oct 25 08:47:35 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/6012/p53-bancilhon/p53-bancilhon.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/6012/p53-bancilhon/;
http://www.acm.org:80/pubs/citations/proceedings/pods/6012/p53-bancilhon/",
acknowledgement = ack-nhfb,
keywords = "design; theory",
subject = "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf H.2.1} Information
Systems, DATABASE MANAGEMENT, Logical Design, Normal
forms. {\bf G.2.2} Mathematics of Computing, DISCRETE
MATHEMATICS, Graph Theory, Graph algorithms. {\bf
F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Computations on discrete structures. {\bf
F.2.1} Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Numerical Algorithms and
Problems, Number-theoretic computations.",
}
@InProceedings{Gucht:1986:SCM,
author = "Dirk Van Gucht and Patrick C. Fischer",
title = "Some classes of multilevel relational structures",
crossref = "ACM:1986:PPF",
pages = "60--69",
year = "1986",
bibdate = "Wed Oct 25 08:47:35 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/6012/p60-van_gucht/p60-van_gucht.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/6012/p60-van_gucht/",
acknowledgement = ack-nhfb,
}
@InProceedings{VanGucht:1986:SCM,
author = "Dirk {Van Gucht} and Patrick C. Fischer",
title = "Some classes of multilevel relational structures",
crossref = "ACM:1986:PPF",
pages = "60--69",
year = "1986",
bibdate = "Thu Mar 12 18:39:01 MST 1998",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pods/6012/p60-van_gucht/",
acknowledgement = ack-nhfb,
keywords = "algorithms; theory; verification",
subject = "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf H.2.1} Information
Systems, DATABASE MANAGEMENT, Logical Design, Normal
forms. {\bf H.2.1} Information Systems, DATABASE
MANAGEMENT, Logical Design, Schema and subschema. {\bf
F.2.1} Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Numerical Algorithms and
Problems, Number-theoretic computations.",
}
@InProceedings{Gadia:1986:WTR,
author = "Shashi K. Gadia",
title = "Weak temporal relations",
crossref = "ACM:1986:PPF",
pages = "70--77",
year = "1986",
bibdate = "Wed Oct 25 08:47:35 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/6012/p70-gadia/p70-gadia.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/6012/p70-gadia/;
http://www.acm.org:80/pubs/citations/proceedings/pods/6012/p70-gadia/",
acknowledgement = ack-nhfb,
keywords = "design; languages; theory",
subject = "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf F.2.1} Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Numerical Algorithms and Problems,
Number-theoretic computations. {\bf D.3.1} Software,
PROGRAMMING LANGUAGES, Formal Definitions and Theory,
Semantics. {\bf H.2.4} Information Systems, DATABASE
MANAGEMENT, Systems, Query processing.",
}
@InProceedings{Olken:1986:RDM,
author = "Frank Olken and Doron Rotem",
title = "Rearranging data to maximize the efficiency of
compression",
crossref = "ACM:1986:PPF",
pages = "78--90",
year = "1986",
bibdate = "Wed Oct 25 08:47:35 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/6012/p78-olken/p78-olken.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/6012/p78-olken/;
http://www.acm.org:80/pubs/citations/proceedings/pods/6012/p78-olken/",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; economics; theory; verification",
subject = "{\bf E.4} Data, CODING AND INFORMATION THEORY, Data
compaction and compression. {\bf H.3.2} Information
Systems, INFORMATION STORAGE AND RETRIEVAL, Information
Storage, File organization. {\bf H.2.1} Information
Systems, DATABASE MANAGEMENT, Logical Design, Data
models.",
}
@InProceedings{Robinson:1986:OPL,
author = "John T. Robinson",
title = "Order preserving linear hashing using dynamic key
statistics",
crossref = "ACM:1986:PPF",
pages = "91--99",
year = "1986",
bibdate = "Wed Oct 25 08:47:35 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/6012/p91-robinson/p91-robinson.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/6012/p91-robinson/;
http://www.acm.org:80/pubs/citations/proceedings/pods/6012/p91-robinson/",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; experimentation; measurement;
performance; theory",
subject = "{\bf H.2.2} Information Systems, DATABASE MANAGEMENT,
Physical Design, Access methods. {\bf E.2} Data, DATA
STORAGE REPRESENTATIONS, Hash-table representations.
{\bf E.5} Data, FILES, Organization/structure. {\bf
D.4.3} Software, OPERATING SYSTEMS, File Systems
Management, Access methods.",
}
@InProceedings{Otoo:1986:BME,
author = "Ekow J. Otoo",
title = "Balanced multidimensional extendible hash tree",
crossref = "ACM:1986:PPF",
pages = "100--113",
year = "1986",
bibdate = "Wed Oct 25 08:47:35 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/6012/p100-otoo/p100-otoo.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/6012/p100-otoo/;
http://www.acm.org:80/pubs/citations/proceedings/pods/6012/p100-otoo/",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; experimentation; theory",
subject = "{\bf E.2} Data, DATA STORAGE REPRESENTATIONS,
Hash-table representations. {\bf E.1} Data, DATA
STRUCTURES, Trees. {\bf E.5} Data, FILES,
Organization/structure. {\bf E.1} Data, DATA
STRUCTURES, Arrays. {\bf H.2.1} Information Systems,
DATABASE MANAGEMENT, Logical Design, Schema and
subschema. {\bf H.2.7} Information Systems, DATABASE
MANAGEMENT, Database Administration, Data
dictionary/directory. {\bf H.2.4} Information Systems,
DATABASE MANAGEMENT, Systems, Query processing. {\bf
F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Sorting and searching. {\bf D.4.3} Software,
OPERATING SYSTEMS, File Systems Management, Access
methods.",
}
@InProceedings{Naqvi:1986:NFF,
author = "Shamim A. Naqvi",
title = "Negation as failure for first-order queries",
crossref = "ACM:1986:PPF",
pages = "114--122",
year = "1986",
bibdate = "Wed Oct 25 08:47:35 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/6012/p114-naqvi/p114-naqvi.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/6012/p114-naqvi/;
http://www.acm.org:80/pubs/citations/proceedings/pods/6012/p114-naqvi/",
acknowledgement = ack-nhfb,
keywords = "economics; languages; performance; reliability;
theory",
subject = "{\bf I.2.5} Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Programming Languages and Software,
Prolog. {\bf H.2.3} Information Systems, DATABASE
MANAGEMENT, Languages, Query languages. {\bf F.4.1}
Theory of Computation, MATHEMATICAL LOGIC AND FORMAL
LANGUAGES, Mathematical Logic, Logic and constraint
programming. {\bf I.2.4} Computing Methodologies,
ARTIFICIAL INTELLIGENCE, Knowledge Representation
Formalisms and Methods, Predicate logic. {\bf F.4.3}
Theory of Computation, MATHEMATICAL LOGIC AND FORMAL
LANGUAGES, Formal Languages, Classes defined by
grammars or automata.",
}
@InProceedings{Bidoit:1986:PVM,
author = "Nicole Bidoit and Richard Hull",
title = "Positivism vs. minimalism in deductive databases",
crossref = "ACM:1986:PPF",
pages = "123--132",
year = "1986",
bibdate = "Wed Oct 25 08:47:35 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/6012/p123-bidoit/p123-bidoit.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/6012/p123-bidoit/;
http://www.acm.org:80/pubs/citations/proceedings/pods/6012/p123-bidoit/",
acknowledgement = ack-nhfb,
keywords = "languages; performance; reliability; theory",
subject = "{\bf I.2.3} Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Deduction and Theorem Proving, Deduction.
{\bf H.1.m} Information Systems, MODELS AND PRINCIPLES,
Miscellaneous. {\bf I.2.3} Computing Methodologies,
ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving,
Nonmonotonic reasoning and belief revision. {\bf I.2.4}
Computing Methodologies, ARTIFICIAL INTELLIGENCE,
Knowledge Representation Formalisms and Methods,
Predicate logic. {\bf D.3.1} Software, PROGRAMMING
LANGUAGES, Formal Definitions and Theory, Semantics.
{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC
AND FORMAL LANGUAGES, Mathematical Logic, Logic and
constraint programming.",
}
@InProceedings{Gelfond:1986:ECW,
author = "M. Gelfond and H. Przymusinska and T. Przymusinski",
title = "The extended closed world assumption and its
relationship to parallel circumscription",
crossref = "ACM:1986:PPF",
pages = "133--139",
year = "1986",
bibdate = "Wed Oct 25 08:47:35 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/6012/p133-gelfond/p133-gelfond.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/6012/p133-gelfond/;
http://www.acm.org:80/pubs/citations/proceedings/pods/6012/p133-gelfond/",
acknowledgement = ack-nhfb,
keywords = "languages; performance; reliability; theory",
subject = "{\bf I.2.4} Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Knowledge Representation Formalisms and
Methods, Predicate logic. {\bf I.2.3} Computing
Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and
Theorem Proving, Nonmonotonic reasoning and belief
revision. {\bf H.1.m} Information Systems, MODELS AND
PRINCIPLES, Miscellaneous. {\bf F.4.1} Theory of
Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES,
Mathematical Logic, Computational logic.",
}
@InProceedings{Chan:1986:PCC,
author = "E. P. F. Chan and Paolo Atzeni",
title = "On the properties and characterization of
connection-trap-free schemes",
crossref = "ACM:1986:PPF",
pages = "140--147",
year = "1986",
bibdate = "Wed Oct 25 08:47:35 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/6012/p140-chan/p140-chan.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/6012/p140-chan/;
http://www.acm.org:80/pubs/citations/proceedings/pods/6012/p140-chan/",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; languages; performance; theory;
verification",
subject = "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
Logical Design, Schema and subschema. {\bf H.2.4}
Information Systems, DATABASE MANAGEMENT, Systems,
Query processing. {\bf H.3.3} Information Systems,
INFORMATION STORAGE AND RETRIEVAL, Information Search
and Retrieval, Retrieval models. {\bf H.2.1}
Information Systems, DATABASE MANAGEMENT, Logical
Design, Data models.",
}
@InProceedings{Biskup:1986:OFA,
author = "H. Biskup and L. Schnetgoke",
title = "One flavor assumption and gamma-acyclicity for
universal relation views",
crossref = "ACM:1986:PPF",
pages = "148--159",
year = "1986",
bibdate = "Wed Oct 25 08:47:35 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/6012/p148-biskup/p148-biskup.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/6012/p148-biskup/;
http://www.acm.org:80/pubs/citations/proceedings/pods/6012/p148-biskup/",
acknowledgement = ack-nhfb,
keywords = "design; theory; verification",
subject = "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
Logical Design, Schema and subschema. {\bf H.2.4}
Information Systems, DATABASE MANAGEMENT, Systems,
Query processing. {\bf H.2.1} Information Systems,
DATABASE MANAGEMENT, Logical Design, Data models.",
}
@InProceedings{Sagiv:1986:ESQ,
author = "Yehoshua Sagiv and Oded Shmueli",
title = "The equivalence of solving queries and producing tree
projections (extended abstract)",
crossref = "ACM:1986:PPF",
pages = "160--172",
year = "1986",
bibdate = "Wed Oct 25 08:47:35 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/6012/p160-sagiv/p160-sagiv.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/6012/p160-sagiv/;
http://www.acm.org:80/pubs/citations/proceedings/pods/6012/p160-sagiv/",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; theory; verification",
subject = "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
Logical Design, Schema and subschema. {\bf H.2.4}
Information Systems, DATABASE MANAGEMENT, Systems,
Query processing.",
}
@InProceedings{Sagiv:1986:FFA,
author = "Yehoshua Sagiv",
title = "On finite {FD}-acyclicity",
crossref = "ACM:1986:PPF",
pages = "173--182",
year = "1986",
bibdate = "Sun Nov 07 06:29:03 2004",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/6012/p173-sagiv/p173-sagiv.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/6012/p173-sagiv/;
http://www.acm.org:80/pubs/citations/proceedings/pods/6012/p173-sagiv/",
acknowledgement = ack-nhfb,
keywords = "algorithms; theory; verification",
subject = "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
Logical Design, Schema and subschema.",
}
@InProceedings{Ozsoyoglu:1986:UFM,
author = "Meral Ozsoyoglu and Li Yan Yuan",
title = "Unifying functional and multivalued dependencies for
relational database design",
crossref = "ACM:1986:PPF",
pages = "183--190",
year = "1986",
bibdate = "Wed Oct 25 08:47:35 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/6012/p183-ozsoyoglu/p183-ozsoyoglu.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/6012/p183-ozsoyoglu/;
http://www.acm.org:80/pubs/citations/proceedings/pods/6012/p183-ozsoyoglu/",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; theory; verification",
subject = "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
Logical Design, Schema and subschema.",
}
@InProceedings{Ruland:1986:AAD,
author = "Detlev Ruland and Dietmar Seipel",
title = "Alpha-acyclic decompositions of relational database
schemes",
crossref = "ACM:1986:PPF",
pages = "191--201",
year = "1986",
bibdate = "Wed Oct 25 08:47:35 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/6012/p191-ruland/p191-ruland.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/6012/p191-ruland/",
acknowledgement = ack-nhfb,
}
@InProceedings{Ruland:1986:ADR,
author = "Detlev Ruland and Dietmar Seipel",
title = "Alpha-acyclic decompositions of relational database
schemes",
crossref = "ACM:1986:PPF",
pages = "191--201",
year = "1986",
bibdate = "Thu Mar 12 18:39:01 MST 1998",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pods/6012/p191-ruland/",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; theory",
subject = "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
Logical Design, Schema and subschema. {\bf H.2.1}
Information Systems, DATABASE MANAGEMENT, Logical
Design, Normal forms. {\bf G.2.2} Mathematics of
Computing, DISCRETE MATHEMATICS, Graph Theory, Graph
algorithms.",
}
@InProceedings{Graham:1986:CTM,
author = "Marc H. Graham and Ke Wang",
title = "Constant time maintenance or the triumph of the
{FD.}",
crossref = "ACM:1986:PPF",
pages = "202--216",
year = "1986",
bibdate = "Wed Oct 25 08:47:35 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/6012/p202-graham/p202-graham.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/6012/p202-graham/;
http://www.acm.org:80/pubs/citations/proceedings/pods/6012/p202-graham/",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; theory; verification",
subject = "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
Logical Design, Schema and subschema. {\bf H.2.1}
Information Systems, DATABASE MANAGEMENT, Logical
Design, Normal forms.",
}
@InProceedings{Mannila:1986:TDR,
author = "Heikki Mannila and Kari Jouko Raiha",
title = "Test data for relational queries",
crossref = "ACM:1986:PPF",
pages = "217--223",
year = "1986",
bibdate = "Wed Oct 25 08:47:35 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/6012/p217-mannila/p217-mannila.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/6012/p217-mannila/;
http://www.acm.org:80/pubs/citations/proceedings/pods/6012/p217-mannila/",
acknowledgement = ack-nhfb,
keywords = "algorithms; languages; theory; verification",
subject = "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
Languages, Query languages. {\bf H.3.3} Information
Systems, INFORMATION STORAGE AND RETRIEVAL, Information
Search and Retrieval, Query formulation. {\bf H.2.1}
Information Systems, DATABASE MANAGEMENT, Logical
Design, Schema and subschema. {\bf D.2.5} Software,
SOFTWARE ENGINEERING, Testing and Debugging, Testing
tools (e.g., data generators, coverage testing).",
}
@InProceedings{Wilkins:1986:MAU,
author = "Marianne Winslett Wilkins",
title = "A model-theoretic approach to updating logical
databases",
crossref = "ACM:1986:PPF",
pages = "224--234",
year = "1986",
bibdate = "Thu Mar 12 18:39:01 MST 1998",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pods/6012/p224-wilkins/",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; economics; languages; theory",
subject = "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf H.2.3} Information
Systems, DATABASE MANAGEMENT, Languages, Data
manipulation languages (DML). {\bf I.2.3} Computing
Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and
Theorem Proving, Nonmonotonic reasoning and belief
revision. {\bf H.1.m} Information Systems, MODELS AND
PRINCIPLES, Miscellaneous. {\bf E.1} Data, DATA
STRUCTURES. {\bf D.3.1} Software, PROGRAMMING
LANGUAGES, Formal Definitions and Theory, Semantics.
{\bf I.2.4} Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Knowledge Representation Formalisms and
Methods, Predicate logic.",
}
@InProceedings{Wilkins:1986:MTA,
author = "Marianne Winslett Wilkins",
title = "A model-theoretic approach to updating logical
databases",
crossref = "ACM:1986:PPF",
pages = "224--234",
year = "1986",
bibdate = "Wed Oct 25 08:47:35 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/6012/p224-wilkins/p224-wilkins.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/6012/p224-wilkins/",
acknowledgement = ack-nhfb,
}
@InProceedings{Abiteboul:1986:DPT,
author = "Serge Abiteboul and Victor Vianu",
title = "Deciding properties of transactional schemas",
crossref = "ACM:1986:PPF",
pages = "235--239",
year = "1986",
bibdate = "Wed Oct 25 08:47:35 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/6012/p235-abiteboul/p235-abiteboul.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/6012/p235-abiteboul/;
http://www.acm.org:80/pubs/citations/proceedings/pods/6012/p235-abiteboul/",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; languages; theory",
subject = "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
Logical Design, Schema and subschema. {\bf H.2.4}
Information Systems, DATABASE MANAGEMENT, Systems,
Transaction processing. {\bf H.2.1} Information
Systems, DATABASE MANAGEMENT, Logical Design, Data
models. {\bf H.1.m} Information Systems, MODELS AND
PRINCIPLES, Miscellaneous. {\bf F.3.1} Theory of
Computation, LOGICS AND MEANINGS OF PROGRAMS,
Specifying and Verifying and Reasoning about Programs,
Specification techniques.",
}
@InProceedings{Abbadi:1986:APR,
author = "Amr El Abbadi and Sam Toueg",
title = "Availability in partitioned replicated databases",
crossref = "ACM:1986:PPF",
pages = "240--251",
year = "1986",
bibdate = "Wed Oct 25 08:47:35 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/6012/p240-el_abbadi/p240-el_abbadi.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/6012/p240-el_abbadi/;
http://www.acm.org:80/pubs/citations/proceedings/pods/6012/p240-el_abbadi/",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; reliability; theory;
verification",
subject = "{\bf C.2.4} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Distributed Systems,
Distributed databases. {\bf H.2.1} Information Systems,
DATABASE MANAGEMENT, Logical Design, Data models. {\bf
H.2.4} Information Systems, DATABASE MANAGEMENT,
Systems, Transaction processing. {\bf C.2.2} Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Network Protocols, Protocol architecture. {\bf D.4.1}
Software, OPERATING SYSTEMS, Process Management,
Concurrency. {\bf D.4.6} Software, OPERATING SYSTEMS,
Security and Protection, Access controls. {\bf H.2.1}
Information Systems, DATABASE MANAGEMENT, Logical
Design, Data models. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS, Reliability,
availability, and serviceability.",
}
@InProceedings{Vardi:1986:IDI,
author = "Moshe Vardi",
title = "On the integrity of databases with incomplete
information",
crossref = "ACM:1986:PPF",
pages = "252--266",
year = "1986",
bibdate = "Wed Oct 25 08:47:35 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/6012/p252-vardi/p252-vardi.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/6012/p252-vardi/;
http://www.acm.org:80/pubs/citations/proceedings/pods/6012/p252-vardi/",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; languages; theory; verification",
subject = "{\bf H.2.0} Information Systems, DATABASE MANAGEMENT,
General, Security, integrity, and protection**. {\bf
H.2.1} Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf H.1.m} Information
Systems, MODELS AND PRINCIPLES, Miscellaneous. {\bf
I.2.3} Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Deduction and Theorem Proving,
Nonmonotonic reasoning and belief revision. {\bf H.2.1}
Information Systems, DATABASE MANAGEMENT, Logical
Design, Schema and subschema. {\bf F.1.3} Theory of
Computation, COMPUTATION BY ABSTRACT DEVICES,
Complexity Measures and Classes, Relations among
complexity classes.",
}
@InProceedings{Naughton:1986:DIR,
author = "Jeff Naughton",
title = "Data independent recursion in deductive databases",
crossref = "ACM:1986:PPF",
pages = "267--279",
year = "1986",
bibdate = "Wed Oct 25 08:47:35 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/6012/p267-naughton/p267-naughton.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/6012/p267-naughton/;
http://www.acm.org:80/pubs/citations/proceedings/pods/6012/p267-naughton/",
acknowledgement = ack-nhfb,
keywords = "algorithms; languages; theory",
subject = "{\bf I.2.4} Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Knowledge Representation Formalisms and
Methods, Predicate logic. {\bf I.2.3} Computing
Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and
Theorem Proving, Deduction. {\bf H.2.3} Information
Systems, DATABASE MANAGEMENT, Languages, Query
languages. {\bf F.4.1} Theory of Computation,
MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical
Logic, Recursive function theory. {\bf G.2.2}
Mathematics of Computing, DISCRETE MATHEMATICS, Graph
Theory, Graph algorithms.",
}
@InProceedings{Cosmadakis:1986:PER,
author = "S. Cosmadakis and P. Kanellakis",
title = "Parallel evaluation of recursive rule queries",
crossref = "ACM:1986:PPF",
pages = "280--293",
year = "1986",
bibdate = "Wed Oct 25 08:47:35 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/6012/p280-cosmadakis/p280-cosmadakis.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/6012/p280-cosmadakis/;
http://www.acm.org:80/pubs/citations/proceedings/pods/6012/p280-cosmadakis/",
acknowledgement = ack-nhfb,
keywords = "languages; theory; verification",
subject = "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
Languages, Query languages. {\bf H.2.1} Information
Systems, DATABASE MANAGEMENT, Logical Design. {\bf
D.2.8} Software, SOFTWARE ENGINEERING, Metrics,
Complexity measures. {\bf H.1.m} Information Systems,
MODELS AND PRINCIPLES, Miscellaneous. {\bf F.4.1}
Theory of Computation, MATHEMATICAL LOGIC AND FORMAL
LANGUAGES, Mathematical Logic, Recursive function
theory. {\bf F.1.3} Theory of Computation, COMPUTATION
BY ABSTRACT DEVICES, Complexity Measures and Classes,
Relations among complexity classes. {\bf G.1.0}
Mathematics of Computing, NUMERICAL ANALYSIS, General,
Parallel algorithms.",
}
@InProceedings{Abiteboul:1986:PTS,
author = "S. Abiteboul and V. Vianu",
title = "Properties of Transactional Schemas",
crossref = "ACM:1986:PPF",
pages = "??--??",
month = mar,
year = "1986",
bibsource = "Database/Wiederhold.bib",
annote = "a study of optimization for insert/delete
operations.",
}
@InProceedings{Neff:1987:DBC,
author = "R. K. Neff",
title = "Data bases, compound objects, and networked
workstations: {Beyond} distributed computing
{(Abstract)}",
crossref = "Dayal:1987:PAC",
pages = "1--1",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p1-neff/p1-neff.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p1-neff/",
abstract = "Requirements for future data base systems are
developed from the perspective of the user of a
networked workstation who naturally deals with compound
objects. Objects considered include full text,
diagrams, maps, sound recordings, images from film and
video and of art objects, spreadsheets, etc. Searching
requirements and strategies over multi-objects are also
considered. The context of such data base systems is
the library, in its electronic or digital version.
Comments are presented with respect to the digital
learning environment of the future. Current related
projects at Berkeley are described.",
acknowledgement = ack-nhfb,
generalterms = "Design; Human Factors; Performance",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Distributed databases};
Information Systems --- Information Storage and
Retrieval --- General (H.3.0); Information Systems ---
Information Storage and Retrieval --- Systems and
Software (H.3.4): {\bf Information networks}; Hardware
--- Input/Output and Data Communications --- General
(B.4.0)",
}
@InProceedings{Ullman:1987:DTF,
author = "J. D. Ullman",
title = "Database theory --- past and future",
crossref = "ACM:1987:PPS",
pages = "1--10",
year = "1987",
bibdate = "Thu Mar 12 18:40:49 MST 1998",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pods/28659/p1-ullman/",
acknowledgement = ack-nhfb,
keywords = "management; theory",
subject = "{\bf H.2.0} Information Systems, DATABASE MANAGEMENT,
General.",
}
@InProceedings{Ullman:1987:DTP,
author = "J. D. Ullman",
title = "Database theory--past and future",
crossref = "ACM:1987:PPS",
pages = "1--10",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/28659/p1-ullman/p1-ullman.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/28659/p1-ullman/",
abstract = "We briefly sketch the development of the various
branches of database theory. One important branch is
the theory of relational databases, including such
areas as dependency theory, universal-relation theory,
and hypergraph theory. A second important branch is the
theory of concurrency control and distributed
databases. Two other branches have not in the past been
given the attention they deserve. One of these is
``logic and databases,'' and the second is
``object-oriented database systems,'' which to my
thinking includes systems based on the network or
hierarchical data models. Both these areas are going to
be more influential in the future.",
acknowledgement = ack-nhfb,
generalterms = "Management; Theory",
subject = "Information Systems --- Database Management ---
General (H.2.0)",
}
@InProceedings{Ingenthron:1987:TDR,
author = "Kurt Ingenthron",
title = "Thoughts on database research: {A} user perspective",
crossref = "Dayal:1987:PAC",
pages = "2--2",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p2-ingenthron/p2-ingenthron.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p2-ingenthron/",
abstract = "The future of computer aided design is in object
oriented programming. If the database community hopes
to participate in this future, it must reexamine some
basic assumptions about the architecture of database
systems. Database system functionality can be added to
object systems but if the performance cost is too high,
it will never survive. Below are some suggestions for
what can be done at a reasonable performance cost.
\par
The object oriented paradigm provides a more practical
approach to the partitioning of the global database
than horizontal and vertical partitioning of relational
tables. Each partition should itself be an independent
database containing related data such as the geometry
of a part or the spacial relationship of parts in an
assembly. A meta-database would be used to control
access to collections of these partitions. A collection
of partitions comprise the database for a user's design
session. \par
The overhead of traditional database transaction
management is not acceptable for high performance CAD
systems. With the partitioning scheme described above,
transaction management can be performed at a
partition/session granularity. Once the user has
composed the collection of partitions, he has a single
user database. There is no need for concurrency control
or transaction logging except at the meta-database
level. This type of transaction management can in fact
be more functional than traditional transaction
management, allowing for versioning, long transactions,
integrity checking and archival. \par
Object oriented databases need a message model, not a
data model. Any object which responds to the same
messages as an object of ``Duck'' class (walk and
quack) is, for all intents and purposes, a duck. An
attempt to design a data model based on instance
variables of an object or based on collections of
objects of like class violates the data abstraction
facilities of object oriented languages and diminishes
their power. An attempt to implement a relational
database system with an object oriented language yields
a relational database system where you get abstract
data types for free. It does not yield an object
oriented database system. \par
For object oriented queries, the message is the media.
A query can be transformed into an execution plan
consisting of messages sent to database objects.
Optimization decisions can be made by sending messages
to referenced objects. Collection classes can be
implemented for new access methods with cost and
selectivity methods to provide optimization
information. In this way, the query language can grow
with the application. \par
Data representation is an important aspect of object
oriented systems. Most object systems are typeless in
that all instance variables of an object are object
references. For performance sake, object systems should
provide enough of a type mechanism to allow simple data
items (integers, floats, characters, \ldots{}) to be
represented in the form intrinsic to the machine.
Methods can then be compiled for access to typed data.
\par
In conclusion, object systems provide enormous
potential for the development of CAD systems.
Performance influences the approach taken to an
application. WYSIWYG publishing applications were not
attempted until performance was adequate. Functionality
is what sells CAD systems. Database system
functionality can be added to object systems at a
reasonable cost.",
acknowledgement = ack-nhfb,
generalterms = "Design; Human Factors",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Transaction processing}; Software
--- Operating Systems --- Communications Management
(D.4.4): {\bf Message sending}",
}
@InProceedings{Ioannidis:1987:QOS,
author = "Yannis E. Ioannidis and Eugene Wong",
title = "Query optimization by simulated annealing",
crossref = "Dayal:1987:PAC",
pages = "9--22",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p9-ioannidis/p9-ioannidis.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p9-ioannidis/",
abstract = "Query optimizers of future database management systems
are likely to face large access plan spaces in their
task. Exhaustively searching such access plan spaces is
unacceptable. We propose a query optimization algorithm
based on {\em simulated annealing}, which is a
probabilistic hill climbing algorithm. We show the
specific formulation of the algorithm for the case of
optimizing complex non-recursive queries that arise in
the study of linear recursion. The query answer is
explicitly represented and manipulated within the {\em
closed semiring\/} of linear relational operators. The
optimization algorithm is applied to a state space that
is constructed from the equivalent algebraic forms of
the query answer. A prototype of the simulated
annealing algorithm has been built and few experiments
have been performed for a limited class of relational
operators. Our initial experience is that, in general,
the algorithm converges to processing strategies that
are very close to the optimal. Moreover, the
traditional processing strategies (e.g., the {\em
semi-naive evaluation\/}) have been found to be, in
general, suboptimal.",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Design; Performance",
subject = "Information Systems --- Information Storage and
Retrieval --- Information Search and Retrieval (H.3.3):
{\bf Query formulation}; Information Systems ---
Database Management --- Logical Design (H.2.1): {\bf
Data models}; Information Systems --- Database
Management --- Physical Design (H.2.2): {\bf Access
methods}",
}
@InProceedings{Kuper:1987:LPS,
author = "G. M. Kuper",
title = "Logic programming with sets",
crossref = "ACM:1987:PPS",
pages = "11--20",
year = "1987",
bibdate = "Wed Oct 25 08:47:34 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/28659/p11-kuper/p11-kuper.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/28659/p11-kuper/;
http://www.acm.org:80/pubs/citations/proceedings/pods/28659/p11-kuper/",
acknowledgement = ack-nhfb,
keywords = "languages; management; theory; verification",
subject = "{\bf H.2.m} Information Systems, DATABASE MANAGEMENT,
Miscellaneous. {\bf H.2.1} Information Systems,
DATABASE MANAGEMENT, Logical Design. {\bf F.4.1} Theory
of Computation, MATHEMATICAL LOGIC AND FORMAL
LANGUAGES, Mathematical Logic, Logic and constraint
programming. {\bf I.2.3} Computing Methodologies,
ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving,
Logic programming. {\bf F.4.3} Theory of Computation,
MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal
Languages, Algebraic language theory.",
}
@InProceedings{Beeri:1987:SNL,
author = "C. Beeri and S. Naqvi and R. Ramakrishnan and O.
Shmueli and S. Tsur",
title = "Sets and negation in a logic data base language
{(LDL1)}",
crossref = "ACM:1987:PPS",
pages = "21--37",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/28659/p21-beeri/p21-beeri.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/28659/p21-beeri/;
http://www.acm.org:80/pubs/citations/proceedings/pods/28659/p21-beeri/",
abstract = "In this paper we extend LDL, a Logic Based Database
Language, to include finite sets and negation. The new
language is called LDL1. We define the notion of a
model and show that a negation-free program need not
have a model, and that it may have more than one
minimal model. We impose syntactic restriction in order
to define a deterministic language. These restrictions
allow only layered (stratified) programs. We prove that
for any program satisfying the syntactic restrictions
of layering, there is a minimal model, and that this
model can be constructed in a bottom-up fashion.
Extensions to the basic grouping mechanism are
proposed. We show that these extensions can be
translated into equivalent LDL1 programs. Finally, we
show how the technique of magic sets can be extended to
translate LDL1 programs into equivalent programs which
can often be executed more efficiently",
acknowledgement = ack-nhfb,
generalterms = "Languages; Management; Theory; Verification",
keywords = "languages; management; theory; verification",
subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language
Classifications. {\bf F.4.1} Theory of Computation,
MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical
Logic, Logic and constraint programming. {\bf I.2.3}
Computing Methodologies, ARTIFICIAL INTELLIGENCE,
Deduction and Theorem Proving, Logic programming. {\bf
D.3.1} Software, PROGRAMMING LANGUAGES, Formal
Definitions and Theory.",
}
@InProceedings{Ganski:1987:ONS,
author = "Richard A. Ganski and Harry K. T. Wong",
title = "Optimization of nested {SQL} queries revisited",
crossref = "Dayal:1987:PAC",
pages = "23--33",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p23-ganski/p23-ganski.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p23-ganski/",
abstract = "Current methods of evaluating nested queries in the
SQL language can be inefficient in a variety of query
and data base contexts. Previous research in the area
of nested query optimization which sought methods of
reducing evaluation costs is summarized, including a
classification scheme for nested queries, algorithms
designed to transform each type of query to a logically
equivalent form which may then be evaluated more
efficiently, and a description of a major bug in one of
these algorithms. Further examination reveals another
bug in the same algorithm. Solutions to these bugs are
proposed and incorporated into a new transformation
algorithm, and extensions are proposed which will allow
the transformation algorithms to handle a larger class
of predicates. A recursive algorithm for processing a
general nested query is presented and the action of
this algorithm is demonstrated. This algorithm can be
used to transform any nested query.",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Design; Performance",
subject = "Information Systems --- Database Management ---
Languages (H.2.3): {\bf SQL}; Information Systems ---
Information Storage and Retrieval --- Information
Search and Retrieval (H.3.3): {\bf Query formulation}",
}
@InProceedings{Abiteboul:1987:RQS,
author = "Serge Abiteboul and Paris Kanellakis and Gosta
Grahne",
title = "On the representation and querying of sets of possible
worlds",
crossref = "Dayal:1987:PAC",
pages = "34--48",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p34-abiteboul/p34-abiteboul.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p34-abiteboul/",
abstract = "We represent a {\em set of possible worlds\/} using an
incomplete information database. The representation
techniques that we study form a hierarchy, which
generalizes relations of constants. This hierarchy
ranges from the very simple Codd-table, (i.e., a
relation of constants and distinct variables called
nulls, which stand for values present but unknown), to
much more complex mechanisms involving views on
conditioned-tables, (i.e., queries on Codd-tables
together with conditions). The views we consider are
the queries that have polynomial data-complexity on
complete information databases. Our conditions are
conjunctions of equalities and inequalities. \par
(1) We provide matching upper and lower bounds on the
data-complexity of testing {\em containment}, {\em
membership}, and {\em uniqueness\/} for sets of
possible worlds and we fully classify these problems
with respect to our representation hierarchy. The most
surprising result in this classification is that it is
complete in $2^p$, whether a set of possible worlds
represented by a Codd-table is a subset of a set of
possible worlds represented by a Codd-table with one
conjunction of inequalities. \par
(2) We investigate the data-complexity of querying
incomplete information databases. We examine both
asking for {\em certain facts\/} and for {\em possible
facts}. Our approach is algebraic but our bounds also
apply to logical databases. We show that asking for a
certain fact is coNP-complete, even for a fixed first
order query on a Codd-table. We thus strengthen a lower
bound of [16], who showed that this holds for a
Codd-table with a conjunction of inequalities. For each
fixed positive existential query we present a
polynomial algorithm solving the bounded possible fact
problem of this query on conditioned-tables. We show
that our approach is, in a sense, the best possible, by
deriving two NP-completeness lower bounds for the
bounded possible fact problem when the fixed query
contains either negation or recursion.",
acknowledgement = ack-nhfb,
generalterms = "Theory",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Data models}; Computing
Methodologies --- Artificial Intelligence --- Deduction
and Theorem Proving (I.2.3): {\bf Uncertainty,
``fuzzy,'' and probabilistic reasoning}; Computing
Methodologies --- Artificial Intelligence --- Knowledge
Representation Formalisms and Methods (I.2.4): {\bf
Relation systems}",
}
@InProceedings{Yuan:1987:LDR,
author = "L. Y. Yuan and Z. M. Ozsoyoglu",
title = "Logical design of relational database schemes",
crossref = "ACM:1987:PPS",
pages = "38--47",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/28659/p38-yuan/p38-yuan.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/28659/p38-yuan/;
http://www.acm.org:80/pubs/citations/proceedings/pods/28659/p38-yuan/",
abstract = "We define extended conflict free dependencies in the
context of functional and multivalued dependencies, and
prove that there exists an acyclic, dependency
preserving, 4NF database scheme if and only if the
given set of dependencies has an extended conflict free
cover. This condition can be checked in polynomial
time. A polynomial time algorithm to obtain such a
scheme for a given extended conflict free set of
dependencies is also presented. The result is also
applicable when the data dependencies consists of only
functional dependencies, giving the necessary and
sufficient condition for an acyclic, dependency
preserving BCNF database scheme",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Design; Management; Theory; Verification",
keywords = "algorithms; design; management; theory; verification",
subject = "{\bf H.2.m} Information Systems, DATABASE MANAGEMENT,
Miscellaneous. {\bf H.2.1} Information Systems,
DATABASE MANAGEMENT, Logical Design, Schema and
subschema.",
}
@InProceedings{Chan:1987:DDS,
author = "E. P. F. Chan and H. J. Hernandez",
title = "On designing database schemes bounded or constant-time
maintainable with respect to functional dependencies",
crossref = "ACM:1987:PPS",
pages = "48--57",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/28659/p48-chan/p48-chan.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/28659/p48-chan/;
http://www.acm.org:80/pubs/citations/proceedings/pods/28659/p48-chan/",
abstract = "Under the weak instance model, to determine if a class
of database schemes is bounded with respect to
dependencies is fundamental for the analysis of the
behavior of the class of database schemes with respect
to query processing and updates. However, proving that
a class of database schemes is bounded with respect to
dependencies seems to be very difficult even for
restricted cases. To resolve this problem, we need to
develop techniques for characterizing bounded database
schemes \par
In this paper, we give a formal methodology for
designing database schemes bounded with respect to
functional dependencies using a new technique called
extensibility. This methodology can also be used to
design constant-time-maintainable database schemes",
acknowledgement = ack-nhfb,
generalterms = "Design; Management; Theory; Verification",
keywords = "design; management; theory; verification",
subject = "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
Logical Design, Schema and subschema.",
}
@InProceedings{Sacca:1987:MCM,
author = "Domenico Sacca and Carlo Zaniolo",
title = "Magic counting methods",
crossref = "Dayal:1987:PAC",
pages = "49--59",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p49-sacca/p49-sacca.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p49-sacca/",
abstract = "{\em The problem considered is that of implementing
recursive queries, expressed in a logic-based language,
by efficient fixpoint computations. In particular, the
situation is studied where the initial bindings in the
recursive predicate can be used to restrict the search
space and ensure safety of execution. Two key
techniques previously proposed to solve this problem
are (i) the highly efficient counting method, and (ii)
the magic set method which is safe in a wider range of
situations than (i). In this paper, we present a family
of methods, called the magic counting methods, that
combines the advantages of (i) and (ii). This is made
possible by the similarity of the strategies used by
the counting method and the magic set method for
propagating the bindings. This paper introduces these
new methods, examines their computational complexity,
and illustrates the trade-offs between the family
members and their superiority with respect to the old
methods}.",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Theory",
subject = "Information Systems --- Database Management ---
Languages (H.2.3); Theory of Computation ---
Mathematical Logic and Formal Languages ---
Mathematical Logic (F.4.1): {\bf Recursive function
theory}; Theory of Computation --- Mathematical Logic
and Formal Languages --- Grammars and Other Rewriting
Systems (F.4.2); Theory of Computation --- Analysis of
Algorithms and Problem Complexity --- Numerical
Algorithms and Problems (F.2.1): {\bf Number-theoretic
computations}",
}
@InProceedings{Gottlob:1987:CCE,
author = "G. Gottlob",
title = "Computing covers for embedded functional
dependencies",
crossref = "ACM:1987:PPS",
pages = "58--69",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/28659/p58-gottlob/p58-gottlob.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/28659/p58-gottlob/;
http://www.acm.org:80/pubs/citations/proceedings/pods/28659/p58-gottlob/",
abstract = "This paper deals with the problem of computing covers
for the functional dependencies embedded in a subset of
a given relation schema. We show how this problem can
be simplified and present a new and efficient algorithm
``Reduction. By Resolution'' (RBR) for its solution.
Though the problem of computing covers for embedded
dependencies is inherently exponential, our algorithm
behaves polynomially for several classes of inputs. RBR
can be used for the solution of some related problems
in the theory of database design, such as deciding
whether a given database scheme is in Boyce-Codd Normal
Form or decomposing a scheme into Boyce-Codd Normal
Form.",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Design; Management; Theory; Verification",
keywords = "algorithms; design; management; theory; verification",
subject = "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
Logical Design, Schema and subschema.",
}
@InProceedings{Aly:1987:NDM,
author = "Hussien Aly and Z. Meral Ozsoyoglu",
title = "Non-deterministic modelling of logical queries in
deductive databases",
crossref = "Dayal:1987:PAC",
pages = "60--72",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p60-aly/p60-aly.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p60-aly/",
abstract = "We propose a technique based on Petri Nets formalism
to model logic queries in deductive databases. The
model is called PNLP (Petri Net model for Logic
Programs), and it has a simple formal description and a
graphical representation. The PNLP model explicitly
represents the relationships between rules and
predicates. It is general and flexible enough to
demonstrate the flow of control in different algorithms
used to evaluate recursive logic queries. In fact the
model unifies the level of description of these
algorithms, and facilitates identifying similarities
and differences between them. The inherent
non-determinism in the PNLP model may also be useful in
recognizing the parallelism within Horn-clause logic
programs. In this paper, the PNLP model is described,
and its functionality is demonstrated by modeling
several existing algorithms for recursive query
evaluation.",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Design; Theory",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Query processing}; Theory of
Computation --- Mathematical Logic and Formal Languages
--- Mathematical Logic (F.4.1): {\bf Logic and
constraint programming}; Mathematics of Computing ---
Discrete Mathematics --- Graph Theory (G.2.2): {\bf
Network problems}; Theory of Computation ---
Mathematical Logic and Formal Languages ---
Mathematical Logic (F.4.1): {\bf Recursive function
theory}",
}
@InProceedings{DAtri:1987:DQI,
author = "A. D'Atri and P. Di Felice and M. Moscarini",
title = "Dynamic query interpretation in relational databases",
crossref = "ACM:1987:PPS",
pages = "70--78",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/28659/p70-d_atri/p70-d_atri.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/28659/p70-d_atri/;
http://www.acm.org:80/pubs/citations/proceedings/pods/28659/p70-d_atri/",
abstract = "A new dynamic approach to the problem of determining
the correct interpretation of a logically independent
query to a relational database is described. The
proposed disambiguating process is based on a simple
user-system dialogue that consists in a sequence of
decisions about the relevance (or not) of an attribute
with respect to the user interpretation",
acknowledgement = ack-nhfb,
generalterms = "Design; Management; Theory",
keywords = "design; management; theory",
subject = "{\bf H.2.m} Information Systems, DATABASE MANAGEMENT,
Miscellaneous. {\bf H.2.4} Information Systems,
DATABASE MANAGEMENT, Systems, Query processing. {\bf
H.2.1} Information Systems, DATABASE MANAGEMENT,
Logical Design, Schema and subschema.",
}
@InProceedings{Han:1987:HRP,
author = "Jiawei Han and Lawrence J. Henschen",
title = "Handling redundancy in the processing of recursive
database queries",
crossref = "Dayal:1987:PAC",
pages = "73--81",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p73-han/p73-han.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p73-han/",
abstract = "Redundancy may exist in the processing of recursive
database queries at four different levels
precompilation level, iteration level, tuple processing
level and file accessing level. Techniques for reducing
redundant work at each level are studied. In the
precompilation level, the optimization techniques
include removing redundant parts in a rule cluster,
simplifying recursive clusters and sharing common
subexpressions among rules. At the iteration level, the
techniques discussed are the use of frontier relations
and the counting method. At the tuple processing level,
we use merging and filtering methods to exclude
processed drivers from database reaccessing. Finally,
at the file accessing level, I/O cost can be further
reduced by level relaxation. We conclude that even for
complex recursion, redundant database processing can be
considerably reduced or eliminated by developing
appropriate algorithms.",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Performance; Theory",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Query processing}; Theory of
Computation --- Mathematical Logic and Formal Languages
--- Mathematical Logic (F.4.1): {\bf Recursive function
theory}",
}
@InProceedings{Atzeni:1987:NBW,
author = "P. Atzeni and M. C. De Bernardis",
title = "A new basis for the weak instance model",
crossref = "ACM:1987:PPS",
pages = "79--86",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/28659/p79-atzeni/p79-atzeni.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/28659/p79-atzeni/;
http://www.acm.org:80/pubs/citations/proceedings/pods/28659/p79-atzeni/",
abstract = "A new definition of the weak instance model is
presented, which does not consider the missing values
as existent though unknown, but just assumes that no
information is available about them. It is possible to
associate with the new definition logical theories that
do not contain universally quantified variables. The
new model enjoys various desirable properties of the
old weak instance model, with respect to dependency
satisfaction, query answering, and associated logical
theories.",
acknowledgement = ack-nhfb,
generalterms = "Design; Management; Theory",
keywords = "design; management; theory",
subject = "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models.",
}
@InProceedings{Daniels:1987:DLT,
author = "Dean S. Daniels and Alfred Z. Spector and Dean S.
Thompson",
title = "Distributed logging for transaction processing",
crossref = "Dayal:1987:PAC",
pages = "82--96",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p82-daniels/p82-daniels.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p82-daniels/",
abstract = "Increased interest in using workstations and small
processors for distributed transaction processing
raises the question of how to implement the logs needed
for transaction recovery. Although logs can be
implemented with data written to duplexed disks on each
processing node, this paper argues there are advantages
if log data is written to multiple {\em log server\/}
nodes. A simple analysis of expected logging loads
leads to the conclusion that a high performance,
microprocessor based processing node can support a log
server if it uses efficient communication protocols and
low latency, non volatile storage to buffer log data.
The buffer is needed to reduce the processing time per
log record and to increase throughput to the logging
disk. An interface to the log servers using simple,
robust, and efficient protocols is presented. Also
described are the disk data structures that the log
servers use. This paper concludes with a brief
discussion of remaining design issues, the status of a
prototype implementation, and plans for its
completion.",
acknowledgement = ack-nhfb,
generalterms = "Design; Performance",
subject = "Information Systems --- Database Management ---
Systems (H.2.4); Information Systems --- Database
Management --- Database Administration (H.2.7): {\bf
Logging and recovery}",
}
@InProceedings{Malvestuto:1987:AQC,
author = "F. M. Malvestuto",
title = "Answering queries in categorical databases",
crossref = "ACM:1987:PPS",
pages = "87--96",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/28659/p87-malvestuto/p87-malvestuto.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/28659/p87-malvestuto/;
http://www.acm.org:80/pubs/citations/proceedings/pods/28659/p87-malvestuto/",
abstract = "A compatible categorical data base can be viewed as a
single (contingency) table by taking the {\em
maximum-entropy\/} extension of the component tables.
Such a view, here called {\em universal table model,\/}
is needed to answer a user who wishes
``cross-classified'' categorical data, that is,
categorical data resulting from the combination of the
information contents of two or more base tables. In
order to implement a {\em universal table interface\/}
we make use of a query-optimization procedure, which is
able to generate an appropriate answer both in the case
that the asked data are present in the data base and in
the case that they are not and, then, have to be
estimated",
acknowledgement = ack-nhfb,
generalterms = "Design; Management; Theory; Verification",
keywords = "design; management; theory; verification",
subject = "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf H.2.m} Information
Systems, DATABASE MANAGEMENT, Miscellaneous.",
}
@InProceedings{Herman:1987:DAV,
author = "Gary Herman and K. C. Lee and Abel Weinrib",
title = "The datacycle architecture for very high throughput
database systems",
crossref = "Dayal:1987:PAC",
pages = "97--103",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p97-herman/p97-herman.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p97-herman/",
abstract = "{\em The evolutionary trend toward a database-driven
public communications network has motivated research
into database architectures capable of executing
thousands of transactions per second. In this paper we
introduce the Datacycle architecture, an attempt to
exploit the enormous transmission bandwidth of optical
systems to permit the implementation of high throughput
multiprocessor database systems. The architecture has
the potential for unlimited query throughput,
simplified data management, rapid execution of complex
queries, and efficient concurrency control. We describe
the logical operation of the architecture and discuss
implementation issues in the context of a prototype
system currently under construction}.",
acknowledgement = ack-nhfb,
generalterms = "Design; Management",
subject = "Information Systems --- Database Management ---
Systems (H.2.4); Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Network
communications}; Computer Systems Organization ---
Computer-Communication Networks --- Distributed Systems
(C.2.4): {\bf Network operating systems}; Information
Systems --- Database Management --- General (H.2.0)",
}
@InProceedings{Fekete:1987:NTR,
author = "A. Fekete and N. Lynch and M. Merrit and W. Weihl",
title = "Nested transactions and read-write locking",
crossref = "ACM:1987:PPS",
pages = "97--111",
year = "1987",
bibdate = "Wed Oct 25 08:47:34 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/28659/p97-fekete/p97-fekete.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/28659/p97-fekete/;
http://www.acm.org:80/pubs/citations/proceedings/pods/28659/p97-fekete/",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; management; verification",
subject = "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
Systems, Transaction processing.",
}
@InProceedings{Lehman:1987:RAH,
author = "Tobin J. Lehman and Michael J. Carey",
title = "A recovery algorithm for a high-performance
memory-resident database system",
crossref = "Dayal:1987:PAC",
pages = "104--117",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p104-lehman/p104-lehman.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p104-lehman/",
abstract = "With memory prices dropping and memory sizes
increasing accordingly, a number of researchers are
addressing the problem of designing high-performance
database systems for managing memory-resident data. In
this paper we address the recovery problem in the
context of such a system. We argue that existing
database recovery schemes fall short of meeting the
requirements of such a system, and we present a new
recovery mechanism which is designed to overcome their
shortcomings. The proposed mechanism takes advantage of
a few megabytes of reliable memory in order to organize
recovery information on a per ``object'' basis. As a
result, it is able to amortize the cost of checkpoints
over a controllable number of updates, and it is also
able to separate post-crash recovery into two
phases--high-speed recovery of data which is needed
immediately by transactions, and background recovery of
the remaining portions of the database. A simple
performance analysis is undertaken, and the results
suggest our mechanism should perform well in a
high-performance, memory-resident database
environment.",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Performance",
subject = "Information Systems --- Database Management ---
Physical Design (H.2.2); Computer Systems Organization
--- Performance of Systems (C.4); Information Systems
--- Database Management --- Systems (H.2.4)",
}
@InProceedings{Segall:1987:TCA,
author = "A. Segall and O. Wolfson",
title = "Transaction commitment at minimal communication cost",
crossref = "ACM:1987:PPS",
pages = "112--118",
year = "1987",
bibdate = "Thu Mar 12 18:40:49 MST 1998",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pods/28659/p112-segall/",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; management; standardization;
theory; verification",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
Systems, Distributed databases. {\bf G.2.2} Mathematics
of Computing, DISCRETE MATHEMATICS, Graph Theory,
Trees.",
}
@InProceedings{Segall:1987:TCM,
author = "A. Segall and O. Wolfson",
title = "Transaction commitment at minimal communication cost",
crossref = "ACM:1987:PPS",
pages = "112--118",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/28659/p112-segall/p112-segall.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/28659/p112-segall/",
abstract = "We consider the communication protocol for transaction
commitment in a distributed database. Specifically, the
connection between the structure of communication among
the participating sites, and the communication network
topology is investigated. In order to do so, the cost
of transaction commitment is defined as the number of
network hops that messages of the protocol must
traverse. We establish the necessary cost for
transaction commitment, and show that it is also
sufficient. A simple distributed algorithm is presented
to prove sufficiency. Our algorithm is also
time-efficient, and in order to prove that we show that
the timing of our algorithm is optimal within a natural
class of commit-protocols.",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Design; Management; Standardization;
Theory; Verification",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network Protocols
(C.2.2); Information Systems --- Database Management
--- Systems (H.2.4): {\bf Distributed databases};
Mathematics of Computing --- Discrete Mathematics ---
Graph Theory (G.2.2): {\bf Trees}",
}
@InProceedings{Nixon:1987:ICS,
author = "Brian Nixon and Lawrence Chung and John Mylopoulos and
David Lauzon and Alex Borgida and M. Stanley",
title = "Implementation of a compiler for a semantic data
model: {Experiences} with taxis",
crossref = "Dayal:1987:PAC",
pages = "118--131",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p118-nixon/p118-nixon.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p118-nixon/",
abstract = "The features of a compiler for the Taxis design
language are described and discussed. Taxis offers an
entity-based framework for designing interactive
information systems and supports generalisation,
classification and aggregation as abstraction
mechanisms. Its features include multiple inheritance
of attributes, isA hierarchies of transactions,
metaclasses, typed attributes, a procedural
exception-handling mechanism and an iteration construct
based on the abstraction mechanisms supported
Developing a compiler for the language involved dealing
with the problems of efficiently representing and
accessing a large collection of entities, performing
(static) type checking and representing isA hierarchies
of transactions.",
acknowledgement = ack-nhfb,
generalterms = "Languages; Performance; Theory",
subject = "Software --- Programming Languages --- Processors
(D.3.4): {\bf Compilers}; Information Systems ---
Database Management --- Logical Design (H.2.1): {\bf
Data models}; Software --- Programming Languages ---
Language Classifications (D.3.2): {\bf TAXIS}",
}
@InProceedings{Wang:1987:PAM,
author = "C. P. Wang and V. O. K. Li",
title = "The precedence-assignment model for distributed
databases concurrency control algorithms",
crossref = "ACM:1987:PPS",
pages = "119--128",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/28659/p119-wang/p119-wang.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/28659/p119-wang/",
abstract = "We have developed a unified model, called the
precedence-assignment model (PAM), of concurrency
control algorithms in distributed database. It is shown
that two-phase locking timestamp-ordering and other
existing concurrency control algorithms may be modeled
by PAM. We have also developed a new concurrency
control algorithm under the PAM modeling framework,
which is free from deadlocks and transaction restarts.
Finally, a unified concurrency control subsystem for
precedence-assignment algorithms is developed. By using
this subsystem, different transactions may be executed
under different concurrency control algorithms
simultaneously.",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Design; Management; Theory; Verification",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Concurrency}; Information Systems
--- Database Management --- Systems (H.2.4): {\bf
Distributed databases}",
}
@InProceedings{Wang:1987:PMD,
author = "C. P. Wang and V. O. K. Li",
title = "The precedence-assignment model for distributed
databases concurrency control algorithms",
crossref = "ACM:1987:PPS",
pages = "119--128",
year = "1987",
bibdate = "Thu Mar 12 18:40:49 MST 1998",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pods/28659/p119-wang/",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; management; theory; verification",
subject = "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
Systems, Concurrency. {\bf H.2.4} Information Systems,
DATABASE MANAGEMENT, Systems, Distributed databases.",
}
@InProceedings{Hadzilacos:1987:KAA,
author = "V. Hadzilacos",
title = "A knowledge-theoretic analysis of atomic commitment
protocols",
crossref = "ACM:1987:PPS",
pages = "129--134",
year = "1987",
bibdate = "Thu Mar 12 18:40:49 MST 1998",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pods/28659/p129-hadzilacos/",
acknowledgement = ack-nhfb,
keywords = "algorithms; management; standardization; theory;
verification",
subject = "{\bf C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
Systems, Distributed databases. {\bf G.m} Mathematics
of Computing, MISCELLANEOUS.",
}
@InProceedings{Hadzilacos:1987:KTA,
author = "V. Hadzilacos",
title = "A knowledge-theoretic analysis of atomic commitment
protocols",
crossref = "ACM:1987:PPS",
pages = "129--134",
year = "1987",
bibdate = "Wed Oct 25 08:47:34 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/28659/p129-hadzilacos/p129-hadzilacos.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/28659/p129-hadzilacos/",
acknowledgement = ack-nhfb,
}
@InProceedings{Lyngbaek:1987:MSD,
author = "Peter Lyngbaek and Victor Vianu",
title = "Mapping a semantic database model to the relational
model",
crossref = "Dayal:1987:PAC",
pages = "132--142",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p132-lyngbaek/p132-lyngbaek.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p132-lyngbaek/",
abstract = "The connection between semantic database models and
the relational model is formally investigated using the
Iris Data Model, which has been implemented using
relational database techniques. The results focus on
properties of relational schemas that are translations
of Iris schemas. Two new types of constraints,
cross-product constraints and multiplicity constraints
are introduced to characterize the relational
translations of Iris schemas. The connection
established between Iris and relational schemas also
yields new, unexpected information about Iris schemas.
In particular, a notion of equivalence of Iris schemas
is defined using their relational translations, and a
result is obtained on simplifying the type structure of
Iris schemas.",
acknowledgement = ack-nhfb,
generalterms = "Design; Theory",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Data models}; Software ---
Software Engineering --- Design Tools and Techniques
(D.2.2): {\bf IRIS}",
}
@InProceedings{Minker:1987:PDD,
author = "J. Minker",
title = "Perspectives in deductive databases {(Abstract
only)}",
crossref = "ACM:1987:PPS",
pages = "135--136 (or 135--135??)",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/28659/p135-minker/p135-minker.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/28659/p135-minker/;
http://www.acm.org:80/pubs/citations/proceedings/pods/28659/p135-minker/",
abstract = "I will discuss my experiences, some of the work that I
have done and related work that influenced me,
concerning deductive databases over the last 30 years.
It will be convenient to divide this time period into
roughly three equal parts, 1957 - 1968, 1969 - 1978,
1979 - present. For the first portion I will describe
how my interest started in deductive databases in 1957,
at a time when not even the field of databases existed
I will describe work in the beginning years, leading to
the start of deductive databases in about 1968 with the
work of Cordell Green and Bertram Raphael. \par
The second period saw a great deal of work in theorem
proving as well as the introduction of logic
programming. The existence and importance of deductive
databases as a formal and viable discipline received
its impetus at a workshop held in Toulouse, France, in
1977, which culminated in the book, Logic and Data
Bases. The relationship of deductive databases and
logic programming was recognized at that time. During
the third and most recent period we have seen formal
theories of databases come about as an outgrowth of
that work, and the recognition that artificial
intelligence and deductive databases are closely
related, at least through the so-called expert database
systems. I expect that the relationships between
techniques from formal logic, databases, logic
programming, and artificial intelligence will continue
to be explored and the field of deductive databases
will become a more prominent area of computer science
in coming years.",
acknowledgement = ack-nhfb,
generalterms = "Management",
keywords = "management",
subject = "{\bf H.2.m} Information Systems, DATABASE MANAGEMENT,
Miscellaneous. {\bf I.2.1} Computing Methodologies,
ARTIFICIAL INTELLIGENCE, Applications and Expert
Systems.",
}
@InProceedings{Apt:1987:MSD,
author = "K. Apt and J. M. Pugin",
title = "Maintenance of stratified databases viewed as a belief
revision system",
crossref = "ACM:1987:PPS",
pages = "136--145",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/28659/p136-apt/p136-apt.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/28659/p136-apt/;
http://www.acm.org:80/pubs/citations/proceedings/pods/28659/p136-apt/",
abstract = "We study here declarative and dynamic aspects of
non-monotonic reasoning in the context of deductive
databases. More precisely, we consider here maintenance
of a special class of indefinite deductive databases,
called stratified databases, introduced in Apt, Blair
and Walker [ABW] and Van Gelder [VG] in which recursion
``through'' negation is disallowed. \par
A stratified database has a natural model associated
with it which is selected as its intended meaning. The
maintenance problem for these databases is complicated
because insertions can lead to deletions and vice
versa. \par
To solve this problem we make use of the ideas present
in the works of Doyle [D] and de Kleer [dK] on belief
revision systems. We offer here a number of solutions
which differ in the amount of static and dynamic
information used and the form of support introduced. We
also discuss the implementation issues and the
trade-offs involved.",
acknowledgement = ack-nhfb,
generalterms = "Design; Management; Theory",
keywords = "design; management; theory",
subject = "{\bf H.2.m} Information Systems, DATABASE MANAGEMENT,
Miscellaneous. {\bf I.2.3} Computing Methodologies,
ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving,
Nonmonotonic reasoning and belief revision.",
}
@InProceedings{Roth:1987:DRD,
author = "Mark A. Roth and Henry F. Korth",
title = "The design of {$1$NF} relational databases into nested
normal form",
crossref = "Dayal:1987:PAC",
pages = "143--159",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p143-roth/p143-roth.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p143-roth/",
abstract = "We develop new algorithms for the design of non first
normal form relational databases that are in nested
normal form. Previously, a set of given multivalued
dependencies and those multivalued dependencies implied
by given functional dependencies were used to obtain a
nested normal form decomposition of a scheme. This
method ignored the semantic distinction between
functional and multivalued dependencies and utilized
only full multivalued dependencies in the design
process. We propose new algorithms which take advantage
of this distinction, and use embedded multivalued
dependencies to enhance the decomposition. This results
in further elimination of redundancy due to functional
dependencies in nested normal form designs.",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Design; Theory",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Data models}; Information
Systems --- Database Management --- Logical Design
(H.2.1): {\bf Normal forms}",
}
@InProceedings{Hegner:1987:SIP,
author = "S. Hegner",
title = "Specification and implementation of programs for
updating incomplete information databases",
crossref = "ACM:1987:PPS",
pages = "146--158",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/28659/p146-hegner/p146-hegner.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/28659/p146-hegner/;
http://www.acm.org:80/pubs/citations/proceedings/pods/28659/p146-hegner/",
abstract = "The problem of updating incomplete information
databases is examined as a programming problem. From
this point of view formal denotational semantics are
developed for two applicative programming languages,
BLU and HLU. BLU is a very simple language with only
five primitives, and is designed primarily as a tool
for the implementation of higher level languages. The
semantics of BLU are formally developed at two levels
possible worlds and clausal and the latter is shown to
be a correct implementation of the former. HLU is a
user level update language. It is defined entirely in
terms of BLU, and so immediately inherits its semantic
definition from that language. This demonstrates a
level of completeness for BLU as a level of primitives
for update language implementation. The necessity of a
particular BLU primitive, {\em masking}, suggests that
there is a high degree of inherent complexity in
updating logical databases.",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Languages; Management; Theory",
keywords = "algorithms; languages; management; theory",
subject = "{\bf H.2.m} Information Systems, DATABASE MANAGEMENT,
Miscellaneous. {\bf D.3.2} Software, PROGRAMMING
LANGUAGES, Language Classifications. {\bf F.3.2} Theory
of Computation, LOGICS AND MEANINGS OF PROGRAMS,
Semantics of Programming Languages, Denotational
semantics. {\bf H.2.1} Information Systems, DATABASE
MANAGEMENT, Logical Design, Schema and subschema.",
}
@InProceedings{Biliris:1987:OSL,
author = "A. Biliris",
title = "Operation specific locking in {B}-trees",
crossref = "ACM:1987:PPS",
pages = "159--169",
month = mar,
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "Database/Wiederhold.bib;
http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/28659/p159-biliris/p159-biliris.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/28659/p159-biliris/;
http://www.acm.org:80/pubs/citations/proceedings/pods/28659/p159-biliris/",
abstract = "B-trees have been used as an access and for both
primary and secondary indexing for quite some time.
This paper presents a deadlock free locking mechanism
in which different processes make use of different lock
types in order to reach the leaf nodes. The
compatibility relations among locks on a node, do not
exclusively depend on their type, but also on the node
status and the number and kind of processes acting
currently on the node. As a result, a number of
insertion or deletion processes can operate
concurrently on a node. The paper presents an
appropriate recovery strategy in case of failure, and
discusses the protocol modifications that are required
so it can be used in other similar structures such as B
+ -trees, compressed B-trees, and R-trees for spatial
searching.",
acknowledgement = ack-nhfb,
generalterms = "Design; Management; Standardization; Theory",
keywords = "design; management; standardization; theory",
subject = "{\bf H.2.2} Information Systems, DATABASE MANAGEMENT,
Physical Design, Deadlock avoidance. {\bf G.2.2}
Mathematics of Computing, DISCRETE MATHEMATICS, Graph
Theory, Trees. {\bf I.2.8} Computing Methodologies,
ARTIFICIAL INTELLIGENCE, Problem Solving, Control
Methods, and Search, Graph and tree search
strategies.",
}
@InProceedings{Graefe:1987:EOG,
author = "Goetz Graefe and David J. DeWitt",
title = "The {EXODUS} optimizer generator",
crossref = "Dayal:1987:PAC",
pages = "160--172",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p160-graefe/p160-graefe.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p160-graefe/",
abstract = "This paper presents the design and an initial
performance evaluation of the query optimizer generator
designed for the EXODUS extensible database system.
Algebraic transformation rules are translated into an
executable query optimizer, which transforms query
trees and selects methods for executing operations
according to cost functions associated with the
methods. The search strategy avoids exhaustive search
and it modifies itself to take advantage of past
experience. Computational results show that an
optimizer generated for a relational system produces
access plans almost as good as those produced by
exhaustive search, with the search time cut to a small
fraction.",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Design; Performance",
subject = "Information Systems --- Information Storage and
Retrieval --- Information Search and Retrieval (H.3.3):
{\bf Query formulation}; Information Systems ---
Database Management --- Logical Design (H.2.1): {\bf
Data models}; Software --- Programming Languages ---
Language Classifications (D.3.2): {\bf EXODUS}",
}
@InProceedings{Nurmi:1987:CCD,
author = "O. Nurmi and E. Soisalon-Soininen and D. Wood",
title = "Concurrency Control in Database Structures with
Relaxed Balance",
crossref = "ACM:1987:PPS",
pages = "170--176",
month = mar,
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "Database/Wiederhold.bib;
http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/28659/p170-nurmi/p170-nurmi.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/28659/p170-nurmi/;
http://www.acm.org:80/pubs/citations/proceedings/pods/28659/p170-nurmi/",
abstract = "We consider the separation of rebalancing from updates
in several database structures, such as B-trees for
external and AVL-trees for internal structures. We show
how this separation can be implemented such that
rebalancing is performed by local background processes.
Our solution implies that even simple locking schemes
(without additional links and copies of certain nodes)
for concurrency control are efficient in the sense that
at any time only a small constant number of nodes must
be locked.",
acknowledgement = ack-nhfb,
annote = "temporary layer block is inserted in Btree so split
does not propagate up. Cleanup as in Sagiv,Y. 86. Can
solve variable-length entry problem.",
generalterms = "Design; Management; Theory",
keywords = "design; management; theory",
subject = "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
Systems, Concurrency. {\bf I.2.8} Computing
Methodologies, ARTIFICIAL INTELLIGENCE, Problem
Solving, Control Methods, and Search, Graph and tree
search strategies. {\bf G.2.2} Mathematics of
Computing, DISCRETE MATHEMATICS, Graph Theory, Trees.",
}
@InProceedings{Freytag:1987:RBV,
author = "Johann Christoph Freytag",
title = "A rule-based view of query optimization",
crossref = "Dayal:1987:PAC",
pages = "173--180",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p173-freytag/p173-freytag.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p173-freytag/",
abstract = "The query optimizer is an important system component
of a relational database management system (DBMS). It
is the responsibility of this component to translate
the user-submitted query - usually written in a
non-procedural language - into an efficient query
evaluation plan (QEP) which is then executed against
the database. The research literature describes a wide
variety of optimization strategies for different query
languages and implementation environments. However,
very little is known about how to design and structure
the query optimization component to implement these
strategies. \par
This paper proposes a first step towards the design of
a {\em modular query optimizer}. We describe its
operations by {\em transformation rules\/} which
generate different QEPs from initial query
specifications. As we distinguish different aspects of
the query optimization process, our hope is that the
approach taken in this paper will contribute to the
more general goal of a modular query optimizer as part
of an extensible database management system.",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Design; Theory",
subject = "Information Systems --- Information Storage and
Retrieval --- Information Search and Retrieval (H.3.3):
{\bf Query formulation}; Information Systems ---
Database Management --- Logical Design (H.2.1): {\bf
Data models}; Information Systems --- Database
Management --- Systems (H.2.4); Theory of Computation
--- Mathematical Logic and Formal Languages ---
Grammars and Other Rewriting Systems (F.4.2)",
}
@InProceedings{Sun:1987:PRM,
author = "R. Sun and G. Thomas",
title = "Performance results on multiversion timestamp
concurrency control with predeclared writesets",
crossref = "ACM:1987:PPS",
pages = "177--184",
year = "1987",
bibdate = "Wed Oct 25 08:47:34 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/28659/p177-sun/p177-sun.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/28659/p177-sun/;
http://www.acm.org:80/pubs/citations/proceedings/pods/28659/p177-sun/",
acknowledgement = ack-nhfb,
keywords = "management; measurement; performance;
standardization",
subject = "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
Systems, Concurrency. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS, Modeling
techniques.",
}
@InProceedings{Shenoy:1987:SSQ,
author = "Sreekumar T. Shenoy and Z. Meral Ozsoyoglu",
title = "A system for semantic query optimization",
crossref = "Dayal:1987:PAC",
pages = "181--195",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p181-shenoy/p181-shenoy.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p181-shenoy/",
abstract = "This paper describes a scheme to utilize semantic
integrity constraints in optimizing a user specified
query. The scheme uses a graph theoretic approach to
identify redundant join clauses and redundant
restriction clauses specified in a user query. An
algorithm is suggested to eliminate such redundant
joins and avoid unnecessary restrictions. In addition
to these eliminations, the algorithm aims to introduce
as many restrictions on indexed attributes as possible,
thus yielding an equivalent, but potentially more
profitable, form of the original query.",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Languages; Performance",
subject = "Information Systems --- Information Storage and
Retrieval --- Information Search and Retrieval (H.3.3):
{\bf Query formulation}; Information Systems ---
Database Management --- Logical Design (H.2.1): {\bf
Data models}",
}
@InProceedings{Dechter:1987:DAR,
author = "R. Dechter",
title = "Decomposing an {$N$-ary} Relation into a Tree of Binary
Relations",
crossref = "ACM:1987:PPS",
pages = "185--189",
month = mar,
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/;
http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/28659/p185-dechter/p185-dechter.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/28659/p185-dechter/",
abstract = "We present an efficient algorithm for decomposing an
$n$-ary relation into a tree of binary relations, and
provide an efficient test for checking whether or not
the tree formed represents the relation. If there
exists a tree-decomposition, the algorithm is
guaranteed to find one, otherwise, the tree generated
will fail the test, then indicating that no tree
decomposition exist. The unique features of the
algorithm presented in this paper, is that it does not
a priori assume any dependencies in the initial
relation, rather it derives such dependencies from the
bare relation instance.",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Management; Theory; Verification",
keywords = "algorithms; management; theory; verification",
subject = "{\bf G.2.2} Mathematics of Computing, DISCRETE
MATHEMATICS, Graph Theory, Trees. {\bf I.2.8} Computing
Methodologies, ARTIFICIAL INTELLIGENCE, Problem
Solving, Control Methods, and Search, Graph and tree
search strategies.",
}
@InProceedings{Delgrande:1987:FLA,
author = "J. P. Delgrande",
title = "Formal limits on the automatic generation and
maintenance of integrity constraints",
crossref = "ACM:1987:PPS",
pages = "190--196",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/28659/p190-delgrande/p190-delgrande.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/28659/p190-delgrande/;
http://www.acm.org:80/pubs/citations/proceedings/pods/28659/p190-delgrande/",
abstract = "A formal approach to the automatic generation and
maintenance of integrity constraints in relational
databases is presented. It is assumed that some portion
of the database extension is known and that constraints
are to be formed on the basis of this portion. Since
this portion may be updated or new relations added to
the database the set of hypothesised constraints may
require occasional revision. The goal is this paper is
to characterise those constraints that may potentially
be formed on the basis of a part of the extension.
Formal systems are derived by means of which the set of
constraints that can be formed is precisely specified.
A procedure is derived for restoring the consistency of
a set of constraints after conflicting tuples are
encountered. It is shown that the set of constraints to
which the procedure may be applied corresponds with
minor limitations to the sentences of relational
algebra.",
acknowledgement = ack-nhfb,
generalterms = "Management; Theory; Verification",
keywords = "management; theory; verification",
subject = "{\bf H.2.0} Information Systems, DATABASE MANAGEMENT,
General, Security, integrity, and protection**. {\bf
H.2.m} Information Systems, DATABASE MANAGEMENT,
Miscellaneous. {\bf G.2.m} Mathematics of Computing,
DISCRETE MATHEMATICS, Miscellaneous. {\bf H.2.1}
Information Systems, DATABASE MANAGEMENT, Logical
Design, Schema and subschema.",
}
@InProceedings{Paul:1987:AID,
author = "H. B. Paul and H. J. Schek and M. H. Scholl",
title = "Architecture and implementation of the {Darmstadt}
database kernel system",
crossref = "Dayal:1987:PAC",
pages = "196--207",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p196-paul/p196-paul.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p196-paul/",
abstract = "The multi-layered architecture of the DArmStadt Data
Base System (DASDBS) for advanced applications is
introduced DASDBS is conceived as a family of
application-specific database systems on top of a
common database kernel system. The main design problem
considered here is, What features are common enough to
be integrated into the kernel and what features are
rather application-specific? Kernel features must be
simple enough to be efficiently implemented and to
serve a broad class of clients, yet powerful enough to
form a convenient basis for application-oriented
layers. Our kernel provides mechanisms to efficiently
store hierarchically structured complex objects, and
offers operations which are set-oriented and can be
processed in a single scan through the objects. To
achieve high concurrency in a layered system, a
multi-level transaction methodology is applied. First
experiences with our current implementation and some
lessons we have learned from it are reported.",
acknowledgement = ack-nhfb,
generalterms = "Design; Performance",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf DASDBS}; Software --- Software
Engineering --- Distribution, Maintenance, and
Enhancement (D.2.7): {\bf Extensibility**}",
}
@InProceedings{Imielinski:1987:RKD,
author = "T. Imielinski",
title = "Relative knowledge in a distributed database",
crossref = "ACM:1987:PPS",
pages = "197--209",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/28659/p197-imielinski/p197-imielinski.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/28659/p197-imielinski/;
http://www.acm.org:80/pubs/citations/proceedings/pods/28659/p197-imielinski/",
abstract = "Let DB be a database and let u 1, , u m be a
collection of users each having at his or her disposal
a query sublanguage L u 1 generated by some view
predicate Each of these users knows only as much as he
can learn from the database using his or her query
sublanguage. Such a knowledge is called {\em relative
knowledge\/} in the paper and its various properties
including the model and proof theory are investigated.
The applications of relative knowledge in the database
security and integrity are also discussed.",
acknowledgement = ack-nhfb,
generalterms = "Languages; Management; Theory; Verification",
keywords = "languages; management; theory; verification",
subject = "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
Systems, Distributed databases. {\bf H.2.3} Information
Systems, DATABASE MANAGEMENT, Languages, Query
languages.",
}
@InProceedings{Richardson:1987:PCD,
author = "Joel E. Richardson and Michael J. Carey",
title = "Programming constructs for database system
implementation in {EXODUS}",
crossref = "Dayal:1987:PAC",
pages = "208--219",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p208-richardson/p208-richardson.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p208-richardson/",
abstract = "The goal of the EXODUS extensible DBMS project is to
enable the rapid development of a wide spectrum of
high-performance, application-specific database systems
EXODUS provides certain kernel facilities for use by
all applications and a set of tools to aid the database
implementor (DBI) in generating new database system
software. Some of the DBI's work is supported by EXODUS
tools which generate database components from a
specification. However, components such as new abstract
data types, access methods, and database operations
must be explicitly coded by the DBI. This paper
analyzes the major programming problems faced by the
DBI, describing the collection of programming language
constructs that EXODUS provides for simplifying the
DBI's task. These constructs have been embedded in the
E programming language, an extension of C++ designed
specifically for implementing DBMS software.",
acknowledgement = ack-nhfb,
generalterms = "Design; Languages; Performance",
subject = "Software --- Programming Languages --- Language
Classifications (D.3.2): {\bf EXODUS}; Information
Systems --- Database Management --- Systems (H.2.4);
Software --- Programming Languages --- Language
Constructs and Features (D.3.3); Software --- Software
Engineering --- Distribution, Maintenance, and
Enhancement (D.2.7): {\bf Extensibility**}",
}
@InProceedings{Afrati:1987:PCS,
author = "F. Afrati and C. Papadimitriou",
title = "The Parallel Complexity of Simple Chain Queries",
crossref = "ACM:1987:PPS",
pages = "210--213",
month = mar,
year = "1987",
bibdate = "Wed Oct 25 08:47:34 MDT 2000",
bibsource = "Database/Wiederhold.bib;
http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/28659/p210-afrati/p210-afrati.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/28659/p210-afrati/;
http://www.acm.org:80/pubs/citations/proceedings/pods/28659/p210-afrati/",
acknowledgement = ack-nhfb,
keywords = "languages; management; theory; verification",
subject = "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf F.1.2} Theory of
Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of
Computation, Parallelism and concurrency. {\bf H.2.3}
Information Systems, DATABASE MANAGEMENT, Languages,
Datalog.",
}
@InProceedings{Beeri:1987:BPS,
author = "C. Beeri and P. Kanellakis and F. Bancilhon and R.
Ramakrishnan",
title = "Bounds on the propagation of selection into logic
programs",
crossref = "ACM:1987:PPS",
pages = "214--226",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/28659/p214-beeri/p214-beeri.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/28659/p214-beeri/;
http://www.acm.org:80/pubs/citations/proceedings/pods/28659/p214-beeri/",
abstract = "We consider the problem of propagating selections
(i.e., bindings of variables) into logic programs. In
particular, we study the class of binary chain programs
and define selection propagation as the task of finding
an equivalent program containing only unary derived
predicates. We associate a context free grammar {\em
L(H)\/} with every binary chain program {\em H}. We
show that, given {$H$} propagating a selection
involving some constant is possible iff {\em L(H)\/} is
regular, and therefore undecidable. We also show that
propagating a selection of the form {\em p(X,X)\/} is
possible iff {\em L(H)\/} is finite, and therefore
decidable. We demonstrate the connection of these two
cases, respectively, with the weak monadic second order
theory of one successor and with monadic generalized
spectra. We further clarify the analogy between chain
programs and languages from the point of view of
program equivalence and selection propagation
heuristics.",
acknowledgement = ack-nhfb,
generalterms = "Languages; Management; Theory; Verification",
keywords = "languages; management; theory; verification",
subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC
AND FORMAL LANGUAGES, Mathematical Logic, Logic and
constraint programming. {\bf I.2.3} Computing
Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and
Theorem Proving, Logic programming. {\bf F.4.2} Theory
of Computation, MATHEMATICAL LOGIC AND FORMAL
LANGUAGES, Grammars and Other Rewriting Systems,
Grammar types. {\bf H.2.3} Information Systems,
DATABASE MANAGEMENT, Languages, Query languages.",
}
@InProceedings{Lindsay:1987:DME,
author = "Bruce Lindsay and John McPherson and Hamid Pirahesh",
title = "A data management extension architecture",
crossref = "Dayal:1987:PAC",
pages = "220--226",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p220-lindsay/p220-lindsay.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p220-lindsay/",
abstract = "A database management system architecture is described
that facilitates the implementation of data management
extensions for relational database systems. The
architecture defines two classes of data management
extensions alternative ways of storing relations called
relation ``storage methods'', and access paths,
integrity constraints, or triggers which are
``attachments'' to relations. Generic sets of
operations are defined for storage methods and
attachments, and these operations must be provided in
order to add a new storage method or attachment type to
the system. The data management extension architecture
also provides common services for coordination of
storage method and attachment execution. This article
describes the data management extension architecture
along with some implementation issues and techniques.",
acknowledgement = ack-nhfb,
generalterms = "Design; Performance",
subject = "Information Systems --- Database Management ---
Systems (H.2.4); Information Systems --- Database
Management --- Logical Design (H.2.1): {\bf Data
models}; Software --- Software Engineering ---
Distribution, Maintenance, and Enhancement (D.2.7):
{\bf Extensibility**}",
}
@InProceedings{Naughton:1987:DCB,
author = "J. F. Naughton and Y. Sagiv",
title = "A decidable class of bounded recursions",
crossref = "ACM:1987:PPS",
pages = "227--236",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/28659/p227-naughton/p227-naughton.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/28659/p227-naughton/;
http://www.acm.org:80/pubs/citations/proceedings/pods/28659/p227-naughton/",
abstract = "Detecting bounded recursions is a powerful
optimization technique for recursions database query
languages as bounded recursions can be replaced by
equivalent nonrecursive definitions. The problem is of
theoretical interest because by varying the class of
recursions considered one can generate instances that
vary from linearly decidable to NP-hard to undecidable.
In this paper we review and clarify the existing
definitions of boundedness. We then specify a sample
criterion that guarantees that the condition in
Vaughton [7] is necessary and sufficient for
boundedness. The programs satisfying this criterion
subsume and extend previously known decidable classes
of bounded linear recursions.",
acknowledgement = ack-nhfb,
generalterms = "Languages; Management; Theory; Verification",
keywords = "languages; management; theory; verification",
subject = "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
Languages, Query languages. {\bf F.3.3} Theory of
Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies
of Program Constructs, Program and recursion schemes.
{\bf G.2.m} Mathematics of Computing, DISCRETE
MATHEMATICS, Miscellaneous.",
}
@InProceedings{Jajodia:1987:DV,
author = "Sushil Jajodia and David Mutchler",
title = "Dynamic voting",
crossref = "Dayal:1987:PAC",
pages = "227--238",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p227-jajodia/p227-jajodia.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p227-jajodia/",
abstract = "In a voting-based algorithm, a replicated file can be
updated in a partition if it contains a majority of
copies. In this paper, we propose an extension of this
scheme which permits a file to be updated in a
partition provided it contains a majority of up-to-date
copies. Our scheme not only preserves mutual
consistency of the replicated file, but provides
improvement in its availability as well. We develop a
stochastic model which gives insight into the
improvements afforded by our scheme over the voting
scheme.",
acknowledgement = ack-nhfb,
generalterms = "Design; Performance",
subject = "Software --- Operating Systems --- File Systems
Management (D.4.3): {\bf Maintenance**}; Information
Systems --- Database Management --- Systems (H.2.4):
{\bf Distributed databases}; Information Systems ---
Database Management --- Systems (H.2.4): {\bf
Transaction processing}",
}
@InProceedings{Shmueli:1987:DEA,
author = "O. Shmueli",
title = "Decidability and expressiveness aspects of logic
queries",
crossref = "ACM:1987:PPS",
pages = "237--249",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/28659/p237-shmueli/p237-shmueli.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/28659/p237-shmueli/;
http://www.acm.org:80/pubs/citations/proceedings/pods/28659/p237-shmueli/",
abstract = "This paper addresses some basic problems regarding
logic programming based queries over relational
databases. We re-examine the query classes {$H$} and
{\em YE\/} + defined by Chandra and Harel [2] We define
{$H$} + and {\em YE\/} ++ which differ from {$H$} and
{\em YE\/} + in that the use of equality (=) and
inequality () is prohibited. We show that {$H$} + is
more expressive than {\em YE\/} ++ and that any {$H$} +
program can be transformed into an equivalent {$H$} +
program containing a single recursive predicate without
using the equality or inequality operators. As a
corollary we obtain a fixpoint formula characterization
of {$H$} + queries. \par
We consider the problems of determining containment,
equivalence, and satisfiability of logic based queries.
The containment and equivalence problems addressed here
extend the work of Aho, Sagiv and Ullman on relational
queries [1] and Papadimitrious on Prolog [10]. As
corollaries we show that determining safety and literal
redundancy are both undecidable problems.",
acknowledgement = ack-nhfb,
generalterms = "Languages; Management; Theory; Verification",
keywords = "languages; management; theory; verification",
subject = "{\bf H.2.m} Information Systems, DATABASE MANAGEMENT,
Miscellaneous. {\bf F.4.1} Theory of Computation,
MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical
Logic, Logic and constraint programming. {\bf I.2.3}
Computing Methodologies, ARTIFICIAL INTELLIGENCE,
Deduction and Theorem Proving, Logic programming.",
}
@InProceedings{Haerder:1987:CTR,
author = "Theo Haerder and Kurt Rothermel",
title = "Concepts for transaction recovery in nested
transactions",
crossref = "Dayal:1987:PAC",
pages = "239--248",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p239-haerder/p239-haerder.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p239-haerder/",
abstract = "The concept of nested transactions offers more
decomposable execution units and finer grained control
over recovery and concurrency as compared to `flat'
transactions. To exploit these advantages, especially
transaction recovery has to be refined and adjusted to
the requirements of the control structure. \par
In this paper, we investigate transaction recovery for
nested transactions. Therefore, a model for nested
transaction is introduced allowing for synchronous and
asynchronous transaction invocation as well as single
call and conversational interfaces. For the resulting
four parameter combinations, the properties and
dependencies of transaction recovery are explored if a
transaction is `unit of recovery' and if savepoints
within transactions are used to gain finer recovery
units.",
acknowledgement = ack-nhfb,
generalterms = "Performance; Security; Theory",
subject = "Information Systems --- Database Management ---
Physical Design (H.2.2): {\bf Recovery and restart};
Information Systems --- Database Management --- Systems
(H.2.4): {\bf Transaction processing}",
}
@InProceedings{Garcia-Molina:1987:S,
author = "Hector Garcia-Molina and Kenneth Salem",
title = "Sagas",
crossref = "Dayal:1987:PAC",
pages = "249--259",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p249-garcia-molina/p249-garcia-molina.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p249-garcia-molina/",
abstract = "Long lived transactions (LLTs) hold on to database
resources for relatively long periods of time,
significantly delaying the termination of shorter and
more common transactions. To alleviate these problems
we propose the notion of a saga. A LLT is a saga if it
can be written as a sequence of transactions that can
be interleaved with other transactions. The database
management system guarantees that either all the
transactions in a saga are successfully completed or
compensating transactions are run to amend a partial
execution. Both the concept of saga and its
implementation are relatively simple, but they have the
potential to improve performance significantly. We
analyze the various implementation issues related to
sagas, including how they can be run on an existing
system that does not directly support them. We also
discuss techniques for database and LLT design that
make it feasible to break up LLTs into sagas.",
acknowledgement = ack-nhfb,
generalterms = "Design",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Transaction processing};
Information Systems --- Database Management ---
Physical Design (H.2.2)",
}
@InProceedings{Selinger:1987:CEI,
author = "P. Selinger",
title = "Chickens and eggs --- the interrelationship of systems
and theory",
crossref = "ACM:1987:PPS",
pages = "250--253",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/28659/p250-selinger/p250-selinger.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/28659/p250-selinger/;
http://www.acm.org:80/pubs/citations/proceedings/pods/28659/p250-selinger/",
abstract = "This paper describes a personal perspective of the
kinds of contributions that systems research and
theoretical research make to one another particularly
in the database area. Examples of each kind of
contribution are given, and then several case studies
from the author a personal experience are presented.
The case studies illustrate database systems research
where theoretical work contributed to systems results
and vice versa. Areas of database systems which need
more contributions from the theoretical community will
also be presented.",
acknowledgement = ack-nhfb,
generalterms = "Management; Theory",
keywords = "management; theory",
subject = "{\bf H.1.1} Information Systems, MODELS AND
PRINCIPLES, Systems and Information Theory.",
}
@InProceedings{Karabeg:1987:ASR,
author = "A. Karabeg and D. Karabeg and K. Papakonstantinou and
V. Vianu",
title = "Axiomatization and simplification rules for relational
transactions",
crossref = "ACM:1987:PPS",
pages = "254--259",
year = "1987",
bibdate = "Wed Oct 25 08:47:34 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/28659/p254-karabeg/p254-karabeg.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/28659/p254-karabeg/;
http://www.acm.org:80/pubs/citations/proceedings/pods/28659/p254-karabeg/",
acknowledgement = ack-nhfb,
keywords = "management; theory; verification",
subject = "{\bf H.2.m} Information Systems, DATABASE MANAGEMENT,
Miscellaneous. {\bf H.2.4} Information Systems,
DATABASE MANAGEMENT, Systems, Transaction processing.
{\bf G.2.m} Mathematics of Computing, DISCRETE
MATHEMATICS, Miscellaneous.",
}
@InProceedings{Abiteboul:1987:TLC,
author = "S. Abiteboul and V. Vianu",
title = "A translation language complete for database update
and specification",
crossref = "ACM:1987:PPS",
pages = "260--268",
year = "1987",
bibdate = "Wed Oct 25 08:47:34 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/28659/p260-abiteboul/p260-abiteboul.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/28659/p260-abiteboul/;
http://www.acm.org:80/pubs/citations/proceedings/pods/28659/p260-abiteboul/",
acknowledgement = ack-nhfb,
keywords = "design; languages; management",
subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language
Classifications, TL.",
}
@InProceedings{Freeston:1987:BFN,
author = "Michael Freeston",
title = "The {BANG} file: {A} new kind of grid file",
crossref = "Dayal:1987:PAC",
pages = "260--269",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p260-freeston/p260-freeston.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p260-freeston/",
abstract = "A new multi-dimensional file structure has been
developed in the course of a project to devise ways of
improving the support for interactive queries to
database and knowledge bases. Christened the `BANG'
file - a Balanced And Nested Grid - the new structure
is of the `grid file' type, but is fundamentally
different from previous grid file designs in that it
does not share their common underlying properties. It
has a tree-structured directory which has the
self-balancing property of a B-tree and which, in
contrast to previous designs, always expands at the
same rate as the data, whatever the form of the data
distribution. Its partitioning strategy both accurately
reflects the clustering of points in the data space,
and is flexible enough to adapt gracefully to changes
in the distribution.",
acknowledgement = ack-nhfb,
generalterms = "Design",
subject = "Data --- Files (E.5): {\bf Organization/structure};
Data --- Data Structures (E.1): {\bf Trees};
Information Systems --- Database Management --- Logical
Design (H.2.1): {\bf Data models}",
}
@InProceedings{Beeri:1987:PM,
author = "C. Beeri and R. Ramakrishnan",
title = "On the power of magic",
crossref = "ACM:1987:PPS",
pages = "269--284",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/28659/p269-beeri/p269-beeri.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/28659/p269-beeri/;
http://www.acm.org:80/pubs/citations/proceedings/pods/28659/p269-beeri/",
abstract = "This paper considers the efficient evaluation of
recursive queries expressed using Horn Clauses. We
define {\em sideways information passing\/} formally
and show how a query evaluation algorithm may be
defined in terms of sideways information passing and
control. We then consider a class of information
passing strategies which suffices to describe most
query evaluation algorithms in the database literature,
and show that these strategies may always be
implemented by rewriting a given program and evaluating
the rewritten program bottom-up. We describe in detail
several algorithms for rewriting a program. These
algorithms generalize the Counting and Magic Sets
algorithms to work with arbitrary programs. Safety and
optimality of the algorithms are also considered.",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Management; Performance; Theory;
Verification",
keywords = "algorithms; management; performance; theory;
verification",
subject = "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf F.3.3} Theory of
Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies
of Program Constructs, Program and recursion schemes.
{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC
AND FORMAL LANGUAGES, Mathematical Logic, Logic and
constraint programming.",
}
@InProceedings{Nelson:1987:PAH,
author = "Randal C. Nelson and Hanan Samet",
title = "A population analysis for hierarchical data
structures",
crossref = "Dayal:1987:PAC",
pages = "270--277",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p270-nelson/p270-nelson.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p270-nelson/",
abstract = "A new method termed population analysis is presented
for approximating the distribution of node occupancies
in hierarchical data structures which store a variable
number of geometric data items per node. The basic idea
is to describe a dynamic data structure as a set of
populations which are permitted to transform into one
another according to certain rules. The transformation
rules are used to obtain a set of equations describing
a population distribution which is stable under
insertion of additional information into the structure.
These equations can then be solved, either analytically
or numerically, to obtain the population distribution.
Hierarchical data structures are modeled by letting
each population represent the nodes of a given
occupancy. A detailed analysis of quadtree data
structures for storing point data is presented, and the
results are compared to experimental data. Two
phenomena referred to as {\em aging\/} and {\em
phasing\/} are defined and shown to account for the
differences between the experimental results and those
predicted by the model. The population technique is
compared with statistical methods of analyzing similar
data structures.",
acknowledgement = ack-nhfb,
generalterms = "Design",
subject = "Data --- Data Structures (E.1): {\bf Trees}; Data ---
Files (E.5): {\bf Organization/structure}; Information
Systems --- Database Management --- Logical Design
(H.2.1): {\bf Data models}",
}
@InProceedings{Sellis:1987:ESP,
author = "Timos K. Sellis",
title = "Efficiently supporting procedures in relational
database systems",
crossref = "Dayal:1987:PAC",
pages = "278--291",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p278-sellis/p278-sellis.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p278-sellis/",
abstract = "We examine an extended relational database system
which supports database procedures as full fledged
objects. In particular, we focus on the problems of
query processing and efficient support for database
procedures. First, a variation to the original INGRES
decomposition algorithm is presented. Then, we examine
the idea of storing results of previously processed
procedures in secondary storage ({\em caching\/}).
Using a cache, the cost of processing a query can be
reduced by preventing multiple evaluations of the same
procedure. Problems associated with cache
organizations, such as replacement policies and
validation schemes are examined. Another means for
reducing the execution cost of queries is indexing. A
new indexing scheme for cached results, Partial
Indexing, is proposed and analyzed.",
acknowledgement = ack-nhfb,
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Data models}",
}
@InProceedings{Grahne:1987:EES,
author = "G. Grahne and S. Sippu and E. Soisalon-Soininen",
title = "Efficient evaluation for a subset of recursive
queries",
crossref = "ACM:1987:PPS",
pages = "284--293",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/28659/p284-grahne/p284-grahne.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/28659/p284-grahne/;
http://www.acm.org:80/pubs/citations/proceedings/pods/28659/p284-grahne/",
abstract = "Well-known results on graph traversal are used to
develop a practical, efficient algorithm for evaluating
regularly and linearly recursive queries in databases
that contain only binary relations. Transformations are
given that reduce a subset of regular and linear
queries involving $n$-ary relations ($n^2$) to queries
involving only binary relations.",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Management; Measurement; Performance;
Theory",
keywords = "algorithms; management; measurement; performance;
theory",
subject = "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf F.3.3} Theory of
Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies
of Program Constructs, Program and recursion schemes.
{\bf G.2.m} Mathematics of Computing, DISCRETE
MATHEMATICS, Miscellaneous.",
xxauthor = "G. Grahne and S. Siu and E. Soisalon-Soininen",
}
@InProceedings{Hardwick:1987:WRF,
author = "Martin Hardwick",
title = "Why {ROSE} is fast: {Five} optimizations in the design
of an experimental database system for {CAD\slash CAM}
applications",
crossref = "Dayal:1987:PAC",
pages = "292--298",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p292-hardwick/p292-hardwick.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p292-hardwick/",
abstract = "ROSE is an experimental database system for CAD/CAM
applications that organizes a database into entries and
relationships. The data model of ROSE is an extension
of the relational model and the data manipulation
language is an extension of the relational algebra.
Internally, ROSE is organized so that it can use
operating system services to implement database system
services. In this paper we describe five optimizations
that have helped to make ROSE a fast database system
for CAD/CAM.",
acknowledgement = ack-nhfb,
generalterms = "Design; Experimentation; Performance",
subject = "Computer Applications --- Computer-Aided Engineering
(J.6); Information Systems --- Database Management ---
Systems (H.2.4): {\bf ROSE}",
}
@InProceedings{Marchetti-Spaccamella:1987:WCC,
author = "A. Marchetti-Spaccamella and A. Pelaggi and D. Sacca",
title = "Worst-case complexity analysis of methods for logic
query implementation",
crossref = "ACM:1987:PPS",
pages = "294--301",
year = "1987",
bibdate = "Wed Oct 25 08:47:34 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/28659/p294-marchetti-spaccamella/p294-marchetti-spaccamella.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/28659/p294-marchetti-spaccamella/;
http://www.acm.org:80/pubs/citations/proceedings/pods/28659/p294-marchetti-spaccamella/",
acknowledgement = ack-nhfb,
keywords = "algorithms; management; theory",
subject = "{\bf H.2.m} Information Systems, DATABASE MANAGEMENT,
Miscellaneous. {\bf H.2.4} Information Systems,
DATABASE MANAGEMENT, Systems, Query processing. {\bf
G.2.m} Mathematics of Computing, DISCRETE MATHEMATICS,
Miscellaneous.",
}
@InProceedings{Kemper:1987:OOS,
author = "Alfons Kemper and Peter C. Lockemann and Mechtild
Wallrath",
title = "An object-oriented system for engineering
applications",
crossref = "Dayal:1987:PAC",
pages = "299--310",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p299-kemper/p299-kemper.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p299-kemper/",
abstract = "One of the most promising approaches to database
support of engineering applications is the concept of
object-oriented database management. Object-orientation
is usually approached from either a behavioral or
structural viewpoint. The former emphasizes the
application-specific manipulation of technical objects
while hiding their structural details whereas the
latter concentrates on the structural aspects and their
efficient implementation. The thesis of the paper is
that the two viewpoints may enter into a fruitful
symbiosis where a behaviorally object-oriented system
is implemented on top of a structurally object-oriented
database system, thereby combining ease of use by the
engineer with high database system performance. The
thesis will be demonstrated in the paper by a
user-friendly interface based on user-definable
abstract datatypes and its implementation using a
prototype for the non-first-normal-form (NF 2)
relational model, and will be supported by an
engineering example application from off-line robot
programming.",
acknowledgement = ack-nhfb,
generalterms = "Design",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Data models}; Computer
Applications --- Physical Sciences and Engineering
(J.2): {\bf Engineering}; Information Systems ---
Database Management --- Systems (H.2.4); Software ---
Software Engineering --- Design Tools and Techniques
(D.2.2)",
}
@InProceedings{Gucht:1987:EPE,
author = "D. Van Gucht",
title = "On the expressive power of the extended relational
algebra for the unnormalized relational model",
crossref = "ACM:1987:PPS",
pages = "302--312",
year = "1987",
bibdate = "Wed Oct 25 08:47:34 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/28659/p302-van_gucht/p302-van_gucht.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/28659/p302-van_gucht/",
acknowledgement = ack-nhfb,
}
@InProceedings{VanGucht:1987:EPE,
author = "D. {Van Gucht}",
title = "On the expressive power of the extended relational
algebra for the unnormalized relational model",
crossref = "ACM:1987:PPS",
pages = "302--312",
year = "1987",
bibdate = "Thu Mar 12 18:40:49 MST 1998",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pods/28659/p302-van_gucht/",
acknowledgement = ack-nhfb,
keywords = "design; management; theory; verification",
subject = "{\bf H.2.m} Information Systems, DATABASE MANAGEMENT,
Miscellaneous. {\bf H.2.1} Information Systems,
DATABASE MANAGEMENT, Logical Design.",
}
@InProceedings{Banerjee:1987:SIS,
author = "Jay Banerjee and Won Kim and Hyoung-Joo Kim and Henry
F. Korth",
title = "Semantics and implementation of schema evolution in
object-oriented databases",
crossref = "Dayal:1987:PAC",
pages = "311--322",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p311-banerjee/p311-banerjee.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p311-banerjee/",
abstract = "Object-oriented programming is well-suited to such
data-intensive application domains as CAD/CAM, AI, and
OIS (office information systems) with multimedia
documents. At MCC we have built a prototype
object-oriented database system, called ORION. It adds
persistence and sharability to objects created and
manipulated in applications implemented in an
object-oriented programming environment. One of the
important requirements of these applications is schema
evolution, that is, the ability to dynamically make a
wide variety of changes to the database schema. In this
paper, following a brief review of the object-oriented
data model that we support in ORION, we establish a
framework for supporting schema evolution, define the
semantics of schema evolution, and discuss its
implementation.",
acknowledgement = ack-nhfb,
generalterms = "Languages; Performance",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Schema and subschema};
Information Systems --- Database Management --- Logical
Design (H.2.1): {\bf Data models}; Information Systems
--- Information Storage and Retrieval --- Systems and
Software (H.3.4): {\bf ORION}",
}
@InProceedings{VanGelder:1987:SCT,
author = "A. {Van Gelder} and R. Topor",
title = "Safety and correct translation of relational calculus
formulas",
crossref = "ACM:1987:PPS",
pages = "313--327",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/28659/p313-van_gelder/p313-van_gelder.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/28659/p313-van_gelder/",
abstract = "Not all queries in relational calculus can be answered
``sensibly'' once disjunction, negation, and universal
quantification are allowed. The class of relational
calculus queries, or formulas, that have ``sensible''
answers is called the {\em domain independent\/} class,
which is known to be undecidable. Subsequent research
has focused on identifying large decidable subclasses
of domain independent formulas In this paper we
investigate the properties of two such classes the {\em
evaluable\/} formulas and the {\em allowed\/} formulas.
Although both classes have been defined before, we give
simplified definitions, present short proofs of their
man properties, and describe a method to incorporate
equality. \par
Although evaluable queries have sensible answers, it is
not straightforward to compute them efficiently or
correctly. We introduce {\em relational algebra normal
form\/} for formulas from which form the correct
translation into relational algebra is trivial. We give
algorithms to transform an evaluable formula into an
equivalent {\em allowed\/} formula, and from there into
relational algebra normal form. Our algorithms avoid
use of the so-called {\em Dom\/} relation, consisting
of all constants appearing in the database or the
query. \par
Finally, we describe a restriction under which every
domain independent formula is evaluable, and argue that
evaluable formulas may be the largest decidable
subclass of the domain independent formulas that can be
efficiently recognized.",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Management; Performance; Theory;
Verification",
keywords = "algorithms; management; performance; theory;
verification",
subject = "Information Systems --- Database Management ---
Miscellaneous (H.2.m); Computing Methodologies ---
Artificial Intelligence --- Deduction and Theorem
Proving (I.2.3): {\bf Deduction}",
subject = "{\bf H.2.m} Information Systems, DATABASE MANAGEMENT,
Miscellaneous. {\bf I.2.3} Computing Methodologies,
ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving,
Deduction.",
}
@InProceedings{Cruz:1987:GQL,
author = "Isabel F. Cruz and Alberto O. Mendelzon and Peter T.
Wood",
title = "A graphical query language supporting recursion",
crossref = "Dayal:1987:PAC",
pages = "323--330",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p323-cruz/p323-cruz.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p323-cruz/",
abstract = "We define a language G for querying data represented
as a labeled graph {\em G}. By considering {$G$} as a
relation, this graphical query language can be viewed
as a relational query language, and its expressive
power can be compared to that of other relational query
languages. We do not propose G as an alternative to
general purpose relational query languages, but rather
as a complementary language in which recursive queries
are simple to formulate. The user is aided in this
formulation by means of a graphical interface. The
provision of regular expressions in G allows recursive
queries more general than transitive closure to be
posed, although the language is not as powerful as
those based on function-free Horn clauses. However, we
hope to be able to exploit well-known graph algorithms
in evaluating recursive queries efficiently, a topic
which has received widespread attention recently.",
acknowledgement = ack-nhfb,
generalterms = "Languages; Theory",
subject = "Information Systems --- Database Management ---
Languages (H.2.3); Information Systems --- Database
Management --- Logical Design (H.2.1): {\bf Data
models}; Mathematics of Computing --- Discrete
Mathematics --- Graph Theory (G.2.2): {\bf Path and
circuit problems}; Theory of Computation ---
Mathematical Logic and Formal Languages ---
Mathematical Logic (F.4.1): {\bf Recursive function
theory}",
}
@InProceedings{Ramakrishnan:1987:SRH,
author = "R. Ramakrishnan and F. Bancilhon and A. Silberschatz",
title = "Safety of recursive {Horn} clauses with infinite
relations",
crossref = "ACM:1987:PPS",
pages = "328--339",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/28659/p328-ramakrishnan/p328-ramakrishnan.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/28659/p328-ramakrishnan/;
http://www.acm.org:80/pubs/citations/proceedings/pods/28659/p328-ramakrishnan/",
abstract = "A database query is said to be {\em safe\/} if its
result consists of a finite set of tuples If a query is
expressed using a set of pure Horn Clauses, the problem
of determining whether it is safe is in general
undecidable In this paper, we show that the problem is
decidable when terms involving function symbols
(including arithmetic) are represented as distinct
occurrences of uninterpreted infinite predicates over
which certain {\em finiteness dependencies\/} hold. We
present a sufficient condition for safety when some
{\em monotonicity constraints\/} also hold.",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Management; Performance; Theory",
keywords = "algorithms; management; performance; theory",
subject = "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf F.4.1} Theory of
Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES,
Mathematical Logic, Logic and constraint programming.
{\bf H.2.0} Information Systems, DATABASE MANAGEMENT,
General, Security, integrity, and protection**.",
}
@InProceedings{Jagadish:1987:STC,
author = "H. V. Jagadish and Rakesh Agrawal and Linda Ness",
title = "A study of transitive closure as a recursion
mechanism",
crossref = "Dayal:1987:PAC",
pages = "331--344",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p331-jagadish/p331-jagadish.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p331-jagadish/",
abstract = "We show that every linearly recursive query can be
expressed as a transitive closure possibly preceded and
followed by operations already available in relational
algebra. This reduction is possible even if there are
repeated variables in the recursive literals and if
some of the arguments in the recursive literals are
constants. Such an equivalence has significant
theoretical and practical ramifications. One the one
hand it influences the design of expressive notations
to capture recursion as an augmentation of relational
query languages. On the other hand implementation of
deductive databases is impacted in that the design does
not have to provide the generality that linear
recursion would demand. It suffices to study the single
problem of transitive closure and to provide an
efficient implementation for it.",
acknowledgement = ack-nhfb,
generalterms = "Languages; Theory",
subject = "Theory of Computation --- Mathematical Logic and
Formal Languages --- Mathematical Logic (F.4.1): {\bf
Recursive function theory}; Information Systems ---
Database Management --- Logical Design (H.2.1): {\bf
Data models}",
}
@InProceedings{Naughton:1987:OR,
author = "J. F. Naughton",
title = "One-sided recursions",
crossref = "ACM:1987:PPS",
pages = "340--348",
year = "1987",
bibdate = "Thu Mar 12 18:40:49 MST 1998",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pods/28659/p340-naughton/",
acknowledgement = ack-nhfb,
keywords = "algorithms; languages; management; performance;
theory",
subject = "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
Languages, Query languages. {\bf F.3.3} Theory of
Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies
of Program Constructs, Program and recursion schemes.
{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC
AND FORMAL LANGUAGES, Mathematical Logic, Recursive
function theory.",
}
@InProceedings{Naughton:1987:OSR,
author = "J. F. Naughton",
title = "One-sided recursions",
crossref = "ACM:1987:PPS",
pages = "340--348",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/28659/p340-naughton/p340-naughton.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/28659/p340-naughton/",
abstract = "The performance of systems with recursive query
languages can be improved by recognizing simple, easily
evaluable classes of recursions and using algorithms
tailored to these classes whenever possible. In this
paper we identify a useful subset of recursive
definitions, the {\em one-sided recursions}. We show
how to detect one-sided recursions, and give two simple
evaluation algorithms that cover one-sided definitions
in that for any selection on a one-sided definition, at
least one of the two algorithms will apply. These
algorithms have simple termination conditions, maintain
minimal state and use selections on the recursively
defined relation whenever possible. We show that there
are no similar algorithms for many-sided recursions We
also prove that it is undecidable whether an arbitrary
definition has an equivalent one-sided definition.
However, we do present a procedure that converts many
potentially one-sided recursions to one-sided form, and
prove it complete for a useful class of recursions.",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Languages; Management; Performance;
Theory",
subject = "Information Systems --- Database Management ---
Languages (H.2.3): {\bf Query languages}; Theory of
Computation --- Logics and Meanings of Programs ---
Studies of Program Constructs (F.3.3): {\bf Program and
recursion schemes}; Theory of Computation ---
Mathematical Logic and Formal Languages ---
Mathematical Logic (F.4.1): {\bf Recursive function
theory}",
}
@InProceedings{Zhang:1987:NCD,
author = "Weining Zhang and C. T. Yu",
title = "A necessary condition for a doubly recursive rule to
be equivalent to a linear recursive rule",
crossref = "Dayal:1987:PAC",
pages = "345--356",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p345-zhang/p345-zhang.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p345-zhang/",
abstract = "Nonlinear recursive queries are usually less efficient
in processing than linear recursive queries. It is
therefore of interest to transform non-linear recursive
queries into linear ones. We obtain a necessary and
sufficient condition for a doubly recursive rule of a
certain type to be logically equivalent to a single
linear recursive rule obtained in a specific way.",
acknowledgement = ack-nhfb,
generalterms = "Languages; Theory",
subject = "Theory of Computation --- Mathematical Logic and
Formal Languages --- Mathematical Logic (F.4.1): {\bf
Recursive function theory}",
}
@InProceedings{Sagiv:1987:ODP,
author = "Y. Sagiv",
title = "Optimizing datalog programs",
crossref = "ACM:1987:PPS",
pages = "349--362",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/28659/p349-sagiv/p349-sagiv.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/28659/p349-sagiv/;
http://www.acm.org:80/pubs/citations/proceedings/pods/28659/p349-sagiv/",
abstract = "Datalog programs, i.e., Prolog programs without
function symbols, are considered It is assumed that a
variable appearing in the head of a rule must also
appear in the body of the rule. The input of a program
is a set of ground atoms (which are given in addition
to the program's rules) and, therefore, can be viewed
as an assignment of relations to some of the program's
predicates. Two programs are equivalent if they produce
the same result for all possible assignments of
relations to the extensional predicates (i.e., the
predicates that do not appear as heads of rules). Two
programs are uniformly equivalent if they produce the
same result for all possible assignments of initial
relations to all the predicates (i.e., both extensional
and intentional). The equivalence problem for Datalog
programs is known to be undecidable. It is shown that
uniform equivalence is decidable, and an algorithm is
given for minimizing a Datalog program under uniform
equivalence. A technique for removing parts of a
program that are redundant under equivalence (but not
under uniform equivalence) is developed. A procedure
for testing uniform equivalence is also developed for
the case in which the database satisfies some
constraints.",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Languages; Management; Theory;
Verification",
keywords = "algorithms; languages; management; theory;
verification",
subject = "{\bf I.2.7} Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Natural Language Processing, DATALOG.
{\bf G.2.m} Mathematics of Computing, DISCRETE
MATHEMATICS, Miscellaneous. {\bf F.3.3} Theory of
Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies
of Program Constructs, Program and recursion schemes.",
}
@InProceedings{Morgenstern:1987:SIM,
author = "Matthew Morgenstern",
title = "Security and inference in multilevel database and
knowledge-base systems",
crossref = "Dayal:1987:PAC",
pages = "357--373",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p357-morgenstern/p357-morgenstern.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p357-morgenstern/",
abstract = "This paper addresses the threat to multilevel security
that arises from logical inference and the semantics of
the application. Such compromises of security are
particularly challenging since they circumvent
traditional security mechanisms and rely on a user's
knowledge of the application. The problems of inference
and security have heretofore been amorphous and
difficult to circumscribe. We focus on these problems
in the context of a multilevel database system and show
their relevance to knowledge-based systems, sometimes
referred to as expert systems. Here we establish a
framework for studying these inference control
problems, describe a representation for relevant
semantics of the application, develop criteria for
safety and security of a system to prevent these
problems, and outline algorithms for enforcing these
criteria.",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Security",
subject = "Computing Methodologies --- Artificial Intelligence
--- Deduction and Theorem Proving (I.2.3): {\bf
Deduction}; Information Systems --- Database Management
--- Systems (H.2.4); Computing Methodologies ---
Artificial Intelligence --- Applications and Expert
Systems (I.2.1); Information Systems --- Database
Management --- General (H.2.0): {\bf Security,
integrity, and protection**}",
}
@InProceedings{Stemple:1987:MMF,
author = "David Stemple and Subhasish Mazumdar and Tim Sheard",
title = "On the modes and meaning of feedback to transaction
designers",
crossref = "Dayal:1987:PAC",
pages = "374--386",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p374-stemple/p374-stemple.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p374-stemple/",
abstract = "An analysis of database transactions in the presence
of database integrity constraints can lead to several
modes of feedback to transaction designers. The
different kinds of feedback include tests and updates
that could be added to the transaction to make it obey
the integrity constraints, as well as predicates
representing post-conditions guaranteed by a
transaction's execution. We discuss the various modes,
meanings, and uses of feedback. We also discuss methods
of generating feedback from integrity constraints,
transaction details and theorems constituting both
generic knowledge of database systems and specific
knowledge about a particular database. Our methods are
based on a running system that generates tailored
theories about database systems from their schemas and
uses these theories to prove that transactions obey
integrity constraints.",
acknowledgement = ack-nhfb,
generalterms = "Design; Documentation; Theory",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Transaction processing};
Information Systems --- Database Management --- General
(H.2.0): {\bf Security, integrity, and protection**};
Theory of Computation --- Logics and Meanings of
Programs --- Specifying and Verifying and Reasoning
about Programs (F.3.1): {\bf Pre- and post-conditions};
Information Systems --- Database Management --- Logical
Design (H.2.1): {\bf Normal forms}",
}
@InProceedings{Rubenstein:1987:BSD,
author = "W. B. Rubenstein and M. S. Kubicar and R. G. G.
Cattell",
title = "Benchmarking simple database operations",
crossref = "Dayal:1987:PAC",
pages = "387--394",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p387-rubenstein/p387-rubenstein.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p387-rubenstein/",
abstract = "There are two widely-known benchmarks for database
management systems the TP1 benchmarks (Anon {\em et
al\/} [1985]), designed to measure transaction
throughout, and the Wisconsin benchmarks (Bitton,
Dewitt, Turbyfil [1984]), designed to measure the
performance of a relational query processor. In our
work with databases on engineering workstations, we
found neither of these benchmarks a suitable measure
for our applications' needs. Instead, our requirements
are for {\em response time\/} for simple queries. We
propose benchmark measurements to measure response
time, specifically designed for the simple,
object-oriented queries that engineering database
applications perform. We report results from running
this benchmark against some database systems we use
ourselves, and provide enough detail for others to
reproduce the benchmark measurements on other
relational, object-oriented, or specialized database
systems. We discuss a number of factors that make an
order of magnitude improvement in benchmark performance
caching the entire database in main memory, avoiding
query optimization overhead, using physical links for
prejoins, and using an alternative to the
generally-accepted database ``server'' architecture on
distributed networks.",
acknowledgement = ack-nhfb,
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Data models}; Computer
Systems Organization --- Performance of Systems (C.4);
Computing Milieux --- Management of Computing and
Information Systems --- Installation Management
(K.6.2): {\bf Benchmarks}",
}
@InProceedings{Gray:1987:MRT,
author = "Jim Gray and Franco Putzolu",
title = "The $5$ minute rule for trading memory for disc
accesses and the $10$ byte rule for trading memory for
{CPU} time",
crossref = "Dayal:1987:PAC",
pages = "395--398",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p395-gray/p395-gray.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p395-gray/",
abstract = "If an item is accessed frequently enough, it should be
main memory resident. For current technology,
``frequently enough'' means about every five minutes.
\par
Along a similar vein, one can frequently trade memory
space for CPU time. For example, bits can be packed in
a byte at the expense of extra instructions to extract
the bits. It makes economic sense to spend ten bytes of
main memory to save one instruction per second.
\par
These results depend on current price ratios of
processors, memory and disc accesses. These ratios are
changing and hence the constants in the rules are
changing.",
acknowledgement = ack-nhfb,
generalterms = "Design; Performance; Reliability; Theory",
subject = "Computer Systems Organization --- Performance of
Systems (C.4); Information Systems --- Database
Management --- Physical Design (H.2.2); Information
Systems --- Information Storage and Retrieval ---
Information Storage (H.3.2)",
}
@InProceedings{Richardson:1987:DEP,
author = "James P. Richardson and Hongjun Lu and Krishna
Mikkilineni",
title = "Design and evaluation of parallel pipelined join
algorithms",
crossref = "Dayal:1987:PAC",
pages = "399--409",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p399-richardson/p399-richardson.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p399-richardson/",
abstract = "The join operation is the most costly operation in
relational database management systems. Distributed and
parallel processing can effectively speed up the join
operation. In this paper, we describe a number of
highly parallel and pipelined multiprocessor join
algorithms using sort-merge and hashing techniques.
Among them, two algorithms are parallel and pipelined
versions of traditional sort-merge join methods, two
algorithms use both hashing and sort-merge techniques,
and another two are variations of the hybrid hash join
algorithms. The performance of those algorithms is
evaluated analytically against a generic database
machine architecture. The methodology used in the
design and evaluation of these algorithms is also
discussed. \par
The results of the analysis indicate that using a
hashing technique to partition the source relations can
dramatically reduce the elapsed time hash-based
algorithms outperform sort-merge algorithms in almost
all cases because of their high parallelism. Hash-based
sort-merge and hybrid hash methods provide similar
performance in most cases. With large source relations,
the algorithms which replicate the smaller relation
usually give better elapsed time. Sharing memory among
processors also improves performance somewhat.",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Design; Performance; Theory",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Data models}; Mathematics
of Computing --- Numerical Analysis --- General
(G.1.0): {\bf Parallel algorithms}",
}
@InProceedings{Butler:1987:SRO,
author = "Margaret H. Butler",
title = "Storage reclamation in object oriented database
systems",
crossref = "Dayal:1987:PAC",
pages = "410--425",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p410-butler/p410-butler.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p410-butler/",
abstract = "When providing data management for nontraditional
data, database systems encounter storage reclamation
problems similar to those encountered by virtual memory
managers. The paging behavior of existing automatic
storage reclamation schemes as applied to objects
stored in a database management system is one indicator
of the performance cost of various features of storage
reclamation algorithms. The results of modeling the
paging behavior suggest that Mark and Sweep causes many
more input/output operations than Copy-Compact. A
contributing factor to the expense of Mark and Sweep is
that it does not recluster memory as does Copy-Compact.
If memory is not reclustered, the average cost of
accessing data can go up tremendously. Other algorithms
that do not recluster memory also suffer performance
problems, namely all reference counting schemes. The
main advantage of a reference count scheme is that it
does not force a running program to pause for a long
period of time while reclamation takes place, it
amortizes the cost of reclamation across all accesses.
The reclustering of Copy-Compact and the cost
amortization of Reference Count are combined to great
advantage in Baker's algorithm. This algorithm proves
to be the least prohibitive for operating on disk-based
data.",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Performance",
subject = "Information Systems --- Information Storage and
Retrieval --- Information Storage (H.3.2)",
}
@InProceedings{Faloutsos:1987:AOO,
author = "Christos Faloutsos and Timos Sellis and Nick
Roussopoulos",
title = "Analysis of object oriented spatial access methods",
crossref = "Dayal:1987:PAC",
pages = "426--439",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p426-faloutsos/p426-faloutsos.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p426-faloutsos/",
abstract = "This paper provides an analysis of R-trees and a
variation (R + -trees) that avoids overlapping
rectangles in intermediate nodes of the tree. The main
contributions of the paper are the following. We
provide the first known analysis of R-trees. Although
formulas are given for objects in one dimension (line
segments), they can be generalized for objects in
higher dimensions as well. We show how the
transformation of objects to higher dimensions [HINR83]
can be effectively used as a tool for the analysis of
R- and R + - trees. Finally, we derive formulas for R +
-trees and compare the two methods analytically. The
results we obtained show that R + -trees require less
than half the disk accesses required by a corresponding
R-tree when searching files of real life sizes R +
-trees are clearly superior in cases where there are
few long segments and a lot of small ones.",
acknowledgement = ack-nhfb,
generalterms = "Performance",
subject = "Information Systems --- Database Management ---
Physical Design (H.2.2): {\bf Access methods};
Information Systems --- Database Management --- Systems
(H.2.4)",
}
@InProceedings{Hanson:1987:PAV,
author = "Eric N. Hanson",
title = "A performance analysis of view materialization
strategies",
crossref = "Dayal:1987:PAC",
pages = "440--453",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p440-hanson/p440-hanson.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p440-hanson/",
abstract = "The conventional way to process commands for
relational views is to use query modification to
translate the commands into ones on the base relations.
An alternative approach has been proposed recently,
whereby materialized copies of views are kept, and
incrementally updated immediately after each
modification of the database. A related scheme exists,
in which update of materialized views is deferred until
just before data is retrieved from the view. A
performance analysis is presented comparing the cost of
query modification, immediate view maintenance, and
deferred view maintenance. Three different models of
the structure of views are given a simple selection and
projection of one relation, the natural join of two
relations, and an aggregate (e.g., the sum of values in
a column) over a selection-projection view. The results
show that the choice of the most efficient view
maintenance method depends heavily on the structure of
the database, the view definition, and the type of
query and update activity present.",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Design; Languages; Performance",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1); Information Systems ---
Database Management --- Physical Design (H.2.2)",
}
@InProceedings{Segev:1987:LMT,
author = "Arie Segev and Arie Shoshani",
title = "Logical modeling of temporal data",
crossref = "Dayal:1987:PAC",
pages = "454--466",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p454-segev/p454-segev.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p454-segev/",
abstract = "In this paper we examine the semantics and develop
constructs for temporal data independent of any
traditional data model, such as the relational or
network data models. Unlike many other works which
extend existing models to support temporal data, our
purpose is to characterize the properties of temporal
data and operators over them without being influenced
by traditional models which were not specifically
designed to model temporal data. We develop data
constructs that represent sequences of temporal values,
identify their semantic properties, and define
operations over these structures.",
acknowledgement = ack-nhfb,
generalterms = "Design; Languages; Theory",
subject = "Theory of Computation --- Logics and Meanings of
Programs --- Semantics of Programming Languages
(F.3.2): {\bf Algebraic approaches to semantics};
Information Systems --- Database Management --- Logical
Design (H.2.1): {\bf Data models}; Software ---
Programming Languages --- Language Constructs and
Features (D.3.3): {\bf Abstract data types}",
}
@InProceedings{McKenzie:1987:ERA,
author = "Edwin McKenzie and Richard Snodgrass",
title = "Extending the relational algebra to support
transaction time",
crossref = "Dayal:1987:PAC",
pages = "467--478",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p467-mckenzie/p467-mckenzie.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p467-mckenzie/",
abstract = "In this paper we discuss extensions to the
conventional relational algebra to support transaction
time. We show that these extensions are applicable to
historical algebras that support valid time, yielding a
temporal algebraic language. Since transaction time
concerns the storage of information in the database,
the notion of state is central. The extensions are
formalized using denotational semantics. The additions
preserve the useful properties of the conventional
relational algebra.",
acknowledgement = ack-nhfb,
generalterms = "Languages; Theory",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Data models}; Information
Systems --- Database Management --- Systems (H.2.4):
{\bf Transaction processing}; Theory of Computation ---
Logics and Meanings of Programs --- Semantics of
Programming Languages (F.3.2): {\bf Algebraic
approaches to semantics}",
}
@InProceedings{Rubenstein:1987:DDM,
author = "W. Bradley Rubenstein",
title = "A database design for musical information",
crossref = "Dayal:1987:PAC",
pages = "479--490",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p479-rubenstein/p479-rubenstein.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p479-rubenstein/",
abstract = "As part of our research into a general purpose data
management system for musical information, a major
focus has been the development of tools to support a
data model for music. This paper first outlines the
various types of information that fall under the
purview of our proposed data manager. We consider
extensions to the entity-relationship data model to
implement the notion of {\em hierarchical ordering},
commonly found in musical data. We then present
examples from our schema for representing musical
notation in a database, taking advantage of these
extensions.",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Design",
subject = "Computer Applications --- Arts and Humanities (J.5):
{\bf Music**}; Information Systems --- Database
Management --- General (H.2.0); Information Systems ---
Database Management --- Logical Design (H.2.1): {\bf
Data models}",
}
@InProceedings{Hudson:1987:OOD,
author = "Scott E. Hudson and Roger King",
title = "Object-oriented database support for software
environments",
crossref = "Dayal:1987:PAC",
pages = "491--503",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p491-hudson/p491-hudson.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p491-hudson/",
abstract = "Cactis is an object-oriented, multi-user DBMS
developed at the University of Colorado. The
implementation is self-adaptive and concurrent, and
runs in the Unix/C Sun workstation environment. A
central, unique focus of Cactis is the support of
functionally-defined data in a manner which provides
good performance. Cactis is intended for use in
applications which are conducive to an object-oriented
approach and involve derived data. Such applications
include software environments. \par
Cactis supports the construction of objects and
type/subtype hierarchies, which are useful for managing
the complex and highly-interrelated data found in
software environments. Such data types include
programs, requirement specifications, milestone
reports, configurations, documentation, and many
others. Cactis uses techniques based on attributed
graphs to ensure that functionally-defined attributes
of objects, such as compilation dependencies, cost
calculations, and milestone dependencies can be
maintained efficiently. Since it is necessary to
dynamically add new tools (such as debuggers and
compilers) to a software environment, the DBMS allows
the user to extend the type structure. The system also
supports an efficient rollback and recovery mechanism,
which provides the framework for a software version
facility.",
acknowledgement = ack-nhfb,
generalterms = "Design",
subject = "Software --- Software Engineering --- Programming
Environments (D.2.6); Software --- Programming
Languages --- Language Constructs and Features (D.3.3);
Information Systems --- Database Management --- Logical
Design (H.2.1): {\bf Data models}",
}
@InProceedings{Croft:1987:SOD,
author = "W. B. Croft and D. W. Stemple",
title = "Supporting office document architectures with
constrained types",
crossref = "Dayal:1987:PAC",
pages = "504--509",
year = "1987",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p504-croft/p504-croft.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/38713/p504-croft/",
abstract = "Data models have been proposed as a means of defining
the objects and operations in an office information
system. Office documents, because of their highly
variable structure and multimedia content, are a
difficult class of objects to model. The modeling task
is further complicated by document architecture
standards used for interchange between systems. We
present an approach to data modeling based on
constrained type definitions that allows architecture
standards to be defined and ensures that individual
document types conform to those standards. The ADABTPL
model, which is used to define the schema of document
types and standards, is described.",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Design",
subject = "Information Systems --- Information Systems
Applications --- Office Automation (H.4.1); Software
--- Programming Languages --- Language Constructs and
Features (D.3.3): {\bf Data types and structures};
Information Systems --- Database Management --- Logical
Design (H.2.1): {\bf Data models}; Software ---
Programming Languages --- Language Constructs and
Features (D.3.3): {\bf Abstract data types}",
}
@InProceedings{Delgrande:1987:FBA,
author = "J. P. Delgrande",
title = "Formal Bounds on Automatic Generation and Maintenance
of Integrity Constraints",
crossref = "ACM:1987:PPS",
pages = "??--??",
month = mar,
year = "1987",
bibsource = "Database/Wiederhold.bib",
}
@InProceedings{Chandra:1988:TDQ,
author = "Ashok K. Chandra",
title = "Theory of database queries",
crossref = "ACM:1988:PPS",
pages = "1--9",
year = "1988",
bibdate = "Wed Oct 25 08:47:34 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/308386/p1-chandra/p1-chandra.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/308386/p1-chandra/",
acknowledgement = ack-nhfb,
}
@InProceedings{Swami:1988:OLJ,
author = "Arun Swami and Anoop Gupta",
title = "Optimization of large join queries",
crossref = "ACM:1988:PAC",
pages = "8--17",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/50202/p8-swami/p8-swami.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/50202/p8-swami/",
abstract = "We investigate the problem of optimizing
Select--Project--Join queries with large numbers of
joins. Taking advantage of commonly used heuristics,
the problem is reduced to that of determining the
optimal join order. This is a hard combinatorial
optimization problem. Some general techniques, such as
iterative improvement and simulated annealing, have
often proved effective in attacking a wide variety of
combinatorial optimization problems. In this paper, we
apply these general algorithms to the large join query
optimization problem. We use the statistical techniques
of factorial experiments and analysis of variance
(ANOVA) to obtain reliable values for the parameters of
these algorithms and to compare these algorithms. One
interesting result of our experiments is that the
relatively simple iterative improvement proves to be
better than all the other algorithms (included the more
complex simulated annealing). We also find that the
general algorithms do quite well at the maximum time
limit.",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Theory",
subject = "Computing Methodologies --- Simulation and Modeling
--- Applications (I.6.3); Information Systems ---
Database Management --- Systems (H.2.4): {\bf Query
processing}; Mathematics of Computing --- Numerical
Analysis --- Optimization (G.1.6); Mathematics of
Computing --- Numerical Analysis --- Numerical Linear
Algebra (G.1.3): {\bf Linear systems (direct and
iterative methods)}; Mathematics of Computing ---
Discrete Mathematics --- Combinatorics (G.2.1): {\bf
Combinatorial algorithms}",
}
@InProceedings{Kuper:1988:EPL,
author = "Gabriel M. Kuper",
title = "On the expressive power of logic programming languages
with sets",
crossref = "ACM:1988:PPS",
pages = "10--14",
year = "1988",
bibdate = "Wed Oct 25 08:47:34 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/308386/p10-kuper/p10-kuper.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/308386/p10-kuper/",
acknowledgement = ack-nhfb,
}
@InProceedings{Shmueli:1988:RRC,
author = "Oded Shmueli and Shalom Tsur and Carlo Zaniolo",
title = "Rewriting of rules containing set terms in a logic
data language {LDL}",
crossref = "ACM:1988:PPS",
pages = "15--28",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/308386/p15-shmueli/p15-shmueli.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/308386/p15-shmueli/",
abstract = "We propose compilation methods for supporting set
terms in Horn clause programs, without using
general-purpose set matching algorithms, which tend to
run in times exponential in the size of the
participating sets Instead, we take the approach of
formulating specialized computation plans that, by
taking advantage of information available in the given
rules, limit the number of alternatives explored. Our
strategy is to employ {\em compile time\/} rewriting
techniques and to transform the problem into an
``ordinary'' Horn clause compilation problem, with
minimal additional overhead. The execution cost of the
rewritten rules is substantially lower than that of the
original rules and the additional cost of compilation
can thus be amortized over many executions",
acknowledgement = ack-nhfb,
}
@InProceedings{Lohman:1988:GLF,
author = "Guy M. Lohman",
title = "Grammar-like functional rules for representing query
optimization alternatives",
crossref = "ACM:1988:PAC",
pages = "18--27",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/50202/p18-lohman/p18-lohman.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/50202/p18-lohman/",
abstract = "Extensible query optimization requires that the
``repertoire'' of alternative strategies for executing
queries be represented as data, not embedded in the
optimizer code. Recognizing that query optimizers are
essentially expert systems, several researchers have
suggested using strategy rules to transform query
execution plans into alternative or better plans.
Though extremely flexible, these systems can be very
inefficient at any step in the processing, many rules
may be eligible for application and complicated
conditions must be tested to determine that eligibility
during unification. We present a constructive,
``building blocks'' approach to defining alternative
plans, in which the rules defining alternatives are an
extension of the productions of a grammar to resemble
the definition of a function in mathematics. The
extensions permit each token of the grammar to be
parametrized and each of its alternative definitions to
have a complex condition. The terminals of the grammar
are base-level database operations on tables that are
interpreted at run-time. The non-terminals are defined
declaratively by production rules that combine those
operations into meaningful plans for execution. Each
production produces a set of alternative plans, each
having a vector of properties, including the estimated
cost of producing that plan. Productions can require
certain properties of their inputs, such as tuple order
and location, and we describe a ``glue'' mechanism for
augmenting plans to achieve the required properties. We
give detailed examples to illustrate the power and
robustness of our rules and to contrast them with
related ideas.",
acknowledgement = ack-nhfb,
generalterms = "Languages; Theory",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Query processing}; Theory of
Computation --- Mathematical Logic and Formal Languages
--- Grammars and Other Rewriting Systems (F.4.2): {\bf
Grammar types}; Information Systems --- Information
Storage and Retrieval --- Information Search and
Retrieval (H.3.3): {\bf Clustering}",
}
@InProceedings{Muralikrishna:1988:EDM,
author = "M. Muralikrishna and David J. DeWitt",
title = "Equi-depth multidimensional histograms",
crossref = "ACM:1988:PAC",
pages = "28--36",
year = "1988",
bibdate = "Wed Oct 25 08:47:40 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/50202/p28-muralikrishna/p28-muralikrishna.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/50202/p28-muralikrishna/",
acknowledgement = ack-nhfb,
}
@InProceedings{Paredaens:1988:PLU,
author = "Jan Paredaens and Dirk Van Gucht",
title = "Possibilities and limitations of using flat operators
in nested algebra expressions",
crossref = "ACM:1988:PPS",
pages = "29--38",
year = "1988",
bibdate = "Wed Oct 25 08:47:34 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/308386/p29-paredaens/p29-paredaens.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/308386/p29-paredaens/",
acknowledgement = ack-nhfb,
}
@InProceedings{Garza:1988:TMO,
author = "Jorge F. Garza and Won Kim",
title = "Transaction management in an object-oriented database
system",
crossref = "ACM:1988:PAC",
pages = "37--45",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/50202/p37-garza/p37-garza.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/50202/p37-garza/",
abstract = "In this paper, we describe transaction management in
ORION, an object-oriented database system. The
application environments for which ORION is intended
led us to implement the notions of sessions of
transactions, and hypothetical transactions
(transactions which always abort). The object-oriented
data model which ORION implements complicates locking
requirements. ORION supports a concurrency control
mechanism based on extensions to the current theory of
locking, and a transaction recovery mechanism based on
conventional logging.",
acknowledgement = ack-nhfb,
generalterms = "Design; Reliability; Security",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Concurrency}; Information Systems
--- Database Management --- Physical Design (H.2.2):
{\bf Recovery and restart}; Information Systems ---
Information Storage and Retrieval --- Systems and
Software (H.3.4): {\bf ORION}; Information Systems ---
Database Management --- Database Administration
(H.2.7): {\bf Logging and recovery}; Data --- Files
(E.5): {\bf Backup/recovery}",
}
@InProceedings{Hull:1988:EPD,
author = "Richard Hull and Jianwen Su",
title = "On the expressive power of database queries with
intermediate types",
crossref = "ACM:1988:PPS",
pages = "39--51",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/308386/p39-hull/p39-hull.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/308386/p39-hull/",
abstract = "The {\em set-height\/} of a complex object type is
defined to be its level of nesting of the set
construct. In a query of the complex object calculus
which maps a database {$D$} to an output type {\em T},
an {\em intermediate type\/} is a type which is used by
some variable of the query, but which is not present in
{$D$} or {\em T}. For each $k$, $i$ ? 0 we define CALC
{\em k,i\/} to be the family of calculus queries
mapping from and to types with set-height $k$ and using
intermediate types with set-height $i$ In particular,
CALC 0,0 is the relational calculus, and CALC 0,1 is
equivalent to the family of second-order (relational)
queries \par
Several results concerning these families of languages
are obtained. A primary focus is on the families CALC
0,i, which map relations to relations Upper bounds on
the complexity of these families are provided, and it
is shown that CALC 0,3 has at least the complexity of
exponential space. The CALC 0,i hierarchy does not
collapse, because for each {\em i}, CALC 0,i is
strictly less expressive than CALC 0,i+2. The union 0i
CALC 0,i is strictly less expressive than the family of
`computable' database queries. \par
The expressive power of queries from the complex object
calculus interpreted using a semantics based on the use
of arbitrarily large finite numbers of {\em invented
values\/} is studied. Under this semantics, the
expressive power of the relational calculus is not
increased, and the CALC 0,i hierarchy collapses at CALC
0,1. We also consider queries which use a bounded
number of invented values.",
acknowledgement = ack-nhfb,
}
@InProceedings{Jagannathan:1988:SDS,
author = "D. Jagannathan and B. L. Fritchman and R. L. Guck and
J. P. Thompson and D. M. Tolbert",
title = "{SIM}: a database system based on the semantic data
model",
crossref = "ACM:1988:PAC",
pages = "46--55",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/50202/p46-jagannathan/p46-jagannathan.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/50202/p46-jagannathan/",
abstract = "SIM is a fully featured, commercially available
database management system based on a semantic data
model similar to Hammer and McLeod's SDM SIM has two
primary modeling goals. The first is to narrow the gap
between a user's real-world perception of data and the
conceptual view imposed by the database system because
of modeling presuppositions or limitations. The second
goal is to allow, as much as possible, the semantics of
data to be defined in the schema and make the database
system responsible for enforcing its integrity SIM
provides a rich set of constructs for schema
definition, including those for specifying
generalization hierarchies modeled by directed acyclic
graphs, interobject relationships and integrity
constraints. It also features a novel, easy-to-use,
English-like DML. This paper describes the key modeling
features of SIM, the architecture of the system and its
implementation considerations.",
acknowledgement = ack-nhfb,
generalterms = "Design; Languages",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Data models}; Software ---
Programming Languages --- Language Classifications
(D.3.2): {\bf Nonprocedural languages**}; Computing
Methodologies --- Symbolic and Algebraic Manipulation
--- Languages and Systems (I.1.3): {\bf Nonprocedural
languages**}",
}
@InProceedings{Kifer:1988:AAD,
author = "Michael Kifer and Raghu Ramakrishnan and Avi
Silberschatz",
title = "An axiomatic approach to deciding query safety in
deductive databases",
crossref = "ACM:1988:PPS",
pages = "52--60",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/308386/p52-kifer/p52-kifer.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/308386/p52-kifer/",
abstract = "A database query is {\em safe\/} if its result
consists of a finite set of tuples. If a query is
expressed using a set of pure Horn Clauses, the problem
of determining query safety is, in general,
undecidable. In this paper we consider a slightly
stronger notion of safety, called {\em supersafety},
for Horn databases in which function symbols are
replaced by the abstraction of infinite relations with
{\em finiteness constraints\/} [Ramarkrishman et. al
87] We show that the supersafety problem is not only
decidable, but also {\em axiomatizable}, and the
axiomatization yields an effective decision procedure.
Although there are safe queries which are not
supersafe, we demonstrate that the latter represent
quite a large and nontrivial portion of the safe of all
safe queries",
acknowledgement = ack-nhfb,
}
@InProceedings{Caruso:1988:CMO,
author = "Michael Caruso and Edward Sciore",
title = "Contexts and metamessages in object-oriented database
programming language design",
crossref = "ACM:1988:PAC",
pages = "56--65",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/50202/p56-caruso/p56-caruso.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/50202/p56-caruso/",
abstract = "VISION is an object-oriented database system currently
used commercially to develop investment analysis and
other large statistical applications. Characteristic of
these applications, beside the standard issues of
structural and computational richness, is the need to
handle time, versions, and concurrency control in a
manner that does not produce combinatoric complexity in
object protocol. This paper describes the approach
taken by VISION in addressing these issues.",
acknowledgement = ack-nhfb,
generalterms = "Design; Languages",
subject = "Information Systems --- Database Management ---
Languages (H.2.3): {\bf Query languages}; Information
Systems --- Database Management --- Systems (H.2.4):
{\bf Concurrency}; Computer Applications ---
Administrative Data Processing (J.1): {\bf Financial}",
}
@InProceedings{Chomicki:1988:TDD,
author = "Jan Chomicki and Tomasz Imieli{\'n}ski",
title = "Temporal deductive databases and infinite objects",
crossref = "ACM:1988:PPS",
pages = "61--73",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/308386/p61-chomicki/p61-chomicki.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/308386/p61-chomicki/",
abstract = "We discuss deductive databases with one fixed
occurrence of a monadic function symbol({\em
successor\/}) per predicate Databases of this kind can
be used in a natural way to model simple patterns of
events repeated in time, and this is why we term them
{\em temporal}. Temporal deductive databases are also
interesting from a theoretical point of view, because
they give rise to {\em infinite\/} least fix-points and
{\em infinite\/} query answers. We study complexity
properties of finite query answers and define the
notion of {\em infinite objects\/} which makes some
infinite least fixpoints computable in finite time",
acknowledgement = ack-nhfb,
}
@InProceedings{Laurent:1988:PSI,
author = "D. Laurent and N. Spyratis",
title = "Partition semantics for incomplete information in
relational databases",
crossref = "ACM:1988:PAC",
pages = "66--73",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/50202/p66-laurent/p66-laurent.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/50202/p66-laurent/",
abstract = "We define partition semantics for databases with
incomplete information and we present an algorithm for
query processing in the presence of incomplete
information and functional dependencies. We show that
Lipski's model for databases with incomplete
information can be seen as a special case of our
model.",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Design; Languages; Theory",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Query processing}; Information
Systems --- Database Management --- Logical Design
(H.2.1): {\bf Data models}; Software --- Programming
Languages --- Formal Definitions and Theory (D.3.1):
{\bf Syntax}; Theory of Computation --- Mathematical
Logic and Formal Languages --- Formal Languages
(F.4.3): {\bf Classes defined by grammars or
automata}",
}
@InProceedings{Ullman:1988:COS,
author = "Jeffrey D. Ullman and Moshe Y. Vardi",
title = "The complexity of ordering subgoals",
crossref = "ACM:1988:PPS",
pages = "74--81",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/308386/p74-ullman/p74-ullman.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/308386/p74-ullman/",
abstract = "Selection of an appropriate order for the evaluation
of subgoals in a logical rule frequently is essential
for efficiency. We formulate the problem as one of
feasible subgoal orders and show that the question is
inherently exponential in time. The proof is by
reduction from linear-space alternating Turing machine
recognition, which appears to be far easier, in this
case, than the more obvious reduction from
exponential-time (ordinary) Turing machines",
acknowledgement = ack-nhfb,
}
@InProceedings{Yuan:1988:SCQ,
author = "Li Yan Yuan and Ding-An Chiang",
title = "A sound and complete query evaluation algorithm for
relational databases with null values",
crossref = "ACM:1988:PAC",
pages = "74--81",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/50202/p74-yuan/p74-yuan.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/50202/p74-yuan/",
abstract = "Reiter has proposed extended relational theory to
formulate relational databases with null values and
presented a query evaluation algorithm for such
databases. However, due to indefinite information
brought in by null values, Reiter's algorithm is sound
but not complete. In this paper, we first propose an
extended relation to represent indefinite information
in relational databases. Then, we define an extended
relational algebra for extended relations. Based on
Reiter's extended relational theory, and our extended
relations and the extended relational algebra, we
present a sound and complete query evaluation algorithm
for relational databases with null values",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Design; Languages; Theory",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Data models}; Information
Systems --- Database Management --- Systems (H.2.4):
{\bf Query processing}; Information Systems ---
Database Management --- Languages (H.2.3): {\bf Query
languages}",
}
@InProceedings{Morris:1988:AOS,
author = "Katherine A. Morris",
title = "An algorithm for ordering subgoals in {NAIL?}",
crossref = "ACM:1988:PPS",
pages = "82--88",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/308386/p82-morris/p82-morris.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/308386/p82-morris/",
abstract = "Rule-goal graphs are the central data structures used
in the NAIL system, a knowledge-base system being
developed at Stanford University They are constructed
while testing the applicability of {\em capture rules},
and traversed while generating ICODE to evaluate
queries. Generating rule-goal graphs may be reduced to
the problem of ordering subgoals. This paper gives an
algorithm for generating rule-goal graphs efficiently,
in time polynomial in the size of the rules if the
arity of recursive predicates is bounded. The graphs
generated may be suboptimal for some purposes, but the
algorithm will always find a rule-goal graph if one
exists. The algorithm has been implemented in Cprolog,
and is currently being used to generate rule-goal
graphs for the NAIL system",
acknowledgement = ack-nhfb,
}
@InProceedings{Malvestuto:1988:DPS,
author = "F. M. Malvestuto",
title = "The derivation problem of summary data",
crossref = "ACM:1988:PAC",
pages = "82--89",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/50202/p82-malvestuto/p82-malvestuto.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/50202/p82-malvestuto/",
abstract = "Given a statistical database consisting of two summary
tables based on a common but not identical
classification criterion (e.g., two geographical
partitionings of a country) there are additional
summary tables that are {\em derivable\/} in the sense
that they are uniquely (i.e., with no uncertainty)
determined by the tables given. Derivable tables
encompass not only, of course, ``less detailed'' tables
(that is, aggregated data) but also ``more detailed''
tables (that is, disaggregated data). Tables of the
second type can be explicitly constructed by using a
``procedure of data refinement'' based on the graph
representation of the correspondences between the
categories of the two classification systems given in
some cases, that is, when such a graph representation
meets the {\em acyclicity\/} condition, the underlying
database is ``equivalent'' to a single table (called
{\em representative table\/}) and then a necessary and
sufficient condition for a table to be derivable can be
stated.",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Theory",
subject = "Mathematics of Computing --- Discrete Mathematics ---
Graph Theory (G.2.2): {\bf Graph algorithms}; Computing
Methodologies --- Image Processing And Computer Vision
--- Segmentation (I.4.6): {\bf Region growing,
partitioning}; Information Systems --- Database
Management --- Systems (H.2.4): {\bf Query processing};
Data --- Data Structures (E.1): {\bf Tables**};
Mathematics of Computing --- Probability and Statistics
(G.3): {\bf Statistical computing}; Computing
Methodologies --- Artificial Intelligence --- Vision
and Scene Understanding (I.2.10): {\bf Modeling and
recovery of physical attributes}",
}
@InProceedings{Ramakrishnan:1988:OED,
author = "Raghu Ramakrishnan and Catriel Beeri and Ravi
Krishnamurthy",
title = "Optimizing existential datalog queries",
crossref = "ACM:1988:PPS",
pages = "89--102",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/308386/p89-ramakrishnan/p89-ramakrishnan.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/308386/p89-ramakrishnan/",
abstract = "The problem of pushing projections in recursive rules
has received little attention. The objective of this
paper is to motivate this problem and present some
(partial) solutions. We consider programs with
function-free rules, also known as {\em Datalog\/}
programs. After formally defining existential
subqueries, we present a syntactic criterion for
detecting them and then consider optimization in three
areas (1) We identify the existential subqueries and
make them explicit by rewriting the rules. This, in
effect, automatically captures some aspects of Prolog's
{\em cut\/} operator that are appropriate to the
bottom-up model of computation (2) We eliminate
argument positions in recursive rules by ``pushing
projections'' (3) We observe that ``pushing
projections'' in rules also has the effect of making
some rules (even recursive rules) redundant and try to
(identify and) discard them",
acknowledgement = ack-nhfb,
}
@InProceedings{Alexander:1988:PDC,
author = "W. Alexander and G. Copeland",
title = "Process and dataflow control in distributed
data-intensive systems",
crossref = "ACM:1988:PAC",
pages = "90--98",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/50202/p90-alexander/p90-alexander.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/50202/p90-alexander/",
abstract = "{\em In dataflow architectures, each dataflow
operation is typically executed on a single physical
node. We are concerned with distributed data-intensive
systems, in which each base (i.e., persistent) set of
data has been declustered over many physical nodes to
achieve load balancing. Because of large base set size,
each operation is executed where the base set resides,
and intermediate results are transferred between
physical nodes. In such systems, each dataflow
operation is typically executed on many physical nodes.
Furthermore, because computations are data-dependent,
we cannot know until run time which subset of the
physical nodes containing a particular base set will be
involved in a given dataflow operation. This
uncertainty creates several problems}. \par
{\em We examine the problems of efficient program
loading, dataflow--operation activation and
termination, control of data transfer among dataflow
operations, and transaction commit and abort in a
distributed data-intensive system. We show how these
problems are interrelated, and we present a unified set
of mechanisms for efficiently solving them. For some of
the problems, we present several solutions and compare
them quantitatively}.",
acknowledgement = ack-nhfb,
generalterms = "Design",
subject = "Computer Systems Organization --- Processor
Architectures --- Other Architecture Styles (C.1.3):
{\bf Data-flow architectures}; Information Systems ---
Database Management --- Systems (H.2.4): {\bf
Distributed databases}; Computer Systems Organization
--- Processor Architectures --- Multiple Data Stream
Architectures (Multiprocessors) (C.1.2): {\bf Parallel
processors**}; Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1): {\bf Packet-switching
networks}",
}
@InProceedings{Copeland:1988:DPB,
author = "George Copeland and William Alexander and Ellen
Boughter and Tom Keller",
title = "Data placement in {Bubba}",
crossref = "ACM:1988:PAC",
pages = "99--108",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/50202/p99-copeland/p99-copeland.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/50202/p99-copeland/",
abstract = "{\em This paper examines the problem of data placement
in Bubba, a highly-parallel system for data-intensive
applications being developed at MCC.
``Highly-parallel'' implies that load balancing is a
critical performance issue. ``Data-intensive'' means
data is so large that operations should be executed
where the data resides. As a result, data placement
becomes a critical performance issue}. \par
{\em In general, determining the optimal placement of
data across processing nodes for performance is a
difficult problem. We describe our heuristic approach
to solving the data placement problem in Bubba. We then
present experimental results using a specific workload
to provide insight into the problem. Several
researchers have argued the benefits of declustering (i
e, spreading each base relation over many nodes). We
show that as declustering is increased, load balancing
continues to improve. However, for transactions
involving complex joins, further declustering reduces
throughput because of communications, startup and
termination overhead}. \par
{\em We argue that data placement, especially
declustering, in a highly-parallel system must be
considered early in the design, so that mechanisms can
be included for supporting variable declustering, for
minimizing the most significant overheads associated
with large-scale declustering, and for gathering the
required statistics}.",
acknowledgement = ack-nhfb,
generalterms = "Design; Performance; Security",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Concurrency}; Computer Systems
Organization --- Processor Architectures --- Multiple
Data Stream Architectures (Multiprocessors) (C.1.2):
{\bf Parallel processors**}; Information Systems ---
Information Storage and Retrieval --- Information
Search and Retrieval (H.3.3): {\bf Clustering};
Information Systems --- Database Management ---
Database Administration (H.2.7): {\bf Logging and
recovery}; Computer Systems Organization ---
Performance of Systems (C.4): {\bf Reliability,
availability, and serviceability}",
}
@InProceedings{Imielinski:1988:ECL,
author = "Tomasz Imielinski and Shamim Naqvi",
title = "Explicit control of logic programs through rule
algebra",
crossref = "ACM:1988:PPS",
pages = "103--116",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/308386/p103-imielinski/p103-imielinski.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/308386/p103-imielinski/",
abstract = "{\em In this paper we argue with a basic premise in
logic programming research that the meaning of a
program can be inferred from its syntax alone. We show
that users may have a variety of intended models for
programs and that a single program may give different
intended models under different assumptions of
semantics. Our conclusion is that it is impossible to
infer the intended model from the syntax of the program
and no single semantics will capture all the intended
models. We propose as a solution an explicit
specification of control. Towards this purpose we
define a rule algebra. The user formulates a program as
an algebraic specification that directs the execution
towards the intended model. The interesting question at
that point is how to efficiently implement such
programs. We show a natural and easy transformation
such that it takes as input an algebraic specification
and produces as output a program belonging to a
subclass of locally stratified programs. Moreover,
there is a homomorphic correspondence between the
algebraic expressions and their translations}.",
acknowledgement = ack-nhfb,
}
@InProceedings{Patterson:1988:CRA,
author = "David A. Patterson and Garth Gibson and Randy H.
Katz",
title = "A case for redundant arrays of inexpensive disks
{(RAID)}",
crossref = "ACM:1988:PAC",
pages = "109--116",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/50202/p109-patterson/p109-patterson.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/50202/p109-patterson/",
abstract = "{\em Increasing performance of CPUs and memories will
be squandered if not matched by a similar performance
increase in I/O. While the capacity of Single Large
Expensive Disks (SLED) has grown rapidly, the
performance improvement of SLED has been modest.
Redundant Arrays of Inexpensive Disks (RAID), based on
the magnetic disk technology developed for personal
computers, offers an attractive alternative to SLED,
promising improvements of an order of magnitude in
performance, reliability, power consumption, and
scalability. This paper introduces five levels of
RAIDs, giving their relative cost/performance, and
compares RAID to an IBM 3380 and a Fujitsu Super
Eagle}.",
acknowledgement = ack-nhfb,
generalterms = "Design; Performance",
subject = "Hardware --- Input/Output and Data Communications ---
Performance Analysis and Design Aids** (B.4.4);
Hardware --- Memory Structures --- Performance Analysis
and Design Aids** (B.3.3); Hardware --- Memory
Structures --- Design Styles (B.3.2): {\bf Mass
storage}",
}
@InProceedings{Kumar:1988:SBT,
author = "Akhil Kumar and Michael Stonebraker",
title = "Semantics based transaction management techniques for
replicated data",
crossref = "ACM:1988:PAC",
pages = "117--125",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/50202/p117-kumar/p117-kumar.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/50202/p117-kumar/",
abstract = "Data is often replicated in distributed database
applications to improve availability and response time.
Conventional multi-copy algorithms deliver fast
response times and high availability for read-only
transactions while sacrificing these goals for updates.
In this paper, we propose a multi-copy algorithm that
works well in both retrieval and update environments by
exploiting special application semantics. By
subdividing transactions into various categories, and
utilizing a commutativity property, we demonstrate
cheaper techniques and show that they guarantee
correctness. A performance comparison between our
techniques and conventional ones quantifies the extent
of the savings.",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Design; Measurement; Performance;
Reliability",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Distributed databases}; Computer
Systems Organization --- Performance of Systems (C.4):
{\bf Reliability, availability, and serviceability};
Information Systems --- Database Management --- Systems
(H.2.4): {\bf Concurrency}; Computing Milieux ---
Management of Computing and Information Systems ---
Installation Management (K.6.2): {\bf Performance and
usage measurement}",
}
@InProceedings{Ramakrishna:1988:ABD,
author = "M. V. Ramakrishna and P. Mukhopadhyay",
title = "Analysis of bounded disorder file organization",
crossref = "ACM:1988:PPS",
pages = "117--125",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/308386/p117-ramakrishna/p117-ramakrishna.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/308386/p117-ramakrishna/",
abstract = "Recently Litwin and Lomet proposed the Bounded
Disorder (BD) file organization which uses a
combination of hashing and tree indexing Lomet provided
an approximate analysis with a mention of the
difficulty involved in exact modeling and analysis. The
performance analysis of the method involves solving a
classical sequential occupancy problem. We encountered
this problem in our attempt to obtain a general model
for single access and almost single access retrieval
methods developed in the recent years. In this paper,
we develop a probability model and present some
preliminary results of the exact analysis.",
acknowledgement = ack-nhfb,
}
@InProceedings{Abbadi:1988:GPC,
author = "Amr El Abbadi and Sam Toueg",
title = "The group paradigm for concurrency control",
crossref = "ACM:1988:PAC",
pages = "126--134",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/50202/p126-el_abbadi/p126-el_abbadi.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/50202/p126-el_abbadi/",
abstract = "We propose a paradigm for developing, describing and
proving the correctness of concurrency control
protocols for replicated databases in the presence of
failures or communication restrictions. Our approach is
to hierarchically divide the problem of achieving
one-copy serializability by introducing the notion of a
``group'' that is a higher level of abstraction than
transactions. Instead of dealing with the overall
problem of serializing all transactions, our paradigm
divides the problem into two simpler ones. (1) A {\em
local policy\/} for each group that ensures a total
order of all transactions in that group. (2) A {\em
global policy\/} that ensures a correct serialization
of all groups. We use the paradigm to demonstrate the
similarities between several concurrency control
protocols by comparing the way they achieve
correctness.",
acknowledgement = ack-nhfb,
generalterms = "Design; Performance; Reliability",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Concurrency}; Information Systems
--- Database Management --- Systems (H.2.4): {\bf
Distributed databases}; Computer Systems Organization
--- Performance of Systems (C.4): {\bf Reliability,
availability, and serviceability}",
}
@InProceedings{Srivastava:1988:AMM,
author = "Jaideep Srivastava and Doron Rotem",
title = "Analytical modeling of materialized view maintenance",
crossref = "ACM:1988:PPS",
pages = "126--134",
year = "1988",
bibdate = "Wed Oct 25 08:47:34 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/308386/p126-srivastava/p126-srivastava.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/308386/p126-srivastava/",
acknowledgement = ack-nhfb,
}
@InProceedings{Hadzilacos:1988:SGA,
author = "Thanasis Hadzilacos",
title = "Serialization graph algorithms for multiversion
concurrency control",
crossref = "ACM:1988:PPS",
pages = "135--141",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/308386/p135-hadzilacos/p135-hadzilacos.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/308386/p135-hadzilacos/",
abstract = "{\em We propose a new algorithmic framework for
database concurrency control using multiple versions of
data items and a serialization graph of the
transactions as a synchronization technique, which
generalizes all concurrency control methods known so
far. This class of algorithms, called MVSGA for Multi
Version Serialization Graph set of Algorithms, works by
monitoring the acyclicity of the serialization graph
which has nodes corresponding to transactions and arcs
corresponding to read-from and other transaction
positioning decisions made by the scheduler. For each
of the major known schedulers we give examples of MVSGA
schedulers that cover them}. \par
{\em We propose a criterion for optimality among MVSGA
schedulers Choice of versions to read from and relative
positioning of transactions in the serialization graph
should be done in a way that leaves the largest
flexibility possible for future choices. This
flexibility is measured as the number of pairs of nodes
in the serialization graph that remain incomparable.
Unfortunately, enforcing this criterion turns out to be
NP-complete, so we describe an MVSGA scheduler based on
a heuristic that approximates the optimal}.",
acknowledgement = ack-nhfb,
}
@InProceedings{Breitbart:1988:MUI,
author = "Yuri Breitbart and Avi Silberschatz",
title = "Multidatabase update issues",
crossref = "ACM:1988:PAC",
pages = "135--142",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/50202/p135-breitbart/p135-breitbart.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/50202/p135-breitbart/",
abstract = "A formal model of data updates in a multidatabase
environment is developed, and a theory of concurrency
control in such an environment is presented. We
formulate a correctness condition for the concurrency
control mechanism and propose a protocol that allows
concurrent execution of a set of global transactions in
presence of local ones. This protocol ensures the
consistency of the multidatabase and deadlock freedom.
We use the developed theory to prove the protocol's
correctness and discuss complexity issues of
implementing the proposed protocol.",
acknowledgement = ack-nhfb,
generalterms = "Design; Performance; Reliability",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Concurrency}; Information Systems
--- Database Management --- Systems (H.2.4): {\bf
Distributed databases}; Information Systems ---
Database Management --- Database Administration
(H.2.7): {\bf Logging and recovery}",
}
@InProceedings{Kelter:1988:QPD,
author = "Udo Kelter",
title = "The queue protocol: a deadlock-free, homogeneous,
non-two-phase locking protocol",
crossref = "ACM:1988:PPS",
pages = "142--151",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/308386/p142-kelter/p142-kelter.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/308386/p142-kelter/",
abstract = "The M-pitfall protocol (MPP) is the most general
homogeneous non-two-phase locking protocol which
supports shared and exclusive locks. It has two major
disadvantages: it is not deadlock-free and it has the
paradoxical property that concurrency is often reduced
if shared locks are used instead of exclusive locks.
This paper presents a new protocol, the Queue Protocol
(QP), which removes these deficiencies. Although the QP
can be regarded an enhancement of the MPP, pitfalls are
no more used in the QP; thus, the QP has the further
advantage that processing overhead due to pitfalls is
avoided.",
acknowledgement = ack-nhfb,
}
@InProceedings{Abiteboul:1988:DFD,
author = "Serge Abiteboul and Richard Hull",
title = "Data functions, datalog and negation",
crossref = "ACM:1988:PAC",
pages = "143--153",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/50202/p143-abiteboul/p143-abiteboul.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/50202/p143-abiteboul/",
abstract = "Datalog is extended to incorporate single-valued
``data functions'', which correspond to attributes in
semantic models, and which may be base (user-specified)
or derived (computed). Both conventional and stratified
datalog are considered. Under the extension, a datalog
program may not be consistent, because a derived
function symbol may evaluate to something which is not
a function. Consistency is shown to be undecidable, and
is decidable in a number of restricted cases. A
syntactic restriction, {\em panwise consistency}, is
shown to guarantee consistency. The framework developed
here can also be used to incorporate single-valued data
functions into the Complex Object Language (COL), which
supports deductive capabilities, complex database
objects, and set-valued data functions. \par
There is a natural correspondence between the extended
datalog introduced here, and the usual datalog with
functional dependencies. For families and of
dependencies and a family of datalog programs , the -
{\em implication problem\/} for asks, given sets F and
G and a program P in , whether for all inputs I, I @@@@
F implies P(I) @@@@ G. The FD-FD implication problem is
undecidable for datalog, and the TGD-EGD implication
problem is decidable for stratified datalog. Also, the
{\o}-MVD problem is undecidable (and hence also the
MVD-preservation problem).",
acknowledgement = ack-nhfb,
generalterms = "Design; Languages; Measurement; Performance",
subject = "Computing Methodologies --- Artificial Intelligence
--- Natural Language Processing (I.2.7): {\bf DATALOG};
Information Systems --- Database Management --- Systems
(H.2.4): {\bf Query processing}; Information Systems
--- Database Management --- Languages (H.2.3): {\bf
DAPLEX}; Information Systems --- Database Management
--- Languages (H.2.3): {\bf Query languages}",
}
@InProceedings{Banciihon:1988:OOD,
author = "Fran{\c{c}}ois Banciihon",
title = "Object-oriented database systems",
crossref = "ACM:1988:PPS",
pages = "152--162",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/308386/p152-banciihon/p152-banciihon.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/308386/p152-banciihon/",
abstract = "This paper describes my vision of the current state of
object-oriented database research. I first briefly
define this field by its objectives, and relate it to
other database subfields. I describe what I consider to
be the main characteristics of an object oriented
system, i.e., those which are important to integrate in
a database system: encapsulation, object identity,
classes or types, inheritance, overriding and late
binding. I point out the differences between an object
oriented system and an object oriented database system.
I also point out the advantages and drawbacks of an
object oriented database system with respect to a
relational system. Finally, I list some research
issues.",
acknowledgement = ack-nhfb,
}
@InProceedings{Krishnamurthy:1988:FTS,
author = "Ravi Krishnamurthy and Raghu Ramakrishnan and Oded
Shmueli",
title = "A framework for testing safety and effective
computability of extended datalog",
crossref = "ACM:1988:PAC",
pages = "154--163",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/50202/p154-krishnamurthy/p154-krishnamurthy.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/50202/p154-krishnamurthy/",
abstract = "This paper presents a methodology for testing a
general logic program containing function symbols and
built-in predicates for {\em safety\/} and {\em
effective computability}. Safety is the property that
the set of answers for a given query is finite. A
related issues is whether the evaluation strategy can
effectively compute all answers and terminate. We
consider these problems under the assumption that
queries are evaluated using a bottom-up fixpoint
computation. We also approximate the use of function
symbols by considering Datalog programs with infinite
base relations over which {\em finiteness
constraints\/} and {\em monotonicity constraints\/} are
considered. One of the main results of this paper is a
recursive algorithm, {\em check_clique}, to test the
safety and effective computability of predicates in
arbitrarily complex cliques. This algorithm takes
certain procedures as parameters, and its applicability
can be strengthened by making these procedures more
sophisticated. We specify the properties required of
these procedures precisely, and present a formal proof
of correctness for algorithm {\em check_clique}. This
work provides a framework for testing safety and
effective computability of recursive programs, and is
based on a clique by clique analysis. The results
reported here form the basis of the safety testing for
the LDL language, being implemented at MCC.",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Design; Languages",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Query processing}; Computing
Methodologies --- Artificial Intelligence --- Natural
Language Processing (I.2.7): {\bf DATALOG}; Theory of
Computation --- Mathematical Logic and Formal Languages
--- Mathematical Logic (F.4.1): {\bf Logic and
constraint programming}; Computing Methodologies ---
Artificial Intelligence --- Deduction and Theorem
Proving (I.2.3): {\bf Logic programming}",
}
@InProceedings{Chan:1988:IRD,
author = "Edward P. F. Chan and Hector J. Hernandez",
title = "Independence-reducible database schemes",
crossref = "ACM:1988:PPS",
pages = "163--173",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/308386/p163-chan/p163-chan.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/308386/p163-chan/",
abstract = "A class of cover embedding database schemes, called
independence-reducible, is proposed and is proven to be
bounded and algebraic-maintainable, and therefore is
highly desirable with respect to query answering and
constraint enforcement. This class of schemes is shown
to properly contain a superset of all previously known
classes of cover embedding BCNF database schemes which
are bounded (and constant-time-maintainable). An
efficient algorithm is found which recognizes exactly
this class of database schemes. Independence-reducible
database schemes properly contain a class of
constant-time-maintainable database schemes and a
condition which characterizes this class of schemes is
found, this condition can be tested efficiently.
Throughout, it is assumed that a cover of the
functional dependencies is embedded in the database
scheme in the form of key dependencies.",
acknowledgement = ack-nhfb,
}
@InProceedings{Chen:1988:IMR,
author = "Qiming Chen and Georges Gardarin",
title = "An implementation model for reasoning with complex
objects",
crossref = "ACM:1988:PAC",
pages = "164--172",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/50202/p164-chen/p164-chen.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/50202/p164-chen/",
abstract = "In this paper, we first propose a natural syntactical
extension of DATALOG called NESTED_DATALOG for dealing
with complex objects represented as nested predicates.
Then, we introduce the token object model which is a
simple extension of the relational model with tokens to
represent complex objects and support referential
information sharing. An implementation model of a
NESTED_DATALOG program is defined by mapping it to the
token object model which remains a straightforward
extension of classical logical databases. Through this
work, we can accommodate two basic requirements. The
availability of a rule language for reasoning with
complex objects, and the mechanism for mapping a
complex object rule program to a relational DBMS
offering a pure DATALOG rule language. In summary, the
main contributions of the paper are the definition of a
rule language for complex objects and the development
of a technique to compile this complex object rule
language to classical DATALOG.",
acknowledgement = ack-nhfb,
generalterms = "Languages; Theory; Verification",
subject = "Computing Methodologies --- Artificial Intelligence
--- Natural Language Processing (I.2.7): {\bf DATALOG};
Computing Methodologies --- Artificial Intelligence ---
Deduction and Theorem Proving (I.2.3): {\bf Logic
programming}; Theory of Computation --- Mathematical
Logic and Formal Languages --- Mathematical Logic
(F.4.1): {\bf Logic and constraint programming};
Mathematics of Computing --- Discrete Mathematics ---
Graph Theory (G.2.2): {\bf Trees}",
}
@InProceedings{Kim:1988:OFD,
author = "Myoung Ho Kim and Sakti Pramanik",
title = "Optimal file distribution for partial match
retrieval",
crossref = "ACM:1988:PAC",
pages = "173--182",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/50202/p173-kim/p173-kim.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/50202/p173-kim/",
abstract = "In this paper we present data distribution methods for
parallel processing environment. The primary objective
is to process partial match retrieval type queries for
parallel devices. \par
The main contribution of this paper is the development
of a new approach called FX (Fieldwise eXclusive)
distribution for maximizing data access concurrency. An
algebraic property of exclusive-or operation, and field
transformation techniques are fundamental to this data
distribution techniques. We have shown through theorems
and corollaries that this FX distribution approach
performs better than other methods proposed earlier. We
have also shown, by computing probability of optimal
distribution and query response time, that FX
distribution gives better performance than others over
a large class of partial match queries. This approach
presents a new basis in which optimal data distribution
for more general type of queries can be formulated.",
acknowledgement = ack-nhfb,
generalterms = "Design; Performance",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Concurrency}; Computer Systems
Organization --- Performance of Systems (C.4): {\bf
Performance attributes}; Computer Systems Organization
--- Processor Architectures --- Multiple Data Stream
Architectures (Multiprocessors) (C.1.2): {\bf Parallel
processors**}; Information Systems --- Database
Management --- Systems (H.2.4): {\bf Distributed
databases}; Information Systems --- Database Management
--- Systems (H.2.4): {\bf Query processing}",
}
@InProceedings{Hegner:1988:DRS,
author = "Stephen J. Hegner",
title = "Decomposition of relational schemata into components
defined by both projection and restriction",
crossref = "ACM:1988:PPS",
pages = "174--183",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/308386/p174-hegner/p174-hegner.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/308386/p174-hegner/",
abstract = "A generalized approach to the decomposition of
relational schemata is developed in which the component
views may be defined using both restriction and
projection operators, thus admitting both horizontal
and vertical decompositions. The realization of
restrictions is enabled through the use of a Boolean
algebra of types, while true independence of
projections is modelled by permitting null values in
the base schema. The flavor of the approach is
algebraic, with the collection of all candidate views
of a decomposition modelled within a lattice-like
framework, and the actual decompositions arising as
Boolean subalgebraic. Central to the framework is the
notion of {\em sidimensional join dependency}, which
generalizes the classical notion of join dependency by
allowing the components of the join to be selected
horizontally as well as vertically. Several properties
of such dependencies are presented, including a
generalization of many of the classical results known
to be equivalent to schema acyclicity. Finally, a
characterization of the nature of dependencies which
participate in decompositions is presented. It is shown
that there are two major types, the bidimensional join
dependencies, which are tuple generating and allow
tuple removal by implicit encoding of knowledge, and
splitting dependencies, which simply partition the
database into two components.",
acknowledgement = ack-nhfb,
}
@InProceedings{Hutflesz:1988:TGF,
author = "Andreas Hutflesz and Hans-Werner Six and Peter
Widmayer",
title = "Twin grid files: space optimizing access schemes",
crossref = "ACM:1988:PAC",
pages = "183--190",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/50202/p183-hutflesz/p183-hutflesz.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/50202/p183-hutflesz/",
abstract = "Storage access schemes for points, supporting spatial
searching, usually suffer from an undesirably low
storage space utilization. We show how a given set of
points can be distributed among two grid files in such
a way that storage space utilization is optimal. The
optimal twin grid file can be built practically as fast
as a standard grid file, i.e., the storage space
optimality is obtained at almost no extra cost. We
compare the performances of the standard grid file, the
optimal static twin grid file, and an efficient dynamic
twin grid file, where insertions and deletions trigger
the redistribution of points among the two grid files.
Twin grid files utilize storage space at roughly 90%,
as compared with the 69% of the standard grid file.
Typical range queries - the most important spatial
search operations - can be answered in twin grid files
at least as fast as in the standard grid file.",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Design",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Local and Wide-Area
Networks (C.2.5): {\bf Access schemes}; Information
Systems --- Information Storage and Retrieval ---
Information Search and Retrieval (H.3.3): {\bf Search
process}; Information Systems --- Information Storage
and Retrieval --- Information Storage (H.3.2): {\bf
File organization}; Data --- Files (E.5): {\bf
Optimization**}; Data --- Files (E.5): {\bf
Organization/structure}",
}
@InProceedings{Batory:1988:CDS,
author = "D. S. Batory",
title = "Concepts for a database system compiler",
crossref = "ACM:1988:PPS",
pages = "184--192",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/308386/p184-batory/p184-batory.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/308386/p184-batory/",
abstract = "We propose a very simple formalism based on
parameterized types and a rule-based algebra to explain
the storage structures and algorithms of database
management systems. Implementations of DBMSs are
expressed as equations If all functions referenced in
the equations have been implemented the software for a
DBMS can be synthesized in minutes at little cost, in
contrast to current methods where man-years of effort
and hundreds of thousands of dollars are required. Our
research aims to develop a DBMS counterpart to today's
compiler-complier technologies",
acknowledgement = ack-nhfb,
}
@InProceedings{Ramakrishna:1988:HPA,
author = "M. V. Ramakrishna",
title = "Hashing practice: analysis of hashing and universal
hashing",
crossref = "ACM:1988:PAC",
pages = "191--199",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/50202/p191-ramakrishna/p191-ramakrishna.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/50202/p191-ramakrishna/",
abstract = "Much of the literature on hashing deals with overflow
handling (collision resolution) techniques and its
analysis. What does all the analytical results mean in
practice and how can they be achieved with practical
files? This paper considers the problem of achieving
analytical performance of hashing techniques in
practice with reference to successful search lengths,
unsuccessful search lengths and the expected worst case
performance (expected length of the longest probe
sequence). There has been no previous attempt to
explicitly link the analytical results to performance
of real life files. Also, the previously reported
experimental results deal mostly with successful search
lengths. We show why the well known division method
performs ``well'' under a specific model of selecting
the test file. We formulate and justify an hypothesis
that by choosing functions from a particular class of
hashing functions, the analytical performance can be
obtained in practice on real life files. Experimental
results presented strongly support our hypothesis.
Several interesting problems arising are mentioned in
conclusion.",
acknowledgement = ack-nhfb,
generalterms = "Design; Theory",
subject = "Information Systems --- Information Storage and
Retrieval --- Information Storage (H.3.2): {\bf File
organization}; Data --- Data Storage Representations
(E.2): {\bf Hash-table representations}",
}
@InProceedings{Hadzilacos:1988:TSO,
author = "Thanasis Hadzilacos and Vassos Hadzilacos",
title = "Transaction synchronisation in object bases",
crossref = "ACM:1988:PPS",
pages = "193--200",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/308386/p193-hadzilacos/p193-hadzilacos.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/308386/p193-hadzilacos/",
abstract = "In this paper we investigate the problem of
synchronising transactions in an object base. An object
base is a collection of objects, much the way a
database is a collection of data. An object, for our
purposes, consists of a collection of variables (whose
values at any point in time comprise the state of that
object) and a set of operations, called methods, that
are the only means of accessing (sensing or modifying)
the object's variables \par
There is a certain sense in which a traditional
database is an object base. It consists of ``objects''
(records, tuples or what have you) each of which has a
state that can be accessed only through the operations
Read and Write. The main difference is that in an
object base, each object supplies its own methods and
these are arbitrary. In particular, a method for a
certain object may call methods of other objects to
carry out its task. In contrast to certain models in
which objects correspond to ``levels of abstraction'',
our model is completely general in this respect for
example, it is permissible for a method of object {$A$}
to call a method of object {$B$} which, in turn, may
call some other method of object {$A$} again \par
One implication of this difference between data and
object bases is that in the latter the assumption,
commonly made in the former, that the operations which
manipulate the state of the objects are short enough to
be implemented serially (one at a time) is no longer
valid. A related implication is that in object bases we
are faced with the necessity of dealing with nested
transactions, since the invocation of one method may
result in further method invocations \par
Another, less fundamental, difference between data and
object bases is that, in addition to being of uniform
type, the ``objects'' of a database are usually assumed
to be of uniform size as well. In an object base one
can imagine objects of widely differing sizes. A clock
and the New York City telephone directory could be
objects differing in size by orders of magnitude, yet
co-existing in the same object base \par
In spite of these differences it is possible to
approach concurrency control in an object base in the
following way. Each object is viewed as a database
item. Further, each method invocation is treated as a
group of Read or Write operations on those data items
that were accessed as a result of that method
invocation. With these analogies, any conventional
database concurrency control method (two-phase locking,
timestamp ordering, certification, and the whole lot)
can be employed to synchronise concurrent transactions
in the object base. This approach has the virtue of
simplicity and may be well-suited to certain
environments. It is, for example, the approach taken in
the GemStone project and product (cf Maier and Stein
[1987], Purdy {\em et al\/} [1987]) \par
We are interested in exploring approaches to
concurrency control in object bases which take into
account their special features and differences from
databases. The hope is that this will lead to more
efficient techniques. More specifically, we would like
to consider mechanisms that \par
Take into account the nested nature of transactions
\par
Allow methods accessing an object to execute
concurrently (but correctly) This seems especially
important as multiprocessors become available, since
forcing serial access to an object's methods restricts
parallelism (bear in mind that each method could be a
lengthy procedure) \par
Are modular, in that each object is responsible for
synchronizing the invocations of its own methods as it
sees fit \par
The first two of these points have been considered by
others as well. For example, Argus (cf Liskov and
Scheifler [1983]) uses a synchronisation algorithm
which is an adaptation of strict two-phase locking in a
nested transaction environment. In addition, Argus
allows multiple concurrent invo",
acknowledgement = ack-nhfb,
}
@InProceedings{Ioannidis:1988:DMD,
author = "Yannis E. Ioannidis and Miron Livny",
title = "Data modeling in {DELAB}",
crossref = "ACM:1988:PAC",
pages = "200--200",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/50202/p200-ioannidis/p200-ioannidis.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/50202/p200-ioannidis/",
abstract = "As the size and complexity of processing and
manufacturing systems increases, the need for Database
Management Systems (DBMS) that meet the special needs
of studies that experiment with such systems becomes
more current. System analysts who study the performance
of modern processing systems have to manipulate large
amounts of data in order to profile the behavior of the
system. They have to identify the relationship between
the properties of a compound system and a wide spectrum
of performance metrics. In a recent study in which we
have analyzed a set of distributed concurrency control
algorithms, we performed more than 1400 simulation
experiments. Each experiment was characterized by more
than 6000 input parameters and generated more than 400
output values. It is thus clear that powerful means for
defining the structure and properties of complex
systems are needed, as well as efficient tools to
retrieve the data accumulated in the course of the
study. We are currently engaged in an effort to develop
and implement the DE {\em LAB simulation laboratory\/}
that aims to provide such means and tools for
simulation studies. \par
The goal of the first phase of this effort was to
design and implement a simulation language. It ended in
1986 when the DE {\em NET\/} (Discrete Event NETwork)
simulation language became operational. The language is
based on the concept of Discrete Event System
Specifications (DEVS). It views the simulator as a
collection of self contained objects that communicate
via Discrete Event Connectors that provide a unified
synchronization protocol In the past two years the
language has been used in a number of real life
studies. It was used to simulate distributed processing
environments, communication protocols, and production
lines Several tools have been developed around the
language. All tools adhere to the same modeling
methodology and thus create a cohesive simulation
environment. \par
In the second phase of the DE {\em LAB\/} project we
have been addressing the data management problem DE
{\em NET\/} has been interfaced to a special purpose
relational DBMS that can store descriptions of
simulation runs and provides access to the stored data
Based on our experience with thus DBMS, we have reached
the conclusion that system analysts need to be provided
with a view of the data that differs from the way the
DE {\em NET\/} program views the data, and thus decided
to develop a data model that meets their needs. The
M@@@@SE data model, which is the result of this effort,
has an {\em object oriented\/} flavor. It was developed
with the guidance of potential users and was tested on
a number of real life simulation studies. \par
Although the conception of M@@@@SE was motivated by the
specific needs of a simulation laboratory, we believe
that it addresses the representational needs of many
other environments We have decided to support the
notion of an {\em object}. Every object is assigned a
unique identifier. Depending on their properties
(attributes), objects can simultaneously belong to
several {\em classes}, inheriting properties from all
of them. Among these classes, one is characterized as
the {\em primary\/} class of the object. The notion of
a primary class helps achieving a ``conceptual'' as
well as a physical clustering among similar objects.
Collections of objects are supported as regular objects
in M@@@@SE in the form of sets, multisets (bags), and
arrays. The {\em extent\/} of a class, i.e., the
objects that are known members of the class, is
explicitly stored in the database. Every M@@@@SE
database schema has a straightforward directed graph
representation. Each node represents a class of objects
and is labeled by the class name. Relationships between
the classes in the schema are captured by the arcs of
the graph. Similarly to most object-oriented data
models, M@@@@SE has two major types of arcs {\em
component arcs\/} and {\em inheritance arcs}\ldots{}
\par
",
acknowledgement = ack-nhfb,
generalterms = "Design; Languages; Performance",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Data models}; Computing
Methodologies --- Simulation and Modeling ---
Simulation Languages (I.6.2); Theory of Computation ---
Mathematical Logic and Formal Languages --- Formal
Languages (F.4.3): {\bf Classes defined by grammars or
automata}; Information Systems --- Database Management
--- Languages (H.2.3): {\bf Query languages}",
}
@InProceedings{Ono:1988:DMT,
author = "Kiyoshi Ono and Mikio Aoyama and Hiroshi Fujimoto",
title = "Data management of telecommunications networks",
crossref = "ACM:1988:PAC",
pages = "201--201",
year = "1988",
bibdate = "Wed Oct 25 08:47:40 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/50202/p201-ono/p201-ono.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/50202/p201-ono/",
acknowledgement = ack-nhfb,
}
@InProceedings{Herlihy:1988:HCC,
author = "Maurice P. Herlihy and William E. Weihl",
title = "Hybrid concurrency control for abstract data types",
crossref = "ACM:1988:PPS",
pages = "201--210",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/308386/p201-herlihy/p201-herlihy.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/308386/p201-herlihy/",
abstract = "We define a new locking protocol that permits more
concurrency than existing commutativity-based
protocols. The protocol uses timestamps generated when
transactions commit to provide more information about
the serialization order of transactions, and hence to
weaken the constraints on conflicts. In addition, the
protocol permits operations to be both partial and
non-deterministic, and it permits results of operations
to be used in choosing locks. The protocol exploits
type-specific properties of objects, necessary and
sufficient constraints on lock conflicts are defined
directly from a data type specification. We give a
complete formal description of the protocol,
encompassing both concurrency control and recovery, and
prove that the protocol satisfies {\em hybrid
atomicity}, a local atomicity property that combines
aspects of static and dynamic atomic protocols. We also
show that the protocol is optimal in the sense that no
hybrid atomic locking scheme can permit more
concurrency.",
acknowledgement = ack-nhfb,
}
@InProceedings{Alho:1988:DDM,
author = "Kari Alho and Hannu Peltonen and Martti
M{\"a}ntyl{\"a} and Rejio Sulonen",
title = "A design data manager",
crossref = "ACM:1988:PAC",
pages = "202--202",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/50202/p202-alho/p202-alho.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/50202/p202-alho/",
abstract = "{\em HutBase\/} is a visual design data manager that
can be used to store and manipulate data objects
created and processed by a variety of design
applications. In particular, HutBase allows the user to
manipulate the data and start applications, and
provides a access mechanism for the applications.
\par
HutBase consists of three software layers. The lowest
layer, the {\em Object Management System\/} (OMS), is
based on the Entity-Relationship model and includes
those basic operations related to the storage and
access of design data objects that are common to all
applications. The database is divided into {\em
workspaces}, which are collections of OMS {\em
objects\/} and {\em relationships\/} organized
according to an application-dependent schema and
forming a significant whole (e.g., a design project)
from the user's point of view Workspace is also the
unit for locking and access control. \par
An object is a collection of {\em attributes}. Each
attribute has a name and value. The name is a string
and the value is an arbitrary sequence of bytes. The
value of an attribute can be of any length, from a
single integer to an external representation of a
complicated geometric model. A relationship is a named
directed connection between two objects. Relationships
have attributes like objects. \par
The OMS library contains functions for creating,
opening and removing workspaces, objects, relationships
and attributes. All operations are carried out within
{\em transactions}. The functions do not change the
permanent data on the disk until the user calls the
{\em save_changes\/} function, which saves the current
state of all workspaces opened in a given transaction.
\par
The next layer is a prototype data model built on top
of OMS, which stores the objects in each workspace as a
hierarchical tree by means of relationships. The leaves
of the hierarchy are called {\em representations\/} and
contain the actual data manipulated by the
applications. Each representation is associated with a
{\em representation type}, which in turn are linked to
the application programs, or {\em tools}. The
representation types and tools are stored as objects in
a separate workspace. \par
The top level contains a user interface and a
procedural application interface. The user interface
shows the available representation types, tools, and
contents of one or more workspaces in iconic form. A
representation can be opened by selecting its icon on
the screen. The tool corresponding to the type of the
representation is then started with a handle to the
representation as argument. The interface also allows
the user to create, remove and copy objects. \par
The tool programs run as subprocesses of the HutBase
process. Tools access the data base by remote procedure
calls that send data base requests from the tool
process to the HutBase process. The tools can also
create relationships between representations and
navigate in the workspace by following the relationship
links. \par
We are currently working on a interpreted definition
language that can be used to describe the structure of
a workspace. The definition language will be based on
an object-oriented notation, where object and relation
types form a class hierarchy. Class descriptions
include (possibly inherited) methods for dealing with
the various HutBase operations. With the contemplated
description facility, new object and relationship types
can be defined by declaring new subclasses of the
existing ones.",
acknowledgement = ack-nhfb,
generalterms = "Design; Languages",
subject = "Computing Methodologies --- Computer Graphics ---
Methodology and Techniques (I.3.6): {\bf Interaction
techniques}; Information Systems --- Database
Management --- Logical Design (H.2.1): {\bf Data
models}",
}
@InProceedings{Naeymi-Rad:1988:RDD,
author = "Frank Naeymi-Rad and Lowell Carmony and David Trace
and Christine Georgakis and Max Harry Weil",
title = "A relational database design in support of standard
medical terminology in multi-domain knowledge bases",
crossref = "ACM:1988:PAC",
pages = "203--203",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/50202/p203-naeymi-rad/p203-naeymi-rad.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/50202/p203-naeymi-rad/",
abstract = "Relational database techniques have been used to
create knowledge bases for a medical diagnostic
consultant system. Known as MEDAS (Medical Emergency
Decision Assistance System), this expert system, using
disorder patterns consisting of features such as
symptoms and laboratory results, is able to diagnose
multiple disorders. Database technology has been used
in MEDAS to develop knowledge engineering tools, called
the TOOL BOX, which permit domain experts to create
knowledge without the assistance of a knowledge
engineer. \par
In the process of knowledge development with the TOOL
BOX a standardization of terms was needed. This led us
to design a Feature Dictionary and a grammar to support
a standardized format for features. A common dictionary
of features will allow us to merge knowledge bases,
translate between multi-domain bases, and compare
competing expert systems. In addition, standard
terminology will assist communication across domains
\par
The Feature Dictionary has the following attributes
{\em Long\/} forms of the feature name (White Blood
Count) and {\em short\/} forms (WBC) as well as a three
line description of the feature. The {\em type}, binary
(Abdominal Pain), continuous-valued (WBC), or derived
(pulse pressure = systolic - diastolic) is also kept
for each feature \par
For value features the appropriate {\em unit\/} (cc,
kg, etc.) as well as {\em range\/} limits are stored so
that these can be used as a form of quality control on
input. The {\em permanence\/} (Y/N) of each feature is
kept so it is possible to automatically include
permanent features in future encounters. In addition,
for each feature three separate `` {\em cost\/} ''
parameters are kept. {\em Risk\/} measures the danger
to the patient from no risk such as taking a blood
pressure to highly invasive proceedings such as a liver
biopsy. {\em Time\/} measures whether results can be
expected in minutes, hours, or days. {\em Money\/}
measures the actual cost to the patient FD-Equivalents
stores the synonyms and antonyms of each feature. These
are used to translate between knowledge bases using
different terminology. \par
Features were first classified in terms of a Problem
Oriented Medical Record. We have added an anatomical
reclassification in terms of body systems. Experts will
be able to add new kinds of feature classifications.
\par
MEDAS, a multi-membership Bayesian model, needs binary
representations for its inference. These Binary
Features are created by the expert physician in the
given disorder patterns. For example, ``WBC 50,000'',
or ``Age 2 Female Hematocrit 42'' are binary features
that might appear in a disorder pattern. Laboratory
results often lead to a multiplicity of binary features
(such as ``WBC 3,000'', or 3,000 WBC 10,000, etc.). Our
design allows the user to enter the value of such a
feature and have the system set of all the
corresponding binary features. This intelligent user
interface is controlled by a grammar that allows us to
parse the binary features and generate rules for them.
\par
The knowledge base for a particular problem domain such
as OB/GYN is organized as a collection of disorder
patterns. Each of these is represented as a list of
binary features and associated probabilities. The
domain knowledge base contains only the features
relevant to that domain. \par
Experience with the Feature Dictionary has convinced us
that there are many advantages in using a DBMS to store
the knowledge base for an expert system. The TOOL BOX,
originally in ACCENT-R, was rewritten in dBase III for
the PC. The knowledge bases created on the PC were then
ported to the mainframe. As the number of domains
supported by MEDAS grew, it became evident that we
needed a DBMS that could function in both environments
so we are in the process of converting to ORACLE.",
acknowledgement = ack-nhfb,
generalterms = "Design; Human Factors",
subject = "Computer Applications --- Life and Medical Sciences
(J.3): {\bf Medical information systems}; Computing
Methodologies --- Artificial Intelligence ---
Applications and Expert Systems (I.2.1); Information
Systems --- Information Storage and Retrieval ---
Content Analysis and Indexing (H.3.1): {\bf
Dictionaries}; Information Systems --- Database
Management --- Systems (H.2.4)",
}
@InProceedings{Hernandez:1988:CCT,
author = "H{\'e}ctor J. Hern{\'a}ndez and Edward P. F. Chan",
title = "A characterization of constant-time maintainability
for {BCNF} database schemes",
crossref = "ACM:1988:PAC",
pages = "209--217",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/50202/p209-hernandez/p209-hernandez.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/50202/p209-hernandez/",
abstract = "The {\em maintenance problem\/} (for database states)
of a database scheme R with respect to a set of
functional dependencies {$F$} is the following decision
problem. Let r be a consistent state of R with respect
to {$F$} and assume we insert a tuple $t$ into {\em r
p\/} [epsilon] r. Is $r$ ? $t$ a consistent state of R
with respect to {$F$}? R is said to be {\em
constant-time-maintainable\/} with respect to {$F$} if
there is an algorithm that solves the maintenance
problem of R with respect to {$F$} in time independent
of the state size. \par
A characterization of constant-time-maintainability for
the class of BCNF database schemes is given. An
efficient algorithm that tests this characterization is
shown, as well as an algorithm for solving the
maintenance problem in time independent of the state
size. It is also proven that constant-time-maintainable
BCNF database schemes are bounded. In particular, it is
shown that total projections of the representative
instance can be computed via unions of projections of
extension joins. Throughout we assume that database
schemes are cover embedding and BCNF, and that
functional dependencies are given in the form of key
dependencies.",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Design; Theory",
subject = "Software --- Operating Systems --- File Systems
Management (D.4.3): {\bf Maintenance**}; Theory of
Computation --- Mathematical Logic and Formal Languages
--- Formal Languages (F.4.3): {\bf Classes defined by
grammars or automata}; Information Systems --- Database
Management --- Logical Design (H.2.1): {\bf Normal
forms}; Information Systems --- Information Storage and
Retrieval --- Information Search and Retrieval (H.3.3):
{\bf Query formulation}",
}
@InProceedings{Lanin:1988:CSM,
author = "Vladimir Lanin and Dennis Shasha",
title = "Concurrent set manipulation without locking",
crossref = "ACM:1988:PPS",
pages = "211--220",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/308386/p211-lanin/p211-lanin.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/308386/p211-lanin/",
abstract = "Set manipulation consists of the actions {\em insert,
delete}, and {\em member\/} on keys. We propose a
concurrent set manipulation algorithm that uses no
locking at all and requires no aborts, relying instead
on atomic read-modify-write operations on single (data)
locations. The algorithm satisfies order-preserving
serializability through conditions that are strictly
looser than existing algorithms",
acknowledgement = ack-nhfb,
}
@InProceedings{Leuchner:1988:PTA,
author = "J. Leuchner and L. Miller and G. Slutzki",
title = "A polynomial time algorithm for testing implications
of a join dependency and embodied functional
dependencies",
crossref = "ACM:1988:PAC",
pages = "218--224",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/50202/p218-leuchner/p218-leuchner.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/50202/p218-leuchner/",
abstract = "The problem of deciding whether a full join dependency
(JD) [ {$R$} ] and a set of functional dependencies
(FDs) {$F$} imply an embedded join dependency (EJD) [
{$S$} ] is known to be NP-complete. We show that the
problem can be decided in polynomial time if {$S$}
{$R$} and {$F$} is embedded in {\em R}. Our work uses
arguments based on an extension of complete
intersection graphs rather than tableaus. This approach
has facilitated our results and should prove useful for
future research.",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Design; Languages; Theory",
subject = "Theory of Computation --- Analysis of Algorithms and
Problem Complexity --- Numerical Algorithms and
Problems (F.2.1): {\bf Computations on polynomials};
Theory of Computation --- Mathematical Logic and Formal
Languages --- Formal Languages (F.4.3): {\bf Classes
defined by grammars or automata}; Information Systems
--- Database Management --- Logical Design (H.2.1):
{\bf Schema and subschema}",
}
@InProceedings{VanGelder:1988:USW,
author = "Allen {Van Gelder} and Kenneth Ross and John S.
Schlipf",
title = "Unfounded sets and well-founded semantics for general
logic programs",
crossref = "ACM:1988:PPS",
pages = "221--230",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/308386/p221-van_gelder/p221-van_gelder.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/308386/p221-van_gelder/",
abstract = "A general logic program (abbreviated to ``program''
hereafter) is a set of rules that have both positive
and negative subgoals. It is common to view a deductive
database as a general logic program consisting of rules
(IDB) sitting above elementary relations (EDB, facts).
It is desirable to associate one Herbrand model with a
program and think of that model as the ``meaning of the
program,'' or its ``declarative semantics.'' Ideally,
queries directed to the program would be answered in
accordance with this model. We introduce {\em unfounded
sets\/} and {\em well-founded partial models}, and
define the well-founded semantics of a program to be
its well-founded partial model. If the well-founded
partial model is in fact a model, we call it the {\em
well-founded\/} model, and say the program is
``well-behaved''. We show that the class of
well-behaved programs properly includes previously
studied classes of ``stratified'' and ``locally
stratified'' programs Gelfand and Lifschits have
proposed a definition of ``unique stable model'' for
general logic programs. We show that a program has a
unique stable model if it has a well-founded model, in
which case they are the same. We discuss why the
converse is not true.",
acknowledgement = ack-nhfb,
}
@InProceedings{Gyssens:1988:PAR,
author = "Marc Gyssens and Dirk van Gucht",
title = "The powerset algebra as a result of adding programming
constructs to the nested relational algebra",
crossref = "ACM:1988:PAC",
pages = "225--232",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/50202/p225-gyssens/p225-gyssens.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/50202/p225-gyssens/",
abstract = "In this paper, we discuss augmentations of the nested
relational algebra with programming constructs, such as
while-loops and for-loops. We show that the algebras
obtained in this way are equivalent to a slight
extension of the powerset algebra, thus emphasizing
both the strength and the naturalness of the powerset
algebra as a tool to manipulate nested relations, and,
at the same time, indicating more direct ways to
implement this algebra.",
acknowledgement = ack-nhfb,
generalterms = "Languages; Theory",
subject = "Theory of Computation --- Logics and Meanings of
Programs --- Studies of Program Constructs (F.3.3);
Information Systems --- Database Management ---
Languages (H.2.3): {\bf Query languages}",
}
@InProceedings{Kolaitis:1988:WNF,
author = "Phokion G. Kolaitis and Christos H. Papadimitriou",
title = "Why not negation by fixpoint?",
crossref = "ACM:1988:PPS",
pages = "231--239",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/308386/p231-kolaitis/p231-kolaitis.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/308386/p231-kolaitis/",
abstract = "{\em There is a fixpoint semantics for DATALOG
programs with negation that is a natural generalization
of the standard semantics for DATALOG programs without
negation. We show that, unfortunately, several
compelling complexity-theoretic obstacles rule out its
efficient implementation. As an alternative, we propose
Inflationary DATALOG, an efficiently implementable
semantics for negation, based on inflationary
fixpoints\/}",
acknowledgement = ack-nhfb,
}
@InProceedings{Mazumdar:1988:RTB,
author = "Subhasish Mazumdar and David Stemple and Tim Sheard",
title = "Resolving the tension between integrity and security
using a theorem prover",
crossref = "ACM:1988:PAC",
pages = "233--242",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/50202/p233-mazumdar/p233-mazumdar.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/50202/p233-mazumdar/",
abstract = "Some information in databases and knowledge bases
often needs to be protected from disclosure to certain
users. Traditional solutions involving multi-level
mechanisms are threatened by the user's ability to
infer higher level information from the semantics of
the application. We concentrate on the revelation of
secrets through a user running transactions in the
presence of database integrity constraints. We develop
a method of specifying secrets formally that not only
exposes a useful structure and equivalence among
secrets but also allows a theorem prover to detect
certain security lapses during transaction compilation
time.",
acknowledgement = ack-nhfb,
generalterms = "Design; Security; Verification",
subject = "Information Systems --- Database Management ---
General (H.2.0): {\bf Security, integrity, and
protection**}; Information Systems --- Database
Management --- Systems (H.2.4): {\bf Transaction
processing}; Information Systems --- Database
Management --- Logical Design (H.2.1): {\bf Data
models}",
}
@InProceedings{Abiteboul:1988:PDD,
author = "Serge Abiteboul and Victor Vianu",
title = "Procedural and declarative database update languages",
crossref = "ACM:1988:PPS",
pages = "240--250",
year = "1988",
bibdate = "Wed Oct 25 08:47:34 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/308386/p240-abiteboul/p240-abiteboul.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/308386/p240-abiteboul/",
acknowledgement = ack-nhfb,
}
@InProceedings{Qian:1988:TLD,
author = "Xiaolei Qian and Richard Waldinger",
title = "A transaction logic for database specification",
crossref = "ACM:1988:PAC",
pages = "243--250",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/50202/p243-qian/p243-qian.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/50202/p243-qian/",
abstract = "We introduce a logical formalism for the specification
of the dynamic behavior of databases. The evolution of
databases is characterized by both the dynamic
integrity constraints which describe the properties of
state transitions and the transactions whose executions
lead to state transitions. Our formalism is based on a
variant of first-order situational logic in which the
states of computations are explicit objects. Integrity
constraints and transactions are uniformly specifiable
as expressions in our language. We also point out the
application of the formalism to the verification and
synthesis of transactions.",
acknowledgement = ack-nhfb,
generalterms = "Design; Verification",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Transaction processing};
Information Systems --- Database Management --- Logical
Design (H.2.1): {\bf Data models}; Computing
Methodologies --- Artificial Intelligence --- Deduction
and Theorem Proving (I.2.3)",
}
@InProceedings{Gadia:1988:GMR,
author = "Shashi K. Gadia and Chuen-Sing Yeung",
title = "A generalized model for a relational temporal
database",
crossref = "ACM:1988:PAC",
pages = "251--259",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/50202/p251-gadia/p251-gadia.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/50202/p251-gadia/",
abstract = "We propose a generalized relational model for a
temporal database which allows time stamping with
respect to a Boolean algebra of multidimensional time
stamps. The interplay between the various temporal
dimensions is symmetric. As an application, a two
dimensional model which allows objects with real world
and transaction oriented time stamps is discussed. The
two dimensional model can be used to query the past
states of the database. It can also be used to give a
precise classification of the errors and updates in a
database, and is a promising approach for querying
these errors and updates.",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Design",
subject = "Computing Methodologies --- Simulation and Modeling
--- Applications (I.6.3); Information Systems ---
Database Management --- Systems (H.2.4): {\bf Query
processing}; Information Systems --- Database
Management --- Logical Design (H.2.1): {\bf Data
models}",
}
@InProceedings{Naqvi:1988:DUL,
author = "Shamim Naqvi and Ravi Krishnamurthy",
title = "Database updates in logic programming",
crossref = "ACM:1988:PPS",
pages = "251--262",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/308386/p251-naqvi/p251-naqvi.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/308386/p251-naqvi/",
abstract = "{\em The need for control in logic programs is now
being recognized. This is particularly evident when one
focuses on allowing updates in logic programs. In this
paper we propose a language DatalogA which is an
extension of Datalog with updates to base relations. We
define some procedural constructs to allow update
programs to be written in an easy manner. The (W,p)
scheme of Dynamic Logic fits nicely into the semantics
of DatalogA programs in which W is taken to be the set
of all possible states of the program and p is the
accessibility relation between states. We give
declarative semantics and equivalent constructed model
semantics for DatalogA programs. We show that in the
absence of updates our semantics reduce to the
classical semantics of Datalog. Finally, we show some
examples of non-stratified programs expressed in
DatalogA}.",
acknowledgement = ack-nhfb,
}
@InProceedings{Peinl:1988:HCS,
author = "Peter Peinl and Andreas Reuter and Harald Sammer",
title = "High contention in a stock trading database: a case
study",
crossref = "ACM:1988:PAC",
pages = "260--268",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/50202/p260-peinl/p260-peinl.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/50202/p260-peinl/",
abstract = "Though in general, current database systems adequately
support application development and operation for
online transaction processing (OLTP), increasing
complexity of applications and throughput requirements
reveal a number of weaknesses with respect to the data
model and implementation techniques used. By presenting
the experiences gained from a case study of a large,
high volume stock trading system, representative for a
broad class of OLTP applications, it is shown, that
this particularly holds for dealing with high frequency
access to a small number of data elements (hot spots).
As a result, we propose extended data types and several
novel mechanisms, which are easy to use and highly
increase the expressional power of transaction oriented
programming, that effectively cope with hot spots.
Moreover, their usefulness and their ability to
increased parallelism is exemplified by the stock
trading application.",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Design; Management",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Data models}; Computer
Applications --- Administrative Data Processing (J.1):
{\bf Financial}; Information Systems --- Database
Management --- Systems (H.2.4): {\bf Transaction
processing}; Computing Methodologies --- Simulation and
Modeling --- Applications (I.6.3); Computing Milieux
--- Management of Computing and Information Systems ---
Project and People Management (K.6.1): {\bf Systems
analysis and design}; Computing Methodologies ---
Simulation and Modeling --- Model Validation and
Analysis (I.6.4)",
}
@InProceedings{Muralikrishna:1988:OMR,
author = "M. Muralikrishna and David J. DeWitt",
title = "Optimization of multiple-relation multiple-disjunct
queries",
crossref = "ACM:1988:PPS",
pages = "263--275",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/308386/p263-muralikrishna/p263-muralikrishna.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/308386/p263-muralikrishna/",
abstract = "In this paper we discuss the optimization of
multiple-relation multiple-disjunct queries in a
relational database system. Since optimization
techniques for conjunctive (single disjunct) queries in
relational databases are well known [Smith75, Wong76,
Selinger79, Yao79, Youssefi79], the natural way to
evaluate a multiple-disjunct query was to execute each
disjunct independently [Bernstein81, Kerschberg82]
However, evaluating each disjunct independently may be
very inefficient. In this paper, we develop methods
that merge two or more disjuncts to form a term. The
advantage of merging disjuncts to form terms lies in
the fact that each term can be evaluated with a single
scan of each relation that is present in the term. In
addition, the number of times a join is performed will
also be reduced when two or more disjuncts are merged.
The criteria for merging a set of disjuncts will be
presented. As we will see, the number of times each
relation in the query is scanned will be equal to the
number of terms. Thus, minimizing the number of terms
will minimize the number of scans for each relation. We
will formulate the problem of minimizing the number of
scans as one of covering a merge graph by a minimum
number of complete merge graphs which are a restricted
class of Cartesian product graphs. In general, the
problem of minimizing the number of scans is
NP-complete. We present polynomial time algorithms for
special classes of merge graphs. We also present a
heuristic for general merge graphs. \par
Throughout this paper, we will assume that no relations
have any indices on them and that we are only concerned
with reducing the number of scans for each relation
present in the query. What about relations that have
indices on them? It turns out that our performance
metric of reducing the number of scans is beneficial
even in the case that there are indices. In
[Muralikrishna88] we demonstrate that when optimizing
single-relation multiple-disjunct queries, the cost
(measured in terms of disk accesses) may be reduced if
all the disjuncts are optimized together rather than
individually. Thus, our algorithm for minimizing the
number of terms is also very beneficial in cases where
indices exist",
acknowledgement = ack-nhfb,
}
@InProceedings{Haynie:1988:DLD,
author = "M. Haynie",
title = "A {DBMS} for large design automation databases",
crossref = "ACM:1988:PAC",
pages = "269--276",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/50202/p269-haynie/p269-haynie.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/50202/p269-haynie/",
abstract = "Large capacity Design Automation (CAD/CAM) database
management systems require special capabilities over
and above what commercial DBMSs or small
workstation-based CAD/CAM systems provide. This paper
describes one such system, Tacoma, used at Amdahl
Corporation for the storage and retrieval of LSI and
VLSI mainframe computer designs Tacoma is based on the
relational model with additional object-oriented
database features.",
acknowledgement = ack-nhfb,
generalterms = "Design; Languages",
subject = "Information Systems --- Database Management ---
Languages (H.2.3): {\bf SQL}; Information Systems ---
Database Management --- Systems (H.2.4): {\bf
Distributed databases}; Computer Applications ---
Computer-Aided Engineering (J.6): {\bf Computer-aided
design (CAD)}; Computer Systems Organization ---
Computer System Implementation --- VLSI Systems
(C.5.4); Computer Systems Organization --- Computer
System Implementation --- Large and Medium
(``Mainframe'') Computers (C.5.1); Software ---
Operating Systems --- General (D.4.0): {\bf UNIX};
Information Systems --- Database Management --- Logical
Design (H.2.1): {\bf Data models}",
}
@InProceedings{Hou:1988:SER,
author = "Wen-Chi Hou and Gultekin Ozsoyoglu and Baldeo K.
Taneja",
title = "Statistical estimators for relational algebra
expressions",
crossref = "ACM:1988:PPS",
pages = "276--287",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/308386/p276-hou/p276-hou.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/308386/p276-hou/",
abstract = "Present database systems process all the data related
to a query before giving out responses. As a result,
the size of the data to be processed becomes excessive
for real-time/time-constrained environments. A new
methodology is needed to cut down systematically the
time to process the data involved in processing the
query. To this end, we propose to use data samples and
construct an approximate synthetic response to a given
query. \par
In this paper, we consider only COUNT(E) type queries,
where E is an arbitrary relational algebra expression.
We make no assumptions about the distribution of
attribute values and ordering of tuples in the input
relations, and propose consistent and unbiased
estimators for arbitrary COUNT(E) type queries. We
design a sampling plan based on the cluster sampling
method to improve the utilization of sampled data and
to reduce the cost of sampling. We also evaluate the
performance of the proposed estimators.",
acknowledgement = ack-nhfb,
}
@InProceedings{Bell:1988:SDM,
author = "Jean L. Bell",
title = "A specialized data management system for parallel
execution of particle physics codes",
crossref = "ACM:1988:PAC",
pages = "277--285",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/50202/p277-bell/p277-bell.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/50202/p277-bell/",
abstract = "The specialized data management system described in
this paper was motivated by the need for much more
efficient data management than a standard database
management system could provide for particle physics
codes in shared memory multiprocessor environments. The
special characteristics of data and access patterns in
particle physics codes need to be fully exploited in
order to effect efficient data management. The data
management system allows parameteric user control over
system features not usually available to them,
especially details of physical design and retrieval
such as horizontal clustering, asynchronous I/O, and
automatic distribution across processors. In the past,
each physics code has constructed the equivalent of a
primitive data management system from scratch. The
system described in this paper is a generic system that
can now be interfaced with a variety of physics
codes.",
acknowledgement = ack-nhfb,
generalterms = "Design",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Concurrency}; Computer
Applications --- Physical Sciences and Engineering
(J.2): {\bf Physics}; Computing Methodologies ---
Simulation and Modeling --- Applications (I.6.3);
Computer Systems Organization --- Processor
Architectures --- Multiple Data Stream Architectures
(Multiprocessors) (C.1.2): {\bf Parallel processors**};
Information Systems --- Database Management ---
Physical Design (H.2.2): {\bf Access methods}",
}
@InProceedings{Christodoulakis:1988:PAF,
author = "Stavros Christodoulakis and Daniel Alexander Ford",
title = "Performance analysis and fundamental performance
tradeoffs for {CLV} optical disks",
crossref = "ACM:1988:PAC",
pages = "286--294",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/50202/p286-christodoulakis/p286-christodoulakis.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/50202/p286-christodoulakis/",
abstract = "CLV type optical disks is a very large and important
class of optical disk technology, of which CD-ROM disks
form a subclass. \par
In this paper we present a model of retrieval from CLV
optical disks. We then provide exact and approximate
results analyzing the retrieval performance from them.
Our analysis takes into account disks with and without
a mirror in the read mechanism, small objects
completely placed within block boundaries, placement
that allows block boundary crossing, as well as very
large objects (such as documents) placed within files.
\par
In the second part of the paper we describe some
fundamental implications of physical data base design
for data bases stored on CLV optical disks. We show
that very significant performance gains may be realized
by appropriate design.",
acknowledgement = ack-nhfb,
generalterms = "Design; Performance",
subject = "Computing Methodologies --- Simulation and Modeling
--- Applications (I.6.3); Computing Methodologies ---
Simulation and Modeling --- Model Validation and
Analysis (I.6.4); Information Systems --- Information
Storage and Retrieval --- Information Search and
Retrieval (H.3.3): {\bf Retrieval models}; Information
Systems --- Database Management --- Physical Design
(H.2.2); Hardware --- Memory Structures --- Design
Styles (B.3.2): {\bf Mass storage}; Information Systems
--- Database Management --- Systems (H.2.4): {\bf
Transaction processing}; Information Systems ---
Information Storage and Retrieval --- Information
Search and Retrieval (H.3.3): {\bf Search process}",
}
@InProceedings{Huang:1988:SSM,
author = "Bing-Chao Huang and Michael A. Langston",
title = "Stable set and multiset operations in optimal time and
space",
crossref = "ACM:1988:PPS",
pages = "288--293",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/308386/p288-huang/p288-huang.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/308386/p288-huang/",
abstract = "The focus of this paper is on demonstrating the
existence of methods for stably performing set and
multiset operations on sorted files of data in both
optimal time and optimal extra space. It is already
known that stable merging and stable duplicate-key
extraction permit such methods. The major new results
reported herein are these \par
an asymptotically optimal time and space algorithm is
devised for stably selecting matched records from a
sorted file, \par
this selection strategy is employed, along with other
algorithmic tools, to prove that all of the elementary
binary set operations can be stably performed in
optimal time and space on sorted files, and \par
after generalizing these operations to multisets in a
natural way for file processing, it is proved that each
can be stably performed in optimal time and space on
sorted files \par
",
acknowledgement = ack-nhfb,
}
@InProceedings{Yu:1988:MTS,
author = "Lin Yu and Daniel J. Rosenkrantz",
title = "Minimizing time-space cost for database version
control",
crossref = "ACM:1988:PPS",
pages = "294--301",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/308386/p294-yu/p294-yu.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/308386/p294-yu/",
abstract = "We introduce the concept of a version graph to model
the problem of minimising the space and version
regeneration cost for database version control. We show
that, in general, this problem and several of its
variations are NP-complete. Motivated by the practical
importance of these problems, we develop several
heuristics and obtain worst-case guarantees on their
performance. We also present linear time algorithms for
problems characterized by special classes of version
graphs.",
acknowledgement = ack-nhfb,
}
@InProceedings{Hanson:1988:PQA,
author = "Eric N. Hanson",
title = "Processing queries aganist database procedures: a
performance analysis",
crossref = "ACM:1988:PAC",
pages = "295--302",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/50202/p295-hanson/p295-hanson.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/50202/p295-hanson/",
abstract = "A database procedure is a collection of queries stored
in the database. Several methods are possible for
processing queries that retrieve the value returned by
a database procedure. The conventional algorithm is to
execute the queries in a procedure whenever it is
accessed. A second strategy requires caching the
previous value returned by the database procedure. If
the cached value is valid at the time of a query, the
value is returned immediately. If the cached value has
been invalidated by an update, the value is recomputed,
stored back into the cache, and then returned. A third
strategy uses a differential view maintenance algorithm
to maintain an up-to-date copy of the value returned by
the procedure. This paper compares the performance of
these three alternatives. The results show that which
algorithm is preferred depends heavily on the database
environment, particularly, the frequency of updates and
the size of objects retrieved by database procedures.",
acknowledgement = ack-nhfb,
generalterms = "Algorithms; Economics; Languages; Management;
Performance",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Query processing}; Information
Systems --- Information Storage and Retrieval ---
Information Search and Retrieval (H.3.3): {\bf Query
formulation}; Information Systems --- Database
Management --- Languages (H.2.3): {\bf Query
languages}; Computing Methodologies --- Simulation and
Modeling --- Applications (I.6.3); Computing Milieux
--- Management of Computing and Information Systems ---
Installation Management (K.6.2): {\bf Pricing and
resource allocation}",
}
@InProceedings{Reiter:1988:WSD,
author = "Raymond Reiter",
title = "What should a database know?",
crossref = "ACM:1988:PPS",
pages = "302--304",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/pods/308386/p302-reiter/p302-reiter.pdf;
http://www.acm.org/pubs/citations/proceedings/pods/308386/p302-reiter/",
abstract = "The by now conventional perspective on databases,
especially deductive databases, is that they are sets
of first order sentences. As such, they can be said to
be claims about the truths of some {\em external\/}
world, the database is a symbolic representation of
that world. \par
While agreeing with this account of what a database is,
I disagree with how, both in theory and practice, a
database is {\em used}, specifically how it is queried
and how its integrity is enforced. \par
Virtually all approaches to database query evaluation
treat queries as first order formulas, usually with
free variables whose bindings resulting from the
evaluation phase define the answers to the query. The
sole exception to this is the work of Levesque (1981,
1984), who argues that queries should be formulas in an
epistemic modal logic. Queries, in other words, should
be permitted to address aspects of the external world
as represented in the database, as well as aspects of
the database itself i.e., aspects of what the database
{\em knows}. To take a simple example, suppose {\em DB
= p y q\/} \par
Query $p$ (i.e., is $p$ true in the external world?)
\par
Answer unknown \par
Query {\em Kp\/} (i e. do you know whether $p$ is true
in the external world?) \par
Answer no \par
Levesque's modal logic (called KFOPCE) distinguishes
between known and unknown individuals in the database
and thus accounts for ``regular'' database values as
well as null values. For example, if {\em KB\/} is
\par
{Teach (John, Math100), ($x$) Teach ({\em x}, CS100),
Teach (Mary, Psych100) y Teach (Sue, Psych100)},
\par
then \par
Query ($x$) {$K$} Teach (John, $x$) i.e., is there a
known course which John teaches? \par
Answer yes-Math100 \par
Query ($x$) {$K$} Teach ({\em x}, CS100) i e is there a
known teacher for CS100? \par
Answer No \par
Query ($x$) Teach ({\em x}, Psych100) i.e., does anyone
teach Psych 100? \par
Answer: Yes - Mary or Sue \par
Query ($x$) {$K$} Teach ({\em x}, Psych100) i.e., is
there a known teacher of Psych100? \par
Answer No \par
Levesque (1981, 1984) provides a semantics for his
language KFOPCE FOPCE, is the first order language
KFOPCE without the modal K Levesque proposes that a
database is best viewed as a set of FOPCE sentences,
and that it be queried by sentences of KFOPCE. He
further provides a (noneffective) way of answering
database queries. \par
Recently I have considered the concept of a static
integrity constraint in the context of Levesque's
KFOPCE (Reiter 1988). The conventional view of
integrity constraints is that, like the database
itself, they too are first order formulas (e.g., Lloyd
Topor (1985), Nicolas Yazdanian (1978), Reiter (1984)).
There are two definitions in the literature of a
deductive database {\em KB\/} satisfying an integrity
constraint {\em IC}. \par
{\em Definition 1\/} Consistency (e.g., Kowalski
(1978), Sadri and Kowalski (1987)) {\em KB satisfies IC
if f KB + IC is satisfiable\/} \par
{\em Definition 2\/} Entailment (e.g., Lloyd and Topor
(1985), Reiter (1984)) {\em KB satisfies IC if f KB
@@@@ IC\/} \par
Alas, neither definition seems correct. Consider a
constraint requiring that employees have social
security numbers (V $x$) {\em emp\/} ($x$ ) ($y$) {\em
ss\#\/} ({\em x y\/}) (1) \par
1 Suppose {\em KB\/} = {emp (Mary)} Then {\em KB +
IC\/} is satisfiable. But intuitively, we want the
constraint to require {\em KB\/} to contain a ss\#
ent",
acknowledgement = ack-nhfb,
}
@InProceedings{Jarke:1988:MKA,
author = "Matthias Jarke and Thomas Rose",
title = "Managing knowledge about information system
evolution",
crossref = "ACM:1988:PAC",
pages = "303--311",
year = "1988",
bibdate = "Wed Oct 25 12:40:13 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
URL = "http://www.acm.org/pubs/articles/proceedings/mod/50202/p303-jarke/p303-jarke.pdf;
http://www.acm.org/pubs/citations/proceedings/mod/50202/p303-jarke/",
abstract = "This paper describes the design and initial prototype