Valid HTML 4.0! Valid CSS!
%%% -*-BibTeX-*-
%%% ====================================================================
%%%  BibTeX-file{
%%%     author          = "Nelson H. F. Beebe",
%%%     version         = "2.27",
%%%     date            = "09 November 2023",
%%%     time            = "09:31:48 MST",
%%%     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             = "https://www.math.utah.edu/~beebe",
%%%     checksum        = "11582 53291 252158 2769242",
%%%     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 World Wide Web sites
%%%                        for these conference proceedings at
%%%
%%%                            http://www.sigmod.org/publications/literature
%%%                            http://www.sigmod.org/sigmod-pods-conferences
%%%                            http://www.sigmod.org/<YEAR>/
%%%
%%%                        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.27, the year coverage looked
%%%                        like this:
%%%
%%%                             1975 (   1)    1988 (  90)    2001 ( 115)
%%%                             1976 (   2)    1989 (  83)    2002 ( 110)
%%%                             1977 (   1)    1990 (  85)    2003 ( 117)
%%%                             1978 (   1)    1991 (  79)    2004 ( 119)
%%%                             1979 (   1)    1992 ( 131)    2005 (  36)
%%%                             1980 (   1)    1993 ( 119)    2006 (  40)
%%%                             1981 (   0)    1994 ( 111)    2007 (  32)
%%%                             1982 (   4)    1995 ( 135)    2008 (  32)
%%%                             1983 (   3)    1996 (  95)    2009 (  31)
%%%                             1984 (   6)    1997 (  96)    2010 (  32)
%%%                             1985 (  57)    1998 ( 122)    2011 (  29)
%%%                             1986 (  32)    1999 ( 122)    2012 (  31)
%%%                             1987 (  85)    2000 (  85)    2013 (  29)
%%%
%%%                             Article:          1
%%%                             InProceedings: 2238
%%%                             Proceedings:     61
%%%
%%%                             Total entries: 2300
%%%
%%%                        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|https://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;
                 https://www.math.utah.edu/pub/tex/bib/pods.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;
                 https://www.math.utah.edu/pub/tex/bib/pods.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;
                 https://www.math.utah.edu/pub/tex/bib/pods.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;
                 https://www.math.utah.edu/pub/tex/bib/pods.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;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
}

@InProceedings{Pitelli:1984:BAU,
  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;
                 https://www.math.utah.edu/pub/tex/bib/pods.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;
                 https://www.math.utah.edu/pub/tex/bib/pods.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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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;
                 https://www.math.utah.edu/pub/tex/bib/pods.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;
                 https://www.math.utah.edu/pub/tex/bib/pods.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;
                 https://www.math.utah.edu/pub/tex/bib/pods.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;
                 https://www.math.utah.edu/pub/tex/bib/pods.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;
                 https://www.math.utah.edu/pub/tex/bib/pods.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;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
}

@InProceedings{Garcia-Molina: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;
                 https://www.math.utah.edu/pub/tex/bib/pods.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;
                 https://www.math.utah.edu/pub/tex/bib/pods.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;
                 https://www.math.utah.edu/pub/tex/bib/pods.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;
                 https://www.math.utah.edu/pub/tex/bib/pods.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;
                 https://www.math.utah.edu/pub/tex/bib/pods.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;
                 https://www.math.utah.edu/pub/tex/bib/pods.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;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
}

@InProceedings{Skeen:1985:EFT,
  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;
                 https://www.math.utah.edu/pub/tex/bib/pods.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;
                 https://www.math.utah.edu/pub/tex/bib/pods.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;
                 https://www.math.utah.edu/pub/tex/bib/pods.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;
                 https://www.math.utah.edu/pub/tex/bib/pods.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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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: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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 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{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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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{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 =      "Wed Oct 25 08:47:35 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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: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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 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{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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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{ElAbbadi: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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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;
                 https://www.math.utah.edu/pub/tex/bib/pods.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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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: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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 http://www.acm.org:80/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",
  keywords =     "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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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: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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 http://www.acm.org:80/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",
  keywords =     "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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 http://www.acm.org:80/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",
  keywords =     "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{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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 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{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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/contents/proceedings/series/sigmod_pods/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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{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 =      "Wed Oct 25 08:47:34 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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}",
}

@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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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: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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 http://www.acm.org:80/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",
  keywords =     "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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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;
                 https://www.math.utah.edu/pub/tex/bib/pods.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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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{ElAbbadi: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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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-compiler 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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  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
                 implementation of a knowledge base management system
                 (KBMS) for controlling database software development
                 and maintenance. The KBMS employs a version of the
                 conceptual modelling language CML to represent
                 knowledge about the tool-aided development process of
                 an information system from requirements analysis to
                 conceptual design to implementation, together with the
                 relationship of these system components to the
                 real-world environment in which the information system
                 is intended to function. A decision-centered
                 documentation methodology facilitates communication
                 across time and among multiple developers (and possibly
                 users), thus enabling improved maintenance support.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Documentation; Management",
  subject =      "Computing Methodologies --- Artificial Intelligence
                 --- Knowledge Representation Formalisms and Methods
                 (I.2.4): {\bf Representations (procedural and
                 rule-based)}; Computing Milieux --- Management of
                 Computing and Information Systems --- Software
                 Management (K.6.3): {\bf Software maintenance};
                 Software --- Software Engineering --- Design**
                 (D.2.10): {\bf Representation**}; Computing Milieux ---
                 Management of Computing and Information Systems ---
                 Software Management (K.6.3): {\bf Software
                 development}; Computing Milieux --- Management of
                 Computing and Information Systems --- Project and
                 People Management (K.6.1): {\bf Systems development}",
}

@InProceedings{Buneman:1988:SCO,
  author =       "Peter Buneman and Susan Davidson and Aaron Watters",
  title =        "A semantics for complex objects and approximate
                 queries",
  crossref =     "ACM:1988:PPS",
  pages =        "305--314",
  year =         "1988",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/308386/p305-buneman/p305-buneman.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/308386/p305-buneman/",
  abstract =     "A new definition of complex objects is introduced
                 which provides a denotation for incomplete tuples as
                 well as partially described sets. Set values are
                 ``sandwiched'' between ``complete'' and ``consistent''
                 descriptions (representing the Smyth and Hoare
                 powerdomains respectively), allowing the maximal values
                 to be arbitrary subsets of maximal elements in the
                 domain of the set. We also examine the use of rules in
                 defining queries over such objects.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Naughton:1988:CSR,
  author =       "Jeffrey F. Naughton",
  title =        "Compiling separable recursions",
  crossref =     "ACM:1988:PAC",
  pages =        "312--319",
  year =         "1988",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/50202/p312-naughton/p312-naughton.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/50202/p312-naughton/",
  abstract =     "In this paper we consider evaluating queries on
                 relations defined by a combination of recursive rules.
                 We first define separable recursions. We then give a
                 specialized algorithm for evaluating selections on
                 separable recursions. Like the Generalized Magic Sets
                 and Generalized Counting algorithms, thus algorithm
                 uses selection constants to avoid examining irrelevant
                 portions of the database, however, on some simple
                 recursions this algorithm is $O(n)$, whereas
                 Generalized Magic Sets is $O(n^2)$ and Generalized
                 Counting is $O(2^n)$",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Languages",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Computing
                 Methodologies --- Artificial Intelligence --- Deduction
                 and Theorem Proving (I.2.3): {\bf Logic programming};
                 Information Systems --- Information Storage and
                 Retrieval --- Information Search and Retrieval (H.3.3):
                 {\bf Query formulation}",
}

@InProceedings{Winslett:1988:FCU,
  author =       "Marianne Winslett",
  title =        "A framework for comparison of update semantics",
  crossref =     "ACM:1988:PPS",
  pages =        "315--324",
  year =         "1988",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/308386/p315-winslett/p315-winslett.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/308386/p315-winslett/",
  abstract =     "Scattered across the scientific literature of three or
                 more disciplines appears a profusion of proposals for
                 semantics of updates to logical theories. Because no
                 previous work has compared these proposals with one
                 another, the merits and demerits of the various
                 approaches are not well known. Since the semantics
                 differ from one another in systematic ways, it is
                 possible to generalize from existing proposals and
                 speak of the properties of {\em classes\/} of update
                 semantics. In this paper we suggest a two-dimensional
                 taxonomy for characterizing semantics, and describe the
                 properties inherent to the classes implicit therein.
                 Our discussion includes measurement of the
                 computational complexity of the different classes.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Youn:1988:CRF,
  author =       "Cheong Youn and Lawrence J. Henschen and Jiawei Han",
  title =        "Classification of recursive formulas in deductive
                 databases",
  crossref =     "ACM:1988:PAC",
  pages =        "320--328",
  year =         "1988",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/50202/p320-youn/p320-youn.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/50202/p320-youn/",
  abstract =     "In this paper, we present results on the
                 classification of linear recursive formulas in
                 deductive databases and apply those results to the
                 compilation and optimization of recursive queries. We
                 also introduce compiled formulas and query evaluation
                 plans for a representative query for each of these
                 classes. \par

                 To explain general recursive formulas, we use a graph
                 model that shows the connectivity between variables.
                 The connecticity between variables is the most critical
                 part in processing recursive formulas. We demonstrate
                 that based on such a graph model all the linear
                 recursive formulas can be classified into several
                 classes and each class shares some common
                 characteristics in compilation and query processing.
                 The compiled formulas and the corresponding query
                 evaluation plans can be derived based on the study of
                 the compilation of each class.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Theory",
  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}; Theory of Computation --- Mathematical
                 Logic and Formal Languages --- Mathematical Logic
                 (F.4.1): {\bf Recursive function theory}",
}

@InProceedings{Sippu:1988:GTC,
  author =       "Seppo Sippu and Eljas Soisalon-Soininen",
  title =        "A generalized transitive closure for relational
                 queries",
  crossref =     "ACM:1988:PPS",
  pages =        "325--332",
  year =         "1988",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/308386/p325-sippu/p325-sippu.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/308386/p325-sippu/",
  abstract =     "We augment relational algebra with a generalized
                 transitive closure operator that allows for the
                 efficient evaluation of a subclass of recursive
                 queries. The operator is based on a composition
                 operator which is as general as possible when the
                 operator is required to be associative and when only
                 relational algebra operators are used in its
                 definition. The closure of such a composition can be
                 computed using the well-known efficient algorithms
                 designed for the computation of the usual transitive
                 closure. Besides the case in which complete
                 materialization of recursive relations are required,
                 our strategy also yields an efficient solution in the
                 case in which a selection is applied to the closure.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Wolfson:1988:DPL,
  author =       "Ouri Wolfson and Avi Silberschatz",
  title =        "Distributed processing of logic programs",
  crossref =     "ACM:1988:PAC",
  pages =        "329--336",
  year =         "1988",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/50202/p329-wolfson/p329-wolfson.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/50202/p329-wolfson/",
  abstract =     "This paper is concerned with the issue of parallel
                 evaluation of logic programs. To address this issue we
                 define a new concept of {\em predicate
                 decomposability}. If a predicate is decomposable, it
                 means that the load of evaluating it can be divided
                 among a number of processors, without a need for
                 communication among them. This in turn results in a
                 very significant speed-up of the evaluation process.
                 \par

                 We completely characterize three classes of single rule
                 programs (sirups) with respect to decomposability
                 nonrecursive, linear, and simple chain programs. All
                 three classes were studied previously in various
                 contexts. We establish that nonrecursive programs are
                 decomposable, whereas for the other two classes we
                 determine which ones are, and which ones are not
                 decomposable. We also establish two sufficient
                 conditions for sirup decomposability.",
  acknowledgement = ack-nhfb,
  generalterms = "Design",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Information
                 Systems --- Database Management --- Systems (H.2.4):
                 {\bf Distributed databases}; 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{Haddad:1988:CMC,
  author =       "Ramsey W. Haddad and Jeffrey F. Naughton",
  title =        "Counting methods for cyclic relations",
  crossref =     "ACM:1988:PPS",
  pages =        "333--340",
  year =         "1988",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/308386/p333-haddad/p333-haddad.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/308386/p333-haddad/",
  abstract =     "In this paper we consider selections of the form
                 ``column = constant'' on relations defined by linear
                 recursive, two rule datalog programs. In general,
                 counting methods perform well on such queries. However,
                 counting methods fail in the presence of cycles in the
                 database. We present an algorithm in the spirit of
                 counting methods that correctly deals with cyclic data
                 and has the same asymptotic running time as counting
                 methods. The algorithm, which is based on reducing a
                 query on a database to a question about intersections
                 of semi-linear sets, works by using efficient methods
                 to construct the appropriate semi-linear sets from the
                 database and query constant.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Group:1988:BNS,
  author =       "{Tandem Performance Group}",
  title =        "A benchmark of non-stop {SQL} on the debit credit
                 transaction",
  crossref =     "ACM:1988:PAC",
  pages =        "337--341",
  year =         "1988",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/citations/proceedings/mod/50202/p337-tandem_performance_group/",
  abstract =     "NonStop SQL is an implementation of ANSI SQL on Tandem
                 Computer Systems Debit Credit is a widely used
                 industry-standard transaction. This paper summarizes a
                 benchmark of NonStop SQL which demonstrated linear
                 growth of throughout from 14 to 208 Debit Credit
                 transactions per second as the hardware grew from 2 to
                 32 processors. The benchmark also compared the
                 performance of NonStop SQL to the performance of a
                 record-at a time file system interface",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Languages; Management; Performance",
  subject =      "Computer Systems Organization --- Performance of
                 Systems (C.4): {\bf Performance attributes};
                 Information Systems --- Database Management ---
                 Languages (H.2.3): {\bf SQL}; Computing Milieux ---
                 Management of Computing and Information Systems ---
                 Installation Management (K.6.2): {\bf Benchmarks};
                 Computer Systems Organization --- Performance of
                 Systems (C.4): {\bf Measurement techniques}",
}

@InProceedings{Vardi:1988:DUR,
  author =       "Moshe Y. Vardi",
  title =        "Decidability and undecidability results for
                 boundedness of linear recursive queries",
  crossref =     "ACM:1988:PPS",
  pages =        "341--351",
  year =         "1988",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/308386/p341-vardi/p341-vardi.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/308386/p341-vardi/",
  abstract =     "If it is possible to eliminate recursion from a
                 Datalog program {\em P}, then {$P$} is said to be {\em
                 bounded}. It was shown by Gaifman et al that the
                 problem of deciding whether a given Datalog program is
                 bounded is undecidable, even for linear programs that
                 has one {\em 4-ary\/} intensional predicate. We sharpen
                 that result by showing that the problem of deciding
                 whether a given Datalog program is bounded is
                 undecidable, even for linear programs that has one {\em
                 binary\/} intensional predicate. We then consider
                 linear programs with a single recursive rule. We show
                 that if the intensional predicate is binary, then the
                 boundedness problem for such program is decidable, in
                 fact, it is NP-complete.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Borr:1988:HPS,
  author =       "A. Borr",
  title =        "High performance {SQL} through low-level system
                 integration",
  crossref =     "ACM:1988:PAC",
  pages =        "342--349",
  year =         "1988",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/50202/p342-borr/p342-borr.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/50202/p342-borr/",
  abstract =     "NonStop SQL [TM] achieves high performance through an
                 implementation which integrates SQL record access with
                 the pre-existing disk I/O and transaction management
                 subsystems, and moves SQL function downward from the
                 client to the server level of these subsystems. System
                 integration and movement of function to the server
                 reduce message traffic and CPU consumption by putting
                 SQL optimizations at the lower levels of the system.
                 Examples of such optimizations are message traffic
                 savings by filtering data and applying updates at the
                 data source, I/O savings by SQL-optimized buffer pool
                 management, and locking and transaction journaling
                 techniques which take advantage of SQL semantics.
                 Achieving message traffic reduction is particularly
                 important in a distributed, non shared-memory
                 architecture such as the Tandem NonStop System. The
                 result of this implementation is an SQL system which
                 matches the performance of the pre-existing DBMS, while
                 inheriting such pre-existing architecturally-derived
                 features as high availability, transaction-based data
                 integrity, and distribution of both data and
                 execution.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Languages; Performance",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Transaction processing}; Computer
                 Systems Organization --- Performance of Systems (C.4):
                 {\bf Performance attributes}; Information Systems ---
                 Database Management --- Languages (H.2.3): {\bf SQL}",
}

@InProceedings{DeWitt:1988:PAG,
  author =       "D. J. DeWitt and S. Ghandeharizadeh and D. Schneider",
  title =        "A performance analysis of the gamma database machine",
  crossref =     "ACM:1988:PAC",
  pages =        "350--360",
  year =         "1988",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/50202/p350-dewitt/p350-dewitt.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/50202/p350-dewitt/",
  abstract =     "This paper presents the results of an initial
                 performance evaluation of the Gamma database machine.
                 In our experiments we measured the effect of relation
                 size and indices on response time for selection, join,
                 and aggregation queries, and single-tuple updates. A
                 Teradata DBC/1012 database machine of similar size is
                 used as a basis for interpreting the results obtained.
                 We also analyze the performance of Gemma relative to
                 the number of processors employed and study the impact
                 of varying the memory size and disk page size on the
                 execution time of a variety of selection and join
                 queries. We analyze and interpret the results of these
                 experiments based on our understanding of the system
                 hardware and software, and conclude with an assessment
                 of the strengths and weaknesses of Gamma.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Management; Performance",
  subject =      "Computer Systems Organization --- Performance of
                 Systems (C.4): {\bf Measurement techniques}; Computer
                 Systems Organization --- Performance of Systems (C.4):
                 {\bf Performance attributes}; Information Systems ---
                 Database Management --- Systems (H.2.4): {\bf Query
                 processing}; Computing Milieux --- Management of
                 Computing and Information Systems --- Installation
                 Management (K.6.2): {\bf Benchmarks}",
  xxauthor =     "D. J. DeWitt and S. Ghanderaizadeh and D. Schneider",
}

@InProceedings{Roesler:1988:SLM,
  author =       "M. Roesler and W. A. Burkhard",
  title =        "Semantic lock models in object-oriented distributed
                 systems and deadlock resolution",
  crossref =     "ACM:1988:PAC",
  pages =        "361--370",
  year =         "1988",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/50202/p361-roesler/p361-roesler.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/50202/p361-roesler/",
  abstract =     "{\em We propose a distributed algorithm for detection
                 and resolution of resource deadlocks in object-oriented
                 distributed systems. The algorithm proposed is shown to
                 detect and resolve all O(n 1) cycles present in the
                 worst case waits-for-graph (WFG) with n vertices by
                 transmitting O(n 3) messages of small constant size.
                 Its average time complexity has been shown to be O(ne),
                 where e is the number of edges in the WFG After
                 deadlock resolution, the algorithm leaves information
                 in the system concerning dependence relations of
                 running transactions. This information will preclude
                 the wasteful retransmission of messages and reduce the
                 delay in detecting future deadlocks}.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Theory",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Distributed databases};
                 Information Systems --- Database Management ---
                 Physical Design (H.2.2): {\bf Deadlock avoidance};
                 Information Systems --- Database Management --- Systems
                 (H.2.4): {\bf Transaction processing}; Theory of
                 Computation --- Computation by Abstract Devices ---
                 Models of Computation (F.1.1): {\bf Computability
                 theory}",
}

@InProceedings{Ramarao:1988:CPD,
  author =       "K. V. S. Ramarao",
  title =        "Commitment in a partitioned distributed database",
  crossref =     "ACM:1988:PAC",
  pages =        "371--378",
  year =         "1988",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/50202/p371-ramarao/p371-ramarao.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/50202/p371-ramarao/",
  abstract =     "Network partition is among the hardest failure types
                 in a distributed system even if all processors and
                 links are of {\em fail-stop\/} type. We address the
                 transaction commitment problem in a partitioned
                 distributed database. It is assumed that partitions are
                 detectable. The approach taken is conservative - that
                 is, the same transaction cannot be committed by one
                 site and aborted by another. \par

                 A new and very general formal model of protocols
                 operating in a partitioned system is introduced and
                 protocols more efficient than the existing ones are
                 constructed.",
  acknowledgement = ack-nhfb,
  generalterms = "Design",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Distributed databases};
                 Information Systems --- Database Management --- Systems
                 (H.2.4): {\bf Transaction processing}",
}

@InProceedings{Korth:1988:FMC,
  author =       "H. K. Korth and G. Speegle",
  title =        "Formal model of correctness without serializability",
  crossref =     "ACM:1988:PAC",
  pages =        "379--386",
  year =         "1988",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/50202/p379-korth/p379-korth.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/50202/p379-korth/",
  abstract =     "In the classical approach to transaction processing, a
                 concurrent execution is considered to be correct if it
                 is equivalent to a non-concurrent schedule. This notion
                 of correctness is called {\em serializability}.
                 Serializability has proven to be a highly useful
                 concept for transaction systems for data-processing
                 style applications. Recent interest in applying
                 database concepts to applications in computer-aided
                 design, office information systems, etc. has resulted
                 in transactions of relatively long duration. For such
                 transactions, there are serious consequences to
                 requiring serializability as the notion of correctness.
                 Specifically, such systems either impose long-duration
                 waits or require the abortion of long transactions. In
                 this paper, we define a transaction model that allows
                 for several alternative notions of correctness without
                 the requirement of serializability. After introducing
                 the model, we investigate classes of schedules for
                 transactions. We show that these classes are richer
                 than analogous classes under the classical model.
                 Finally, we show the potential practicality of our
                 model by describing protocols that permit a transaction
                 manager to allow correct non-serializable executions",
  acknowledgement = ack-nhfb,
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Transaction processing};
                 Information Systems --- Database Management --- Systems
                 (H.2.4): {\bf Concurrency}",
}

@InProceedings{Ramnarayan:1988:DKB,
  author =       "R. Ramnarayan and H. Lu",
  title =        "A data\slash knowledge base management testbed and
                 experimental results on data\slash knowledge base query
                 and update processing",
  crossref =     "ACM:1988:PAC",
  pages =        "387--395",
  year =         "1988",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/50202/p387-ramnarayan/p387-ramnarayan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/50202/p387-ramnarayan/",
  abstract =     "This paper presents our experience in designing and
                 implementing a data/knowledge base management testbed.
                 The testbed consists of two layers, the knowledge
                 manager and the database management system, with the
                 former at the top. The testbed is based on the logic
                 programming paradigm, wherein data, knowledge, and
                 queries are all expressed as Horn clauses. The
                 knowledge manager compiles pure, function-free Horn
                 clause queries into embedded-SQL programs, which are
                 executed by the database management system to produce
                 the query results. The database management system is a
                 commercial relational database system and provides
                 storage for both rules and facts. First, the testbed
                 architecture and major data structures and algorithms
                 are described. Then, several preliminary tests
                 conducted using the current version of the testbed and
                 the conclusions from the test results are presented.
                 The principal contributions of this work have been to
                 unify various concepts, both previously published and
                 new ones we developed, into a real system and to
                 present several insights into data/knowledge base
                 management system design gleaned from the test results
                 and our design and implementation experience.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design",
  subject =      "Computing Methodologies --- Artificial Intelligence
                 --- Deduction and Theorem Proving (I.2.3): {\bf Logic
                 programming}; 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}",
}

@InProceedings{Delcambre:1988:SCI,
  author =       "L. M. L. Delcambre and J. N. Etheredge",
  title =        "A self-controlling interpreter for the relational
                 production language",
  crossref =     "ACM:1988:PAC",
  pages =        "396--403",
  year =         "1988",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/50202/p396-delcambre/p396-delcambre.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/50202/p396-delcambre/",
  abstract =     "The Relational Production Language (RPL) solves the
                 paradigm mismatch between expert systems and database
                 systems by relying on the relational data model as the
                 underlying formalism for an expert system. The result
                 is a formally-defined production system language with
                 immediate access to conventional databases. Working
                 memory is modeled as a relational database and rules
                 consist of a relational query on the left hand side
                 (LHS) and database updates on the right hand side
                 (RHS). This paper reports on the design of the RPL 1 0
                 prototype. The prototype directly executes RPL programs
                 and capitalizes on the inherent advantages of the
                 relational approach, particularly for intra-rule and
                 inter-rule parallelism. By using a self-describing
                 approach for representing the interpreter data
                 structures, the interpreter is a self-controlling
                 system that allows conflict resolution, error handling
                 and a wide spectrum of software metrics to be
                 explicitly specified using RPL meta-rules.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Languages; Reliability",
  subject =      "Software --- Programming Languages --- Processors
                 (D.3.4): {\bf Interpreters}; Software --- Software
                 Engineering --- Testing and Debugging (D.2.5): {\bf
                 Error handling and recovery}; Software --- Software
                 Engineering --- Requirements/Specifications (D.2.1):
                 {\bf RPL}; Information Systems --- Database Management
                 --- Logical Design (H.2.1): {\bf Data models}",
}

@InProceedings{Sellis:1988:ILP,
  author =       "T. Sellis and C. C. Lin and L. Raschid",
  title =        "Implementing large production systems in a {DBMS}
                 environment: concepts and algorithms",
  crossref =     "ACM:1988:PAC",
  pages =        "404--423",
  year =         "1988",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/50202/p404-sellis/p404-sellis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/50202/p404-sellis/",
  abstract =     "It has been widely recognized that many future
                 database applications, including engineering processes,
                 manufacturing and communications, will require some
                 kind of rule based reasoning. In this paper we study
                 methods for storing and manipulating large rule bases
                 using relational database management systems. First, we
                 provide a matching algorithm which can be used to
                 efficiently identify applicable rules. The second
                 contribution of this paper, is our proposal for
                 concurrent execution strategies which surpass, in terms
                 of performance, the sequential OPS5 execution
                 algorithm. The proposed method is fully parallelizable,
                 which makes its use even more attractive, as it can be
                 used in parallel computing environments.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Languages; Theory",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Transaction processing};
                 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 Indexing
                 methods}",
}

@InProceedings{Carey:1988:DMQ,
  author =       "Michael J. Carey and David J. DeWitt",
  title =        "A data model and query language for {EXODUS}",
  crossref =     "ACM:1988:PAC",
  pages =        "413--423",
  year =         "1988",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/50202/p413-carey/p413-carey.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/50202/p413-carey/",
  abstract =     "{\em In this paper, we present the design of the EXTRA
                 data model and the EXCESS query language for the EXODUS
                 extensible database system. The EXTRA data model
                 includes support for complex objects with shared
                 subobjects, a novel mix of object- and value-oriented
                 semantics for data, support for persistent objects of
                 any type in the EXTRA type lattice, and user-defined
                 abstract data types (ADTs). The EXCESS query language
                 provides facilities for querying and updating complex
                 object structures, and it can be extended through the
                 addition of ADT functions and operators, procedures and
                 functions for manipulating EXTRA schema types, and
                 generic set functions EXTRA and EXCESS are intended to
                 serve as a test vehicle for tools developed under the
                 EXODUS extensible database system project}.",
  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 EXODUS}; Information Systems --- Database
                 Management --- Languages (H.2.3): {\bf Query
                 languages}; Information Systems --- Information Storage
                 and Retrieval --- Information Search and Retrieval
                 (H.3.3): {\bf Query formulation}",
}

@InProceedings{Lecluse:1988:OOD,
  author =       "C. Lecluse and P. Richard and F. Velez",
  title =        "{$O_2$}, an object-oriented data model",
  crossref =     "ACM:1988:PAC",
  pages =        "424--433",
  year =         "1988",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/50202/p424-lecluse/p424-lecluse.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/50202/p424-lecluse/",
  abstract =     "The {\em Altair\/} group is currently designing an
                 object-oriented data base system called O 2. This paper
                 presents a formal description of the object-oriented
                 data model of this system. It proposes a type system
                 defined in the framework of a set-and-tuple data model.
                 It models the well known inheritance mechanism and
                 enforces strong typing.",
  acknowledgement = ack-nhfb,
  generalterms = "Design",
  subject =      "Information Systems --- Database Management ---
                 Logical Design (H.2.1): {\bf Data models}; Information
                 Systems --- Database Management --- Systems (H.2.4):
                 {\bf Transaction processing}; Information Systems ---
                 Database Management --- Logical Design (H.2.1): {\bf
                 Schema and subschema}",
}

@InProceedings{Borgida:1988:MCH,
  author =       "A. Borgida",
  title =        "Modeling class hierarchies with contradictions",
  crossref =     "ACM:1988:PAC",
  pages =        "434--443",
  year =         "1988",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/50202/p434-borgida/p434-borgida.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/50202/p434-borgida/",
  abstract =     "One characteristic feature of object-oriented systems
                 and knowledge bases (semantic data models, conceptual
                 modeling languages, Al frames) is that they offer as a
                 basic paradigm the notion of objects grouped into
                 classes, which are themselves organized in subclass
                 hierarchies. Through ideas such as inheritance and
                 bounded polymorphism, this feature supports the
                 technique of ``{\em abstraction by generalization\/}'',
                 which has been argued to be of importance in designing
                 Information Systems [11, 2]. \par

                 We provide in this paper examples demonstrating that in
                 some applications {\em over-generalization\/} is likely
                 to occur an occasional natural subclass may contradict
                 in some way one if its superclass definitions, and thus
                 turn out not to be a strict subtype of this superclass.
                 A similar problem arises when an object is allowed to
                 be a member of several classes which make incompatible
                 predictions about its type. We argue that none of the
                 previous approaches suggested to deal with such
                 situations is entirely satisfactory. \par

                 A language feature is therefore presented to permit
                 class definitions which contradict aspects of other
                 classes, such as superclasses, in an object-based
                 language. In essence, the approach requires
                 contradictions among class definitions to be {\em
                 explicitly\/} acknowledged. We define a semantics of
                 the resulting language, which restores the condition
                 that subclasses are both subsets and subtypes, and
                 deals correctly with the case when an object can belong
                 to several classes. This is done by separating the
                 notions of ``class'' and ``type'', and it allows query
                 compilers to detect type errors as well as eliminate
                 some run-time checks in queries, even in the presence
                 of ``contradictory'' class definitions.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Languages",
  subject =      "Information Systems --- Database Management ---
                 Logical Design (H.2.1): {\bf Data models}; Computing
                 Methodologies --- Artificial Intelligence ---
                 Applications and Expert Systems (I.2.1); Information
                 Systems --- Database Management --- Languages (H.2.3):
                 {\bf Data description languages (DDL)}; Information
                 Systems --- Database Management --- Languages (H.2.3):
                 {\bf Data manipulation languages (DML)}",
}

@InProceedings{VanGelder:1989:AFL,
  author =       "A. {Van Gelder}",
  title =        "The alternating fixpoint of logic programs with
                 negation",
  crossref =     "ACM:1989:PPE",
  pages =        "1--10",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/73721/p1-van_gelder/p1-van_gelder.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/73721/p1-van_gelder/",
  abstract =     "We introduce and describe the {\em alternating
                 fixpoint\/} of a logic program with negation. The
                 underlying idea is to monotonically build up a set of
                 {\em negative\/} conclusions until the least fixpoint
                 is reached, using a transformation related to the one
                 that defines stable models, developed by Gelfand and
                 Lifschitz. From a fixed set of negative conclusions, we
                 can derive the positive conclusions that follow
                 (without deriving any further negative ones), by
                 traditional Horn clause semantics. The union of
                 positive and negative conclusions is called the {\em
                 alternating fixpoint partial model}. The name
                 ``alternating'' was chosen because the transformation
                 runs in two passes; the first pass transforms an
                 underestimate of the set of negative conclusions into
                 an (intermediate) overestimate; the second pass
                 transforms the overestimates into a new underestimate;
                 the composition of the two passes is monotonic.
                 \par

                 Our main theorem is that the alternating fixpoint
                 partial model is exactly the well-founded partial
                 model. \par

                 We also show that a system is {\em fixpoint logic},
                 which permits rule bodies to be first order formulas
                 but requires inductive relations to be positive within
                 them, can be transformed straightforwardly into a
                 normal logic program whose alternating fixpoint partial
                 model corresponds to the least fixpoint of the fixpoint
                 logic system. Thus alternating fixpoint logic is at
                 least as expressive as fixpoint logic. The converse is
                 shown to hold for finite structures.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Theory",
  keywords =     "design; theory",
  subject =      "Theory of Computation --- Mathematical Logic and
                 Formal Languages --- Mathematical Logic (F.4.1): {\bf
                 Lambda calculus and related systems}; Theory of
                 Computation --- Logics and Meanings of Programs ---
                 Semantics of Programming Languages (F.3.2)",
}

@InProceedings{Salza:1989:ESQ,
  author =       "Silvio Salza and Mario Terranova",
  title =        "Evaluating the size of queries on relational databases
                 with non-uniform distribution and stochastic
                 dependence",
  crossref =     "Clifford:1989:PAS",
  pages =        "8--14",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p8-salza/p8-salza.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p8-salza/",
  abstract =     "{\em The paper deals with the problem of evaluating
                 how the originality of the attributes of a relation,
                 i.e., the number of distinct values in each attribute,
                 is affected by relational operations that reduce the
                 cardinality of the relation. This is indeed an
                 interesting problem in research areas such as database
                 design and query optimization. Some authors have shown
                 that non uniform distributions and stochastic
                 dependence significantly affect the originality of the
                 attributes. Therefore the models that have been
                 proposed in the literature, based on uniformity and
                 independence assumptions, in several situation can not
                 be conveniently utilized. In this paper we propose a
                 probabilistic model that overcomes the need of the
                 uniformity and independence assumptions. The model is
                 exact for non uniform distributions when the attributes
                 are independent, and gives approximate results when
                 stochastic dependence is considered. In the latter case
                 the analytical results have been compared with a
                 simulation, and proved to be quite accurate}.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Theory",
  subject =      "Theory of Computation --- Computation by Abstract
                 Devices --- Modes of Computation (F.1.2): {\bf
                 Probabilistic computation}; Information Systems ---
                 Database Management --- Systems (H.2.4): {\bf Query
                 processing}; Information Systems --- Database
                 Management --- Logical Design (H.2.1): {\bf Data
                 models}; Computing Methodologies --- Simulation and
                 Modeling --- Applications (I.6.3)",
}

@InProceedings{Przymusinski:1989:ELP,
  author =       "T. C. Przymusinski",
  title =        "Every logic program has a natural stratification and
                 an iterated least fixed point model",
  crossref =     "ACM:1989:PPE",
  pages =        "11--21",
  year =         "1989",
  bibdate =      "Wed Oct 25 08:47:34 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/73721/p11-przymusinski/p11-przymusinski.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/73721/p11-przymusinski/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p11-przymusinski/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design",
  subject =      "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC
                 AND FORMAL LANGUAGES, Mathematical Logic, Lambda
                 calculus and related systems. {\bf F.3.2} Theory of
                 Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics
                 of Programming Languages. {\bf I.2.3} Computing
                 Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and
                 Theorem Proving, Nonmonotonic reasoning and belief
                 revision.",
}

@InProceedings{Kolodner:1989:AGC,
  author =       "Elliot Kolodner and Barbara Liskov and William Weihl",
  title =        "Atomic garbage collection: managing a stable heap",
  crossref =     "Clifford:1989:PAS",
  pages =        "15--25",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p15-kolodner/p15-kolodner.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p15-kolodner/",
  abstract =     "Modern database systems use transactions to achieve a
                 high degree of fault-tolerance. Many modern programming
                 languages and systems provide garbage collected heap
                 storage, which frees the programmer from the job of
                 explicitly deallocating storage. In this paper we
                 describe integrated garbage collection and recovery
                 algorithms for managing a {\em stable heap\/} in which
                 accessible objects survive both system crashes and
                 media failures. \par

                 A garbage collector typically both moves and modifies
                 objects which can lead to problems when the heap is
                 stable because a system crash after the start of
                 collection but before enough of the reorganized heap
                 reaches the disk can leave the disk in an inconsistent
                 state. Furthermore, collection has to be coordinated
                 with the recovery system. We present a collection
                 algorithm and recovery system that solves these
                 problems.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Languages",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Information
                 Systems --- Database Management --- Systems (H.2.4);
                 Information Systems --- Database Management ---
                 Languages (H.2.3): {\bf Query languages}; Information
                 Systems --- Database Management --- Logical Design
                 (H.2.1): {\bf Data models}; Software --- Programming
                 Languages --- Language Classifications (D.3.2): {\bf
                 C++}",
}

@InProceedings{Ross:1989:PSW,
  author =       "K. A. Ross",
  title =        "A procedural semantics for well founded negation in
                 logic programs",
  crossref =     "ACM:1989:PPE",
  pages =        "22--33",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/73721/p22-ross/p22-ross.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/73721/p22-ross/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p22-ross/",
  abstract =     "We introduce global SLS-resolution, a procedural
                 semantics for well-founded negation as defined by Van
                 Gelder, Ross and Schlipf. Global SLS-resolution extends
                 Prsymusinski's SLS-resolution, and may be applied to
                 all programs, whether locally stratified or not. 1
                 Global SLS-resolution is defined in terms of global
                 trees, a new data structure representing the dependence
                 of goals on derived negative subgoals. We prove that
                 global SLS-resolution is sound with respect to the
                 well-founded semantics, and complete for
                 non-floundering queries.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Theory",
  keywords =     "design; theory",
  subject =      "{\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS
                 OF PROGRAMS, Semantics of Programming Languages. {\bf
                 F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND
                 FORMAL LANGUAGES, Mathematical Logic, Lambda calculus
                 and related systems. {\bf E.1} Data, DATA STRUCTURES,
                 Trees.",
}

@InProceedings{Dong:1989:DPD,
  author =       "Guozhu Dong",
  title =        "On distributed processibility of datalog queries by
                 decomposing databases",
  crossref =     "Clifford:1989:PAS",
  pages =        "26--35",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p26-dong/p26-dong.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p26-dong/",
  abstract =     "We consider distributed or parallel processing of
                 datalog queries. We address this issue by decomposing
                 databases into a number of subdatabases such that the
                 computation of a program on a database can be achieved
                 by {\em unioning its independent evaluations\/} on the
                 subdatabases. More specifically, we identify two kinds
                 of distributed-processable programs according to the
                 properties of database decomposition. (i) A program is
                 {\em disjoint distributive\/} if it is distributed
                 processable over a decomposition consisting of
                 subdatabases with disjoint domains. A characterization
                 of such programs is given in terms of an easily
                 decidable syntactic property called {\em connectivity}.
                 (ii) A program is {\em bounded distributive\/} if it is
                 distributed processable over a decomposition consisting
                 of subdatabases with a fixed size. Three interesting
                 characterizations of such a program are presented, the
                 first by bounded recursion, the second by equivalence
                 to a 1-bounded-recursive program, and the third by
                 constant parallel complexity",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design",
  subject =      "Mathematics of Computing --- Numerical Analysis ---
                 General (G.1.0): {\bf Parallel algorithms}; Software
                 --- Programming Techniques --- Concurrent Programming
                 (D.1.3); Information Systems --- Database Management
                 --- Systems (H.2.4): {\bf Distributed databases};
                 Information Systems --- Database Management --- Systems
                 (H.2.4): {\bf Query processing}; Information Systems
                 --- Database Management --- Systems (H.2.4): {\bf
                 Concurrency}",
}

@InProceedings{Bry:1989:LPC,
  author =       "F. Bry",
  title =        "Logic programming as constructivism: a formalization
                 and its application to databases",
  crossref =     "ACM:1989:PPE",
  pages =        "34--50",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/73721/p34-bry/p34-bry.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/73721/p34-bry/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p34-bry/",
  abstract =     "{\em The features of logic programming that seem
                 unconventional from the viewpoint of classical logic
                 can be explained in terms of constructivistic logic. We
                 motivate and propose a constructivistic proof theory of
                 non-Horn logic programming. Then, we apply this
                 formalization for establishing results of practical
                 interest. First, we show that `stratification' can be
                 motivated in a simple and intuitive way. Relying on
                 similar motivations, we introduce the larger classes of
                 `loosely stratified' and `constructively consistent'
                 programs. Second, we give a formal basis for
                 introducing quantifiers into queries and logic programs
                 by defining `constructively domain independent'
                 formulas. Third, we extend the Generalized Magic Sets
                 procedure to loosely stratified and constructively
                 consistent programs, by relying on a `conditional
                 fixpoint' procedure}.",
  acknowledgement = ack-nhfb,
  generalterms = "Design",
  keywords =     "design",
  subject =      "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC
                 AND FORMAL LANGUAGES, Mathematical Logic, Lambda
                 calculus and related systems. {\bf F.3.1} Theory of
                 Computation, LOGICS AND MEANINGS OF PROGRAMS,
                 Specifying and Verifying and Reasoning about Programs,
                 Specification techniques.",
}

@InProceedings{Agrawal:1989:OOD,
  author =       "R. Agrawal and N. H. Gehani",
  title =        "{ODE (Object Database and Environment)}: the language
                 and the data model",
  crossref =     "Clifford:1989:PAS",
  pages =        "36--45",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p36-agrawal/p36-agrawal.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p36-agrawal/",
  abstract =     "ODE is a database system and environment based on the
                 object paradigm. It offers one integrated data model
                 for both database and general purpose manipulation. The
                 database is defined, queried and manipulated in the
                 database programming language O++ which is based on
                 C++. O++ borrows and extends the object definition
                 facility of C++, called the class. Classes support data
                 encapsulation and multiple inheritance. We provide
                 facilities for creating persistent and versioned
                 objects, defining sets, and iterating over sets and
                 clusters of persistent objects. We also provide
                 facilities to associate constraints and triggers with
                 objects. This paper presents the linguistic facilities
                 provided in O++ and the data model it supports.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Languages",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Information
                 Systems --- Database Management --- Systems (H.2.4);
                 Information Systems --- Database Management ---
                 Languages (H.2.3): {\bf Query languages}; Information
                 Systems --- Database Management --- Logical Design
                 (H.2.1): {\bf Data models}; Software --- Programming
                 Languages --- Language Classifications (D.3.2): {\bf
                 C++}",
}

@InProceedings{Ohori:1989:DPM,
  author =       "Atsushi Ohori and Peter Buneman and Val
                 Breazu-Tannen",
  title =        "Database programming in {Machiavelli} --- a
                 polymorphic language with static type inference",
  crossref =     "Clifford:1989:PAS",
  pages =        "46--57",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p46-ohori/p46-ohori.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p46-ohori/",
  abstract =     "Machiavelli is a polymorphically typed programming
                 language in the spirit of ML, but supports an extended
                 method of type inferencing that makes its polymorphism
                 more general and appropriate for database applications.
                 In particular, a function that selects a field of a
                 records is polymorphic in the sense that it can be
                 applied to any record which contains a field with the
                 appropriate type. When combined with a set data type
                 and database operations including join and projection,
                 this provides a natural medium for relational database
                 programming. Moreover, by implementing database objects
                 as reference types and generating the appropriate views
                 -- sets of structures with ``identity'' -- we can
                 achieve a degree of static type checking for
                 object-oriented databases.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Languages",
  subject =      "Information Systems --- Database Management ---
                 Logical Design (H.2.1): {\bf Data models}; Information
                 Systems --- Database Management --- Languages (H.2.3):
                 {\bf Data manipulation languages (DML)}; Information
                 Systems --- Database Management --- Languages (H.2.3):
                 {\bf Data description languages (DDL)}; Information
                 Systems --- Database Management --- Languages (H.2.3):
                 {\bf Query languages}",
}

@InProceedings{Imielinski:1989:CQP,
  author =       "T. Imielinski and K. Vadaparty",
  title =        "Complexity of query processing in databases with
                 {OR-objects}",
  crossref =     "ACM:1989:PPE",
  pages =        "51--65",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/73721/p51-imielinski/p51-imielinski.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/73721/p51-imielinski/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p51-imielinski/",
  abstract =     "If ground disjunctive facts are admitted into a
                 database the data complexity of conjunctive queries
                 grows from PTIME into CoNP with some simple examples of
                 CoNP-Complete conjunctive queries. A natural question
                 which arises in this context is whether it is possible
                 to syntactically characterize those queries which are
                 ``bad'' (i.e., CoNP-Complete) from those that are
                 ``good'' (i.e., with PTIME data complexity) given a
                 predefined ``pattern'' of disjunctions in the database.
                 In this paper, we study the data complexity of
                 conjunctive queries. We give a complete syntactic
                 characterization of CoNP-Complete conjunctive queries
                 for a class of disjunctive databases called
                 OR-Databases. Our results can be used in complexity
                 tailored design where design decisions are motivated by
                 complexity of query processing. Also, we establish that
                 a similar complete syntactic characterization for
                 disjunctive queries, with negation allowed only on base
                 predicates, would answer the open problem ``Does Graph
                 Isomorphism belong to PTIME or is it NP-Complete?''.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Theory",
  keywords =     "design; theory",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing. {\bf I.2.1} Computing
                 Methodologies, ARTIFICIAL INTELLIGENCE, Applications
                 and Expert Systems. {\bf H.2.0} Information Systems,
                 DATABASE MANAGEMENT, General. {\bf F.1.3} Theory of
                 Computation, COMPUTATION BY ABSTRACT DEVICES,
                 Complexity Measures and Classes, Reducibility and
                 completeness.",
}

@InProceedings{Borgida:1989:CSD,
  author =       "Alexander Borgida and Ronald J. Brachman and Deborah
                 L. McGuinness and Lori Alperin Resnick",
  title =        "{CLASSIC}: a structural data model for objects",
  crossref =     "Clifford:1989:PAS",
  pages =        "58--67",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p58-borgida/p58-borgida.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p58-borgida/",
  abstract =     "CLASSIC is a data model that encourages the
                 description of objects not only in terms of their
                 relations to other known objects, but in terms of a
                 level of intensional structure as well. The CLASSIC
                 language of {\em structured descriptions\/} permits (i)
                 partial descriptions of individuals, under an `open
                 world' assumption, (ii) answers to queries either as
                 extensional lists of values or as descriptions that
                 necessarily hold of all possible answers, and (iii) an
                 easily extensible schema, which can be accessed
                 uniformly with the data. One of the strengths of the
                 approach is that the same language plays multiple roles
                 in the processes of defining and populating the DB, as
                 well as querying and answering. \par

                 CLASSIC (for which we have a prototype main-memory
                 implementation) can actively discover new information
                 about objects from several sources: it can recognize
                 new classes under which an object falls based on a
                 description of the object, it can propagate some
                 deductive consequences of DB updates, it has simple
                 procedural recognizers, and it supports a limited form
                 of forward-chaining rules to derive new conclusions
                 about known objects. \par

                 The kind of language of descriptions and queries
                 presented here provides a new arena for the search for
                 languages that are more expressive than conventional
                 DBMS languages, but for which query processing is still
                 tractable. This space of languages differs from the
                 subsets of predicate calculus hitherto explored by
                 deductive databases.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Languages",
  subject =      "Information Systems --- Database Management ---
                 Languages (H.2.3): {\bf Data manipulation languages
                 (DML)}; Information Systems --- Database Management ---
                 Languages (H.2.3): {\bf Data description languages
                 (DDL)}; Information Systems --- Database Management ---
                 Logical Design (H.2.1): {\bf Data models}; Information
                 Systems --- Database Management --- Languages (H.2.3):
                 {\bf Query languages}",
}

@InProceedings{Yuan:1989:SCQ,
  author =       "L. Y. Yuan and D.-A. Chiang",
  title =        "A sound and complete query evaluation algorithm for
                 relational databases with disjunctive information",
  crossref =     "ACM:1989:PPE",
  pages =        "66--74",
  year =         "1989",
  bibdate =      "Wed Oct 25 08:47:34 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/73721/p66-yuan/p66-yuan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/73721/p66-yuan/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p66-yuan/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design; languages; theory",
  subject =      "{\bf H.2.0} Information Systems, DATABASE MANAGEMENT,
                 General. {\bf F.3.2} Theory of Computation, LOGICS AND
                 MEANINGS OF PROGRAMS, Semantics of Programming
                 Languages, Algebraic approaches to semantics. {\bf
                 H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing.",
}

@InProceedings{Hou:1989:PAR,
  author =       "Wen-Chi Hou and Gultekin Ozsoyoglu and Baldeo K.
                 Taneja",
  title =        "Processing aggregate relational queries with hard time
                 constraints",
  crossref =     "Clifford:1989:PAS",
  pages =        "68--77",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p68-hou/p68-hou.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p68-hou/",
  abstract =     "We consider those database environments in which
                 queries have strict timing constraints, and develop a
                 time-constrained query evaluation methodology. For
                 aggregate relational algebra queries, we describe a
                 time constrained query evaluation algorithm. The
                 algorithm, which is implemented in our prototype DBMS,
                 iteratively samples from input relations, and evaluates
                 the associated estimators developed in our previous
                 work, until a stopping criterion (e.g., a time quota or
                 a desired error range) is satisfied. \par

                 To determine sample sizes at each stage of the
                 iteration (so that the time quota will not be
                 overspent) we need to have (a) accurate sample
                 selectivity estimations of the RA operators in the
                 query, (b) precise time cost formulas, and (c) good
                 time-control strategies. To estimate the sample
                 selectivities of RA operators, we use a runtime sample
                 selectivity estimation and improvement approach which
                 is flexible. For query time estimations, we use
                 time-cost formulas which are adaptive and precise. To
                 use the time quota efficiently, we propose statistical
                 and heuristic time-control strategies to control the
                 risk of overspending the time quota. Preliminary
                 evaluation of the implemented prototype is also
                 presented.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Information
                 Systems --- Database Management --- Languages (H.2.3):
                 {\bf Data manipulation languages (DML)}; Computing
                 Methodologies --- Artificial Intelligence --- Knowledge
                 Representation Formalisms and Methods (I.2.4): {\bf
                 Semantic networks}",
}

@InProceedings{Grahne:1989:HTE,
  author =       "G. Grahne",
  title =        "{Horn} tables --- an efficient tool for handling
                 incomplete information in databases",
  crossref =     "ACM:1989:PPE",
  pages =        "75--82",
  year =         "1989",
  bibdate =      "Wed Oct 25 08:47:34 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/73721/p75-grahne/p75-grahne.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/73721/p75-grahne/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p75-grahne/",
  acknowledgement = ack-nhfb,
  keywords =     "design; theory",
  subject =      "{\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS
                 OF PROGRAMS, Semantics of Programming Languages,
                 Algebraic approaches to semantics. {\bf F.4.1} Theory
                 of Computation, MATHEMATICAL LOGIC AND FORMAL
                 LANGUAGES, Mathematical Logic, Lambda calculus and
                 related systems. {\bf H.2.0} Information Systems,
                 DATABASE MANAGEMENT, General. {\bf H.2.4} Information
                 Systems, DATABASE MANAGEMENT, Systems, Query
                 processing.",
}

@InProceedings{Jagadish:1989:IHR,
  author =       "H. V. Jagadish",
  title =        "Incorporating hierarchy in a relational model of
                 data",
  crossref =     "Clifford:1989:PAS",
  pages =        "78--87",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p78-jagadish/p78-jagadish.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p78-jagadish/",
  abstract =     "We extend the relational model of data to allow
                 classes as attribute values, thereby permitting the
                 representation of hierarchies of objects. Inheritance,
                 including multiple inheritance with exceptions, is
                 clearly supported. Facts regarding classes of objects
                 can be stored and manipulated in the same way as facts
                 regarding object instances. Our model is upwards
                 compatible with the standard relational model.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design",
  subject =      "Information Systems --- Database Management ---
                 Logical Design (H.2.1): {\bf Data models}; Information
                 Systems --- Database Management --- Languages (H.2.3):
                 {\bf Data manipulation languages (DML)}",
}

@InProceedings{Vardi:1989:ITA,
  author =       "M. Y. Vardi",
  title =        "Invited talk: automata theory for database
                 theoreticians",
  crossref =     "ACM:1989:PPE",
  pages =        "83--92",
  year =         "1989",
  bibdate =      "Wed Oct 25 08:47:34 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/73721/p83-vardi/p83-vardi.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/73721/p83-vardi/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p83-vardi/",
  acknowledgement = ack-nhfb,
  keywords =     "design; theory",
  subject =      "{\bf F.1.1} Theory of Computation, COMPUTATION BY
                 ABSTRACT DEVICES, Models of Computation, Automata. {\bf
                 F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND
                 FORMAL LANGUAGES, Mathematical Logic, Lambda calculus
                 and related systems. {\bf H.2.0} Information Systems,
                 DATABASE MANAGEMENT, General. {\bf F.4.3} Theory of
                 Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES,
                 Formal Languages, Algebraic language theory. {\bf
                 F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT
                 DEVICES, Modes of Computation, Alternation and
                 nondeterminism.",
}

@InProceedings{Cammarata:1989:ERD,
  author =       "Stephanie Cammarata and Prasadram Ramachandra and
                 Darrell Shane",
  title =        "Extending a relational database with deferred
                 referential integrity checking and intelligent joins",
  crossref =     "Clifford:1989:PAS",
  pages =        "88--97",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p88-cammarata/p88-cammarata.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p88-cammarata/",
  abstract =     "Interactive use of relational database management
                 systems (DBMS) requires a user to be knowledgeable
                 about the semantics of the application represented in
                 the database. In many cases, however, users are not
                 trained in the application field and are not DBMS
                 experts. Two categories of functionality are
                 problematic for such users: (1) updating a database
                 without violating integrity constraints imposed by the
                 domain and (2) using join operations to retrieve data
                 from more than one relation. We have been conducting
                 research to help an uninformed or casual user interact
                 with a relational DBMS. \par

                 This paper describes two capabilities to aid an
                 interactive database user who is neither an application
                 specialist nor a DBMS expert. We have developed
                 deferred Referential Integrity Checking (RIC) and
                 Intelligent Join (IJ) which extend the operations of a
                 relational DBMS. These facilities are made possible by
                 explicit representation of database semantics combined
                 with a relational schema. Deferred RIC is a static
                 validation procedure that checks uniqueness of tuples,
                 non-null keys, uniqueness of keys, and inclusion
                 dependencies. IJ allows a user to identify only the
                 ``target'' data which is to be retrieved without the
                 need to additionally specify ``join clauses''. In this
                 paper we present the motivation for these facilities,
                 describe the features of each, and present examples of
                 their use.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Human Factors",
  subject =      "Information Systems --- Database Management ---
                 Logical Design (H.2.1): {\bf Data models}; Information
                 Systems --- Models and Principles --- User/Machine
                 Systems (H.1.2): {\bf Human factors}; Information
                 Systems --- Information Storage and Retrieval ---
                 Content Analysis and Indexing (H.3.1): {\bf
                 Dictionaries}",
}

@InProceedings{Manchanda:1989:DED,
  author =       "S. Manchanda",
  title =        "Declarative expression of deductive database updates",
  crossref =     "ACM:1989:PPE",
  pages =        "93--100",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/73721/p93-manchanda/p93-manchanda.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/73721/p93-manchanda/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p93-manchanda/",
  abstract =     "An update can be specified as a single database state
                 transition, or as a sequence of queries and database
                 state transitions. We give an extension of Datalog for
                 expressing both types of update specifications on a
                 logic database. The extension supports the simple and
                 intuitive expression of basic update operations,
                 hypothetical reasoning and update procedures. The
                 extension possesses a possible-world semantics, and a
                 sound and complete proof theory. Soundness and
                 completeness is proved by showing that an update
                 procedure can be mapped into a semantically equivalent
                 Pure Prolog program. This means that the semantic and
                 proof-theoretic results of Pure Prolog can be mapped
                 into similar results for the Datalog extension.",
  acknowledgement = ack-nhfb,
  generalterms = "Design",
  keywords =     "design",
  subject =      "{\bf F.3.1} Theory of Computation, LOGICS AND MEANINGS
                 OF PROGRAMS, Specifying and Verifying and Reasoning
                 about Programs. {\bf I.2.1} Computing Methodologies,
                 ARTIFICIAL INTELLIGENCE, Applications and Expert
                 Systems. {\bf H.2.0} Information Systems, DATABASE
                 MANAGEMENT, General. {\bf F.3.2} Theory of Computation,
                 LOGICS AND MEANINGS OF PROGRAMS, Semantics of
                 Programming Languages. {\bf F.4.1} Theory of
                 Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES,
                 Mathematical Logic. {\bf D.3.2} Software, PROGRAMMING
                 LANGUAGES, Language Classifications, Prolog.",
}

@InProceedings{Copeland:1989:CHA,
  author =       "George Copeland and Tom Keller",
  title =        "A comparison of high-availability media recovery
                 techniques",
  crossref =     "Clifford:1989:PAS",
  pages =        "98--109",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p98-copeland/p98-copeland.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p98-copeland/",
  abstract =     "{\em We compare two high-availability techniques for
                 recovery from media failures in database systems. Both
                 techniques achieve high availability by having two
                 copies of all data and indexes, so that recovery is
                 immediate. ``Mirrored declustering'' spreads two copies
                 of each relation across two identical sets of disks.
                 ``Interleaved declustering'' spreads two copies of each
                 relation across one set of disks while keeping both
                 copies of each tuple on separate disks. Both techniques
                 pay the same costs of doubling storage requirements and
                 requiring updates to be applied to both copies}.
                 \par

                 {\em Mirroring offers greater simplicity and
                 universality. Recovery can be implemented at lower
                 levels of the system software (e.g., the disk
                 controller). For architectures that do not share disks
                 globally, it allows global and local cluster indexes to
                 be independent. Also, mirroring does not require data
                 to be declustered (i.e., spread over multiple disks)}.
                 \par

                 {\em Interleaved declustering offers significant
                 improvements in recovery time, mean time to loss of
                 both copies of some data, throughput during normal
                 operation, and response time during recovery. For all
                 architectures, interleaved declustering enables data to
                 be spread over twice as many disks for improved load
                 balancing. We show how tuning for interleaved
                 declustering is simplified because it is dependent only
                 on a few parameters that are usually well known for a
                 specific workload and system configuration}.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Measurement; Performance;
                 Security",
  subject =      "Information Systems --- Database Management ---
                 General (H.2.0): {\bf Security, integrity, and
                 protection**}; Information Systems --- Database
                 Management --- Physical Design (H.2.2): {\bf Recovery
                 and restart}; Information Systems --- Database
                 Management --- Database Administration (H.2.7): {\bf
                 Logging and recovery}; Data --- Files (E.5): {\bf
                 Backup/recovery}",
}

@InProceedings{Atzeni:1989:UDW,
  author =       "P. Atzeni and R. Torlone",
  title =        "Updating databases in the weak instance model",
  crossref =     "ACM:1989:PPE",
  pages =        "101--109",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/73721/p101-atzeni/p101-atzeni.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/73721/p101-atzeni/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p101-atzeni/",
  abstract =     "{\em Database updates have recently received much more
                 attention than in the past. In this trend, a solid
                 foundation is provided to the problem of updating
                 databases through interfaces based on the weak instance
                 model. Insertions and deletions of tuples are
                 considered}. \par

                 {\em As a preliminary tool, a lattice on states is
                 defined, based on the information content of the
                 various states}. \par

                 {\em Potential results of an insertion are states that
                 contain at least the information in the original state
                 and that in the new tuple. Sometimes there is no
                 potential result, and in the other cases there may be
                 many of them. We argue that the insertion is
                 deterministic if the state that contains the
                 information common to all the potential results (the
                 greatest lower bound, in the lattice framework) is
                 itself a potential result. Effective characterizations
                 for the various cases exist. A symmetric approach is
                 followed for deletions, with fewer cases, since there
                 are always potential results; determinism is
                 characterized consequently}.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Theory",
  keywords =     "design; theory",
  subject =      "{\bf H.2.0} Information Systems, DATABASE MANAGEMENT,
                 General. {\bf F.1.2} Theory of Computation, COMPUTATION
                 BY ABSTRACT DEVICES, Modes of Computation, Parallelism
                 and concurrency. {\bf H.2.4} Information Systems,
                 DATABASE MANAGEMENT, Systems, Query processing. {\bf
                 I.2.1} Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Applications and Expert Systems.",
}

@InProceedings{Tay:1989:AA,
  author =       "Y. C. Tay",
  title =        "Attribute agreement",
  crossref =     "ACM:1989:PPE",
  pages =        "110--119",
  year =         "1989",
  bibdate =      "Wed Oct 25 08:47:34 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/73721/p110-tay/p110-tay.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/73721/p110-tay/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p110-tay/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design; theory",
  subject =      "{\bf G.2.2} Mathematics of Computing, DISCRETE
                 MATHEMATICS, Graph Theory. {\bf H.2.4} Information
                 Systems, DATABASE MANAGEMENT, Systems, Distributed
                 databases. {\bf F.2.2} Theory of Computation, ANALYSIS
                 OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems, Sequencing and scheduling.",
}

@InProceedings{Schneider:1989:PEF,
  author =       "Donovan A. Schneider and David J. DeWitt",
  title =        "A performance evaluation of four parallel join
                 algorithms in a shared-nothing multiprocessor
                 environment",
  crossref =     "Clifford:1989:PAS",
  pages =        "110--121",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p110-schneider/p110-schneider.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p110-schneider/",
  abstract =     "In this paper we analyze and compare four parallel
                 join algorithms. Grace and Hybrid hash represent the
                 class of hash-based join methods, Simple hash
                 represents a looping algorithm with hashing, and our
                 last algorithm is the more traditional sort-merge. The
                 performance of each of the algorithms with different
                 tuple distribution policies, the addition of bit vector
                 filters, varying amounts of main-memory for joining,
                 and non-uniformly distributed join attribute values is
                 studied. The Hybrid hash-join algorithm is found to be
                 superior except when the join attribute values of the
                 inner relation are non-uniformly distributed and memory
                 is limited. In this case, a more conservative algorithm
                 such as the sort-merge algorithm should be used. The
                 Gamma database machine serves as the host for the
                 performance comparison.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Experimentation; Performance",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Distributed databases};
                 Mathematics of Computing --- Numerical Analysis ---
                 General (G.1.0): {\bf Parallel algorithms}; Information
                 Systems --- Database Management --- Systems (H.2.4):
                 {\bf Concurrency}; Data --- Data Storage
                 Representations (E.2): {\bf Hash-table
                 representations}",
}

@InProceedings{Wang:1989:CCT,
  author =       "K. Wang",
  title =        "Can constant-time-maintainability be more practical?",
  crossref =     "ACM:1989:PPE",
  pages =        "120--127",
  year =         "1989",
  bibdate =      "Wed Oct 25 08:47:34 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/73721/p120-wang/p120-wang.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/73721/p120-wang/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p120-wang/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design; theory",
  subject =      "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
                 Logical Design. {\bf F.4.2} Theory of Computation,
                 MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and
                 Other Rewriting Systems, Decision problems. {\bf H.2.4}
                 Information Systems, DATABASE MANAGEMENT, Systems,
                 Query processing.",
}

@InProceedings{Carey:1989:PCC,
  author =       "Michael J. Carey and Miron Livny",
  title =        "Parallelism and concurrency control performance in
                 distributed database machines",
  crossref =     "Clifford:1989:PAS",
  pages =        "122--133",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p122-carey/p122-carey.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p122-carey/",
  abstract =     "While several distributed (or `shared nothing')
                 database machines exist in the form of prototypes or
                 commercial products, and a number of distributed
                 concurrency control algorithms are available, the
                 effect of parallelism on concurrency control
                 performance has received little attention. This paper
                 examines the interplay between parallelism and
                 transaction performance in a distributed database
                 machine context. Four alternative concurrency control
                 algorithms are considered, including two-phase locking,
                 wound-wait, basic timestamp ordering, and optimistic
                 concurrency control. Issues addressed include how
                 performance scales as a function of machine size and
                 the degree to which partitioning the database for
                 intra-transaction parallelism improves performance for
                 the different algorithms. We examine performance from
                 several perspectives, including response time,
                 throughput, and speedup, and we do so over a fairly
                 wide range of system loads. We also examine the
                 performance impact of certain important overhead
                 factors (e.g., communication and process initiation
                 costs) on the four alternative concurrency control
                 algorithms.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Experimentation; Languages; Measurement;
                 Performance; Reliability",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Distributed databases};
                 Mathematics of Computing --- Numerical Analysis ---
                 General (G.1.0): {\bf Parallel algorithms}; Information
                 Systems --- Database Management --- Systems (H.2.4):
                 {\bf Concurrency}; Information Systems --- Database
                 Management --- Languages (H.2.3): {\bf SQL}; Computer
                 Systems Organization --- Performance of Systems (C.4):
                 {\bf Performance attributes}",
}

@InProceedings{Mannila:1989:PAF,
  author =       "H. Mannila and K.-J. Raiha",
  title =        "Practical algorithms for finding prime attributes and
                 testing normal forms",
  crossref =     "ACM:1989:PPE",
  pages =        "128--133",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/73721/p128-mannila/p128-mannila.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/73721/p128-mannila/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p128-mannila/",
  abstract =     "Several decision problems for relational schemas with
                 functional dependencies are computationally hard. Such
                 problems include determining whether an attribute is
                 prime and testing if a schema is in normal form.
                 Algorithms for these problems are needed in database
                 design tools. The problems can be solved by trivial
                 exponential algorithms. Although the size of the
                 instance is usually given by the number of attributes
                 and hence is fairly small, such exponential algorithms
                 are not usable for all design tasks. We give algorithms
                 for these problems whose running time is polynomial in
                 the number of maximal sets not determining an attribute
                 or, equivalently, the number of generators of the
                 family of closed attribute sets. There is theoretical
                 and practical evidence that this quantity is small for
                 the schemas occurring in practice and exponential only
                 for pathological schemas. The algorithms are simple to
                 implement and fast in practice. They are in use in the
                 relational database design tool Design-By-Example.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Theory",
  keywords =     "algorithms; design; theory",
  subject =      "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Data models. {\bf F.4.2} Theory of
                 Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES,
                 Grammars and Other Rewriting Systems, Decision
                 problems. {\bf F.4.1} Theory of Computation,
                 MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical
                 Logic, Computational logic.",
}

@InProceedings{Elkan:1989:DPC,
  author =       "C. Elkan",
  title =        "A decision procedure for conjunctive query
                 disjointness",
  crossref =     "ACM:1989:PPE",
  pages =        "134--139",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/73721/p134-elkan/p134-elkan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/73721/p134-elkan/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p134-elkan/",
  abstract =     "This paper presents an algorithm that decides whether
                 two conjunctive query expressions always describe
                 disjoint sets of tuples. The decision procedure solves
                 an open problem identified by Blakeley, Coburn, and
                 Larson: how to check whether an explicitly stored view
                 relation must be recomputed after an update, taking
                 into account functional dependencies. For
                 nonconjunctive queries, the disjointness problem is
                 {\em NP\/} -hard. For conjunctive queries, the time
                 complexity of the algorithm given cannot be improved
                 unless the reachability problem for directed graphs can
                 be solved in sublinear time. The algorithm is novel in
                 that it combines separate decision procedures for the
                 theory of functional dependencies and for the theory of
                 dense orders. Also, it uses tableaux that are capable
                 of representing all six comparison operators , , =, , ,
                 and .",
  acknowledgement = ack-nhfb,
  generalterms = "Design",
  keywords =     "design",
  subject =      "{\bf F.4.2} Theory of Computation, MATHEMATICAL LOGIC
                 AND FORMAL LANGUAGES, Grammars and Other Rewriting
                 Systems, Decision problems. {\bf F.1.3} Theory of
                 Computation, COMPUTATION BY ABSTRACT DEVICES,
                 Complexity Measures and Classes. {\bf G.2.2}
                 Mathematics of Computing, DISCRETE MATHEMATICS, Graph
                 Theory. {\bf H.2.4} Information Systems, DATABASE
                 MANAGEMENT, Systems, Query processing.",
}

@InProceedings{Kifer:1989:FLH,
  author =       "Michael Kifer and Georg Lausen",
  title =        "{F}-logic: a higher-order language for reasoning about
                 objects, inheritance, and scheme",
  crossref =     "Clifford:1989:PAS",
  pages =        "134--146",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p134-kifer/p134-kifer.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p134-kifer/",
  abstract =     "We propose a database logic which accounts in a clean
                 declarative fashion for most of the ``object-oriented''
                 features such as object identity, complex objects,
                 inheritance, methods, etc. Furthermore, database schema
                 is part of the object language, which allows the user
                 to browse schema and data using the same declarative
                 formalism. The proposed logic has a formal semantics
                 and a sound and complete resolution-based proof
                 procedure, which makes it also computationally
                 attractive.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Languages; Verification",
  subject =      "Software --- Programming Languages --- Language
                 Classifications (D.3.2): {\bf Specialized application
                 languages}; Computing Methodologies --- Artificial
                 Intelligence --- Knowledge Representation Formalisms
                 and Methods (I.2.4): {\bf Semantic networks};
                 Information Systems --- Database Management --- Logical
                 Design (H.2.1): {\bf Data models}; Information Systems
                 --- Database Management --- Languages (H.2.3): {\bf
                 Data description languages (DDL)}; Software ---
                 Programming Languages --- Formal Definitions and Theory
                 (D.3.1): {\bf Semantics}",
}

@InProceedings{Ullman:1989:BBT,
  author =       "J. D. Ullman",
  title =        "Bottom-up beats top-down for datalog",
  crossref =     "ACM:1989:PPE",
  pages =        "140--149",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/73721/p140-ullman/p140-ullman.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/73721/p140-ullman/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p140-ullman/",
  abstract =     "We show that for any safe datalog program {$P$} 1 and
                 any query {$Q$} (predicate of {$P$} 1 with some bound
                 arguments), there is another safe datalog program {$P$}
                 2 that produces the answer to {$Q$} and takes no more
                 time when evaluated by semi-naive evaluation than when
                 {$P$} 1 is evaluated topdown.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Languages; Theory",
  keywords =     "algorithms; design; languages; theory",
  subject =      "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC
                 AND FORMAL LANGUAGES, Mathematical Logic, Lambda
                 calculus and related systems. {\bf H.2.4} Information
                 Systems, DATABASE MANAGEMENT, Systems, Query
                 processing. {\bf H.2.3} Information Systems, DATABASE
                 MANAGEMENT, Languages, Datalog.",
}

@InProceedings{Hull:1989:AOO,
  author =       "Richard Hull and Jianwen Su",
  title =        "On accessing object-oriented databases: expressive
                 power, complexity, and restrictions",
  crossref =     "Clifford:1989:PAS",
  pages =        "147--158",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p147-hull/p147-hull.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p147-hull/",
  abstract =     "A formal framework for studying the expressive power
                 and complexity of OODB queries is developed. Three
                 approaches to modeling sets are articulated and
                 compared. The class of {\em regular\/} OODB schemas
                 supports the explicit representation of set-valued
                 types. Using an {\em object-based\/} semantics for
                 sets, the regular schemas correspond to most
                 implemented OODB systems in the literature; a {\em
                 value-based\/} semantics for sets is also introduced.
                 Without restrictions, both of these approaches support
                 the specification of all computable queries. Assuming
                 that the new operator is prohibited, the query language
                 of the regular OODB schemas under the object-based
                 semantics is complete in PSPACE; and under the
                 value-based semantics it has hyper-exponential
                 complexity. The third approach to modeling sets is
                 given by the {\em algebraic OODB\/} model, in which
                 multi-valued attributes rather than set-valued types
                 are supported. method implementations can use operators
                 stemming from the relational algebra, and do not have
                 side-effects. The query language of algebraic OODBs is
                 more powerful than the relational algebra but has
                 complexity bounded by PTIME. The expressive power and
                 complexity of data access for other variations of OODBs
                 are also considered. Finally, a new relational query
                 language, called {\em algebra\/} + {\em pointwise
                 recursion}, is introduced. This is equivalent to the
                 algebraic OODB language, and can compute generalized
                 transitive closure.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Languages; Theory",
  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}; Software --- Programming Languages ---
                 Formal Definitions and Theory (D.3.1): {\bf Semantics};
                 Information Systems --- Database Management ---
                 Physical Design (H.2.2): {\bf Access methods};
                 Information Systems --- Database Management ---
                 Languages (H.2.3): {\bf Query languages}; Theory of
                 Computation --- Logics and Meanings of Programs ---
                 Semantics of Programming Languages (F.3.2): {\bf
                 Algebraic approaches to semantics}",
}

@InProceedings{Seki:1989:PAT,
  author =       "H. Seki",
  title =        "On the power of {Alexander} templates",
  crossref =     "ACM:1989:PPE",
  pages =        "150--159",
  year =         "1989",
  bibdate =      "Wed Oct 25 08:47:34 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/73721/p150-seki/p150-seki.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/73721/p150-seki/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p150-seki/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design; languages; theory",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing. {\bf I.2.1} Computing
                 Methodologies, ARTIFICIAL INTELLIGENCE, Applications
                 and Expert Systems. {\bf F.1.3} Theory of Computation,
                 COMPUTATION BY ABSTRACT DEVICES, Complexity Measures
                 and Classes. {\bf F.4.1} Theory of Computation,
                 MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical
                 Logic, Lambda calculus and related systems. {\bf H.2.3}
                 Information Systems, DATABASE MANAGEMENT, Languages,
                 Datalog.",
}

@InProceedings{Abiteboul:1989:OIQ,
  author =       "Serge Abiteboul and Paris C. Kanellakis",
  title =        "Object identity as a query language primitive",
  crossref =     "Clifford:1989:PAS",
  pages =        "159--173",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p159-abiteboul/p159-abiteboul.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p159-abiteboul/",
  abstract =     "We demonstrate the power of object identities (oid's)
                 as a database query language primitive. We develop an
                 object-based data model, whose structural part
                 generalizes most of the known complex-object data
                 models: cyclicity is allowed in both its schemas and
                 instances. Our main contribution is the operational
                 part of the data model, the query language IQL, which
                 uses oid's for three critical purposes: (1) to
                 represent data-structures with sharing and cycles, (2)
                 to manipulate sets and (3) to express any computable
                 database query. IQL can be statically type checked, can
                 be evaluated bottom-up and naturally generalizes most
                 popular rule-based database languages. The model can
                 also be extended to incorporate type inheritance,
                 without changes to IQL. Finally, we investigate an
                 analogous value-based data model, whose structural part
                 is founded on regular infinite trees and whose
                 operational part is IQL.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Languages",
  subject =      "Information Systems --- Database Management ---
                 Languages (H.2.3): {\bf Query languages}; Information
                 Systems --- Database Management --- Logical Design
                 (H.2.1): {\bf Data models}; Software --- Programming
                 Languages --- Language Constructs and Features (D.3.3):
                 {\bf Modules, packages}; Software --- Programming
                 Languages --- Formal Definitions and Theory (D.3.1):
                 {\bf Semantics}",
}

@InProceedings{Sagiv:1989:SDQ,
  author =       "Y. Sagiv and M. Y. Vardi",
  title =        "Safety of datalog queries over infinite databases",
  crossref =     "ACM:1989:PPE",
  pages =        "160--171",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/73721/p160-sagiv/p160-sagiv.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/73721/p160-sagiv/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p160-sagiv/",
  abstract =     "A query is {\em safe\/} with respect to a set of
                 constraints if for every database that satisfies the
                 constraints the query is guaranteed to yield a finite
                 set of answers. We study here the safety problem for
                 Datalog programs with respect to {\em finiteness
                 constraints}. We show that safety can be viewed as a
                 combination of two properties: {\em weak safety}, which
                 guarantees the finiteness of intermediate answers, and
                 {\em termination}, which guarantees the finiteness of
                 the evaluation. We prove that while weak safety is
                 decidable, termination is not. We then consider {\em
                 monadic\/} programs, i.e., programs in which all
                 intensional predicates are monadic, and show that
                 safety is decidable in polynomial time for monadic
                 programs. While we do not settle the safety problem, we
                 show that a closely related problem, the decision
                 problem for safety with respect to {\em functional
                 dependencies}, is undecidable even for monadic
                 programs.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Languages; Theory",
  keywords =     "algorithms; design; languages; theory",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing. {\bf F.4.2} Theory of
                 Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES,
                 Grammars and Other Rewriting Systems, Decision
                 problems. {\bf H.2.3} Information Systems, DATABASE
                 MANAGEMENT, Languages, Datalog.",
}

@InProceedings{Ramakrishnan:1989:PTT,
  author =       "R. Ramakrishnan and Y. Sagiv and J. D. Ullman and M.
                 Y. Vardi",
  title =        "Proof-tree transformation theorems and their
                 applications",
  crossref =     "ACM:1989:PPE",
  pages =        "172--181",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/73721/p172-ramakrishnan/p172-ramakrishnan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/73721/p172-ramakrishnan/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p172-ramakrishnan/",
  abstract =     "For certain sets of logical rules, one can demonstrate
                 that for every proof tree there is another tree proving
                 the same fact and having a special form. One technique
                 for detecting such opportunities is to reduce the
                 question to one of conjunctive-query containment. A
                 more powerful technique is to test whether one
                 conjunctive query is contained in the infinite union of
                 conjunctive queries formed by expanding a set of
                 recursive rules. We discuss two applications of these
                 techniques. First, we give tests for commutativity of
                 linear rules. When linear rules commute, we can reduce
                 the complexity of ``counting'' methods for query
                 evaluation from exponential to polynomial;
                 commutativity also implies separability in the sense of
                 Naughton. A second application is the discovery of
                 linear rules that are equivalent to given nonlinear
                 rules.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Theory",
  keywords =     "algorithms; design; theory",
  subject =      "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC
                 AND FORMAL LANGUAGES, Mathematical Logic, Lambda
                 calculus and related systems. {\bf H.2.4} Information
                 Systems, DATABASE MANAGEMENT, Systems, Query
                 processing.",
}

@InProceedings{Chomicki:1989:RSI,
  author =       "Jan Chomicki and Tomasz Imieli{\'n}ski",
  title =        "Relational specifications of infinite query answers",
  crossref =     "Clifford:1989:PAS",
  pages =        "174--183",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p174-chomicki/p174-chomicki.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p174-chomicki/",
  abstract =     "We investigate here functional deductive databases: an
                 extension of DATALOG capable of representing infinite
                 phenomena. Rules in functional deductive databases are
                 Horn and predicates can have arbitrary unary and
                 limited $k$-ary function symbols in one fixed position.
                 This class is known to be decidable. However, least
                 fixpoints of functional rules may be infinite. We
                 present here a method to finitely represent infinite
                 least fixpoints and infinite query answers as {\em
                 relational specifications}. Relational specifications
                 consist of a finite set of tuples and of a finitely
                 specified congruence relation. Our method is applicable
                 to every domain-independent set of functional rules.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Theory",
  subject =      "Mathematics of Computing --- Discrete Mathematics ---
                 Graph Theory (G.2.2): {\bf Graph algorithms}; Theory of
                 Computation --- Computation by Abstract Devices ---
                 Complexity Measures and Classes (F.1.3); Information
                 Systems --- Database Management --- Systems (H.2.4):
                 {\bf Query processing}; Computing Methodologies ---
                 Artificial Intelligence --- Natural Language Processing
                 (I.2.7): {\bf DATALOG}; Computing Methodologies ---
                 Artificial Intelligence --- Deduction and Theorem
                 Proving (I.2.3)",
}

@InProceedings{Saraiya:1989:LNR,
  author =       "Y. P. Saraiya",
  title =        "Linearising nonlinear recursions in polynomial time",
  crossref =     "ACM:1989:PPE",
  pages =        "182--189",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/73721/p182-saraiya/p182-saraiya.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/73721/p182-saraiya/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p182-saraiya/",
  abstract =     "The replacement of nonlinear recursions with
                 equivalent linear recursions is a potentially useful
                 query optimization strategy, since it permits the use
                 of efficient algorithms for the evaluation of linear
                 logic programs. We show that a member of a certain
                 class of bilinear recursions is linearizable in a
                 strong sense if and only if a specific partial proof
                 tree derived from this recursion is contained in a
                 bounded number of partial proof trees generated by the
                 recursion. Further, while each such test of containment
                 between proof trees involves an exponential number of
                 conjunctive-query containment tests, we present
                 syntactic conditions on the recursion that are
                 necessary and sufficient for the containment and
                 verifiable in polynomial time.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Languages; Theory",
  keywords =     "design; languages; 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. {\bf H.2.3} Information Systems,
                 DATABASE MANAGEMENT, Languages, Datalog.",
}

@InProceedings{Sun:1989:SIP,
  author =       "Xian-He Sun and Nabil Kamel and Lionel M. Ni",
  title =        "Solving implication problems in database
                 applications",
  crossref =     "Clifford:1989:PAS",
  pages =        "185--192",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p185-sun/p185-sun.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p185-sun/",
  abstract =     "Computing queries from derived relations, optimizing
                 queries from a group of queries, and updating
                 materialized views are important database problems and
                 have attracted much attention. One thing common to
                 these problems is their demand to quickly solve the
                 implication problem -- given two predicates {$Q$} and
                 ??, can {$Q$} imply ({$Q$})? The implication problem
                 has been solved by converting it into a satisfiability
                 problem. Based on a graph representation, a detailed
                 study of the general implication problem on its own is
                 presented in this paper. We proved that the general
                 implication problem, in which all six comparison
                 operators: =, , , , , , as well as conjunctions and
                 disjunctions are allowed, is NP-hard. In the case when
                 ``'' operators are not allowed in {$Q$} and
                 disjunctions are not allowed in , a polynomial time
                 algorithm is proposed to solve this restricted
                 implication problem. The influence of the ``'' operator
                 and disjunctions are studied. Our theoretical results
                 show that for some special cases the polynomial
                 complexity algorithm can solve the implication problem
                 which allows the ``'' operator or disjunctions in the
                 predicates. Necessary conditions for detecting when the
                 ``'' operator and disjunctions are allowed are also
                 given. These results are very useful in creating
                 heuristic methods.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms",
  subject =      "Information Systems --- Database Management ---
                 Database Applications (H.2.8); Information Systems ---
                 Database Management --- Systems (H.2.4): {\bf
                 Concurrency}; Theory of Computation --- Analysis of
                 Algorithms and Problem Complexity --- Numerical
                 Algorithms and Problems (F.2.1): {\bf Computations on
                 polynomials}; Mathematics of Computing --- Discrete
                 Mathematics --- Graph Theory (G.2.2): {\bf Graph
                 algorithms}",
}

@InProceedings{Brodsky:1989:IMC,
  author =       "A. Brodsky and Y. Sagiv",
  title =        "Inference of monotonicity constraints in datalog
                 programs",
  crossref =     "ACM:1989:PPE",
  pages =        "190--199",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/73721/p190-brodsky/p190-brodsky.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/73721/p190-brodsky/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p190-brodsky/",
  abstract =     "Datalog (i.e., function-free logic) programs with
                 monotonicity constraints on extensional predicates are
                 considered. A monotonicity constraint states that one
                 argument of a predicate is always less than another
                 argument, according to some partial order. Relations of
                 an extensional database are required to satisfy the
                 monotonicity constraints imposed on their predicates.
                 More specifically, a partial order is defined on the
                 domain (i.e., set of constants) of the database, and
                 every tuple of each relation satisfies the monotonicity
                 constraints imposed on its predicate. An algorithm is
                 given for inferring all monotonicity constraints that
                 hold in relations of the intensional database from
                 monotonicity constraints that hold in the extensional
                 database. A complete inference algorithm is also given
                 for disjunctions of monotonicity and equality
                 constraints. It is shown that the inference of
                 monotonicity constraints in programs is a complete
                 problem for exponential time. For linear programs, this
                 problem is complete for polynomial space.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Languages; Theory",
  keywords =     "design; languages; theory",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Datalog. {\bf F.4.1} Theory of Computation,
                 MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical
                 Logic, Lambda calculus and related systems. {\bf I.2.1}
                 Computing Methodologies, ARTIFICIAL INTELLIGENCE,
                 Applications and Expert Systems. {\bf I.2.3} Computing
                 Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and
                 Theorem Proving, Nonmonotonic reasoning and belief
                 revision.",
}

@InProceedings{Bry:1989:TEE,
  author =       "Fran{\c{c}}ois Bry",
  title =        "Towards an efficient evaluation of general queries:
                 quantifier and disjunction processing revisited",
  crossref =     "Clifford:1989:PAS",
  pages =        "193--204",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p193-bry/p193-bry.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p193-bry/",
  abstract =     "{\em Database applications often require to evaluate
                 queries containing quantifiers or disjunctions, e.g.,
                 for handling general integrity constraints. Existing
                 efficient methods for processing quantifiers depart
                 from the relational model as they rely on non-algebraic
                 procedures. Looking at quantified query evaluation from
                 a new angle, we propose an approach to process
                 quantifiers that makes use of relational algebra
                 operators only. Our approach performs in two phases.
                 The first phase normalizes the queries producing a
                 canonical form. This form permits to improve the
                 translation into relational algebra performed during
                 the second phase. The improved translation relies on a
                 new operator - the\/} complement-join - {\em that
                 generalizes the set difference, on algebraic
                 expressions of universal quantifiers that avoid the
                 expensive division operator in many cases, and on a
                 special processing of disjunctions by means of\/}
                 constrained outer-joins. {\em Our method achieves an
                 efficiency at least comparable with that of previous
                 proposals, better in most cases. Furthermore, it is
                 considerably simpler to implement as it completely
                 relies on relational data structures and operators}.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Standardization; Theory",
  subject =      "Information Systems --- Database Management ---
                 Database Applications (H.2.8); Information Systems ---
                 Database Management --- Systems (H.2.4): {\bf Query
                 processing}; Information Systems --- Database
                 Management --- Languages (H.2.3): {\bf Query
                 languages}",
}

@InProceedings{Cohen:1989:WSP,
  author =       "S. Cohen and O. Wolfson",
  title =        "Why a single parallelization strategy is not enough in
                 knowledge bases",
  crossref =     "ACM:1989:PPE",
  pages =        "200--216",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/73721/p200-cohen/p200-cohen.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/73721/p200-cohen/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p200-cohen/",
  abstract =     "We argue that the appropriate parallelization strategy
                 for logic-program evaluation depends on the program
                 being evaluated. Therefore, this paper is concerned
                 with the issues of program-classification, and
                 parallelization-strategies. We propose five
                 parallelization strategies that differ based on the
                 following criteria. Their evaluation cost, the overhead
                 of communication and synchronization among processors,
                 and the programs to which they are applicable. In
                 particular, we start our study with
                 pure-parallelization, i.e., parallelization without
                 overhead. An interesting class-structure of logic
                 programs is demonstrated, when considering amenability
                 to pure-parallelization. The relationship to the NC
                 complexity class is discussed. Then we propose
                 strategies that do incur an overhead, but are optimal
                 in a sense that will be precisely defined. \par

                 This paper makes the initial steps towards a theory of
                 parallel logic-programming.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Languages; Theory",
  keywords =     "design; languages; theory",
  subject =      "{\bf I.2.1} Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Applications and Expert Systems. {\bf
                 F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT
                 DEVICES, Modes of Computation, Parallelism and
                 concurrency. {\bf F.4.1} Theory of Computation,
                 MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical
                 Logic, Lambda calculus and related systems. {\bf H.2.0}
                 Information Systems, DATABASE MANAGEMENT, General.",
}

@InProceedings{Ioannidis:1989:CRR,
  author =       "Yannis E. Ioannidis and Timos K. Sellis",
  title =        "Conflict resolution of rules assigning values to
                 virtual attributes",
  crossref =     "Clifford:1989:PAS",
  pages =        "205--214",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p205-ioannidis/p205-ioannidis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p205-ioannidis/",
  abstract =     "In the majority of research work done on logic
                 programming and deductive databases, it is assumed that
                 the set of rules defined by the user is {\em
                 consistent}, i.e., that no contradictory facts can be
                 inferred by the rules. In this paper, we address the
                 problem of resolving conflicts of rules that assign
                 values to virtual attributes. We devise a general
                 framework for the study of the problem, and we propose
                 an approach that subsumes all previously suggested
                 solutions. Moreover, it suggests several additional
                 solutions, which very often capture the semantics of
                 the data more accurately than the known approaches.
                 Finally, we address the issue of how to index rules so
                 that conflicts are resolved efficiently, i.e., only one
                 of the applicable rules is processed at query time.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Theory",
  subject =      "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};
                 Information Systems --- Database Management ---
                 Languages (H.2.3); Information Systems --- Database
                 Management --- General (H.2.0)",
}

@InProceedings{McCarthy:1989:AAD,
  author =       "Dennis McCarthy and Umeshwar Dayal",
  title =        "The architecture of an active database management
                 system",
  crossref =     "Clifford:1989:PAS",
  pages =        "215--224",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p215-mccarthy/p215-mccarthy.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p215-mccarthy/",
  abstract =     "The HiPAC project is investigating active,
                 time-constrained database management. An active DBMS is
                 one which automatically executes specified actions when
                 specified conditions arise. HiPAC has proposed
                 Event-Condition-Action (ECA) rules as a formalism for
                 active database capabilities. We have also developed an
                 execution model that specifies how these rules are
                 processed in the context of database transactions. The
                 additional functionality provided by ECA rules makes
                 new demands on the design of an active DBMS. In this
                 paper we propose an architecture for an active DBMS
                 that supports ECA rules. This architecture provides new
                 forms of interaction, in support of ECA rules, between
                 application programs and the DBMS. This leads to a new
                 paradigm for constructing database applications.",
  acknowledgement = ack-nhfb,
  generalterms = "Design",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Transaction processing};
                 Information Systems --- Database Management ---
                 Database Applications (H.2.8); Information Systems ---
                 Database Management --- Languages (H.2.3): {\bf SQL};
                 Computing Methodologies --- Artificial Intelligence ---
                 Knowledge Representation Formalisms and Methods
                 (I.2.4): {\bf Representations (procedural and
                 rule-based)}",
}

@InProceedings{Sector:1989:ITM,
  author =       "A. Z. Sector",
  title =        "Invited talk: modular architectures for distributed
                 and databases systems",
  crossref =     "ACM:1989:PPE",
  pages =        "217--224",
  year =         "1989",
  bibdate =      "Thu Mar 12 18:48:02 MST 1998",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p217-sector/",
  acknowledgement = ack-nhfb,
  keywords =     "design; theory",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing. {\bf H.2.6} Information
                 Systems, DATABASE MANAGEMENT, Database Machines. {\bf
                 C.0} Computer Systems Organization, GENERAL, Systems
                 specification methodology. {\bf C.2.0} Computer Systems
                 Organization, COMPUTER-COMMUNICATION NETWORKS,
                 General.",
}

@InProceedings{Spector:1989:ITM,
  author =       "A. Z. Spector",
  title =        "Invited talk: modular architectures for distributed
                 and databases systems",
  crossref =     "ACM:1989:PPE",
  pages =        "217--224",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/73721/p217-spector/p217-spector.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/73721/p217-spector/",
  abstract =     "This paper describes the importance of modularity in
                 systems and lists a number of reasons why systems will
                 become increasingly modular. It describes two strawmen
                 architecture models for systems and distributed
                 databases in order to illustrate the hierarchical
                 decomposition of complex systems. The paper also
                 relates the systems model to the layering achieved in a
                 few systems familiar to the author.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Theory",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Information
                 Systems --- Database Management --- Database Machines
                 (H.2.6); Computer Systems Organization --- General
                 (C.0): {\bf Systems specification methodology};
                 Computer Systems Organization ---
                 Computer-Communication Networks --- General (C.2.0)",
}

@InProceedings{Cohen:1989:CCD,
  author =       "D. Cohen",
  title =        "Compiling complex database transition triggers",
  crossref =     "Clifford:1989:PAS",
  pages =        "225--234",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p225-cohen/p225-cohen.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p225-cohen/",
  abstract =     "This paper presents a language for specifying database
                 updates, queries and rule triggers, and describes how
                 triggers can be compiled into an efficient mechanism.
                 The rule language allows specification of both state
                 and transition constraints as special cases, but is
                 more general than either. The implementation we
                 describe compiles rules and updates independently of
                 each other. Thus rules can be added or deleted without
                 recompiling any update program and vice versa.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Languages",
  subject =      "Information Systems --- Database Management ---
                 Database Applications (H.2.8); Software --- Programming
                 Languages --- Processors (D.3.4): {\bf Compilers};
                 Information Systems --- Database Management ---
                 Languages (H.2.3): {\bf Data manipulation languages
                 (DML)}; Information Systems --- Database Management ---
                 Languages (H.2.3): {\bf Query languages}",
}

@InProceedings{Rotem:1989:CMH,
  author =       "D. Rotem",
  title =        "Clustered multiattribute hash files",
  crossref =     "ACM:1989:PPE",
  pages =        "225--234",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/73721/p225-rotem/p225-rotem.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/73721/p225-rotem/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p225-rotem/",
  abstract =     "Access methods for multidimensional data have
                 attracted much research interest in recent years. In
                 general, the data structures proposed for this problem
                 partition the database into a set of disk pages
                 (buckets). Access to the buckets is provided by
                 searching a directory of some type such as a tree
                 directory or inverted index or by computation of a
                 multiattribute hash function. Examples of the first
                 approach are Multidimensional B-trees[Sch82], K-D-B
                 trees[Rob81] (see also [Sam84] for a survey of these
                 methods) whereas multiattribute hashing methods are
                 described for example in [Rot74],[Aho79],[Riv76] and
                 [Ram83]. In addition, there are also hybrid methods
                 which combine hashing with a directory of some type
                 [Ore84],[Nie84], [Fag79]. \par

                 In all the work mentioned above, the performance is
                 measured in terms of the number of disk accesses made
                 to retrieve the answer without distinguishing whether
                 these are sequential or random. We argue that
                 performance measurements must consider this factor in
                 order to be realistic, especially in the single user
                 environment. Some evidence to support this claim is
                 given in [Sal88, pg. 22] with the IBM 3380 disk drive
                 as an example. For this type of disk, a comparison
                 between accessing $m$ blocks randomly and accessing a
                 contiguous cluster of $m$ blocks is made. The results
                 show that for $m$ = 10, the random access is slower by
                 a factor of about 8 than the clustered one whereas for
                 $m$ = 100 it is slower by a factor of 25. \par

                 Another motivation for this work are optical disks. In
                 this case, there is a big advantage in clustering since
                 the access mechanism on many of these drives is
                 equipped with an adjustable mirror which allows slight
                 deflections of the laser beam. This means that it may
                 be possible to read a complete cluster from a sequence
                 of adjacent tracks beneath the head with a single
                 random seek [Chri88]. \par

                 Our work is inspired by an interesting recent paper
                 [Fal86] which proposes to organize the physical layout
                 of a multiattribute hash file by encoding record
                 signatures using gray code rather than simple binary
                 code. In this way neighboring buckets contain records
                 which differ on a single bit in their signatures. It is
                 then proved that the records which form the answer to a
                 partial match query will tend to be contained in a
                 smaller number of clusters as compared with the binary
                 arrangement. It is also shown that this idea is
                 applicable to many other multiattribute hashing schemes
                 with a small amount of overhead. In addition, it can
                 improve access time to directories of grid type files,
                 extendible hashing and file methods which employ the
                 z-ordering [Ore84].",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Measurement; Performance; Theory",
  keywords =     "design; measurement; performance; theory",
  subject =      "{\bf E.2} Data, DATA STORAGE REPRESENTATIONS,
                 Hash-table representations. {\bf E.5} Data, FILES. {\bf
                 E.1} Data, DATA STRUCTURES. {\bf H.2.7} Information
                 Systems, DATABASE MANAGEMENT, Database Administration,
                 Data dictionary/directory.",
}

@InProceedings{Naughton:1989:EER,
  author =       "J. F. Naughton and R. Ramakrishnan and Y. Sagiv and J.
                 D. Ullman",
  title =        "Efficient evaluation of right-, left-, and
                 multi-linear rules",
  crossref =     "Clifford:1989:PAS",
  pages =        "235--242",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p235-naughton/p235-naughton.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p235-naughton/",
  abstract =     "We present an algorithm for the efficient evaluation
                 of a useful subset of recursive queries. Like the magic
                 sets transformation, the algorithm consists of a
                 rewriting phase followed by semi-naive bottom-up
                 evaluation of the resulting rules. We prove that on a
                 wide range of recursions, this algorithm achieves a
                 factor of ($n$) speedup over magic sets. Intuitively,
                 the transformations in this algorithm achieve their
                 performance by reducing the arity of the recursive
                 predicates in the transformed rules.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Theory",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Theory of
                 Computation --- Mathematical Logic and Formal Languages
                 --- Formal Languages (F.4.3): {\bf Classes defined by
                 grammars or automata}",
}

@InProceedings{Johnson:1989:UBT,
  author =       "T. Johnson and D. Shasha",
  title =        "Utilization of {B}-trees with inserts, deletes and
                 modifies",
  crossref =     "ACM:1989:PPE",
  pages =        "235--246",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/73721/p235-johnson/p235-johnson.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/73721/p235-johnson/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p235-johnson/",
  abstract =     "The utilization of B-tree nodes determines the number
                 of levels in the B-tree and hence its performance.
                 Until now, the only analytical aid to the determination
                 of a B-tree's utilization has been the analysis by Yao
                 and related work. Yao showed that the utilization of
                 B-tree nodes under pure inserts was 69\%. We derive
                 analytically and verify by simulation the utilization
                 of B-tree nodes constructed from $n$ inserts followed
                 by $M$ modifies (where $M ? N$), where each modify is a
                 delete followed by an insert. Assuming that nodes only
                 merge when they are empty (the technique used in most
                 database management systems), we show that the
                 utilization is 39\% as M becomes large. We extend this
                 model to a parameterized mixture of inserts and
                 modifies. Surprisingly, if the modifies are mixed with
                 just 10\% inserts, then the utilization is over 62\%. We
                 also calculated the probability of splitting and
                 merging. We derive a simple rule-of-thumb that
                 accurately calculates the probability of splitting. We
                 present two models for computing this utilization, the
                 more accurate of which remembers items inserted and
                 then deleted in a node --- we call such items ghosts.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Experimentation",
  keywords =     "algorithms; experimentation",
  subject =      "Data --- Data Structures (E.1): {\bf Trees};
                 Information Systems --- Information Storage and
                 Retrieval --- Content Analysis and Indexing (H.3.1):
                 {\bf Indexing methods}",
}

@InProceedings{Larson:1989:FSS,
  author =       "P.-A. Larson and V. Deshpande",
  title =        "A file structure supporting traversal recursion",
  crossref =     "Clifford:1989:PAS",
  pages =        "243--252",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p243-larson/p243-larson.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p243-larson/",
  abstract =     "Traversal recursion is a class of recursive queries
                 where the evaluation of the query involves traversal of
                 a graph or a tree. This limited type of recursion
                 arises in many applications. In this report we
                 investigate a simple file structure that efficiently
                 supports traversal recursion over large, acyclic
                 graphs. The nodes of the graph are sorted in
                 topological order and stored in a B-tree. Hence,
                 traversal of the graph can be done in a single scan.
                 Nodes and edges can also be inserted, deleted, and
                 modified efficiently.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Performance; Theory",
  subject =      "Information Systems --- Information Storage and
                 Retrieval --- Information Storage (H.3.2): {\bf File
                 organization}; Mathematics of Computing --- Discrete
                 Mathematics --- Graph Theory (G.2.2): {\bf Graph
                 algorithms}; Mathematics of Computing --- Discrete
                 Mathematics --- Graph Theory (G.2.2): {\bf Trees};
                 Information Systems --- Database Management --- Systems
                 (H.2.4): {\bf Query processing}",
}

@InProceedings{Faloutsos:1989:FSK,
  author =       "C. Faloutsos and S. Roseman",
  title =        "Fractals for secondary key retrieval",
  crossref =     "ACM:1989:PPE",
  pages =        "247--252",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/73721/p247-faloutsos/p247-faloutsos.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/73721/p247-faloutsos/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p247-faloutsos/",
  abstract =     "In this paper we propose the use of fractals and
                 especially the Hilbert curve, in order to design good
                 distance-preserving mappings. Such mappings improve the
                 performance of secondary-key- and spatial- access
                 methods, where multi-dimensional points have to be
                 stored on a 1-dimensional medium (e.g., disk). Good
                 clustering reduces the number of disk accesses on
                 retrieval, improving the response time. Our experiments
                 on range queries and nearest neighbor queries showed
                 that the proposed Hilbert curve achieves better
                 clustering than older methods (``bit-shuffling'', or
                 Peano curve), for every situation we tried.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Experimentation; Performance; Theory",
  keywords =     "design; experimentation; performance; theory",
  subject =      "{\bf H.2.2} Information Systems, DATABASE MANAGEMENT,
                 Physical Design, Access methods. {\bf H.3.3}
                 Information Systems, INFORMATION STORAGE AND RETRIEVAL,
                 Information Search and Retrieval. {\bf H.2.4}
                 Information Systems, DATABASE MANAGEMENT, Systems,
                 Query processing.",
}

@InProceedings{Faloutsos:1989:DUE,
  author =       "C. Faloutsos and D. Metaxas",
  title =        "Declustering using error correcting codes",
  crossref =     "ACM:1989:PPE",
  pages =        "253--258",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/73721/p253-faloutsos/p253-faloutsos.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/73721/p253-faloutsos/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p253-faloutsos/",
  abstract =     "The problem examined is to distribute a binary
                 Cartesian product file on multiple disks to maximize
                 the parallelism for partial match queries. Cartesian
                 product files appear as a result of some secondary key
                 access methods, such as the multiattribute hashing
                 [10], the grid file [6] etc.. For the binary case, the
                 problem is reduced into grouping the 2 $n$ binary
                 strings on $n$ bits in $m$ groups of unsimilar strings.
                 The main idea proposed in this paper is to group the
                 strings such that the group forms an Error Correcting
                 Code (ECC). This construction guarantees that the
                 strings of a given group will have large Hamming
                 distances, i.e., they will differ in many bit
                 positions. Intuitively, this should result into good
                 declustering. We briefly mention previous heuristics
                 for declustering, we describe how exactly to build a
                 declustering scheme using an ECC, and we prove a
                 theorem that gives a necessary condition for our method
                 to be optimal. Analytical results show that our method
                 is superior to older heuristics, and that it is very
                 close to the theoretical (non-tight) bound.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Performance",
  keywords =     "design; performance",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing. {\bf E.5} Data, FILES. {\bf
                 E.2} Data, DATA STORAGE REPRESENTATIONS, Hash-table
                 representations. {\bf H.2.2} Information Systems,
                 DATABASE MANAGEMENT, Physical Design, Access methods.",
}

@InProceedings{Agrawal:1989:EMT,
  author =       "R. Agrawal and A. Borgida and H. V. Jagadish",
  title =        "Efficient management of transitive relationships in
                 large data and knowledge bases",
  crossref =     "Clifford:1989:PAS",
  pages =        "253--262",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p253-agrawal/p253-agrawal.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p253-agrawal/",
  abstract =     "We argue that accessing the transitive closure of
                 relationships is an important component of both
                 databases and knowledge representation systems in
                 Artificial Intelligence. The demands for efficient
                 access and management of large relationships motivate
                 the need for explicitly storing the transitive closure
                 in a compressed and local way, while allowing updates
                 to the base relation to be propagated incrementally. We
                 present a transitive closure compression technique,
                 based on labeling spanning trees with numeric
                 intervals, and provide both analytical and empirical
                 evidence of its efficacy, including a proof of
                 optimality.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Languages; Verification",
  subject =      "Computing Methodologies --- Artificial Intelligence
                 --- Knowledge Representation Formalisms and Methods
                 (I.2.4): {\bf Representations (procedural and
                 rule-based)}; Information Systems --- Database
                 Management --- Systems (H.2.4): {\bf Query processing};
                 Mathematics of Computing --- Discrete Mathematics ---
                 Graph Theory (G.2.2): {\bf Graph algorithms};
                 Mathematics of Computing --- Discrete Mathematics ---
                 Graph Theory (G.2.2): {\bf Trees}; Information Systems
                 --- Database Management --- Languages (H.2.3): {\bf
                 Query languages}",
}

@InProceedings{Weihl:1989:IRC,
  author =       "W. E. Weihl",
  title =        "The impact of recovery on concurrency control",
  crossref =     "ACM:1989:PPE",
  pages =        "259--269",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/73721/p259-weihl/p259-weihl.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/73721/p259-weihl/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p259-weihl/",
  abstract =     "It is widely recognized by practitioners that
                 concurrency control and recovery for transaction
                 systems interact in subtle ways. In most theoretical
                 work, however, concurrency control and recovery are
                 treated as separate, largely independent problems. In
                 this paper we investigate the interactions between
                 concurrency control and recovery. We consider two
                 general recovery methods for abstract data types,
                 update-in-place and deferred-update. While each
                 requires operations to conflict if they do not
                 ``commute,'' the two recovery methods require subtly
                 different notions of commutativity. We give a precise
                 characterization of the conflict relations that work
                 with each recovery method, and show that each permits
                 conflict relations that the other does not. Thus, the
                 two recovery methods place incomparable constraints on
                 concurrency control. Our analysis applies to arbitrary
                 abstract data types, including those with operations
                 that may be partial or non-deterministic.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Theory",
  keywords =     "algorithms; design; theory",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Concurrency. {\bf H.2.4} Information Systems,
                 DATABASE MANAGEMENT, Systems, Transaction processing.
                 {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language
                 Constructs and Features, Abstract data types. {\bf
                 F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT
                 DEVICES, Modes of Computation, Alternation and
                 nondeterminism.",
}

@InProceedings{Gyssens:1989:GBA,
  author =       "M. Gyssens and J. Paredaens and D. van Gucht",
  title =        "A grammar-based approach towards unifying hierarchical
                 data models",
  crossref =     "Clifford:1989:PAS",
  pages =        "263--272",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p263-gyssens/p263-gyssens.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p263-gyssens/",
  abstract =     "A simple model for representing the hierarchical
                 structure of information is proposed. This model,
                 called the grammatical model, is based on trees that
                 are generated by grammars; the grammars describe the
                 hierarchy of the information represented by the trees.
                 Two transformation languages, an algebra and a
                 calculus, are presented and shown to be equally
                 expressive.",
  acknowledgement = ack-nhfb,
  subject =      "Information Systems --- Database Management ---
                 Logical Design (H.2.1): {\bf Data models}; Mathematics
                 of Computing --- Discrete Mathematics --- Graph Theory
                 (G.2.2): {\bf Trees}; Information Systems --- Database
                 Management --- Database Applications (H.2.8)",
}

@InProceedings{Fu:1989:CCN,
  author =       "A. Fu and T. Kameda",
  title =        "Concurrency control of nested transactions accessing
                 {B}-trees",
  crossref =     "ACM:1989:PPE",
  pages =        "270--285",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/73721/p270-fu/p270-fu.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/73721/p270-fu/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p270-fu/",
  abstract =     "This paper presents a concurrency control algorithm
                 for nested transactions accessing B-trees. It combines
                 the idea of B-link tree with that of resilient 2-phase
                 locking [Mos85b]. The I/O automaton model is used in
                 the specification and proofs of correctness of the
                 system. We define ``strongly-serially correct''
                 schedules and use this property as our correctness
                 criterion.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Languages; Theory",
  keywords =     "algorithms; languages; theory",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Concurrency. {\bf E.1} Data, DATA STRUCTURES,
                 Trees. {\bf H.2.4} Information Systems, DATABASE
                 MANAGEMENT, Systems, Transaction processing. {\bf E.2}
                 Data, DATA STORAGE REPRESENTATIONS, Hash-table
                 representations. {\bf F.3.2} Theory of Computation,
                 LOGICS AND MEANINGS OF PROGRAMS, Semantics of
                 Programming Languages. {\bf F.1.1} Theory of
                 Computation, COMPUTATION BY ABSTRACT DEVICES, Models of
                 Computation, Automata.",
}

@InProceedings{Colby:1989:RAQ,
  author =       "Latha S. Colby",
  title =        "A recursive algebra and query optimization for nested
                 relations",
  crossref =     "Clifford:1989:PAS",
  pages =        "273--283",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p273-colby/p273-colby.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p273-colby/",
  abstract =     "{\em The nested relational model provides a better way
                 to represent complex objects than the (flat) relational
                 model, by allowing relations to have relation-valued
                 attributes. A recursive algebra for nested relations
                 that allows tuples at all levels of nesting in a nested
                 relation to be accessed and modified without any
                 special navigational operators and without having to
                 flatten the nested relation has been developed. In this
                 algebra, the operators of the nested relational algebra
                 are extended with recursive definitions so that they
                 can be applied not only to relations but also to
                 subrelations of a relation. In this paper, we show that
                 queries are more efficient and succinct when expressed
                 in the recursive algebra than in languages that require
                 restructuring in order to access subrelations of
                 relations. We also show that most of the query
                 optimization techniques that have been developed for
                 the relational algebra can be easily extended for the
                 recursive algebra and that queries are more easily
                 optimizable when expressed in the recursive algebra
                 than when they are expressed in languages like the
                 non-recursive algebra}.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design",
  subject =      "Information Systems --- Database Management ---
                 Logical Design (H.2.1): {\bf Data models}; Information
                 Systems --- Database Management --- Systems (H.2.4):
                 {\bf Query processing}; Mathematics of Computing ---
                 Numerical Analysis --- Optimization (G.1.6)",
}

@InProceedings{Tansel:1989:NHR,
  author =       "A. U. Tansel and L. Garnett",
  title =        "Nested historical relations",
  crossref =     "Clifford:1989:PAS",
  pages =        "284--294",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p284-tansel/p284-tansel.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p284-tansel/",
  abstract =     "The paper extends nested relations for managing
                 temporal variation of complex objects. It combines the
                 research in temporal databases and nested relations for
                 nontraditional database applications. The basic
                 modelling construct is a temporal atom as an attribute
                 value. A temporal atom consists of two components, a
                 value and temporal set which is a set of times denoting
                 the validity period of the value. We define algebra
                 operations for nested historical relations. Data
                 redundancy in nested historical relations is also
                 discussed and criteria for well-structured nested
                 relations are established.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design",
  subject =      "Information Systems --- Database Management ---
                 Database Applications (H.2.8); Information Systems ---
                 Database Management --- Logical Design (H.2.1): {\bf
                 Data models}; Information Systems --- Information
                 Storage and Retrieval --- Information Storage (H.3.2):
                 {\bf File organization}",
}

@InProceedings{Bonner:1989:HDN,
  author =       "A. J. Bonner",
  title =        "Hypothetical datalog negation and linear recursion",
  crossref =     "ACM:1989:PPE",
  pages =        "286--300",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/73721/p286-bonner/p286-bonner.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/73721/p286-bonner/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p286-bonner/",
  abstract =     "This paper examines an extension of Horn logic in
                 which rules can add entries to a database
                 hypothetically. Several researchers have developed
                 logical systems along these lines, but the complexity
                 and expressibility of such logics is only now being
                 explored. It has been shown, for instance, that the
                 data-complexity of these logics is {\em PSPACE\/}
                 -complete in the function-free, predicate case. This
                 paper extends this line of research by developing
                 syntactic restrictions with lower complexity. These
                 restrictions are based on two ideas from Horn-clause
                 logic: {\em linear recursion\/} and {\em stratified
                 negation}. In particular, a notion of stratification is
                 developed in which negation-as-failure alternates with
                 linear recursion. The complexity of such rulebases
                 depends on the number of layers of stratification. The
                 result is a hierarchy of syntactic classes which
                 corresponds exactly in the polynomial-time hierarchy of
                 complexity classes. In particular, rulebases with $k$
                 strata are data-complete for {$P$} $h$ . Furthermore,
                 these rulebases provide a complete characterization of
                 the relational queries in {$P$} $h$ . That is, any
                 query whose graph is in {$P$} $h$ can be represented as
                 a set of hypothetical rules with $k$ strata. Unlike
                 other expressibility results in the literature, this
                 result does not require the data domain to be linearly
                 ordered.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Performance; Theory",
  keywords =     "algorithms; design; performance; theory",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Datalog. {\bf F.4.1} Theory of Computation,
                 MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical
                 Logic, Lambda calculus and related systems. {\bf G.2.2}
                 Mathematics of Computing, DISCRETE MATHEMATICS, Graph
                 Theory. {\bf F.1.3} Theory of Computation, COMPUTATION
                 BY ABSTRACT DEVICES, Complexity Measures and Classes.
                 {\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing.",
}

@InProceedings{Orenstein:1989:RSD,
  author =       "J. A. Orenstein",
  title =        "Redundancy in spatial databases",
  crossref =     "Clifford:1989:PAS",
  pages =        "295--305",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p295-orenstein/p295-orenstein.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p295-orenstein/",
  abstract =     "Spatial objects other than points and boxes can be
                 stored in spatial indexes, but the techniques usually
                 require the use of approximations that can be
                 arbitrarily bad. This leads to poor performance and
                 highly inaccurate responses to spatial queries. The
                 situation can be improved by storing some objects in
                 the index redundantly. Most spatial indexes permit no
                 flexibility in adjusting the amount of redundancy.
                 Spatial indexes based on z-order permit this
                 flexibility. Accuracy of the query response increases
                 with redundancy, (there is a ``diminishing return''
                 effect). Search time, as measured by disk accesses
                 first decreases and then increases with redundancy.
                 There is, therefore, an optimal amount of redundancy
                 (for a given data set). The optimal use of redundancy
                 for z-order is explored through analysis of the z-order
                 search algorithm and through experiments.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Transaction processing};
                 Information Systems --- Database Management ---
                 Physical Design (H.2.2): {\bf Access methods};
                 Information Systems --- Database Management --- Systems
                 (H.2.4): {\bf Query processing}",
}

@InProceedings{Lakshmanan:1989:IPG,
  author =       "V. S. Lakshmanan and A. O. Mendelzon",
  title =        "Inductive pebble games and the expressive power of
                 datalog",
  crossref =     "ACM:1989:PPE",
  pages =        "301--310",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/73721/p301-lakshmanan/p301-lakshmanan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/73721/p301-lakshmanan/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p301-lakshmanan/",
  abstract =     "As an alternative to logic-based query languages for
                 recursive queries, we are investigating a graphical
                 query language called {$G$} +, which allows, among
                 other things, easy formulation of certain queries
                 involving simple paths in directed graphs. This led us
                 to study whether such queries are expressible in
                 DATALOG, the language of function-free Horn clauses.
                 Since some {$G$} + queries are NP-hard, and all DATALOG
                 queries are polynomial time computable, the answer
                 appears to be negative. However, it would be
                 interesting to have proof techniques and tools for
                 settling such questions with certainty. The objective
                 of this paper is the development of one such tool, {\em
                 inductive pebble games}, based on a normal form for
                 DATALOG programs derived here, and its relationship to
                 Alternating Turing Machine computations. As an
                 application, we sketch a proof that the query ``find
                 all pairs of nodes connected by a directed simple path
                 of even length'' cannot be expressed in DATALOG.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Languages; Performance",
  keywords =     "design; languages; performance",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Datalog. {\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, Lambda calculus
                 and related systems. {\bf G.2.2} Mathematics of
                 Computing, DISCRETE MATHEMATICS, Graph Theory.",
}

@InProceedings{Christodoulakis:1989:RPV,
  author =       "Stavros Christodoulakis and Daniel Alexander Ford",
  title =        "Retrieval performance versus disc space utilization on
                 {WORM} optical discs",
  crossref =     "Clifford:1989:PAS",
  pages =        "306--314",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p306-christodoulakis/p306-christodoulakis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p306-christodoulakis/",
  abstract =     "Steady progress in the development of optical disc
                 technology over the past decade has brought it to the
                 point where it is beginning to compete directly with
                 magnetic disc technology. WORM optical discs in
                 particular, which permanently register information on
                 the disc surface, have significant advantages over
                 magnetic technology for applications that are mainly
                 archival in nature but require the ability to do
                 frequent on-line insertions. \par

                 In this paper, we propose a class of access methods
                 that use rewritable storage for the temporary buffering
                 of insertions to data sets stored on WORM optical discs
                 and we examine the relationship between the retrieval
                 performance from WORM optical discs and the utilization
                 of disc storage space when one of these organizations
                 is employed. We describe the performance trade off as
                 one of fast sequential retrieval of the contents of a
                 block versus wasted space owing to data replication. A
                 model of a specific instance of such an organization (a
                 buffered hash file scheme) is described that allows for
                 the specification of retrieval performance objectives.
                 Alternative strategies for managing data replication
                 that allow trade offs between higher consumption rates
                 and better average retrieval performance are also
                 described. We then provide an expected value analysis
                 of the amount of disc space that must be consumed on a
                 WORM disc to meet specified performance limits. The
                 analysis is general enough to allow easy extension to
                 other types of buffered files systems for WORM optical
                 discs.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Performance",
  subject =      "Information Systems --- Database Management ---
                 Physical Design (H.2.2): {\bf Access methods};
                 Information Systems --- Information Storage and
                 Retrieval --- Information Storage (H.3.2): {\bf File
                 organization}; Information Systems --- Information
                 Storage and Retrieval --- Information Search and
                 Retrieval (H.3.3): {\bf Retrieval models}",
}

@InProceedings{Cosmadakis:1989:FOE,
  author =       "S. S. Cosmadakis",
  title =        "On the first-order expressibility of recursive
                 queries",
  crossref =     "ACM:1989:PPE",
  pages =        "311--323",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/73721/p311-cosmadakis/p311-cosmadakis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/73721/p311-cosmadakis/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p311-cosmadakis/",
  abstract =     "A Datalog program is {\em bounded\/} iff it is
                 equivalent to a recursion-free Datalog program. We show
                 that, for some classes of Datalog programs,
                 expressibility in first-order query languages coincides
                 with boundedness. Our results imply that testing
                 first-order expressibility is undecidable for binary
                 programs, decidable for monadic programs, and complete
                 for 0 2.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Languages; Performance",
  keywords =     "design; languages; performance",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Information
                 Systems --- Database Management --- Languages (H.2.3):
                 {\bf Datalog}; Information Systems --- Database
                 Management --- Languages (H.2.3): {\bf Query
                 languages}; Theory of Computation --- Mathematical
                 Logic and Formal Languages --- Mathematical Logic
                 (F.4.1)",
}

@InProceedings{Lomet:1989:AMM,
  author =       "David Lomet and Betty Salzberg",
  title =        "Access methods for multiversion data",
  crossref =     "Clifford:1989:PAS",
  pages =        "315--324",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p315-lomet/p315-lomet.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p315-lomet/",
  abstract =     "We present an access method designed to provide a
                 single integrated index structure for a versioned
                 timestamped database with a non-deletion policy.
                 Historical data (superceded versions) is stored
                 separately from current data. Our access method is
                 called the {\em Time-Split B-tree}. It is an index
                 structure based on Malcolm Easton's Write Once B-tree.
                 \par

                 The Write Once B-tree was developed for data stored
                 entirely on a Write-Once Read-Many or {\em WORM\/}
                 optical disk. The Time-Split B-tree differs from the
                 Write Once B-tree in the following ways: \par

                 Current data {\em must\/} be stored on an {\em
                 erasable\/} random-access device. \par

                 Historical data {\em may\/} be stored on {\em any\/}
                 random-access device, including WORMs, erasable optical
                 disks, and magnetic disks. The point is to use a faster
                 and more expensive device for the current data and a
                 slower cheaper device for the historical data. \par

                 The splitting policies have been changed to reduce
                 redundancy in the structure--the option of pure key
                 splits as in B + -trees and a choice of split times for
                 time-based splits enable this performance enhancement.
                 \par

                 When data is migrated from the current to the
                 historical database, it is consolidated and appended to
                 the end of the historical database, allowing for high
                 space utilization in WORM disk sectors. \par

                 ",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design",
  subject =      "Information Systems --- Information Storage and
                 Retrieval --- Content Analysis and Indexing (H.3.1):
                 {\bf Indexing methods}; Information Systems ---
                 Information Storage and Retrieval --- Information
                 Storage (H.3.2); Information Systems --- Database
                 Management --- Physical Design (H.2.2): {\bf Access
                 methods}",
}

@InProceedings{Dublish:1989:EBA,
  author =       "P. Dublish and S. N. Maheshwari",
  title =        "Expressibility of bounded-arity fixed-point query
                 hierarchies",
  crossref =     "ACM:1989:PPE",
  pages =        "324--335",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/73721/p324-dublish/p324-dublish.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/73721/p324-dublish/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p324-dublish/",
  abstract =     "The expressibility of bounded-arity query hierarchies
                 resulting from the extension of first-order logic by
                 the least fixed-point, inductive fixed-point and
                 generalized fixed-point operators is studied. In each
                 case, it is shown that increasing the arity of the
                 predicate variable from k to k+1 always allows some
                 more k-ary predicates to be expressed. Further, k-ary
                 inductive fixed-points are shown to be more expressive
                 than k-ary least fixed-points and k-ary generalized
                 fixed-points are shown to be more expressive than k-ary
                 inductive fixed-points.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Languages; Theory",
  keywords =     "algorithms; design; languages; theory",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Information
                 Systems --- Database Management --- Languages (H.2.3):
                 {\bf Query languages}; Theory of Computation ---
                 Mathematical Logic and Formal Languages ---
                 Mathematical Logic (F.4.1): {\bf Lambda calculus and
                 related systems}; Mathematics of Computing --- Discrete
                 Mathematics --- Graph Theory (G.2.2)",
}

@InProceedings{Shekita:1989:PET,
  author =       "Eugene J. Shekita and Michael J. Carey",
  title =        "Performance enhancement through replication in an
                 object-oriented {DBMS}",
  crossref =     "Clifford:1989:PAS",
  pages =        "325--336",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p325-shekita/p325-shekita.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p325-shekita/",
  abstract =     "In this paper we describe how replicated data can be
                 used to speedup query processing in an object-oriented
                 database system. The general idea is to use replicated
                 data to eliminate some of the functional joins that
                 would otherwise be required for query processing. We
                 refer to our technique for replicating data as {\em
                 field replication\/} because it allows individual data
                 fields to be selectively replicated. In the paper we
                 describe how field replication can be specified at the
                 data model level and we present storage-level
                 mechanisms to efficiently support it. We also present
                 an analytical cost model to give some feel for how
                 beneficial field replication can be and the
                 circumstances under which it breaks down. While field
                 replication is a relatively simple notion, the analysis
                 shows that it can provide significant performance gains
                 in many situations.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Performance; 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}",
}

@InProceedings{Kedem:1989:RDB,
  author =       "Z. M. Kedem and A. Tuzhilin",
  title =        "Relational database behavior: utilizing relational
                 discrete event systems and models",
  crossref =     "ACM:1989:PPE",
  pages =        "336--346",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/73721/p336-kedem/p336-kedem.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/73721/p336-kedem/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p336-kedem/",
  abstract =     "Behavior of relational databases is studied within the
                 framework of {\em Relational Discrete Event Systems\/}
                 (RDE-Ses) and {\em Models\/} (RDEMs). Production system
                 and recurrence equation RDEMs are introduced, and their
                 expressive powers are compared. Non-deterministic
                 behavior is defined for both RDEMs and the expressive
                 power of deterministic and non-deterministic production
                 rule programs is also compared. This comparison shows
                 that non-determinism increases expressive power of
                 production systems. A formal concept of a production
                 system interpreter is defined, and several specific
                 interpreters are proposed. One interpreter, called {\em
                 parallel deterministic}, is shown to be better than
                 others in many respects, including the conflict
                 resolution module of OPS5.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Performance; Theory",
  keywords =     "algorithms; design; performance; theory",
  subject =      "{\bf H.2.6} Information Systems, DATABASE MANAGEMENT,
                 Database Machines. {\bf F.1.2} Theory of Computation,
                 COMPUTATION BY ABSTRACT DEVICES, Modes of Computation,
                 Alternation and nondeterminism. {\bf H.2.3} Information
                 Systems, DATABASE MANAGEMENT, Languages, Query
                 languages. {\bf H.2.4} Information Systems, DATABASE
                 MANAGEMENT, Systems.",
}

@InProceedings{Kim:1989:COR,
  author =       "Won Kim and Elisa Bertino and Jorge F. Garza",
  title =        "Composite objects revisited",
  crossref =     "Clifford:1989:PAS",
  pages =        "337--347",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p337-kim/p337-kim.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p337-kim/",
  abstract =     "In object-oriented systems, an object may recursively
                 reference any number of other objects. The references,
                 however, do not capture any special relationships
                 between objects. An important semantic relationship
                 which may be superimposed on a reference is the
                 IS-PART-OF relationship between a pair of objects. A
                 set of objects related by the IS-PART-OF relationship
                 is collectively called a composite object. \par

                 An earlier paper [KIM87b] presented a model of
                 composite objects which has been implemented in the
                 ORION object-oriented database system at MCC. Although
                 the composite-object feature has been found quite
                 useful, the model suffers from a number of serious
                 shortcomings, primarily because it overloads a number
                 of orthogonal semantics on the references. In this
                 paper, first we present a more general model of
                 composite objects which does not suffer from these
                 shortcomings. Further, [KIM87b] made an important
                 contribution by exploring the use of composite objects
                 as a unit for versions, physical clustering, and
                 concurrency control. The extended model of composite
                 objects necessitates non-trivial changes to the results
                 of [KIM87b]. This paper describes the new results on
                 the use of composite objects as a unit of not only
                 versions, physical clustering and concurrency control,
                 but also authorization.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Theory",
  subject =      "Theory of Computation --- Logics and Meanings of
                 Programs --- Semantics of Programming Languages
                 (F.3.2); 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{Hull:1989:USI,
  author =       "R. Hull and J. Su",
  title =        "Untyped sets, invention, and computable queries",
  crossref =     "ACM:1989:PPE",
  pages =        "347--359",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/73721/p347-hull/p347-hull.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/73721/p347-hull/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p347-hull/",
  abstract =     "Conventional database query languages are considered
                 in the context of untyped sets. The algebra without
                 while has the expressive power of the typed complex
                 object algebra. The algebra plus while, and COL with
                 untyped sets (under stratified semantics or
                 inflationary semantics) have the power of the
                 computable queries. The calculus has power beyond the
                 computable queries; and is characterized using the
                 typed complex object calculus with invention. The
                 Bancilhon-Khoshafian calculus is also discussed. A
                 technical tool, called ``generic Turing machine'', is
                 introduced and used in several of the proofs.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Performance; Theory",
  keywords =     "design; performance; theory",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing. {\bf F.3.1} Theory of
                 Computation, LOGICS AND MEANINGS OF PROGRAMS,
                 Specifying and Verifying and Reasoning about Programs,
                 Logics of programs. {\bf H.2.1} Information Systems,
                 DATABASE MANAGEMENT, Logical Design, Data models.",
}

@InProceedings{Chang:1989:EIS,
  author =       "E. E. Chang and R. H. Katz",
  title =        "Exploiting inheritance and structure semantics for
                 effective clustering and buffering in an
                 object-oriented {DBMS}",
  crossref =     "Clifford:1989:PAS",
  pages =        "348--357",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p348-chang/p348-chang.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p348-chang/",
  abstract =     "Object-oriented databases provide new kinds of data
                 semantics in terms of inheritance and structural
                 relationships. This paper examines how to use these
                 additional semantics to obtain more effective object
                 buffering and clustering. We use the information
                 collected from real-world object-oriented applications,
                 the Berkeley CAD Group's OCT design tools, as the basis
                 for a simulation model with which to investigate
                 alternative buffering and clustering strategies.
                 Observing from our measurements that real CAD
                 applications exhibit high data read to write ratios, we
                 propose a run-time clustering algorithm whose initial
                 evaluation indicates that system response time can be
                 improved by a factor of 200\% when the read/write ratio
                 is high. We have also found it useful to limit the
                 amount of I/O allowed to the clustering algorithm as it
                 examines candidate pages for clustering at run-time.
                 Basically, there is little performance distinction
                 between limiting reclustering to a few I/Os or many, so
                 a low limit on I/O appears to be acceptable. We also
                 examine, under a variety of workload assumptions,
                 context-sensitive buffer replacement policies with
                 alternative prefetching policies.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Performance",
  subject =      "Computer Applications --- Computer-Aided Engineering
                 (J.6): {\bf Computer-aided design (CAD)}; Theory of
                 Computation --- Logics and Meanings of Programs ---
                 Semantics of Programming Languages (F.3.2); Software
                 --- Programming Languages --- Language Constructs and
                 Features (D.3.3): {\bf Abstract data types};
                 Information Systems --- Database Management --- Systems
                 (H.2.4)",
}

@InProceedings{Graefe:1989:DQE,
  author =       "G. Graefe and K. Ward",
  title =        "Dynamic query evaluation plans",
  crossref =     "Clifford:1989:PAS",
  pages =        "358--366",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p358-graefe/p358-graefe.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p358-graefe/",
  abstract =     "In most database systems, a query embedded in a
                 program written in a conventional programming language
                 is optimized when the program is compiled. The query
                 optimizer must make assumptions about the values of the
                 program variables that appear as constants in the
                 query, the resources that can be committed to query
                 evaluation, and the data in the database. The
                 optimality of the resulting query evaluation plan
                 depends on the validity of these assumptions. If a
                 query evaluation plan is used repeatedly over an
                 extended period of time, it is important to determine
                 when reoptimization is necessary. Our work aims at
                 developing criteria when reoptimization is required,
                 how these criteria can be implemented efficiently, and
                 how reoptimization can be avoided by using a new
                 technique called {\em dynamic query evaluation plans}.
                 We experimentally demonstrate the need for dynamic
                 plans and outline modifications to the EXODUS optimizer
                 generator required for creating dynamic query
                 evaluation plans.",
  acknowledgement = ack-nhfb,
  generalterms = "Languages; Performance",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Software ---
                 Programming Languages --- Processors (D.3.4): {\bf
                 Optimization}; Software --- Programming Languages ---
                 Language Classifications (D.3.2): {\bf EXODUS}",
}

@InProceedings{Lecluse:1989:MCS,
  author =       "C. L{\'e}cluse and P. Richard",
  title =        "Modeling complex structures in object-oriented logic
                 programming",
  crossref =     "ACM:1989:PPE",
  pages =        "360--368",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/73721/p360-lecluse/p360-lecluse.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/73721/p360-lecluse/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p360-lecluse/",
  abstract =     "In this paper, we present a type model for
                 object-oriented databases. Most object-oriented
                 databases only provide users with flat objects whose
                 structure is a record of other objects. In order to
                 have a powerful expression power, an object-oriented
                 database should not only provide objects but also
                 complex values recursively built using the set, tuple
                 and disjunctive constructors. Our type model presents
                 two notions: that of classes whose instances are
                 objects with identity and that of types whose instances
                 are complex values. The two notions are mixed in that
                 an object is modeled as a pair containing an identifier
                 and a value, and a value is a complex structure which
                 contains objects and values. We define in this context
                 the notions of subtyping and provide a set inclusion
                 semantics for subtyping.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Performance; Theory",
  keywords =     "algorithms; design; performance; theory",
  subject =      "{\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS
                 OF PROGRAMS, Studies of Program Constructs, Type
                 structure. {\bf H.2.0} Information Systems, DATABASE
                 MANAGEMENT, General. {\bf F.3.2} Theory of Computation,
                 LOGICS AND MEANINGS OF PROGRAMS, Semantics of
                 Programming Languages. {\bf F.4.1} Theory of
                 Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES,
                 Mathematical Logic, Lambda calculus and related
                 systems.",
}

@InProceedings{Swami:1989:OLJ,
  author =       "A. Swami",
  title =        "Optimization of large join queries: combining
                 heuristics and combinatorial techniques",
  crossref =     "Clifford:1989:PAS",
  pages =        "367--376",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p367-swami/p367-swami.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p367-swami/",
  abstract =     "We investigate the use of heuristics in optimizing
                 queries with a large number of joins. Examples of such
                 heuristics are the augmentation and local improvement
                 heuristics described in this paper and a heuristic
                 proposed by Krishnamurthy et al. We also study the
                 combination of these heuristics with two general
                 combinatorial optimization techniques, iterative
                 improvement and simulated annealing, that were studied
                 in a previous paper. Several interesting combinations
                 are experimentally compared. For completeness, we also
                 include simple iterative improvement and simulated
                 annealing in our experimental comparisons. We find that
                 two combinations of the augmentation heuristic and
                 iterative improvement perform the best under most
                 conditions. The results are validated using two
                 different cost models and several different synthetic
                 benchmarks.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Economics; Experimentation; Languages;
                 Performance",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Mathematics of
                 Computing --- Discrete Mathematics --- Combinatorics
                 (G.2.1): {\bf Combinatorial algorithms}",
}

@InProceedings{Chen:1989:CLC,
  author =       "W. Chen and D. S. Warren",
  title =        "{C}-logic of complex objects",
  crossref =     "ACM:1989:PPE",
  pages =        "369--378",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/73721/p369-chen/p369-chen.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/73721/p369-chen/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p369-chen/",
  abstract =     "Our objective is to have a logical framework for
                 natural representation and manipulation of complex
                 objects. We start with an analysis of semantic modeling
                 of complex objects, and attempt to understand what are
                 the fundamental aspects which need to be captured. A
                 logic, called C-logic, is then presented which provides
                 direct support for what we believe to be basic features
                 of complex objects, including object identity,
                 multi-valued labels and a dynamic notion of types.
                 C-logic has a simple first-order semantics, but it also
                 allows natural specification of complex objects and
                 gives us a framework for exploring efficient logic
                 deduction over complex objects.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Performance; Theory",
  keywords =     "algorithms; design; performance; theory",
  subject =      "Theory of Computation --- Logics and Meanings of
                 Programs --- Semantics of Programming Languages
                 (F.3.2); Theory of Computation --- Mathematical Logic
                 and Formal Languages --- Mathematical Logic (F.4.1):
                 {\bf Lambda calculus and related systems}; Information
                 Systems --- Database Management --- General (H.2.0);
                 Theory of Computation --- Logics and Meanings of
                 Programs --- Specifying and Verifying and Reasoning
                 about Programs (F.3.1)",
}

@InProceedings{Haas:1989:EQP,
  author =       "L. M. Haas and J. C. Freytag and G. M. Lohman and H.
                 Pirahesh",
  title =        "Extensible query processing in starburst",
  crossref =     "Clifford:1989:PAS",
  pages =        "377--388",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p377-haas/p377-haas.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p377-haas/",
  abstract =     "Today's DBMSs are unable to support the increasing
                 demands of the various applications that would like to
                 use a DBMS. Each kind of application poses new
                 requirements for the DBMS. The Starburst project at
                 IBM's Almaden Research Center aims to extend relational
                 DBMS technology to bridge this gap between applications
                 and the DBMS. While providing a full function
                 relational system to enable sharing across
                 applications, Starburst will also allow (sophisticated)
                 programmers to add many kinds of extensions to the base
                 system's capabilities, including language extensions
                 (e.g., new datatypes and operations), data management
                 extensions (e.g., new access and storage methods) and
                 internal processing extensions (e.g., new join methods
                 and new query transformations). To support these
                 features, the database query language processor must be
                 very powerful and highly extensible. Starburst's
                 language processor features a powerful query language,
                 rule-based optimization and query rewrite, and an
                 execution system based on an extended relational
                 algebra. In this paper, we describe the design of
                 Starburst's query language processor and discuss the
                 ways in which the language processor can be extended to
                 achieve Starburst's goals.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Verification",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Distributed databases};
                 Information Systems --- Database Management --- Systems
                 (H.2.4): {\bf Transaction processing}; Theory of
                 Computation --- Analysis of Algorithms and Problem
                 Complexity --- Numerical Algorithms and Problems
                 (F.2.1)",
}

@InProceedings{Kifer:1989:LOO,
  author =       "M. Kifer and J. Wu",
  title =        "A logic for object-oriented logic programming",
  crossref =     "ACM:1989:PPE",
  pages =        "379--393",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/73721/p379-kifer/p379-kifer.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/73721/p379-kifer/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p379-kifer/",
  abstract =     "We present a logic for reasoning about complex
                 objects, which is a revised and significantly extended
                 version of Maier's O-logic [Mai86]. The logic naturally
                 supports complex objects, object identity, deduction,
                 is tolerant to inconsistent data, and has many other
                 interesting features. It elegantly combines the
                 object-oriented and value-oriented paradigms and, in
                 particular, contains all of the predicate calculus as a
                 special case. Our treatment of sets is also noteworthy:
                 it is more general than ELPS [Kup87] and COL [AbG87],
                 yet it avoids the semantic problems encountered in LDL
                 [BNS87]. The proposed logic has a sound and complete
                 resolution-based proof procedure.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Languages; Theory",
  keywords =     "design; languages; theory",
  subject =      "Theory of Computation --- Logics and Meanings of
                 Programs --- Specifying and Verifying and Reasoning
                 about Programs (F.3.1): {\bf Logics of programs};
                 Information Systems --- Database Management --- General
                 (H.2.0); Theory of Computation --- Logics and Meanings
                 of Programs --- Semantics of Programming Languages
                 (F.3.2)",
}

@InProceedings{Tang:1989:SPS,
  author =       "T. Tang and N. Natarajan",
  title =        "A static pessimistic scheme for handling replicated
                 databases",
  crossref =     "Clifford:1989:PAS",
  pages =        "389--398",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p389-tang/p389-tang.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p389-tang/",
  abstract =     "A replicated database system may partition into
                 isolated groups in the presence of node and link
                 failures. When the system has partitioned, a {\em
                 pessimistic scheme\/} maintains availability and
                 consistency of replicated data by ensuring that updates
                 occur in at most one group. A pessimistic scheme is
                 called a {\em static scheme\/} if these {\em
                 distinguished\/} groups are determined only by the
                 membership of different groups in the partitioned
                 system. In this paper, we present a new static scheme
                 that is more powerful than voting. In this scheme, the
                 set of distinguished groups, called an {\em acceptance
                 set}, is chosen at design time. To commit an update, a
                 node checks if its enclosing group is a member of this
                 acceptance set. Using an encoding scheme for groups,
                 this check is implemented very efficiently. Another
                 merit of the proposed scheme is that the problem of
                 determining an {\em optimal\/} acceptance set is
                 formulated as a {\em sparse 0-1 linear programming
                 problem}. Hence, the optimization problem can be
                 handled using the very rich class of existing
                 techniques for solving such problems. Based on our
                 experiments, we feel that this optimization approach is
                 feasible for systems containing up to 10 nodes
                 (copies).",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Verification",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Distributed databases}; Theory of
                 Computation --- Analysis of Algorithms and Problem
                 Complexity --- Numerical Algorithms and Problems
                 (F.2.1); Information Systems --- Database Management
                 --- Systems (H.2.4): {\bf Concurrency}",
}

@InProceedings{Borgida:1989:TSQ,
  author =       "A. Borgida",
  title =        "Type systems for querying class hierarchies with
                 non-strict inheritance",
  crossref =     "ACM:1989:PPE",
  pages =        "394--400",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/73721/p394-borgida/p394-borgida.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/73721/p394-borgida/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/73721/p394-borgida/",
  abstract =     "Type checking at query compilation time is important
                 for both detecting programmer errors and reducing the
                 running time of queries. We have argued elsewhere [2]
                 that entity-based data management systems which support
                 class hierarchies, such as semantic data models and
                 object-oriented dbms, should not be confined to have ``
                 {\em strict inheritance\/} '' -- i.e., they should
                 permit contradictions between class specifications,
                 albeit in an explicit and controlled way. In this paper
                 we present a type system for queries manipulating
                 objects in such classes. We provide sound and complete
                 axiomatizations of the predications ``{\em is a
                 subtype of\/}'' and ``{\em expression $e$ has
                 type\/}''. The absence of strict inheritance has
                 normally been felt to preclude effective type
                 checking. We show that the problem is co-NP-hard when
                 disjoint types are admitted in the schema, but present
                 a low-order polynomial-time algorithm that determines
                 the absence of type errors in a query when the database
                 has only entities.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Languages; Theory",
  keywords =     "design; languages; theory",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing. {\bf D.3.4} Software,
                 PROGRAMMING LANGUAGES, Processors, Compilers. {\bf
                 F.3.3} Theory of Computation, LOGICS AND MEANINGS OF
                 PROGRAMS, Studies of Program Constructs, Type
                 structure.",
}

@InProceedings{Ellis:1989:CCG,
  author =       "C. A. Ellis and S. J. Gibbs",
  title =        "Concurrency control in groupware systems",
  crossref =     "Clifford:1989:PAS",
  pages =        "399--407",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p399-ellis/p399-ellis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p399-ellis/",
  abstract =     "Groupware systems are computer-based systems that
                 support two or more users engaged in a common task, and
                 that provide an interface to a shared environment.
                 These systems frequently require fine-granularity
                 sharing of data and fast response times. This paper
                 distinguishes real-time groupware systems from other
                 multi-user systems and discusses their concurrency
                 control requirements. An algorithm for concurrency
                 control in real-time groupware systems is then
                 presented. The advantages of this algorithm are its
                 simplicity of use and its responsiveness: users can
                 operate directly on the data without obtaining locks.
                 The algorithm must know some semantics of the
                 operations. However the algorithm's overall structure
                 is independent of the semantic information, allowing
                 the algorithm to be adapted to many situations. An
                 example application of the algorithm to group text
                 editing is given, along with a sketch of its proof of
                 correctness in this particular case. We note that the
                 behavior desired in many of these systems is
                 non-serializable.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Human Factors",
  subject =      "Information Systems --- Models and Principles ---
                 User/Machine Systems (H.1.2): {\bf Human factors};
                 Information Systems --- Database Management --- Systems
                 (H.2.4): {\bf Concurrency}; Computer Applications ---
                 Computers in Other Systems (J.7): {\bf Real time}",
}

@InProceedings{Agrawal:1989:MSM,
  author =       "D. Agrawal and S. Sengupta",
  title =        "Modular synchronization in multiversion databases:
                 version control and concurrency control",
  crossref =     "Clifford:1989:PAS",
  pages =        "408--417",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p408-agrawal/p408-agrawal.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p408-agrawal/",
  abstract =     "In this paper we propose a version control mechanism
                 that enhances the modularity and extensibility of
                 multiversion concurrency control algorithms. We
                 decouple the multiversion algorithms into two
                 components: version control and concurrency control.
                 This permits modular development of multiversion
                 protocols, and simplifies the task of proving the
                 correctness of these protocols. An interesting feature
                 of our framework is that the execution of read-only
                 transactions becomes completely independent of the
                 underlying concurrency control implementation. Also,
                 algorithms with the version control mechanism have
                 several advantages over most other multiversion
                 algorithms.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Verification",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Concurrency}; Information Systems
                 --- Database Management --- Database Administration
                 (H.2.7): {\bf Logging and recovery}; Software ---
                 Software Engineering --- Distribution, Maintenance, and
                 Enhancement (D.2.7): {\bf Version control}",
}

@InProceedings{DeTroyer:1989:RTC,
  author =       "O. {De Troyer}",
  title =        "{RIDL}*: a tool for the computer-assisted engineering
                 of large databases in the presence of integrity
                 constraints",
  crossref =     "Clifford:1989:PAS",
  pages =        "418--429",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p418-de_troyer/p418-de_troyer.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p418-de_troyer/",
  abstract =     "Tools and methods that transform higher level
                 formalisms into logical database designs become very
                 important. Rarely if ever do these transformations take
                 into account integrity constraints existing in the
                 ``conceptual'' model. Yet these become essential if one
                 is forced to introduce redundancies for reasons of
                 e.g., query efficiency. We therefore adopted the Binary
                 Relationship Model (or ``NIAM'') that is rich in
                 constraints and built a flexible tool, RIDL *, that
                 graphically captures NIAM semantic networks, analyzes
                 them and then transforms them into relational designs
                 (normalized or not), under the control of a database
                 engineer assisted by a rule base. This is made possible
                 by a rule-driven implementation of a new, stepwise
                 synthesis process, and its benefits are illustrated by
                 its treatment of e.g., subtypes. RIDL * is operational
                 at several industrial sites in Europe and the U.S. on
                 sizable database projects.",
  acknowledgement = ack-nhfb,
  generalterms = "Design",
  subject =      "Software --- Software Engineering --- Design Tools and
                 Techniques (D.2.2): {\bf Programmer workbench**};
                 Information Systems --- Database Management --- Logical
                 Design (H.2.1): {\bf Schema and subschema}; Information
                 Systems --- Database Management --- Logical Design
                 (H.2.1); Computing Methodologies --- Computer Graphics
                 --- Methodology and Techniques (I.3.6): {\bf
                 Languages}",
}

@InProceedings{Markowitz:1989:CRE,
  author =       "Victor M. Markowitz and Arie Shoshani",
  title =        "On the correctness of representing extended
                 entity-relationship structures in the relational
                 model",
  crossref =     "Clifford:1989:PAS",
  pages =        "430--439",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p430-markowitz/p430-markowitz.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p430-markowitz/",
  abstract =     "Although the relational representation of {\em
                 Entity-Relationship\/} (ER) structures gained extensive
                 coverage, scarce attention has been paid to the issue
                 of {\em correctness\/} for such representations.
                 Several mappings have been proposed for the
                 representation of both ER and extended ER (EER)
                 structures by relational schemas. The informal nature
                 of most of these proposals, however, does not allow a
                 precise evaluation of their correctness, nor a
                 comparison of the various mappings. We propose a {\em
                 canonical\/} relational representation for EER
                 structures and prove its correctness. We claim that a
                 relational schema represents correctly an EER structure
                 if it has {\em equivalent\/} information-capacity with
                 the corresponding canonical representation. \par

                 The second problem addressed by this paper is the
                 normalization of relational schemas that represent EER
                 structures. We examine the conditions required by this
                 process and show that ignoring these conditions leads
                 to erroneous analyses and inappropriate design
                 decisions. We show that, under these conditions, the
                 canonical relational representation of any
                 (unrestricted) EER structure has an
                 (information-capacity) equivalent {\em Boyce-Codd
                 Normal Form\/} schema.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Performance; Verification",
  subject =      "Information Systems --- Database Management ---
                 Logical Design (H.2.1): {\bf Data models}; Information
                 Systems --- Database Management --- Logical Design
                 (H.2.1): {\bf Schema and subschema}; Theory of
                 Computation --- Logics and Meanings of Programs ---
                 Semantics of Programming Languages (F.3.2)",
}

@InProceedings{Navathe:1989:VPD,
  author =       "Shamkant B. Navathe and Mingyoung Ra",
  title =        "Vertical partitioning for database design: a graphical
                 algorithm",
  crossref =     "Clifford:1989:PAS",
  pages =        "440--450",
  year =         "1989",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/67544/p440-navathe/p440-navathe.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/67544/p440-navathe/",
  abstract =     "Vertical partitioning is the process of subdividing
                 the attributes of a relation or a record type, creating
                 fragments. Previous approaches have used an iterative
                 binary partitioning method which is based on clustering
                 algorithms and mathematical cost functions. In this
                 paper, however, we propose a new vertical partitioning
                 algorithm using a graphical technique. This algorithm
                 starts from the attribute affinity matrix by
                 considering it as a complete graph. Then, forming a
                 linearly connected spanning tree, it generates all
                 meaningful fragments simultaneously by considering a
                 cycle as a fragment. We show its computational
                 superiority. It provides a cleaner alternative without
                 arbitrary objective functions and provides an
                 improvement over our previous work on vertical
                 partitioning.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design",
  subject =      "Information Systems --- Database Management ---
                 Logical Design (H.2.1): {\bf Data models}; Mathematics
                 of Computing --- Discrete Mathematics --- Graph Theory
                 (G.2.2): {\bf Graph algorithms}; Theory of Computation
                 --- Computation by Abstract Devices --- Complexity
                 Measures and Classes (F.1.3)",
}

@InProceedings{Lipton:1990:PSE,
  author =       "Richard J. Lipton and Jeffrey F. Naughton and Donovan
                 A. Schneider",
  title =        "Practical selectivity estimation through adaptive
                 sampling",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "1--11",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p1-lipton/p1-lipton.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p1-lipton/",
  abstract =     "Recently we have proposed an adaptive, random sampling
                 algorithm for general query size estimation. In earlier
                 work we analyzed the asymptotic efficiency and accuracy
                 of the algorithm, in this paper we investigate its
                 practicality as applied to selects and joins. First, we
                 extend our previous analysis to provide significantly
                 improved bounds on the amount of sampling necessary for
                 a given level of accuracy. Next, we provide ``sanity
                 bounds'' to deal with queries for which the underlying
                 data is extremely skewed or the query result is very
                 small. Finally, we report on the performance of the
                 estimation algorithm as implemented in a host language
                 on a commercial relational system. The results are
                 encouraging, even with this loose coupling between the
                 estimation algorithm and the DBMS.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Languages; Performance",
  subject =      "Information Systems --- Database Management ---
                 Logical Design (H.2.1): {\bf Data models}; Information
                 Systems --- Database Management --- Systems (H.2.4):
                 {\bf Query processing}; Mathematics of Computing ---
                 Probability and Statistics (G.3): {\bf Probabilistic
                 algorithms (including Monte Carlo)}",
}

@InProceedings{Kim:1990:RDO,
  author =       "Won Kim",
  title =        "Research directions in object-oriented database
                 systems",
  crossref =     "ACM:1990:PPN",
  pages =        "1--15",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/298514/p1-kim/p1-kim.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/298514/p1-kim/",
  abstract =     "The set of object-oriented concepts found in
                 object-oriented programming languages forms a good
                 basis for a data model for post-relational database
                 systems which will extend the domain of database
                 applications beyond conventional business data
                 processing. However, despite the high level of research
                 and development activities during the past several
                 years, there is no standard object-oriented data model,
                 and criticisms and concerns about the field still
                 remain. In this paper, I will first provide a
                 historical perspective on the emergence of
                 object-oriented database systems in order to derive a
                 definition of object-oriented database systems. I will
                 then examine a number of major challenge which remain
                 for researchers and implementors of object-oriented
                 database systems.",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming); C6160Z
                 (Other DBMS)",
  corpsource =   "Microelectron. and Comput. Technol. Corp., Austin, TX,
                 USA",
  generalterms = "Design; Management; Performance; Standardization;
                 Theory",
  keywords =     "database management systems; object-oriented database
                 systems; object-oriented programming",
  sponsororg =   "SIGACT; SIGMOD; SIGART",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Object-oriented databases};
                 Information Systems --- Information Storage and
                 Retrieval --- Information Search and Retrieval (H.3.3);
                 Computing Milieux --- The Computer Industry (K.1): {\bf
                 Standards}",
  treatment =    "B Bibliography; G General Review; P Practical",
}

@InProceedings{King:1990:BAT,
  author =       "Roger King and Ali Morfeq",
  title =        "Bayan: an {Arabic} text database management system",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "12--23",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p12-king/p12-king.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p12-king/",
  abstract =     "Most existing databases lack features which allow for
                 the convenient manipulation of text. It is even more
                 difficult to use them if the text language is not based
                 on the Roman alphabet. The Arabic language is a very
                 good example of this case. Many projects have attempted
                 to use conventional database systems for Arabic data
                 manipulation (including text data), but because of
                 Arabic's many differences with English, these projects
                 have met with limited success. In the Bayan project,
                 the approach has been different. Instead of simply
                 trying to adopt an environment to Arabic, the
                 properties of the Arabic language were the starting
                 point and everything was designed to meet the needs of
                 Arabic, thus avoiding the shortcomings of other
                 projects. A text database management system was
                 designed to overcome the shortcomings of conventional
                 database management systems in manipulating text data.
                 Bayan's data model is based on an object-oriented
                 approach which helps the extensibility of the system
                 for future use. In Bayan, we designed the database with
                 the Arabic text properties in mind. We designed it to
                 support the way Arabic words are derived, classified,
                 and constructed. Furthermore, linguistic algorithms
                 (for word generation and morphological decomposition of
                 words) were designed, leading to a formalization of
                 rules of Arabic language writing and sentence
                 construction. A user interface was designed on top of
                 this environment. A new representation of the Arabic
                 characters was designed, a complete Arabic keyboard
                 layout was created, and a window-based Arabic user
                 interface was also designed.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Languages",
  subject =      "Computing Methodologies --- Document and Text
                 Processing --- Document and Text Editing (I.7.1);
                 Information Systems --- Database Management ---
                 Database Applications (H.2.8); Computer Applications
                 --- Arts and Humanities (J.5): {\bf Linguistics};
                 Information Systems --- Database Management --- Logical
                 Design (H.2.1): {\bf Data models}",
}

@InProceedings{Abiteboul:1990:MS,
  author =       "Serge Abiteboul and Paris C. Kanellakis and Emmanuel
                 Waller",
  title =        "Method schemas",
  crossref =     "ACM:1990:PPN",
  pages =        "16--27",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/298514/p16-abiteboul/p16-abiteboul.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/298514/p16-abiteboul/",
  abstract =     "The concept of {\em method schemas\/} is proposed as a
                 simple model for object-oriented programming with
                 features such as {\em classes with methods and
                 inheritance, method name overloading}, and {\em late
                 binding}. An important issue is to check whether a
                 given method schema can possibly lead to
                 inconsistencies in some interpretations. The
                 consistency problem for method schemas is studied. The
                 problem is shown to be undecidable in general.
                 Decidability is obtained for {\em monadic\/} and/or
                 {\em recursion-free\/} method schemas. The effect of
                 {\em covariance\/} is considered. The issues of
                 incremental consistency checking and of a sound
                 algorithm for the general case are briefly discussed.",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4250 (Database theory); C6110
                 (Systems analysis and programming); C6160Z (Other
                 DBMS)",
  corpsource =   "INRIA, Le Chesnay, France",
  generalterms = "Algorithms; Design; Languages; Management;
                 Performance; Theory",
  keywords =     "classes with methods and inheritance; covariance;
                 database management systems; database theory;
                 databases; decidability; incremental consistency
                 checking; late binding; method name overloading;
                 monadic method schemas; object-oriented programming;
                 recursion-free method schemas; sound algorithm;
                 undecidable",
  sponsororg =   "SIGACT; SIGMOD; SIGART",
  subject =      "Information Systems --- Database Management ---
                 Logical Design (H.2.1): {\bf Schema and subschema};
                 Software --- Programming Techniques --- Object-oriented
                 Programming (D.1.5)",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@InProceedings{Yu:1990:RDO,
  author =       "Lin Yu and Daniel J. Rosenkrantz",
  title =        "Representability of design objects by
                 ancestor-controlled hierarchical specifications",
  crossref =     "ACM:1990:PPN",
  pages =        "28--39",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/298514/p28-yu/p28-yu.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/298514/p28-yu/",
  abstract =     "A simple model, called a VDAG, is proposed for
                 representing hierarchically specified design data in
                 CAD database systems where there are to be alternate
                 expansions of hierarchically specified modules. The
                 model uses an ancestor-based expansion scheme to
                 control which instances of submodules are to be placed
                 within each instance of a given module. The approach is
                 aimed at reducing storage space in engineering design
                 database systems, and providing a means for designers
                 to specify alternate expansions of a module. \par

                 The expressive power of the VDAG model is investigated,
                 and the set of design forests which are VDAG-generable
                 is characterized. The problem of determining whether a
                 given design forest is VDAG-generable is shown to be
                 {\em NP\/} -complete, even when the height of the
                 forest is bounded. However, it is shown that
                 determining whether a given forest is VDAG-generable
                 and producing such a VDAG if it exists, can be
                 partitioned into a number of simpler subproblems, each
                 of which may not be too computationally difficult in
                 practice. Furthermore, for forests in a special natural
                 class that has broad applicability, a polynomial time
                 algorithm is provided that determines whether a given
                 forest is VDAG-generable, and produces such a VDAG if
                 it exists. However, we show that it is {\em NP\/} -hard
                 to produce a minimum-sized such VDAG for forests in
                 this special class, even when the height of the forest
                 is bounded.",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory); C4250 (Database
                 theory); C6160 (Database management systems (DBMS))",
  corpsource =   "Dept. of Comput. Sci., State Univ. of New York,
                 Albany, NY, USA",
  generalterms = "Design; Management; Performance; Theory;
                 Verification",
  keywords =     "ancestor- based expansion scheme; ancestor-controlled
                 hierarchical specifications; bounded forest height; CAD
                 database systems; computational complexity; database
                 management systems; database theory; design data
                 representation; design forests; design objects
                 representation; hierarchically specified design data;
                 hierarchically specified modules; NP-complete; NP-hard;
                 polynomial time algorithm; trees (mathematics); VDAG
                 model; VDAG- generable",
  sponsororg =   "SIGACT; SIGMOD; SIGART",
  subject =      "Computer Applications --- Computer-Aided Engineering
                 (J.6); Information Systems --- Database Management ---
                 Database Applications (H.2.8); Mathematics of Computing
                 --- Discrete Mathematics --- General (G.2.0)",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@InProceedings{Agrawal:1990:OGI,
  author =       "R. Agrawal and N. H. Gehani and J. Srinivasan",
  title =        "{OdeView}: the graphical interface to {Ode}",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "34--43",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p34-agrawal/p34-agrawal.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p34-agrawal/",
  abstract =     "OdeView is the graphical front end for Ode, an
                 object-oriented database system and environment. Ode's
                 data model supports data encapsulation, type
                 inheritance, and complex objects. OdeView provides
                 facilities for examining the database schema (i.e., the
                 object type or class hierarchy), examining class
                 definitions, browsing objects, following chains of
                 references starting from an object, synchronized
                 browsing, displaying selected portions of objects
                 (projection), and retrieving objects with specific
                 characteristics (selection). \par

                 OdeView does not need to know about the internals of
                 Ode objects. Consequently, the internals of specific
                 classes are not hardwired into OdeView and new classes
                 can be added to the Ode database without requiring any
                 changes to or recompilation of OdeView. Just as OdeView
                 does not know about the object internals, class
                 functions (methods) for displaying objects are written
                 without knowing about the specifics of the windowing
                 software used by OdeView or the graphical user
                 interface provided by it. \par

                 In this paper, we present OdeView, and discuss its
                 design and implementation.",
  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}; Information Systems --- Database Management
                 --- Systems (H.2.4); Information Systems --- Database
                 Management --- Languages (H.2.3); Software ---
                 Programming Languages --- Language Classifications
                 (D.3.2): {\bf C++}",
}

@InProceedings{Lipton:1990:QSE,
  author =       "Richard J. Lipton and Jeffrey F. Naughton",
  title =        "Query size estimation by adaptive sampling (extended
                 abstract)",
  crossref =     "ACM:1990:PPN",
  pages =        "40--46",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/298514/p40-lipton/p40-lipton.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/298514/p40-lipton/",
  abstract =     "We present an adaptive, random sampling algorithm for
                 estimating the size of general queries. The algorithm
                 can be used for any query {$Q$} over a database {$D$}
                 such that (1) for some $n$, the answer to {$Q$} can be
                 partitioned into $n$ disjoint subsets {$Q$} 1, {$Q$} 2,
                 \ldots, {\em Q n}, and (2) for 1 $i$ $n$, the size of
                 {\em Q i\/} is bounded by some function $b$ ( {\em D,
                 Q\/}), and (3) there is some algorithm by which we can
                 compute the size of {\em Q i}, where {$i$} is chosen
                 randomly.  We consider the performance of the algorithm
                 on three special cases of the algorithm: join queries,
                 transitive closure queries, and general recursive
                 Datalog queries.",
  acknowledgement = ack-nhfb,
  annote =       "36 papers; See also 6836.1508 1990 9th for papers",
  classification = "C4250 (Database theory); C6160 (Database management
                 systems (DBMS))",
  corpsource =   "Dept. of Comput. Sci., Princeton Univ., NJ, USA",
  generalterms = "Algorithms; Design; Management; Performance; Theory;
                 Verification",
  keywords =     "ACM; adaptive sampling; database; database systems;
                 database theory; disjoint subsets; general recursive
                 Datalog queries; join queries; performance; query
                 languages; query size estimation; random sampling
                 algorithm; SIGACT; transitive closure queries",
  sponsororg =   "SIGACT; SIGMOD; SIGART",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}",
  treatment =    "T Theoretical or Mathematical",
  xxpages =      "18--25",
}

@InProceedings{Ullman:1990:IOC,
  author =       "Jeffrey D. Ullman and Mihalis Yannakakis",
  title =        "The input\slash output complexity of transitive
                 closure",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "44--53",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p44-ullman/p44-ullman.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p44-ullman/",
  abstract =     "Suppose a directed graph has its arcs stored in
                 secondary memory, and we wish to compute its transitive
                 closure, also storing the result in secondary memory.
                 We assume that an amount of main memory capable of
                 holding $s$ ``values'' is available, and that $s$ lies
                 between $n$, the number of nodes of the graph, and $e$,
                 the number of arcs. The cost measure we use for
                 algorithms is the {\em I/O complexity\/} of Kung and
                 Hong, where we count 1 every time a value is moved into
                 main memory from secondary memory, or vice versa.
                 \par

                 In the dense case, where $e$ is close to $n^2$, we show
                 that I/O equal to $(n^3 / s)$ is sufficient to compute
                 the transitive closure of an $n$ -node graph, using
                 main memory of size $s$. Moreover, it is necessary for
                 any algorithm that is ``standard,'' in a sense to be
                 defined precisely in the paper. Roughly, ``standard''
                 means that paths are constructed only by concatenating
                 arcs and previously discovered paths. This class
                 includes the usual algorithms that work for the
                 generalization of transitive closure to semiring
                 problems. For the sparse case, we show that I/O equal
                 to $(n^2 e / s)$ is sufficient, although the algorithm
                 we propose meets our definition of ``standard'' only if
                 the underlying graph is acyclic. We also show that
                 $(n^2 e / s)$ is necessary for any standard algorithm
                 in the sparse case. That settles the I/O complexity of
                 the sparse/acyclic case, for standard algorithms. It is
                 unknown whether this complexity can be achieved in the
                 sparse, cyclic case, by a standard algorithm, and it is
                 unknown whether the bound can be beaten by nonstandard
                 algorithms. \par

                 We then consider a special kind of standard algorithm,
                 in which paths are constructed only by concatenating
                 arcs and old paths, never by concatenating two old
                 paths. This restriction seems essential if we are to
                 take advantage of sparseness. Unfortunately, we show
                 that almost another factor of $n$ I/O is necessary.
                 That is, there is an algorithm in this class using I/O
                 $(n^3 e / s)$ for arbitrary sparse graphs, including
                 cyclic ones. Moreover, every algorithm in the
                 restricted class must use $(n^3 e / s / \log^3 n)$ I/O,
                 on some cyclic graphs.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Theory",
  subject =      "Theory of Computation --- Analysis of Algorithms and
                 Problem Complexity --- Nonnumerical Algorithms and
                 Problems (F.2.2): {\bf Computations on discrete
                 structures}; Information Systems --- Database
                 Management --- Systems (H.2.4): {\bf Query processing};
                 Mathematics of Computing --- Discrete Mathematics ---
                 Graph Theory (G.2.2); Software --- Operating Systems
                 --- Storage Management (D.4.2)",
}

@InProceedings{VanGelder:1990:DCA,
  author =       "Allen {Van Gelder}",
  title =        "Deriving constraints among argument sizes in logic
                 programs (extended abstract)",
  crossref =     "ACM:1990:PPN",
  pages =        "47--60",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/298514/p47-van_gelder/p47-van_gelder.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/298514/p47-van_gelder/",
  abstract =     "In a logic program the feasible argument sizes of
                 derivable facts involving an $n$ -ary predicate are
                 viewed as a set of points in the positive orthant of
                 {\em R n}. We investigate a method of deriving
                 constraints on the feasible set in the form of a
                 polyhedral convex set in the positive orthant, which we
                 call a {\em polycone}. Faces of this polycone represent
                 inequalities proven to hold among the argument sizes.
                 These inequalities are often useful for selecting an
                 evaluation method that is guaranteed to terminate for a
                 given logic procedure. The methods may be applicable to
                 other languages in which the sizes of data structures
                 can be determined syntactically. \par

                 We introduce a {\em generalized Tucker
                 representation\/} for systems of linear equations and
                 show how needed operations on polycones are performed
                 in this representation. We prove that every polycone
                 has a unique {\em normal form\/} in this
                 representation, and give an algorithm to produce it.
                 This in turn gives a decision procedure for the
                 question of whether two set of linear equations define
                 the same polycone. \par

                 When a predicate has several rules, the union of the
                 individual rule's polycones gives the set of feasible
                 argument size vectors for the predicate. Because this
                 set is not necessarily convex, we instead operate with
                 the smallest enclosing polycone, which is the closure
                 of the convex hull of the union. Retaining convexity is
                 one of the key features of our technique.
                 \par

                 Recursion is handled by finding a polycone that is a
                 fixpoint of a transformation that is derived from both
                 the recursive and nonrecursive rules. Some methods for
                 finding a fixpoint are presented, but there are many
                 unresolved problems in this area.",
  acknowledgement = ack-nhfb,
  classification = "C1110 (Algebra); C4140 (Linear algebra); C4210
                 (Formal logic); C4250 (Database theory)",
  corpsource =   "California Univ., Santa Cruz, CA, USA",
  generalterms = "Algorithms; Design; Management; Performance; Theory;
                 Verification",
  keywords =     "$n$-ary predicate; argument sizes; constraint
                 derivation; convex hull; convexity; database theory;
                 decision procedure; derivable facts; feasible argument
                 size vectors; fixpoint; formal logic; generalized
                 Tucker representation; linear algebra; linear
                 equations; logic programming; logic programs;
                 nonrecursive rules; polycone; polyhedral convex set;
                 positive orthant; recursive rules; transformation;
                 unique normal form",
  sponsororg =   "SIGACT; SIGMOD; SIGART",
  subject =      "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};
                 Information Systems --- Database Management --- Systems
                 (H.2.4): {\bf Query processing}; Computing
                 Methodologies --- Artificial Intelligence --- Problem
                 Solving, Control Methods, and Search (I.2.8): {\bf
                 Heuristic methods}",
  treatment =    "T Theoretical or Mathematical",
}

@InProceedings{Agrawal:1990:CSL,
  author =       "D. Agrawal and A. {El Abbadi}",
  title =        "Constrained Shared Locks for Increasing Concurrency in
                 Databases",
  crossref =     "ACM:1990:PPN",
  pages =        "53--63",
  year =         "1990",
  bibdate =      "Mon Mar 16 09:51:33 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "36 papers; See also 6836.1508 1990 9th for papers",
  keywords =     "ACM; database systems; SIGACT",
}

@InProceedings{Shen:1990:IEE,
  author =       "Yeh-Heng Shen",
  title =        "{IDLOG}: extending the expressive power of deductive
                 database languages",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "54--63",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p54-shen/p54-shen.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p54-shen/",
  abstract =     "The expressive power of pure deductive database
                 languages, such as {\em DATALOG\/} and {\em stratified
                 DATALOGS}, is limited in a sense that some useful
                 queries such as functions involving {\em aggregation\/}
                 are not definable in these languages. Our concern in
                 this paper is to provide a uniform logic framework for
                 deductive databases with greater expressive power. It
                 has been shown that with a linear ordering on the
                 domain of the database, the expressive power of some
                 database languages can be enhanced so that some
                 functions involving aggregation can be defined. Yet, a
                 direct implementation of the linear ordering in
                 deductive database languages may seem unintuitive, and
                 may not be very efficient to use in practice. We
                 propose a logic for deductive databases which employs
                 the notion of ``identifying each tuple in a relation''.
                 Through the use of these {\em tuple-identifications},
                 different linear orderings are defined as a result.
                 This intuitively explains the reason why our logic has
                 greater expressive power. The proposed logic language
                 is {\em non-deterministic\/} in nature. However,
                 non-determinism is not the real reason for the enhanced
                 expressive power. A deterministic subset of the
                 programs in this language is {\em computational
                 complete\/} in the sense that it defines all the {\em
                 computable deterministic queries}. Although the problem
                 of deciding whether a program is in this subset is in
                 general undecidable, we do provide a rather general
                 sufficient test for identifying such programs. Also
                 discussed in this paper is an extended notion of
                 queries which allows both the input and the output of a
                 query to contain {\em interpreted constants\/} of an
                 infinite domain. We show that extended queries
                 involving aggregation can also be defined in the
                 language.",
  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 Query processing}; Theory of Computation ---
                 Mathematical Logic and Formal Languages ---
                 Mathematical Logic (F.4.1): {\bf Computability theory};
                 Information Systems --- Database Management ---
                 Languages (H.2.3): {\bf Datalog}; Theory of Computation
                 --- Mathematical Logic and Formal Languages ---
                 Mathematical Logic (F.4.1): {\bf Logic and constraint
                 programming}",
}

@InProceedings{Kolaitis:1990:EPD,
  author =       "Phokion G. Kolaitis and Moshe Y. Vardi",
  title =        "On the Expressive Power of {Datalog}: Tools and a Case
                 Study",
  crossref =     "ACM:1990:PPN",
  pages =        "61--71",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/298514/p61-kolaitis/p61-kolaitis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/298514/p61-kolaitis/",
  abstract =     "We study here the language Datalog(), which is the
                 query language obtained from Datalog by allowing
                 equalities and inequalities in the bodies of the rules.
                 We view Datalog() as a fragment of an infinitary logic
                 {$L$} and show that {$L$} can be characterized in terms
                 of certain two-person pebble games. This
                 characterization provides us with tools for
                 investigating the expressive power of Datalog(). As a
                 case study, we classify the expressibility of {\em
                 fixed subgraph homeomorphism\/} queries on directed
                 graphs. Fortune et al. [FHW80] classified the
                 computational complexity of these queries by
                 establishing two dichotomies, which are proper only if
                 P NP. Without using any complexity-theoretic
                 assumptions, we show here that the two dichotomies are
                 indeed proper in terms of expressibility in
                 Datalog().",
  acknowledgement = ack-nhfb,
  annote =       "36 papers; See also 6836.1508 1990 9th for papers",
  classification = "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic); C4240 (Programming and algorithm theory); C4250
                 (Database theory)",
  corpsource =   "California Univ., Santa Cruz, CA, USA",
  generalterms = "Design; Languages; Management; Performance; Theory;
                 Verification",
  keywords =     "ACM; classify; computational complexity; database
                 systems; database theory; Datalog; Datalog(not=);
                 directed graphs; equalities; expressibility; expressive
                 power; fixed subgraph homeomorphism queries; formal
                 logic; inequalities; infinitary logic; P not=NP; query
                 language; SIGACT; tools; two-person pebble games",
  sponsororg =   "SIGACT; SIGMOD; SIGART",
  subject =      "Information Systems --- Database Management ---
                 Languages (H.2.3): {\bf Datalog}",
  treatment =    "T Theoretical or Mathematical",
  xxpages =      "110--134",
}

@InProceedings{Saraiya:1990:HPS,
  author =       "Yatin P. Saraiya",
  title =        "Hard problems for simple logic programs",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "64--73",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p64-saraiya/p64-saraiya.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p64-saraiya/",
  abstract =     "A number of optimizations have been proposed for
                 Datalog programs involving a single intensional
                 predicate (``single-IDB programs''). Examples include
                 the detection of {\em commutativity\/} and {\em
                 separability\/} ([Naug88],[RSUV89], [Ioan89a]) in
                 linear logic programs, and the detection of {\em
                 ZYT-linearizability\/} ([ZYT88], [RSUV89], [Sara89],
                 [Sara90]) in nonlinear programs. We show that the
                 natural generalizations of the commutativity and
                 ZYT-linearizability problems (respectively, the {\em
                 sequencability\/} and {\em base-case linearizability\/}
                 problems) are undecidable. Our constructions involve
                 the simulation of context-free grammars using
                 single-IDB programs that have a bounded number of
                 initialisation rules. The constructions may be used to
                 show that containment (or equivalence) is undecidable
                 for such programs, even if the programs are linear, or
                 if each program contains a single recursive rule. These
                 results tighten those of [Shmu87] and [Abit89].",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Languages",
  subject =      "Theory of Computation --- Mathematical Logic and
                 Formal Languages --- Mathematical Logic (F.4.1): {\bf
                 Logic and constraint programming}; Information Systems
                 --- Database Management --- Languages (H.2.3): {\bf
                 Datalog}; Mathematics of Computing --- Numerical
                 Analysis --- Optimization (G.1.6): {\bf Linear
                 programming}; Theory of Computation --- Mathematical
                 Logic and Formal Languages --- Grammars and Other
                 Rewriting Systems (F.4.2): {\bf Grammar types};
                 Computing Methodologies --- Artificial Intelligence ---
                 Deduction and Theorem Proving (I.2.3)",
}

@InProceedings{Carey:1990:LCL,
  author =       "Michael J. Carey and Sanjay Krishnamurthi and Miron
                 Livny",
  title =        "Load control for locking: the 'half-and-half'
                 approach",
  crossref =     "ACM:1990:PPN",
  pages =        "72--84",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/298514/p72-carey/p72-carey.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/298514/p72-carey/",
  abstract =     "A number of concurrency control performance studies
                 have shown that, under high levels of data contention,
                 concurrency control algorithms can exhibit thrashing
                 behavior which is detrimental to overall system
                 performance. In this paper, we present an approach to
                 eliminating thrashing in the case of two-phase locking,
                 a widely used concurrency control algorithm. Our
                 solution, which we call the `Half-and-Half' Algorithm,
                 involves monitoring the state of the DBMS in order to
                 dynamically control the multiprogramming level of the
                 system. Results from a performance study indicate that
                 the Half-and-Half algorithm can be very effective at
                 preventing thrashing under a wide range of operating
                 conditions and workloads.",
  acknowledgement = ack-nhfb,
  classification = "C6150J (Operating systems); C6160B (Distributed
                 DBMS)",
  corpsource =   "Dept. of Comput. Sci., wisconsin Univ., Madison, WI,
                 USA",
  generalterms = "Algorithms; Design; Experimentation; Management;
                 Measurement; Performance; Theory",
  keywords =     "concurrency control; concurrency control algorithms;
                 DBMS; dynamically control; half-and-half algorithm;
                 load control; multiprogramming; multiprogramming level;
                 two-phase locking",
  sponsororg =   "SIGACT; SIGMOD; SIGART",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Concurrency}; Information Systems
                 --- Database Management --- Physical Design (H.2.2)",
  treatment =    "P Practical",
}

@InProceedings{Wang:1990:PTD,
  author =       "Ke Wang",
  title =        "Polynomial time designs toward both {BCNF} and
                 efficient data manipulation",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "74--83",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p74-wang/p74-wang.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p74-wang/",
  abstract =     "We define the independence-reducibility based on a
                 modification of key dependencies, which has better
                 computational properties and is more practically useful
                 than the original one based on key dependencies. Using
                 this modification as a tool, we design BCNF databases
                 that are highly desirable with respect to updates
                 and/or query answering. In particular, given a set U of
                 attributes and a set F of functional dependencies over
                 U, we characterize when F can be embedded in a database
                 scheme over U that is independent and is BCNF with
                 respect to F, a polynomial time algorithm that tests
                 this characterization and produces such a database
                 scheme whenever possible is presented. The produced
                 database scheme contains the fewest possible number of
                 relation schemes. Then we show that designs of
                 embedding constant-time-maintainable BCNF schemes and
                 of embedding independence-reducible schemes share
                 exactly the same method with the above design. Finally,
                 a simple modification of this method yields a
                 polynomial time algorithm for designing embedding
                 separable BCNF schemes.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Theory",
  subject =      "Theory of Computation --- Computation by Abstract
                 Devices --- Complexity Measures and Classes (F.1.3):
                 {\bf Reducibility and completeness}; Information
                 Systems --- Database Management --- Systems (H.2.4):
                 {\bf Query processing}; Information Systems ---
                 Database Management --- Logical Design (H.2.1): {\bf
                 Normal forms}",
}

@InProceedings{Atzeni:1990:EUI,
  author =       "Paolo Atzeni and Riccardo Torlone",
  title =        "Efficient updates to independent schemes in the weak
                 instance model",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "84--93",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p84-atzeni/p84-atzeni.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p84-atzeni/",
  abstract =     "{\em The weak instance model is a framework to
                 consider the relations in a database as a whole,
                 regardless of the way attributes are grouped in the
                 individual relations. Queries and updates can be
                 performed involving any set of attributes. The
                 management of updates is based on a lattice structure
                 on the set of legal states, and inconsistencies and
                 ambiguities can arise\/} \par

                 {\em In the general case, the test for inconsistency
                 and determinism may involve the application of the
                 chase algorithm to the whole database. In this paper it
                 is shown how, for the highly significant class of
                 independent schemes, updates can be handled
                 efficiently, considering only the relevant portion of
                 the database}.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; 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}; Theory of Computation ---
                 Analysis of Algorithms and Problem Complexity ---
                 General (F.2.0)",
}

@InProceedings{Agrawal:1990:LCS,
  author =       "Divyakant Agrawal and Amr {El Abbadi}",
  title =        "Locks with constrained sharing (extended abstract)",
  crossref =     "ACM:1990:PPN",
  pages =        "85--93",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/298514/p85-agrawal/p85-agrawal.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/298514/p85-agrawal/",
  abstract =     "In this paper, we propose a new mode for locks that
                 permits sharing in a constrained manner. We develop a
                 family of locking protocols, the strictest of which is
                 the two phase locking protocol while the most
                 permissive recognizes all conflict-preserving
                 serializable histories. This is the first locking-based
                 protocol that can recognize the entire class of
                 conflict-preserving serializable histories.",
  acknowledgement = ack-nhfb,
  classification = "B6150 (Communication system theory); C6160B
                 (Distributed DBMS)",
  corpsource =   "Dept. of Comput. Sci., California Univ., Santa
                 Barbara, CA, USA",
  generalterms = "Design; Management; Performance; Reliability;
                 Standardization; Theory; Verification",
  keywords =     "concurrency control; conflict-preserving serializable
                 histories; constrained sharing; distributed databases;
                 locks; protocols; two phase locking protocol",
  sponsororg =   "SIGACT; SIGMOD; SIGART",
  subject =      "Computer Systems Organization ---
                 Computer-Communication Networks --- Network Protocols
                 (C.2.2); Information Systems --- Database Management
                 --- Physical Design (H.2.2); Information Systems ---
                 Database Management --- Systems (H.2.4): {\bf
                 Concurrency}; Information Systems --- Database
                 Management --- Systems (H.2.4): {\bf Distributed
                 databases}",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@InProceedings{Saraiya:1990:ETD,
  author =       "Y. P. Saraiya",
  title =        "On the Efficiency of Transforming Database Logic
                 Programs",
  crossref =     "ACM:1990:PPN",
  pages =        "87--109",
  year =         "1990",
  bibdate =      "Mon Mar 16 09:51:33 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "36 papers; See also 6836.1508 1990 9th for papers",
  keywords =     "ACM; database systems; SIGACT",
}

@InProceedings{Salzberg:1990:FDS,
  author =       "Betty Salzberg and Alex Tsukerman and Jim Gray and
                 Michael Stuewart and Susan Uren and Bonnie Vaughan",
  title =        "{FastSort}: a distributed single-input single-output
                 external sort",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "94--101",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p94-salzberg/p94-salzberg.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p94-salzberg/",
  abstract =     "External single-input single-output sorts can use
                 multiple processors each with a large tournament
                 replacement-selection in memory, and each with private
                 disks to sort an input stream in linear elapsed time.
                 Of course, increased numbers of processors, memories,
                 and disks are required as the input file size grows.
                 This paper analyzes the algorithm and reports the
                 performance of an implementation.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Performance",
  subject =      "Theory of Computation --- Analysis of Algorithms and
                 Problem Complexity --- Nonnumerical Algorithms and
                 Problems (F.2.2): {\bf Sorting and searching};
                 Mathematics of Computing --- Numerical Analysis ---
                 General (G.1.0): {\bf Parallel algorithms}; Theory of
                 Computation --- Computation by Abstract Devices ---
                 Modes of Computation (F.1.2): {\bf Parallelism and
                 concurrency}; Mathematics of Computing --- Discrete
                 Mathematics --- Graph Theory (G.2.2): {\bf Trees}",
}

@InProceedings{Fekete:1990:SGC,
  author =       "Alan Fekete and Nancy Lynch and William E. Weihl",
  title =        "A serialization graph construction for nested
                 transactions",
  crossref =     "ACM:1990:PPN",
  pages =        "94--108",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/298514/p94-fekete/p94-fekete.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/298514/p94-fekete/",
  abstract =     "This paper makes three contributions. First, we
                 present a proof technique that offers system designers
                 the same ease of reasoning about nested transaction
                 systems as is given by the classical theory for systems
                 without nesting, and yet can be used to verify that a
                 system satisfies the robust ``user view'' definition of
                 correctness of [10]. Second, as applications of the
                 technique, we verify the correctness of Moss'
                 read/write locking algorithm for nested transactions,
                 and of an undo logging algorithm that has not
                 previously been presented or proved for nested
                 transaction systems. Third, we make explicit the
                 assumptions used for this proof technique, assumptions
                 that are usually made {\em implicitly\/} in the
                 classical theory, and therefore we clarify the type of
                 system for which the classical theory itself can
                 reliably be used.",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4250 (Database
                 theory); C6160B (Distributed DBMS)",
  corpsource =   "Sydney Univ., NSW, Australia",
  generalterms = "Algorithms; Design; Management; Performance;
                 Reliability; Theory; Verification",
  keywords =     "concurrency control; database theory; distributed
                 databases; graph theory; Moss read/write locking
                 algorithm; nested transactions; proof technique;
                 serialization graph construction; transaction
                 processing; undo logging algorithm; user view
                 definition of correctness",
  sponsororg =   "SIGACT; SIGMOD; SIGART",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Transaction processing}",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@InProceedings{Graefe:1990:EPV,
  author =       "Goetz Graefe",
  title =        "Encapsulation of parallelism in the {Volcano} query
                 processing system",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "102--111",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p102-graefe/p102-graefe.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p102-graefe/",
  abstract =     "Volcano is a new dataflow query processing system we
                 have developed for database systems research and
                 education. The uniform interface between operators
                 makes Volcano extensible by new operators. All
                 operators are designed and coded as if they were meant
                 for a single-process system only. When attempting to
                 parallelize Volcano, we had to choose between two
                 models of parallelization, called here the {\em
                 bracket\/} and {\em operator\/} models. We describe the
                 reasons for not choosing the bracket model, introduce
                 the novel operator model, and provide details of
                 Volcano's {\em exchange\/} operator that parallelizes
                 all other operators. It allows intra-operator
                 parallelism on partitioned datasets and both vertical
                 and horizontal inter-operator parallelism. The exchange
                 operator encapsulates all parallelism issues and
                 therefore makes implementation of parallel database
                 algorithms significantly easier and more robust.
                 Included in this encapsulation is the translation
                 between demand-driven dataflow within processes and
                 data-driven dataflow between processes. Since the
                 interface between Volcano operators is similar to the
                 one used in ``real,'' commercial systems, the
                 techniques described here can be used to parallelize
                 other query processing engines.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Performance",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Information
                 Systems --- Database Management --- Systems (H.2.4):
                 {\bf Concurrency}; Theory of Computation ---
                 Computation by Abstract Devices --- Modes of
                 Computation (F.1.2): {\bf Parallelism and concurrency};
                 Mathematics of Computing --- Numerical Analysis ---
                 General (G.1.0): {\bf Parallel algorithms}",
}

@InProceedings{Weikum:1990:MLR,
  author =       "Gerhard Weikum and Christof Hasse and Peter Broessler
                 and Peter Muth",
  title =        "Multi-level recovery",
  crossref =     "ACM:1990:PPN",
  pages =        "109--123",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/298514/p109-weikum/p109-weikum.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/298514/p109-weikum/",
  abstract =     "Multi-level transactions have received considerable
                 attention as a framework for high-performance
                 concurrency control methods. An inherent property of
                 multi-level transactions is the need for compensating
                 actions, since state-based recovery methods do no
                 longer work correctly for transaction undo. The
                 resulting requirement of operation logging adds to the
                 complexity of crash recovery. In addition, multi-level
                 recovery algorithms have to take into account that
                 high-level actions are not necessarily atomic, e.g., if
                 multiple pages are updated in a single action. \par

                 In this paper, we present a recovery algorithm for
                 multi-level transactions. Unlike typical commercial
                 database systems, we have striven for simplicity rather
                 than employing special tricks. It is important to note,
                 though, that simplicity is not achieved at the expense
                 of performance. We show how a high-performance
                 multi-level recovery algorithm can be systematically
                 developed based on few fundamental principles. The
                 presented algorithm has been implemented in the DASDBS
                 database kernel system.",
  acknowledgement = ack-nhfb,
  classification = "C6160B (Distributed DBMS)",
  corpsource =   "Dept. of Comput. Sci., ETH Zurich, Switzerland",
  generalterms = "Algorithms; Design; Management; Performance; Theory",
  keywords =     "concurrency control; DASDBS database kernel system;
                 multi-level recovery algorithm; multi-level
                 transactions; transaction processing",
  sponsororg =   "SIGACT; SIGMOD; SIGART",
  subject =      "Information Systems --- Database Management ---
                 Physical Design (H.2.2): {\bf Recovery and restart};
                 Information Systems --- Database Management --- Systems
                 (H.2.4): {\bf Concurrency}",
  treatment =    "P Practical",
}

@InProceedings{Bernstein:1990:IRR,
  author =       "Philip A. Bernstein and Meichun Hsu and Bruce Mann",
  title =        "Implementing recoverable requests using queues",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "112--122",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p112-bernstein/p112-bernstein.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p112-bernstein/",
  abstract =     "Transactions have been rigorously defined and
                 extensively studied in the database and transaction
                 processing literature, but little has been said about
                 the handling of the {\em requests\/} for transaction
                 execution in commercial TP systems, especially
                 distributed ones, managing the flow of requests is
                 often as important as executing the transactions
                 themselves. \par

                 This paper studies fault-tolerant protocols for
                 managing the flow of transaction requests between
                 clients that issue requests and servers that process
                 them. We discuss how to implement these protocols using
                 transactions and {\em recoverable queuing systems}.
                 Queuing systems are used to move requests reliably
                 between clients and servers. The protocols use queuing
                 systems to ensure that the server processes each
                 request exactly once and that a client processes each
                 reply at least once. We treat request-reply protocols
                 for single-transaction requests, for multi-transaction
                 requests, and for requests that require interaction
                 with the display after the request is submitted.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Reliability; Theory",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Distributed databases};
                 Information Systems --- Database Management --- Systems
                 (H.2.4): {\bf Transaction processing}; Mathematics of
                 Computing --- Miscellaneous (G.m): {\bf Queueing
                 theory**}",
}

@InProceedings{Solworth:1990:WOD,
  author =       "Jon A. Solworth and Cyril U. Orji",
  title =        "Write-only disk caches",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "123--132",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p123-solworth/p123-solworth.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p123-solworth/",
  abstract =     "With recent declines in the cost of semiconductor
                 memory and the increasing need for high performance I/O
                 disk systems, it makes sense to consider the design of
                 large caches. In this paper, we consider the effect of
                 caching writes. We show that cache sizes in the range
                 of a few percent allow writes to be performed at
                 negligible or no cost and independently of locality
                 considerations.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Performance",
  subject =      "Hardware --- Memory Structures --- Design Styles
                 (B.3.2): {\bf Cache memories}; Software --- Operating
                 Systems --- Storage Management (D.4.2): {\bf Secondary
                 storage}; Information Systems --- Database Management
                 --- Systems (H.2.4); Software --- Operating Systems ---
                 Process Management (D.4.1): {\bf Scheduling}",
}

@InProceedings{Tay:1990:OSM,
  author =       "Y. C. Tay",
  title =        "On the optimality of strategies for multiple joins",
  crossref =     "ACM:1990:PPN",
  pages =        "124--131",
  year =         "1990",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/298514/p124-tay/p124-tay.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/298514/p124-tay/",
  acknowledgement = ack-nhfb,
  classification = "C4250 (Database theory); C6160D (Relational DBMS)",
  corpsource =   "Dept. of Math., Nat. Univ. of Singapore, Kent Ridge,
                 Singapore",
  keywords =     "database theory; expression evaluation; multiple
                 joins; orderings; relational databases; relations;
                 searched subspace; strategy optimality; tuples",
  sponsororg =   "SIGACT; SIGMOD; SIGART",
  treatment =    "T Theoretical or Mathematical",
}

@InProceedings{Saraiya:1990:PTP,
  author =       "Yatin P. Saraiya",
  title =        "Polynomial-time program transformations in deductive
                 databases",
  crossref =     "ACM:1990:PPN",
  pages =        "132--144",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/298514/p132-saraiya/p132-saraiya.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/298514/p132-saraiya/",
  abstract =     "We investigate the complexity of various optimization
                 techniques for logic databases. In particular, we
                 provide polynomial-time algorithms for restricted
                 versions of common program transformations, and show
                 that a minor relaxation of these restrictions leads to
                 {\em NP\/} -hardness. To this end, we define the $k$
                 -containment problem on conjunctive queries, and show
                 that while the 2-containment problem is in {\em P}, the
                 3-containment problem is {\em NP\/} -complete. These
                 results provide a complete description of the
                 complexity of conjunctive query containment. We also
                 extend these results to provide a natural
                 characterization of certain optimization problems in
                 logic databases, such as the detection of
                 sequencability and commutativity among pairs of Linear
                 rules, the detection of 1-boundedness in sirups, and
                 the detection of ZYT-linearizability in simple
                 nonlinear recursions.",
  acknowledgement = ack-nhfb,
  classification = "C1180 (Optimisation techniques); C1230 (Artificial
                 intelligence); C4210 (Formal logic); C4240 (Programming
                 and algorithm theory); C4250 (Database theory); C6160Z
                 (Other DBMS)",
  corpsource =   "Dept. of Comput. Sci., Stanford Univ., CA, USA",
  generalterms = "Algorithms; Design; Management; Performance; Theory;
                 Verification",
  keywords =     "1-boundedness; 2- containment problem; 3-containment
                 problem; commutativity; complexity; computational
                 complexity; conjunctive query containment; database
                 management systems; database theory; deductive
                 databases; formal logic; k-containment problem;
                 knowledge based systems; linear rules; logic databases;
                 logic programming; nonlinear recursions; NP-complete;
                 NP-hardness; optimisation; optimization; polynomial
                 time program transformations; polynomial-time
                 algorithms; query languages; sequencability; sirups;
                 ZYT- linearizability",
  sponsororg =   "SIGACT; SIGMOD; SIGART",
  subject =      "Computing Methodologies --- Artificial Intelligence
                 --- Deduction and Theorem Proving (I.2.3); Information
                 Systems --- Database Management --- Database
                 Applications (H.2.8); Computing Methodologies ---
                 Artificial Intelligence --- Automatic Programming
                 (I.2.2): {\bf Program transformation}; Mathematics of
                 Computing --- Numerical Analysis --- Optimization
                 (G.1.6)",
  treatment =    "T Theoretical or Mathematical",
}

@InProceedings{Wolfson:1990:NPP,
  author =       "Ouri Wolfson and Aya Ozeri",
  title =        "A new paradigm for parallel and distributed
                 rule-processing",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "133--142",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p133-wolfson/p133-wolfson.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p133-wolfson/",
  abstract =     "This paper is concerned with the parallel evaluation
                 of datalog rule programs, mainly by processors that are
                 interconnected by a communication network. We introduce
                 a paradigm, called data-reduction, for the parallel
                 evaluation of a general datalog program. Several
                 parallelization strategies discussed previously in [CW,
                 GST, W, WS] are special cases of this paradigm. The
                 paradigm parallelizes the evaluation by partitioning
                 among the processors the instantiations of the rules.
                 After presenting the paradigm, we discuss the following
                 issues, that we see fundamental for parallelization
                 strategies derived from the paradigm properties of the
                 strategies that enable a reduction in the communication
                 overhead, decomposability, load balancing, and
                 application to programs with negation. We prove that
                 decomposability, a concept introduced previously in
                 [WS, CW], is undecidable.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Languages",
  subject =      "Information Systems --- Database Management ---
                 Languages (H.2.3): {\bf Datalog}; Mathematics of
                 Computing --- Numerical Analysis --- General (G.1.0):
                 {\bf Parallel algorithms}; Information Systems ---
                 Database Management --- Logical Design (H.2.1): {\bf
                 Data models}; Information Systems --- Database
                 Management --- Systems (H.2.4): {\bf Concurrency}",
}

@InProceedings{Ganguly:1990:FPP,
  author =       "Sumit Ganguly and Avi Silberschatz and Shalom Tsur",
  title =        "A framework for the parallel processing of {Datalog}
                 queries",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "143--152",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p143-ganguly/p143-ganguly.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p143-ganguly/",
  abstract =     "This paper presents several complementary methods for
                 the parallel, bottom-up evaluation of Datalog queries.
                 We introduce the notion of a {\em discriminating
                 predicate}, based on hash functions, that partitions
                 the computation between the processors in order to
                 achieve parallelism. A parallelization scheme with the
                 property of non-redundant computation (no duplication
                 of computation by processors) is then studied in
                 detail. The mapping of Datalog programs onto a network
                 of processors, such that the results is a non-redundant
                 computation, is also studied. The methods reported in
                 this paper clearly demonstrate the trade-offs between
                 redundancy and interprocessor-communication for this
                 class of problems.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Theory",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Concurrency}; Information Systems
                 --- Database Management --- Languages (H.2.3): {\bf
                 Datalog}; Information Systems --- Database Management
                 --- Systems (H.2.4): {\bf Query processing}; Theory of
                 Computation --- Computation by Abstract Devices ---
                 Modes of Computation (F.1.2): {\bf Parallelism and
                 concurrency}; Theory of Computation --- Computation by
                 Abstract Devices --- Complexity Measures and Classes
                 (F.1.3)",
}

@InProceedings{Plambeck:1990:STR,
  author =       "Thane Plambeck",
  title =        "Semigroup techniques in recursive query optimization",
  crossref =     "ACM:1990:PPN",
  pages =        "145--153",
  year =         "1990",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/298514/p145-plambeck/p145-plambeck.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/298514/p145-plambeck/",
  acknowledgement = ack-nhfb,
  classification = "C1110 (Algebra); C1160 (Combinatorial mathematics);
                 C1180 (Optimisation techniques); C4250 (Database
                 theory); C6160 (Database management systems (DBMS))",
  corpsource =   "Dept. of Comput. Sci., Stanford Univ., CA, USA",
  keywords =     "codify; database theory; group theory; mathematical
                 semigroup theory; optimisation; program boundedness;
                 query languages; recursive query optimization; rule
                 commutativity; set theory",
  sponsororg =   "SIGACT; SIGMOD; SIGART",
  treatment =    "T Theoretical or Mathematical",
}

@InProceedings{Kogan:1990:CCM,
  author =       "Boris Kogan and S. Jajodia",
  title =        "Concurrency control in multilevel-secure databases
                 based on replicated architecture",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "153--162",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p153-kogan/p153-kogan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p153-kogan/",
  abstract =     "In a multilevel secure database management system
                 based on the {\em replicated\/} architecture, there is
                 a separate database management system to manage data at
                 or below each security level, and lower level data are
                 replicated in all databases containing higher level
                 data. In this paper, we address the open issue of
                 concurrency control in such a system. We give a secure
                 protocol that guarantees one-copy serializability of
                 concurrent transaction executions and can be
                 implemented in such a way that the size of the trusted
                 code (including the code required for concurrency and
                 recovery) is small.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Security",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Concurrency}; Information Systems
                 --- Database Management --- Systems (H.2.4): {\bf
                 Transaction processing}; Information Systems ---
                 Database Management --- General (H.2.0): {\bf Security,
                 integrity, and protection**}; Computer Applications ---
                 Computers in Other Systems (J.7): {\bf Military}",
}

@InProceedings{Elkan:1990:ILD,
  author =       "Charles Elkan",
  title =        "Independence of logic database queries and updates",
  crossref =     "ACM:1990:PPN",
  pages =        "154--160",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/298514/p154-elkan/p154-elkan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/298514/p154-elkan/",
  abstract =     "A query is independent of an update if executing the
                 update cannot change the result of evaluating the
                 query. The theorems of this paper give methods for
                 proving independence in concrete cases, taking into
                 account integrity constraints, recursive rules, and
                 arbitrary queries. First we define the notion of
                 independence model-theoretically, and we prove basic
                 properties of the concept. Then we provide
                 proof-theoretic conditions for a conjunctive query to
                 be independent of an update. Finally, we prove correct
                 an induction scheme for showing that a recursive query
                 is independent of an update.",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4250 (Database theory); C6160
                 (Database management systems (DBMS))",
  corpsource =   "Dept. of Comput. Sci., Toronto Univ., Ont., Canada",
  generalterms = "Design; Management; Performance; Theory;
                 Verification",
  keywords =     "arbitrary queries; conjunctive query; database theory;
                 formal logic; independence; induction; integrity
                 constraints; logic database queries; logic database
                 update; proof-theoretic conditions; query languages;
                 recursive query; recursive rules",
  sponsororg =   "SIGACT; SIGMOD; SIGART",
  subject =      "Computing Methodologies --- Artificial Intelligence
                 --- Deduction and Theorem Proving (I.2.3): {\bf Logic
                 programming}; Information Systems --- Database
                 Management --- Systems (H.2.4): {\bf Query processing};
                 Information Systems --- Database Management ---
                 Database Applications (H.2.8)",
  treatment =    "T Theoretical or Mathematical",
}

@InProceedings{Ross:1990:MSM,
  author =       "Kenneth A. Ross",
  title =        "Modular stratification and magic sets for Datalog
                 programs with negation",
  crossref =     "ACM:1990:PPN",
  pages =        "161--171",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/298514/p161-ross/p161-ross.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/298514/p161-ross/",
  abstract =     "We propose a class of programs, called modularly
                 stratified programs that have several attractive
                 properties. Modular stratification generalizes
                 stratification and local stratification, while allowing
                 programs that are not expressible by stratified
                 programs. For modularly stratified programs the
                 well-founded semantics coincides with the stable model
                 semantics, and makes every ground literal true or
                 false. Modularly stratified programs are all weakly
                 stratified, but the converse is false. Unlike some
                 weakly stratified programs, modularly stratified
                 programs can be evaluated in a subgoal-at-a-time
                 fashion. We demonstrate a technique for rewriting a
                 modularly stratified program for bottom-up evaluation
                 and extend this rewriting to include magic-set
                 techniques. The rewritten program, when evaluated
                 bottom-up, gives the same answers as the well-founded
                 semantics. We discuss extending modular stratification
                 to other operators such as set-grouping and aggregation
                 that have traditionally been stratified to prevent
                 semantic difficulties.",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory); C4250 (Database theory)",
  corpsource =   "Stanford Univ., CA, USA",
  generalterms = "Design; Languages; Management; Performance; Theory",
  keywords =     "aggregation; bottom-up evaluation; database theory;
                 Datalog programs; logic programming; magic sets;
                 modular stratification; modularly stratified programs;
                 negation; operators; programming theory; rewriting;
                 rewriting systems; set-grouping",
  sponsororg =   "SIGACT; SIGMOD; SIGART",
  subject =      "Information Systems --- Database Management ---
                 Languages (H.2.3): {\bf Datalog}; Software ---
                 Programming Techniques --- General (D.1.0); Information
                 Systems --- Database Management --- Logical Design
                 (H.2.1)",
  treatment =    "T Theoretical or Mathematical",
}

@InProceedings{Badrinath:1990:PES,
  author =       "B. R. Badrinath and Krithi Ramamritham",
  title =        "Performance evaluation of semantics-based multilevel
                 concurrency control protocols",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "163--172",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p163-badrinath/p163-badrinath.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p163-badrinath/",
  abstract =     "For next generation information systems, concurrency
                 control mechanisms are required to handle high level
                 abstract operations and to meet high throughput
                 demands. The currently available single level
                 concurrency control mechanisms for {\em reads\/} and
                 {\em writes\/} are inadequate for future complex
                 information systems. In this paper, we will present a
                 new {\em multilevel\/} concurrency protocol that uses a
                 semantics-based notion of conflict, which is weaker
                 than commutativity, called {\em recoverability}.
                 Further, operations are scheduled according to {\em
                 relative conflict}, a conflict notion based on the
                 structure of operations. \par

                 Performance evaluation via extensive simulation studies
                 show that with our multilevel concurrency control
                 protocol, the performance improvement is significant
                 when compared to that of a single level two-phase
                 locking based concurrency control scheme or to that of
                 a multilevel concurrency control scheme based on
                 commutativity alone. Further, simulation studies show
                 that our new multilevel concurrency control protocol
                 performs better even with resource contention.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Performance",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Concurrency}; Theory of
                 Computation --- Computation by Abstract Devices ---
                 Modes of Computation (F.1.2): {\bf Parallelism and
                 concurrency}; Information Systems --- Database
                 Management --- General (H.2.0): {\bf Security,
                 integrity, and protection**}; Computer Applications ---
                 Computers in Other Systems (J.7): {\bf Military}",
}

@InProceedings{You:1990:TVF,
  author =       "Jia-Huai You and Li Yan Yuan",
  title =        "Three-valued formalization of logic programming: is it
                 needed?",
  crossref =     "ACM:1990:PPN",
  pages =        "172--182",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/298514/p172-you/p172-you.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/298514/p172-you/",
  abstract =     "The central issue of this paper concerns the truth
                 value {\em undefined\/} in Przymusinski's 3-valued
                 formalization of nonmonotonic reasoning and logic
                 programming. We argue that this formalization can lead
                 to the problem of unintended semantics and loss of
                 disjunctive information. We modify the formalization by
                 proposing two general principles for logic program
                 semantics: {\em justifiability\/} and {\em minimal
                 undefinedness}. The former is shown to be a general
                 property for almost all logic program semantics, and
                 the latter requires the use of the undefined only when
                 it is necessary. We show that there are three types of
                 information embedded in the undefined: the disjunctive,
                 the factoring, and the ``difficult-to-be-assigned''. In
                 the modified formalization, the first two can be
                 successfully identified and branched into multiple
                 models. This leaves only the
                 ``difficult-to-be-assigned'' as the undefined. It is
                 shown that the truth value undefined is needed only for
                 a very special type of programs whose practicality is
                 yet to be evidenced.",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4210 (Formal
                 logic); C4240 (Programming and algorithm theory); C4250
                 (Database theory)",
  corpsource =   "Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta.,
                 Canada",
  generalterms = "Design; Languages; Management; Performance; Theory;
                 Verification",
  keywords =     "database theory; difficult-to-be-assigned;
                 disjunctive; disjunctive information; factoring; formal
                 logic; justifiably; logic program semantics; logic
                 programming; minimal undefinedness; nonmonotonic
                 reasoning; programming theory; Przymusinski 3-valued
                 formalization; ternary logic; truth value; unintended
                 semantics",
  sponsororg =   "SIGACT; SIGMOD; SIGART",
  subject =      "Computing Methodologies --- Artificial Intelligence
                 --- Deduction and Theorem Proving (I.2.3): {\bf Logic
                 programming}; Computing Methodologies --- Artificial
                 Intelligence --- Deduction and Theorem Proving (I.2.3):
                 {\bf Nonmonotonic reasoning and belief revision};
                 Theory of Computation --- Logics and Meanings of
                 Programs --- Semantics of Programming Languages
                 (F.3.2); Information Systems --- Database Management
                 --- Logical Design (H.2.1)",
  treatment =    "T Theoretical or Mathematical",
}

@InProceedings{Motro:1990:QDK,
  author =       "Amihai Motro and Qiuhui Yuan",
  title =        "Querying database knowledge",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "173--183",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p173-motro/p173-motro.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p173-motro/",
  abstract =     "The role of database knowledge is usually limited to
                 the evaluation of data queries. In this paper we argue
                 that when this knowledge is of substantial volume and
                 complexity, there is genuine need to query this
                 repository of information. Moreover, since users of the
                 database may not be able to distinguish between
                 information that is data and information that is
                 knowledge, access to knowledge and data should be
                 provided with a single, coherent instrument. We provide
                 an informal review of various kinds of knowledge
                 queries, with possible syntax and semantics. We then
                 formalize a framework of knowledge-rich databases, and
                 a simple query language consisting of a pair of
                 retrieve and describe statements. The retrieve
                 statement is for querying the data (it corresponds to
                 the basic retrieval statement of various knowledge-rich
                 database systems). The describe statement is for
                 querying the knowledge. Essentially, it inquires about
                 the meaning of a concept under specified circumstances.
                 We provide algorithms for evaluating sound and finite
                 knowledge answers to describe queries, and we
                 demonstrate them with examples.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Languages",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Information
                 Systems --- Database Management --- Languages (H.2.3):
                 {\bf Query languages}; Information Systems --- Database
                 Management --- Logical Design (H.2.1): {\bf Data
                 models}; Computing Methodologies --- Artificial
                 Intelligence --- Knowledge Representation Formalisms
                 and Methods (I.2.4): {\bf Representations (procedural
                 and rule-based)}",
}

@InProceedings{Royer:1990:BCE,
  author =       "V{\'e}ronique Royer",
  title =        "Backward chaining evaluation in stratified disjunctive
                 theories",
  crossref =     "ACM:1990:PPN",
  pages =        "183--195",
  year =         "1990",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/298514/p183-royer/p183-royer.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/298514/p183-royer/",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4210 (Formal
                 logic); C4240 (Programming and algorithm theory); C4250
                 (Database theory); C6160 (Database management systems
                 (DBMS))",
  corpsource =   "Dept. of Comput. Sci., ONERA, Toulouse, France",
  keywords =     "atomic queries; backward chaining computation;
                 database management systems; database theory; deductive
                 databases; fixpoint; formal logic; knowledge based
                 systems; logic programming; minimal clauses;
                 programming theory; stratified disjunctive databases;
                 stratified disjunctive theories",
  sponsororg =   "SIGACT; SIGMOD; SIGART",
  treatment =    "T Theoretical or Mathematical",
}

@InProceedings{Laenens:1990:ELP,
  author =       "Els Laenens and Domenico Sacca and Dirk Vermeir",
  title =        "Extending logic programming",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "184--193",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p184-laenens/p184-laenens.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p184-laenens/",
  abstract =     "{\em An extension of logic programming, called
                 ``ordered logic programming'', which includes some
                 abstractions of the object-oriented paradigm, is
                 presented. An ordered program consists of a number of
                 modules (objects), where each module is composed by a
                 number of rules possibly with negated head predicates.
                 A sort of ``isa'' hierarchy can be defined among the
                 modules in order to allow for rule inheritance.
                 Therefore, every module sees its own rules as local
                 rules and the rules of the other modules to which it is
                 connected by the ``isa'' hierarchy as global rules. In
                 this way, as local rules may hide global rules, it is
                 possible to deal with default properties and
                 exceptions. This new approach represents a novel
                 attempt to combine the logic paradigm with the
                 object-oriented one in knowledge base systems.
                 Moreover, this approach provides a new ground for
                 explaining some recent proposals of semantics for
                 classical logic programs with negation in the rule
                 bodies and gives an interesting semantics to logic
                 programs with negated rule heads}.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Languages; Verification",
  subject =      "Theory of Computation --- Mathematical Logic and
                 Formal Languages --- Mathematical Logic (F.4.1): {\bf
                 Logic and constraint programming}; Software ---
                 Software Engineering --- Design Tools and Techniques
                 (D.2.2): {\bf Modules and interfaces}; Computing
                 Methodologies --- Artificial Intelligence --- Knowledge
                 Representation Formalisms and Methods (I.2.4): {\bf
                 Representations (procedural and rule-based)}; Software
                 --- Programming Techniques --- General (D.1.0);
                 Information Systems --- Database Management --- Systems
                 (H.2.4)",
}

@InProceedings{Chrysanthis:1990:AFS,
  author =       "Panayiotis K. Chrysanthis and Krithi Ramamritham",
  title =        "{ACTA}: a framework for specifying and reasoning about
                 transaction structure and behavior",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "194--203",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p194-chrysanthis/p194-chrysanthis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p194-chrysanthis/",
  abstract =     "Recently, a number of extensions to the traditional
                 transaction model have been proposed to support new
                 information-intensive applications such as CAD/CAM and
                 software development. However, these extended models
                 capture only a subset of interactions that can be found
                 in such applications, and represent only some of the
                 points within the spectrum of interactions possible in
                 competitive and cooperative environments. \par

                 {\em ACTA\/} is a formalizable framework developed for
                 characterizing the whole spectrum of interactions. The
                 ACTA framework is {\em not\/} yet another transaction
                 model, but is intended to unify the existing models.
                 ACTA allows for specifying the {\em structure\/} and
                 the {\em behavior\/} of transactions as well as for
                 reasoning about the concurrency and recovery properties
                 of the transactions. In ACTA, the semantics of
                 interactions are expressed in terms of transactions'
                 effects on the commit and abort of other transactions
                 and on objects' state and concurrency status (i.e.,
                 synchronization state). Its ability to capture the
                 semantics of previously proposed transaction models is
                 indicative of its generality. The reasoning
                 capabilities of this framework have also been tested by
                 using the framework to study the properties of a new
                 model that is derived by combining two existing
                 transaction models.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Transaction processing}; Software
                 --- Operating Systems --- File Systems Management
                 (D.4.3); Information Systems --- Database Management
                 --- Logical Design (H.2.1): {\bf Data models};
                 Information Systems --- Database Management --- Systems
                 (H.2.4): {\bf Concurrency}",
}

@InProceedings{Schlipf:1990:EPL,
  author =       "John S. Schlipf",
  title =        "The expressive powers of the logic programming
                 semantics (extended abstract)",
  crossref =     "ACM:1990:PPN",
  pages =        "196--204",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/298514/p196-schlipf/p196-schlipf.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/298514/p196-schlipf/",
  abstract =     "We compare the expressive powers of three semantics
                 for deductive databases and logic programming: the
                 3-valued program completion semantics, the well-founded
                 semantics, and the stable semantics, We identify the
                 expressive power of the stable semantics, and in fairly
                 general circumstances that of the well-founded
                 semantics. \par

                 Over infinite Herbrand models, where the three
                 semantics have equivalent expressive power, we also
                 consider a notion of uniform translatability between
                 the 3-valued program completion and well-founded
                 semantics. In this sense of uniform translatability we
                 show the well-founded semantics to be more
                 expressive.",
  acknowledgement = ack-nhfb,
  annote =       "36 papers; See also 6836.1508 1990 9th for papers",
  classification = "C1230 (Artificial intelligence); C4210 (Formal
                 logic); C4240 (Programming and algorithm theory); C4250
                 (Database theory); C6160 (Database management systems
                 (DBMS))",
  corpsource =   "Cincinnati Univ., OH, USA",
  generalterms = "Design; Languages; Management; Performance; Theory;
                 Verification",
  keywords =     "3-valued program completion semantics; ACM; database
                 management systems; database systems; database theory;
                 deductive databases; expressive powers; infinite
                 Herbrand models; knowledge based systems; logic
                 programming; logic programming semantics; programming
                 theory; SIGACT; stable semantics; ternary logic;
                 uniform translatability; well- founded semantics",
  sponsororg =   "SIGACT; SIGMOD; SIGART",
  subject =      "Theory of Computation --- Logics and Meanings of
                 Programs --- Semantics of Programming Languages
                 (F.3.2); 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};
                 Computing Methodologies --- Artificial Intelligence ---
                 Deduction and Theorem Proving (I.2.3): {\bf Deduction};
                 Information Systems --- Database Management ---
                 Database Applications (H.2.8)",
  treatment =    "T Theoretical or Mathematical",
  xxpages =      "64--86",
}

@InProceedings{Dayal:1990:OLR,
  author =       "Umeshwar Dayal and Meichun Hsu and Rivka Ladin",
  title =        "Organizing long-running activities with triggers and
                 transactions",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "204--214",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p204-dayal/p204-dayal.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p204-dayal/",
  abstract =     "This paper addresses the problem of organising and
                 controlling activities that involve multiple steps of
                 processing and that typically are of long duration. We
                 explore the use of triggers and transactions to specify
                 and organize such long-running activities. Triggers
                 offer data- or event-driven specification of control
                 flow, and thus provide a flexible and modular framework
                 with which the control structures of the activities can
                 be extended or modified. We describe a model based on
                 event-condition-action rules and coupling modes. The
                 execution of these rules is governed by an extended
                 nested transaction model. Through a detailed example,
                 we illustrate the utility of the various features of
                 the model for chaining related steps without
                 sacrificing concurrency, for enforcing integrity
                 constraints, and for providing flexible failure and
                 exception handling.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Languages",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Transaction processing};
                 Information Systems --- Database Management ---
                 Languages (H.2.3); Computer Applications --- Life and
                 Medical Sciences (J.3): {\bf Medical information
                 systems}; Theory of Computation --- Analysis of
                 Algorithms and Problem Complexity --- Nonnumerical
                 Algorithms and Problems (F.2.2): {\bf Computations on
                 discrete structures}",
}

@InProceedings{Sacca:1990:SMN,
  author =       "Domenico Sacca and Carlo Zaniolo",
  title =        "Stable models and nondeterminism in logic programs
                 with negation",
  crossref =     "ACM:1990:PPN",
  pages =        "205--217",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/298514/p205-sacca/p205-sacca.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/298514/p205-sacca/",
  abstract =     "Previous researchers have proposed generalizations of
                 Horn clause logic to support negation and
                 non-determinism as two separate extensions. In this
                 paper, we show that the stable model semantics for
                 logic programs provides a unified basis for the
                 treatment of both concepts. First, we introduce the
                 concepts of partial models, stable models, strongly
                 founded models and deterministic models and other
                 interesting classes of partial models and study their
                 relationships. We show that the maximal deterministic
                 model of a program is a subset of the intersection of
                 all its stable models and that the well-founded model
                 of a program is a subset of its maximal deterministic
                 model. Then, we show that the use of stable models
                 subsumes the use of the non-deterministic {\em
                 choice\/} construct in LDL and provides an alternative
                 definition of the semantics of this construct. Finally,
                 we provide a constructive definition for stable models
                 with the introduction of a procedure, called {\em
                 backtracking fixpoint,\/} that non-deterministically
                 constructs a total stable model, if such a model
                 exists.",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4210 (Formal
                 logic); C4240 (Programming and algorithm theory); C4250
                 (Database theory); C6160 (Database management systems
                 (DBMS))",
  corpsource =   "Dipartimento di Sistemi, Calabria Univ., Rende,
                 Italy",
  generalterms = "Design; Languages; Management; Performance;
                 Reliability; Theory; Verification",
  keywords =     "backtracking fixpoint; database management systems;
                 database theory; deterministic models; formal logic;
                 knowledge based systems; logic programming; logic
                 programs; negation; nondeterminism; partial models;
                 programming theory; stable model semantics; strongly
                 founded models",
  sponsororg =   "SIGACT; SIGMOD; SIGART",
  subject =      "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};
                 Theory of Computation --- Computation by Abstract
                 Devices --- Modes of Computation (F.1.2): {\bf
                 Alternation and nondeterminism}; Theory of Computation
                 --- Logics and Meanings of Programs --- Semantics of
                 Programming Languages (F.3.2)",
  treatment =    "T Theoretical or Mathematical",
}

@InProceedings{Breitbart:1990:RTM,
  author =       "Yuri Breitbart and Avi Silberschatz and Glenn R.
                 Thompson",
  title =        "Reliable transaction management in a multidatabase
                 system",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "215--224",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p215-breitbart/p215-breitbart.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p215-breitbart/",
  abstract =     "A model of a multidatabase system is defined in which
                 each local DBMS uses the two-phase locking protocol
                 Locks are released by a global transaction only after
                 the transaction commits or aborts at each local site.
                 Failures may occur during the processing of
                 transactions. We design a fault tolerant transaction
                 management algorithm and recovery procedures that
                 retain global database consistency. We also show that
                 our algorithms ensure freedom from global deadlocks of
                 any kind.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Transaction processing};
                 Information Systems --- Database Management --- Logical
                 Design (H.2.1): {\bf Data models}; Software ---
                 Operating Systems --- Process Management (D.4.1): {\bf
                 Scheduling}",
}

@InProceedings{Abiteboul:1990:NDL,
  author =       "Serge Abiteboul and Eric Simon and Victor Vianu",
  title =        "Non-deterministic languages to express deterministic
                 transformations",
  crossref =     "ACM:1990:PPN",
  pages =        "218--229",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/298514/p218-abiteboul/p218-abiteboul.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/298514/p218-abiteboul/",
  abstract =     "The use of non-deterministic database languages is
                 motivated using pragmatic and theoretical
                 considerations. It is shown that non-determinism
                 resolves some difficulties concerning the expressive
                 power of deterministic languages: there are
                 non-deterministic languages expressing low complexity
                 classes of queries/updates, whereas no such
                 deterministic languages exist. Various mechanisms
                 yielding non-determinism are reviewed. The focus is on
                 two closely related families of non-deterministic
                 languages. The first consists of extensions of {\em
                 Datalog\/} with negations in bodies and/or heads of
                 rules, with non-deterministic fixpoint semantics. The
                 second consists of non-deterministic extensions of
                 first-order logic and fixpoint logics, using the {\em
                 witness\/} operator. The ability of the various
                 non-deterministic languages to express {\em
                 deterministic\/} transformation is characterized. In
                 particular, non-deterministic languages expressing
                 exactly the queries/updates computable in polynomial
                 time are exhibited, whereas it is conjectured that no
                 analogous deterministic language exists. The connection
                 between non-deterministic languages and determinism is
                 also explored. Several problems of practical interest
                 are examined, such as checking (statically or
                 dynamically) if a given program is deterministic,
                 detecting coincidence of deterministic and
                 non-deterministic semantics, and verifying termination
                 for non-deterministic programs.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Languages; Management; Performance; Theory;
                 Verification",
  subject =      "Information Systems --- Database Management ---
                 Languages (H.2.3); Theory of Computation ---
                 Computation by Abstract Devices --- Modes of
                 Computation (F.1.2): {\bf Alternation and
                 nondeterminism}",
}

@InProceedings{Abiteboul:1990:NLE,
  author =       "S. Abiteboul and E. Simon and V. Vianu",
  title =        "Nondeterministic languages to express deterministic
                 transformations",
  crossref =     "ACM:1990:PPN",
  pages =        "218--229",
  year =         "1990",
  bibdate =      "Mon Mar 16 10:08:58 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory); C4250 (Database theory); C6140D
                 (High level languages); C6160 (Database management
                 systems (DBMS))",
  corpsource =   "INRIA, Le Chesnay, France",
  keywords =     "database management systems; database theory; Datalog;
                 deterministic languages; deterministic transformations;
                 expressive power; first-order logic; fixpoint logics;
                 formal logic; logic programming; negations;
                 nondeterministic database languages; nondeterministic
                 fixpoint semantics; polynomial time; programming
                 theory; query languages; witness operator",
  sponsororg =   "SIGACT; SIGMOD; SIGART",
  treatment =    "T Theoretical or Mathematical",
}

@InProceedings{Cacace:1990:IOO,
  author =       "F. Cacace and S. Ceri and S. Crespi-Reghizzi and L.
                 Tanca and R. Zicari",
  title =        "Integrating object-oriented data modelling with a
                 rule-based programming paradigm",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "225--236",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p225-cacace/p225-cacace.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p225-cacace/",
  abstract =     "LOGRES is a new project for the development of
                 extended database systems which is based on the
                 integration of the object-oriented data modelling
                 paradigm and of the rule-based approach for the
                 specification of queries and updates. \par

                 The data model supports generalization hierarchies and
                 object sharing, the rule-based language extends {\em
                 Datalog\/} to support generalized type constructors
                 (sets, multisets, and sequences), rule-based integrity
                 constraints are automatically produced by analyzing
                 schema definitions. Modularization is a fundamental
                 feature, as modules encapsulate queries and updates,
                 when modules are applied to a LOGRES database, their
                 side effects can be controlled. \par

                 The LOGRES project is a follow-up of the ALGRES
                 project, and takes advantage of the ALGRES programming
                 environment for the development of a fast prototype.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Languages",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Information
                 Systems --- Database Management --- Logical Design
                 (H.2.1): {\bf Data models}; Information Systems ---
                 Database Management --- Languages (H.2.3): {\bf
                 Datalog}",
}

@InProceedings{Yannakakis:1990:GTM,
  author =       "Mihalis Yannakakis",
  title =        "Graph-theoretic methods in database theory",
  crossref =     "ACM:1990:PPN",
  pages =        "230--242",
  year =         "1990",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/298514/p230-yannakakis/p230-yannakakis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/298514/p230-yannakakis/",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4250 (Database
                 theory)",
  corpsource =   "AT and T Bell Labs., Murray Hill, NJ, USA",
  keywords =     "database theory; dynamic problem; graph theory; main
                 memory model; online queries; online updates; parallel
                 algorithms; path problems; query processing; recursive
                 queries; searching graphs; semiring computations;
                 transitive closure",
  sponsororg =   "SIGACT; SIGMOD; SIGART",
  treatment =    "B Bibliography; T Theoretical or Mathematical",
}

@InProceedings{Kiernan:1990:MDD,
  author =       "G. Kiernan and C. de Maindreville and E. Simon",
  title =        "Making deductive databases a practical technology: a
                 step forward",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "237--246",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p237-kiernan/p237-kiernan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p237-kiernan/",
  abstract =     "Deductive databases provide a formal framework to
                 study rule-based query languages that are extensions of
                 first-order logic. However, deductive database
                 languages and their current implementations do not seem
                 appropriate for improving the development of real
                 applications or even sample of them. Our goal is to
                 make deductive database technology practical. The
                 design and implementation of the RDL1 system, presented
                 in this paper, constitute a step toward this goal. Our
                 approach is based on the integration of a production
                 rule language within a relational database system, the
                 development of a rule-based programming environment and
                 the support of system extensibility using Abstract Data
                 Types. We discuss important practical experience gained
                 during the implementation of the system. Also,
                 comparisons with related work such as LDL, STARBURST
                 and POSTGRES are given.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Languages; Performance; Theory",
  subject =      "Information Systems --- Database Management ---
                 Languages (H.2.3): {\bf Datalog}; Theory of Computation
                 --- Mathematical Logic and Formal Languages ---
                 Mathematical Logic (F.4.1); 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}; Information Systems --- Database
                 Management --- Systems (H.2.4); Software ---
                 Programming Languages --- Language Classifications
                 (D.3.2): {\bf LISP}",
}

@InProceedings{Willard:1990:QAP,
  author =       "Dan E. Willard",
  title =        "Quasilinear algorithms for processing relational
                 calculus expressions (preliminary report)",
  crossref =     "ACM:1990:PPN",
  pages =        "243--257",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/298514/p243-willard/p243-willard.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/298514/p243-willard/",
  abstract =     "Throughout this paper q will denote a query such that
                 I is the number of tuples inputted into the query, and
                 U is the number of tuples in its output. We will say
                 that q has quasi-linear complexity iff for some
                 constant d, it is executable in time O(U + I log d I)
                 and space O(I + U). This article will define a large
                 subset of the relational calculus, called RCS, and show
                 that all RCS queries are executable by quasi-linear
                 algorithms. \par

                 Our algorithm does not require the maintenance of any
                 complex index, as it builds all the needed data
                 structures during the course of the executing
                 algorithm. Its exponent d can be large for some
                 particular queries q, but it is a quite nice constant
                 equal to 1 or 0 in most practical cases. Our algorithm
                 is intended for data bases stored in main memory, and
                 its time O(U + I log d I) should amount to only a few
                 seconds of CPU time in many practical applications.
                 \par

                 Chapter 10 of this paper lists some open questions for
                 further investigation.",
  acknowledgement = ack-nhfb,
  classification = "C4250 (Database theory); C6160D (Relational DBMS)",
  corpsource =   "Dept. of Comput. Sci., State Univ. of New York,
                 Albany, NY, USA",
  generalterms = "Algorithms; Design; Management; Performance; Theory;
                 Verification",
  keywords =     "computational complexity; data structures; database
                 theory; main memory; quasi-linear complexity; query
                 languages; RCS; RCS queries; relational calculus
                 expressions; relational databases",
  sponsororg =   "SIGACT; SIGMOD; SIGART",
  subject =      "Computing Methodologies --- Symbolic and Algebraic
                 Manipulation --- Algorithms (I.1.2); Computing
                 Methodologies --- Symbolic and Algebraic Manipulation
                 --- Expressions and Their Representation (I.1.1);
                 Information Systems --- Database Management --- Systems
                 (H.2.4): {\bf Relational databases}",
  treatment =    "T Theoretical or Mathematical",
}

@InProceedings{Mumick:1990:MR,
  author =       "I. S. Mumick and S. J. Finkelstein and Hamid Pirahesh
                 and Raghu Ramakrishnan",
  title =        "Magic is relevant",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "247--258",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p247-mumick/p247-mumick.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p247-mumick/",
  abstract =     "We define the magic-sets transformation for
                 traditional relational systems (with duplicates,
                 aggregation and grouping), as well as for relational
                 systems extended with recursion. We compare the
                 magic-sets rewriting to traditional optimization
                 techniques for nonrecursive queries, and use
                 performance experiments to argue that the magic-sets
                 transformation is often a better optimization
                 technique.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Experimentation; Languages;
                 Performance",
  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 SQL}",
}

@InProceedings{Abdel-Ghaffar:1990:ODA,
  author =       "Khaled A. S. Abdel-Ghaffar and Amr {El Abbadi}",
  title =        "On the optimality of disk allocation for {Cartesian}
                 product files (extended abstract)",
  crossref =     "ACM:1990:PPN",
  pages =        "258--264",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/298514/p258-abdel-ghaffar/p258-abdel-ghaffar.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/298514/p258-abdel-ghaffar/",
  abstract =     "In this paper we present a coding-theoretic analysis
                 of the disk allocation problem. We provide both
                 necessary and sufficient conditions for the existence
                 of strictly optimal allocation methods. Based on a
                 class of optimal codes, known as maximum distance
                 separable codes, strictly optimal allocation methods
                 are constructed. Using the necessary conditions proved,
                 we argue that the standard definition of strict
                 optimality is too strong, and cannot be attained in
                 general. A new criterion for optimality is therefore
                 defined whose objective is to design allocation methods
                 that yield a response time of one for all queries with
                 a minimum number of specified attributes. Using coding
                 theory, we determined this minimum number for binary
                 files, assuming that the number of disks is a power of
                 two. In general, our approach provides better
                 allocation methods than previous techniques.",
  acknowledgement = ack-nhfb,
  classification = "C1260 (Information theory); C4250 (Database theory);
                 C6120 (File organisation)",
  corpsource =   "Dept of Electr. Eng. and Comput. Sci., California
                 Univ., Davis, CA, USA",
  generalterms = "Design; Management; Measurement; Performance; Theory;
                 Verification",
  keywords =     "binary files; Cartesian product files;
                 coding-theoretic analysis; database theory; disk
                 allocation; information theory; maximum distance
                 separable codes; necessary conditions; optimal
                 allocation methods; response time; storage allocation",
  sponsororg =   "SIGACT; SIGMOD; SIGART",
  subject =      "Data --- Coding and Information Theory (E.4); Software
                 --- Operating Systems --- Storage Management (D.4.2):
                 {\bf Allocation/deallocation strategies}; Information
                 Systems --- Information Storage and Retrieval ---
                 Information Storage (H.3.2): {\bf File organization}",
  treatment =    "T Theoretical or Mathematical",
}

@InProceedings{Widom:1990:SOP,
  author =       "Jennifer Widom and S. J. Finkelstein",
  title =        "Set-oriented production rules in relational database
                 systems",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "259--270",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p259-widom/p259-widom.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p259-widom/",
  abstract =     "We propose incorporating a production rules facility
                 into a relational database system. Such a facility
                 allows definition of database operations that are
                 automatically executed whenever certain conditions are
                 met. In keeping with the set-oriented approach of
                 relational data manipulation languages, our production
                 rules are also set-oriented--they are triggered by sets
                 of changes to the database and may perform sets of
                 changes. The condition and action parts of our
                 production rules may refer to the current state of the
                 database as well as to the sets of changes triggering
                 the rules. We define a syntax for production rule
                 definition as an extension to SQL. A model of system
                 behavior is used to give an exact semantics for
                 production rule execution, taking into account
                 externally-generated operations, self-triggering rules,
                 and simultaneous triggering of multiple rules.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Languages",
  subject =      "Information Systems --- Database Management ---
                 Logical Design (H.2.1): {\bf Data models}; Computing
                 Methodologies --- Artificial Intelligence --- Knowledge
                 Representation Formalisms and Methods (I.2.4): {\bf
                 Representations (procedural and rule-based)};
                 Information Systems --- Database Management ---
                 Languages (H.2.3): {\bf SQL}; Information Systems ---
                 Database Management --- Systems (H.2.4)",
}

@InProceedings{Aref:1990:EPW,
  author =       "Walid G. Aref and Hanan Samet",
  title =        "Efficient processing of window queries in the pyramid
                 data structure",
  crossref =     "ACM:1990:PPN",
  pages =        "265--272",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/298514/p265-aref/p265-aref.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/298514/p265-aref/",
  abstract =     "Window operations serve as the basis of a number of
                 queries that can be posed in a spatial database.
                 Examples of these window-based queries include the
                 exist query (i.e., determining whether or not a spatial
                 feature exists inside a window) and the report query,
                 (i.e., reporting the identity of all the features that
                 exist inside a window). Algorithms are described for
                 answering window queries in ($n$ log log {$T$}) time
                 for a window of size $n$ x $n$ in a feature space
                 (e.g., an image) of size {$T$} x {$T$} (e.g., pixel
                 elements). The significance of this result is that even
                 though the window contains $n$ 2 pixel elements, the
                 worst-case time complexity of the algorithms is almost
                 linearly proportional (and not quadratic) to the window
                 diameter, and does not depend on other factors. The
                 above complexity bounds are achieved via the
                 introduction of the incomplete pyramid data structure
                 (a variant of the pyramid data structure) as the
                 underlying representation to store spatial features and
                 to answer queries on them.",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C4250
                 (Database theory); C6160Z (Other DBMS)",
  corpsource =   "Inst. for Adv. Comput. Studies, Maryland Univ.,
                 College Park, MD, USA",
  generalterms = "Algorithms; Design; Management; Measurement;
                 Performance; Theory",
  keywords =     "computational complexity; data structures; database
                 management systems; database theory; exist query; pixel
                 elements; pyramid data structure; report query; spatial
                 database; window queries; worst-case time complexity",
  sponsororg =   "SIGACT; SIGMOD; SIGART",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Data --- Data
                 Structures (E.1)",
  treatment =    "T Theoretical or Mathematical",
}

@InProceedings{Hanson:1990:PMA,
  author =       "Eric N. Hanson and Moez Chaabouni and Chang-Ho Kim and
                 Yu-Wang Wang",
  title =        "A predicate matching algorithm for database rule
                 systems",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "271--280",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p271-hanson/p271-hanson.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p271-hanson/",
  abstract =     "Forward-chaining rule systems must test each newly
                 asserted fact against a collection of predicates to
                 find those rules that match the fact. Expert system
                 rule engines use a simple combination of hashing and
                 sequential search for this matching. We introduce an
                 algorithm for finding the matching predicates that is
                 more efficient than the standard algorithm when the
                 number of predicates is large. We focus on equality and
                 inequality predicates on totally ordered domains. This
                 algorithm is well-suited for database rule systems,
                 where predicate-testing speed is critical. A key
                 component of the algorithm is the {\em interval binary
                 search tree\/} (IBS-tree). The IBS-tree is designed to
                 allow efficient retrieval of all intervals (e.g., range
                 predicates) that overlap a point, while allowing
                 dynamic insertion and deletion of intervals. The
                 algorithm could also be used to improve the performance
                 of forward-chaining inference engines for large expert
                 systems applications.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Performance",
  subject =      "Computing Methodologies --- Artificial Intelligence
                 --- Knowledge Representation Formalisms and Methods
                 (I.2.4): {\bf Representations (procedural and
                 rule-based)}; Computing Methodologies --- Artificial
                 Intelligence --- Problem Solving, Control Methods, and
                 Search (I.2.8): {\bf Heuristic methods}; Theory of
                 Computation --- Analysis of Algorithms and Problem
                 Complexity --- Nonnumerical Algorithms and Problems
                 (F.2.2): {\bf Sorting and searching}; Computing
                 Methodologies --- Artificial Intelligence --- Problem
                 Solving, Control Methods, and Search (I.2.8): {\bf
                 Graph and tree search strategies}; Information Systems
                 --- Database Management --- Systems (H.2.4)",
}

@InProceedings{Johnson:1990:FPA,
  author =       "Theodore Johnson and Dennis Shasha",
  title =        "A framework for the performance analysis of concurrent
                 {B}-tree algorithms",
  crossref =     "ACM:1990:PPN",
  pages =        "273--287",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/298514/p273-johnson/p273-johnson.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/298514/p273-johnson/",
  abstract =     "Many concurrent B-tree algorithms have been proposed,
                 but they have not yet been satisfactorily analyzed.
                 When transaction processing systems require high levels
                 of concurrency, a restrictive serialization technique
                 on the B-tree index can cause a bottleneck. In this
                 paper, we present a framework for constructing
                 analytical performance models of concurrent B-tree
                 algorithms. The models can predict the response time
                 and maximum throughput. We analyze three algorithms:
                 Naive Lock-coupling, Optimistic Descent, and the
                 Lehman-Yao algorithm. The analyses are validated by
                 simulations of the algorithms on actual B-trees. Simple
                 and instructive rules of thumb for predicting
                 performance are also derived. We apply the analyses to
                 determine the effect of database recovery on B-tree
                 concurrency.",
  acknowledgement = ack-nhfb,
  classification = "C4250 (Database theory); C6160B (Distributed DBMS)",
  corpsource =   "Courant Inst. of Math. Sci., New York Univ., NY, USA",
  generalterms = "Algorithms; Design; Experimentation; Management;
                 Measurement; Performance; Theory",
  keywords =     "B-tree index; concurrency control; concurrent B-tree
                 algorithms; data structures; database recovery;
                 database theory; distributed databases; Lehman-Yao
                 algorithm; maximum throughput; naive lock-coupling;
                 optimistic descent; performance analysis; response
                 time; transaction processing systems; trees
                 (mathematics)",
  sponsororg =   "SIGACT; SIGMOD; SIGART",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Concurrency}; Mathematics of
                 Computing --- Discrete Mathematics --- General (G.2.0);
                 Information Systems --- Database Management --- Systems
                 (H.2.4): {\bf Transaction processing}; Mathematics of
                 Computing --- Probability and Statistics (G.3): {\bf
                 Queueing theory}",
  treatment =    "T Theoretical or Mathematical",
}

@InProceedings{Stonebraker:1990:RPC,
  author =       "Michael Stonebraker and Anant Jhingran and Jeffrey Goh
                 and Spyros Potamianos",
  title =        "On rules, procedure, caching and views in data base
                 systems",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "281--290",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p281-stonebraker/p281-stonebraker.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p281-stonebraker/",
  abstract =     "This paper demonstrates that a simple rule system can
                 be constructed that supports a more powerful view
                 system than available in current commercial systems.
                 Not only can views be specified by using rules but also
                 special semantics for resolving ambiguous view updates
                 are simply additional rules. Moreover, procedural data
                 types as proposed in POSTGRES are also efficiently
                 simulated by the same rules system. Lastly, caching of
                 the action part of certain rules is a possible
                 performance enhancement and can be applied to
                 materialize views as well as to cache procedural data
                 items. Hence, we conclude that a rule system is a
                 fundamental concept in a next generation DBMS, and it
                 subsumes both views and procedures as special cases.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Languages; Performance",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Information
                 Systems --- Database Management --- Logical Design
                 (H.2.1): {\bf Data models}; Information Systems ---
                 Database Management --- Languages (H.2.3)",
}

@InProceedings{Lassez:1990:QC,
  author =       "Jean-Louis Lassez",
  title =        "Querying constraints",
  crossref =     "ACM:1990:PPN",
  pages =        "288--298",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/298514/p288-lassez/p288-lassez.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/298514/p288-lassez/",
  abstract =     "The design of languages to tackle constraint
                 satisfaction problems has a long history. Only more
                 recently the reverse problem of introducing constraints
                 as primitive constructs in programming languages has
                 been addressed. A main task that the designers and
                 implementors of such languages face is to use and adapt
                 the concepts and algorithms from the extensive studies
                 on constraints done in areas such as Mathematical
                 Programming, Symbolic Computation, Artificial
                 Intelligence, Program Verification and Computational
                 Geometry. In this paper, we illustrate this task in a
                 simple and yet important domain: linear arithmetic
                 constraints. We show how one can design a querying
                 system for sets of linear constraints by using basic
                 concepts from logic programming and symbolic
                 computation, as well as algorithms from linear
                 programming and computational geometry. We conclude by
                 reporting briefly on how notions of negation and
                 canonical representation used in linear constraints can
                 be generalized to account for cases in term algebras,
                 symbolic computation, affine geometry, and elsewhere.",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages); C6160 (Database
                 management systems (DBMS))",
  corpsource =   "IBM Thomas J. Watson Res. Center, Yorktown Heights,
                 NY, USA",
  generalterms = "Algorithms; Design; Languages; Management;
                 Performance; Theory",
  keywords =     "affine geometry; canonical representation;
                 computational geometry; constraint satisfaction
                 problems; database management systems; linear
                 arithmetic constraints; linear programming; logic
                 programming; negation; primitive constructs;
                 programming languages; query languages; querying
                 system; reverse problem; symbolic computation; term
                 algebras",
  sponsororg =   "SIGACT; SIGMOD; SIGART",
  subject =      "Information Systems --- Database Management ---
                 Languages (H.2.3); Mathematics of Computing ---
                 Numerical Analysis --- Optimization (G.1.6): {\bf
                 Linear programming}; 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}",
  treatment =    "P Practical",
}

@InProceedings{Rosenthal:1990:QGI,
  author =       "Arnon Rosenthal and Cesar Galindo-Legaria",
  title =        "Query graphs, implementing trees, and
                 freely-reorderable outerjoins",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "291--299",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p291-rosenthal/p291-rosenthal.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p291-rosenthal/",
  abstract =     "We determine when a join/outerjoin query can be
                 expressed unambiguously as a query graph, without an
                 explicit specification of the order of evaluation. To
                 do so, we first characterize the set of expression
                 trees that implement a given join/outerjoin query
                 graph, and investigate the existence of transformations
                 among the various trees. Our main theorem is that a
                 join/outerjoin query is freely reorderable if the query
                 graph derived from it falls within a particular class,
                 every tree that ``implements'' such a graph evaluates
                 to the same result. \par

                 The result has applications to language design and
                 query optimization. Languages that generate queries
                 within such a class do not require the user to indicate
                 priority among join operations, and hence may present a
                 simplified syntax. And it is unnecessary to add
                 extensive analyses to a conventional query optimizer in
                 order to generate legal reorderings for a
                 freely-reorderable language.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Languages; Performance; Theory",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Mathematics of
                 Computing --- Discrete Mathematics --- Graph Theory
                 (G.2.2): {\bf Trees}; Theory of Computation ---
                 Analysis of Algorithms and Problem Complexity ---
                 Nonnumerical Algorithms and Problems (F.2.2): {\bf
                 Computations on discrete structures}",
}

@InProceedings{Kanellakis:1990:CQL,
  author =       "Paris C. Kanellakis and Gabriel M. Kuper and Peter Z.
                 Revesz",
  title =        "Constraint query languages (preliminary report)",
  crossref =     "ACM:1990:PPN",
  pages =        "299--313",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/298514/p299-kanellakis/p299-kanellakis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/298514/p299-kanellakis/",
  abstract =     "We discuss the relationship between constraint
                 programming and database query languages. We show that
                 bottom-up, efficient, declarative database programming
                 can be combined with efficient constraint solving. The
                 key intuition is that the generalization of a ground
                 fact, or tuple, is a conjunction of constraints. We
                 describe the basic Constraint Query Language design
                 principles, and illustrate them with four different
                 classes of constraints: Polynomial, rational order,
                 equality, and Boolean constraints.",
  acknowledgement = ack-nhfb,
  annote =       "36 papers; See also 6836.1508 1990 9th for papers",
  classification = "C6140D (High level languages); C6160 (Database
                 management systems (DBMS))",
  corpsource =   "Brown Univ., Providence, RI, USA",
  generalterms = "Design; Languages; Management; Performance; Theory",
  keywords =     "ACM; constraint programming; constraint solving;
                 database management systems; database query languages;
                 database systems; declarative database programming;
                 logic programming; query languages; SIGACT",
  sponsororg =   "SIGACT; SIGMOD; SIGART",
  subject =      "Mathematics of Computing --- Numerical Analysis ---
                 Optimization (G.1.6): {\bf Constrained optimization};
                 Information Systems --- Database Management ---
                 Languages (H.2.3); Computing Methodologies --- Computer
                 Graphics --- Computational Geometry and Object Modeling
                 (I.3.5)",
  treatment =    "P Practical",
  xxpages =      "26--52",
}

@InProceedings{Shekita:1990:PEP,
  author =       "Eugene J. Shekita and Michael J. Carey",
  title =        "A performance evaluation of pointer-based joins",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "300--311",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p300-shekita/p300-shekita.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p300-shekita/",
  abstract =     "In this paper we describe three pointer-based join
                 algorithms that are simple variants of the
                 nested-loops, sort-merge, and hybrid-hash join
                 algorithms used in relational database systems. Each
                 join algorithm is described and an analysis is carried
                 out to compare the performance of the pointer-based
                 algorithms to their standard, non-pointer-based
                 counterparts. The results of the analysis show that the
                 pointer-based algorithms can provide significant
                 performance gains in many situations. The results also
                 show that the pointer-based nested-loops join
                 algorithm, which is perhaps the most natural
                 pointer-based join algorithm to consider using in an
                 object-oriented database system, performs quite poorly
                 on most medium to large joins.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Performance",
  subject =      "Information Systems --- Database Management ---
                 Logical Design (H.2.1): {\bf Data models}; Information
                 Systems --- Database Management --- Systems (H.2.4):
                 {\bf Query processing}; Theory of Computation ---
                 Analysis of Algorithms and Problem Complexity ---
                 Nonnumerical Algorithms and Problems (F.2.2): {\bf
                 Sorting and searching}",
}

@InProceedings{Ioannidis:1990:RAO,
  author =       "Y. E. Ioannidis and Younkyung Kang",
  title =        "Randomized algorithms for optimizing large join
                 queries",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "312--321",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p312-ioannidis/p312-ioannidis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p312-ioannidis/",
  abstract =     "Query optimization for relational database systems is
                 a combinatorial optimization problem, which makes
                 exhaustive search unacceptable as the query size grows.
                 Randomized algorithms, such as Simulated Annealing (SA)
                 and Iterative Improvement (II), are viable alternatives
                 to exhaustive search. We have adapted these algorithms
                 to the optimization of project-select-join queries. We
                 have tested them on large queries of various types with
                 different databases, concluding that in most cases SA
                 identifies a lower cost access plan than II. To explain
                 this result, we have studied the shape of the cost
                 function over the solution space associated with such
                 queries and we have conjectured that it resembles a
                 `cup' with relatively small variations at the bottom.
                 This has inspired a new Two Phase Optimization
                 algorithm, which is a combination of Simulated
                 Annealing and Iterative Improvement. Experimental
                 results show that Two Phase Optimization outperforms
                 the original algorithms in terms of both output quality
                 and running time.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Experimentation; Performance",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Information
                 Systems --- Database Management --- Logical Design
                 (H.2.1): {\bf Data models}; Theory of Computation ---
                 Analysis of Algorithms and Problem Complexity ---
                 Miscellaneous (F.2.m); Mathematics of Computing ---
                 Numerical Analysis --- Optimization (G.1.6)",
}

@InProceedings{Mumick:1990:MC,
  author =       "Inderpal Singh Mumick and Sheldon J. Finkelstein and
                 Hamid Pirahesh and Raghu Ramakrishnan",
  title =        "Magic conditions",
  crossref =     "ACM:1990:PPN",
  pages =        "314--330",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/298514/p314-mumick/p314-mumick.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/298514/p314-mumick/",
  abstract =     "Much recent work has focussed on the bottom-up
                 evaluation of Datalog programs. One approach, called
                 Magic-Sets, is based on rewriting a logic program so
                 that bottom-up fixpoint evaluation of the program
                 avoids generation of irrelevant facts ([BMSU86, BR87,
                 Ram88]). It is widely believed that the principal
                 application of the Magic-Sets technique is to restrict
                 computation in recursive queries using equijoin
                 predicates. We extend the Magic-Set transformation to
                 use predicates other than equality ({$X$} 10, for
                 example). This Extended Magic-Set technique has
                 practical utility in ``real'' relational databases, not
                 only for recursive queries, but for non-recursive
                 queries as well; in ([MFPR90]) we use the results in
                 this paper and those in [MPR89] to define a magic-set
                 transformation for relational databases supporting SQL
                 and its extensions, going on to describe an
                 implementation of magic in Starburst ([HFLP89]). We
                 also give preliminary performance measurements. \par

                 In extending Magic-Sets, we describe a natural
                 generalization of the common class of bound $b$ and
                 free () adornments. We also present a formalism to
                 compare adornment classes.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Languages; Management;
                 Performance; Reliability; Theory; Verification",
  subject =      "Information Systems --- Database Management ---
                 Languages (H.2.3): {\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}; Theory of Computation ---
                 Mathematical Logic and Formal Languages --- Grammars
                 and Other Rewriting Systems (F.4.2): {\bf Parallel
                 rewriting systems}",
}

@InProceedings{Mumick:1990:MCR,
  author =       "I. S. Mumick and S. J. Finkelstein and H. Pirahesh and
                 Ramakrishnan and R.",
  title =        "Magic conditions (relational queries)",
  crossref =     "ACM:1990:PPN",
  pages =        "314--380",
  year =         "1990",
  bibdate =      "Mon Mar 16 10:08:58 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  classification = "C4250 (Database theory); C6140D (High level
                 languages); C6160D (Relational DBMS)",
  corpsource =   "Stanford Univ., CA, USA",
  keywords =     "adornment classes; bottom-up evaluation; database
                 theory; Datalog programs; equijoin predicates; logic
                 program; Magic-Sets; query languages; recursive
                 queries; relational databases",
  sponsororg =   "SIGACT; SIGMOD; SIGART",
  treatment =    "P Practical",
}

@InProceedings{Beckmann:1990:RTE,
  author =       "Norbert Beckmann and Hans-Peter Kriegel and Ralf
                 Schneider and Bernhard Seeger",
  title =        "The {R$^*$-tree}: an efficient and robust access
                 method for points and rectangles",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "322--331",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p322-beckmann/p322-beckmann.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p322-beckmann/",
  abstract =     "The R-tree, one of the most popular access methods for
                 rectangles, is based on the heuristic optimization of
                 the area of the enclosing rectangle in each inner node.
                 By running numerous experiments in a standardized
                 testbed under highly varying data, queries and
                 operations, we were able to design the R * -tree which
                 incorporates a combined optimization of area, margin
                 and overlap of each enclosing rectangle in the
                 directory. Using our standardized testbed in an
                 exhaustive performance comparison, it turned out that
                 the R * -tree clearly outperforms the existing R-tree
                 variants. Guttman's linear and quadratic R-tree and
                 Greene's variant of the R-tree. This superiority of the
                 R * -tree holds for different types of queries and
                 operations, such as map overlay, for both rectangles
                 and multidimensional points in all experiments. From a
                 practical point of view the R * -tree is very
                 attractive because of the following two reasons 1 it
                 efficiently supports point and spatial data at the same
                 time and 2 its implementation cost is only slightly
                 higher than that of other R-trees.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Performance",
  subject =      "Data --- Data Structures (E.1): {\bf Trees}; Theory of
                 Computation --- Analysis of Algorithms and Problem
                 Complexity --- Nonnumerical Algorithms and Problems
                 (F.2.2): {\bf Sorting and searching}; Information
                 Systems --- Database Management --- Logical Design
                 (H.2.1): {\bf Data models}",
}

@InProceedings{Haritsa:1990:BOA,
  author =       "Jayant R. Haritsa and Michael J. Carey and Miron
                 Livny",
  title =        "On being optimistic about real-time constraints",
  crossref =     "ACM:1990:PPN",
  pages =        "331--343",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/298514/p331-haritsa/p331-haritsa.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/298514/p331-haritsa/",
  abstract =     "Performance studies of concurrency control algorithms
                 for conventional database systems have shown that,
                 under most operating circumstances, locking protocols
                 outperform optimistic techniques. Real-time database
                 systems have special characteristics - timing
                 constraints are associated with transactions,
                 performance criteria are based on satisfaction of these
                 timing constraints, and scheduling algorithms are
                 priority driven. In light of these special
                 characteristics, results regarding the performance of
                 concurrency control algorithms need to be re-evaluated.
                 We show in this paper that the following parameters of
                 the real-time database system - its policy for dealing
                 with transactions whose constraints are not met, its
                 knowledge of transaction resource requirements, and the
                 availability of resources - have a significant impact
                 on the relative performance of the concurrency control
                 algorithms. In particular, we demonstrate that under a
                 policy that discards transactions whose constraints are
                 not met, optimistic concurrency control outperforms
                 locking over a wide range of system utilization. We
                 also outline why, for a variety of reasons, optimistic
                 algorithms appear well-suited to real-time database
                 systems.",
  acknowledgement = ack-nhfb,
  classification = "C6160B (Distributed DBMS)",
  corpsource =   "Dept. of Comput. Sci., Wisconsin Univ., Madison, WI,
                 USA",
  generalterms = "Algorithms; Design; Experimentation; Management;
                 Measurement; Performance; Theory",
  keywords =     "concurrency control; conventional database systems;
                 distributed databases; locking; locking protocols;
                 optimistic techniques; performance criteria; real-time
                 constraints; real-time database system; real-time
                 systems; scheduling algorithms; timing constraints;
                 transaction processing",
  sponsororg =   "SIGACT; SIGMOD; SIGART",
  subject =      "Computer Systems Organization --- Special-Purpose and
                 Application-Based Systems (C.3): {\bf Real-time and
                 embedded systems}; Information Systems --- Database
                 Management --- Systems (H.2.4): {\bf Transaction
                 processing}; Information Systems --- Database
                 Management --- Physical Design (H.2.2)",
  treatment =    "P Practical",
}

@InProceedings{Jagadish:1990:LCO,
  author =       "H. V. Jagadish",
  title =        "Linear clustering of objects with multiple
                 attributes",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "332--342",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p332-jagadish/p332-jagadish.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p332-jagadish/",
  abstract =     "There is often a need to map a multi-dimensional space
                 on to a one-dimensional space. For example, this kind
                 of mapping has been proposed to permit the use of
                 one-dimensional indexing techniques to a
                 multi-dimensional index space such as in a spatial
                 database. This kind of mapping is also of value in
                 assigning physical storage, such as assigning buckets
                 to records that have been indexed on multiple
                 attributes, to minimize the disk access effort. \par

                 In this paper, we discuss what the desired properties
                 of such a mapping are, and evaluate, through analysis
                 and simulation, several mappings that have been
                 proposed in the past. We present a mapping based on
                 Hilbert's space-filling curve, which out-performs
                 previously proposed mappings on average over a variety
                 of different operating conditions.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Experimentation; Performance",
  subject =      "Theory of Computation --- Analysis of Algorithms and
                 Problem Complexity --- Nonnumerical Algorithms and
                 Problems (F.2.2): {\bf Sorting and searching};
                 Information Systems --- Database Management --- Logical
                 Design (H.2.1): {\bf Data models}; Data --- Files
                 (E.5): {\bf Sorting/searching}; Information Systems ---
                 Database Management --- Systems (H.2.4): {\bf Query
                 processing}",
}

@InProceedings{Orenstein:1990:CSQ,
  author =       "Jack Orenstein",
  title =        "A comparison of spatial query processing techniques
                 for native and parameter spaces",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "343--352",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p343-orenstein/p343-orenstein.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p343-orenstein/",
  abstract =     "Spatial queries can be evaluated in native space or in
                 a parameter space. In the latter case, data objects are
                 transformed into points and query objects are
                 transformed into search regions. The requirement for
                 different data and query representations may prevent
                 the use of parameter-space searching in some
                 applications. Native-space and parameter-space
                 searching are compared in the context of a z
                 order-based spatial access method. Experimental results
                 show that when there is a single query object,
                 searching in parameter space can be faster than
                 searching in native space, if the data and query
                 objects are large enough, and if sufficient redundancy
                 is used for the query representation. The result is,
                 however, less accurate than the native space result.
                 When there are multiple query objects, native-space
                 searching is better initially, but as the number of
                 query objects increases, parameter space searching with
                 low redundancy is superior. Native-space searching is
                 much more accurate for multiple-object queries.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Experimentation; Performance",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Theory of
                 Computation --- Analysis of Algorithms and Problem
                 Complexity --- Nonnumerical Algorithms and Problems
                 (F.2.2): {\bf Sorting and searching}; Data --- Files
                 (E.5): {\bf Sorting/searching}; Information Systems ---
                 Database Management --- Logical Design (H.2.1): {\bf
                 Data models}",
}

@InProceedings{Tam:1990:TTM,
  author =       "Va-On Tam and Meichun Hsu",
  title =        "Token transactions: managing fine-grained migration of
                 data",
  crossref =     "ACM:1990:PPN",
  pages =        "344--356",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/298514/p344-tam/p344-tam.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/298514/p344-tam/",
  abstract =     "Executing a transaction in a conventional distributed
                 database system involves the execution of several
                 subtransactions, each at a remote site where the data
                 reside and running a two-phase commit protocol at the
                 end of the transaction. With the advent of fast
                 communication networks, we consider an alternative
                 paradigm where the remote data being accessed are
                 dynamically {\em migrated\/} to the initiation site of
                 the transaction. One example of such a system is a
                 distributed shared virtual memory system. \par

                 In this paper, we examine the problem of recovery from
                 system failure in data migration systems. Most data
                 migration systems use the notion of {\em tokens\/} for
                 the access rights a site has on the data elements it
                 caches. Our goal is to recover the site's knowledge of
                 the set of tokens it owned when a system failure
                 occurred. Our approach is to consider the token
                 knowledge at each site as a fragment of a global {\em
                 token database\/} and the data migration activities as
                 {\em token transactions\/} that update this distributed
                 database. We have developed a unique commit protocol
                 for token transactions, called {\em unilateral
                 commit\/} (UCP), that efficiently achieves consistency
                 and recoverability of the token state. The correctness
                 of UCP with respect to the two-phase commit protocol is
                 also presented.",
  acknowledgement = ack-nhfb,
  classification = "C6160B (Distributed DBMS)",
  corpsource =   "Aiken Comput. Lab., Harvard Univ., Cambridge, MA,
                 USA",
  generalterms = "Algorithms; Design; Management; Performance;
                 Reliability; Standardization; Theory; Verification",
  keywords =     "commit protocol; correctness; data migration systems;
                 distributed database system; distributed databases;
                 distributed shared virtual memory system; fast
                 communication networks; fine-grained migration;
                 protocols; recovery; remote data; system failure;
                 system recovery; token database; token knowledge; token
                 transactions; transaction processing; two-phase commit
                 protocol; unilateral commit; virtual storage",
  sponsororg =   "SIGACT; SIGMOD; SIGART",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Transaction processing};
                 Information Systems --- Database Management --- Systems
                 (H.2.4): {\bf Distributed databases}; Computer Systems
                 Organization --- Computer-Communication Networks ---
                 Network Protocols (C.2.2); Information Systems ---
                 Database Management --- Database Administration
                 (H.2.7): {\bf Logging and recovery}",
  treatment =    "P Practical",
}

@InProceedings{Lomet:1990:PMA,
  author =       "David Lomet and Betty Salzberg",
  title =        "The performance of a multiversion access method",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "353--363",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p353-lomet/p353-lomet.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p353-lomet/",
  abstract =     "The {\em Time-Split B-tree\/} is an integrated index
                 structure for a versioned timestamped database. It
                 gradually migrates data from a current database to an
                 historical database, records migrating when nodes
                 split. Records valid at the split time are placed in
                 both an historical node and a current node. This
                 implies some redundancy. Using both analysis and
                 simulation, we characterise the amount of redundancy,
                 the space utilization, and the record addition (insert
                 or update) performance for a spectrum of different
                 rates of insertion versus update. Three splitting
                 policies are studied which alter the conditions under
                 which either time splits or key space splits are
                 performed.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Performance",
  subject =      "Data --- Data Structures (E.1): {\bf Trees}; Theory of
                 Computation --- Analysis of Algorithms and Problem
                 Complexity --- Nonnumerical Algorithms and Problems
                 (F.2.2): {\bf Sorting and searching}; Information
                 Systems --- Database Management --- Logical Design
                 (H.2.1): {\bf Data models}; Information Systems ---
                 Database Management --- Physical Design (H.2.2): {\bf
                 Access methods}; Theory of Computation --- Analysis of
                 Algorithms and Problem Complexity --- Nonnumerical
                 Algorithms and Problems (F.2.2): {\bf Computations on
                 discrete structures}",
}

@InProceedings{Soparkar:1990:DVP,
  author =       "Nandit Soparkar and Abraham Silberschatz",
  title =        "Data-valued partitioning and virtual messages
                 (extended abstract)",
  crossref =     "ACM:1990:PPN",
  pages =        "357--364",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/298514/p357-soparkar/p357-soparkar.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/298514/p357-soparkar/",
  abstract =     "Network Partition failures in traditional Distributed
                 Databases cause severe problems for transaction
                 processing. The only way to overcome the problems of
                 ``blocking'' behavior for transaction processing in the
                 event of such failures is, effectively, to execute them
                 at single sites. A new approach to data representation
                 and distribution is proposed and it is shown to be
                 suitable for failure-prone environments. We propose
                 techniques for transaction processing, concurrency
                 control and recovery for the new representation.
                 Several properties that arise as a result of these
                 methods, such as non-blocking behavior, independent
                 recovery and high availability, suggest that the
                 techniques could be profitably implemented in a
                 distributed environment.",
  acknowledgement = ack-nhfb,
  classification = "C6160B (Distributed DBMS)",
  corpsource =   "Dept. of Comput. Sci., Texas Univ., Austin, TX, USA",
  generalterms = "Design; Management; Performance; Reliability; Theory",
  keywords =     "concurrency control; data representation; distributed
                 databases; failure-prone environments; system recovery;
                 transaction processing; virtual messages",
  sponsororg =   "SIGACT; SIGMOD; SIGART",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Transaction processing};
                 Information Systems --- Database Management --- Systems
                 (H.2.4): {\bf Distributed databases}; Information
                 Systems --- Database Management --- Systems (H.2.4):
                 {\bf Concurrency}; Information Systems --- Database
                 Management --- Database Administration (H.2.7): {\bf
                 Logging and recovery}",
  treatment =    "P Practical",
}

@InProceedings{Kemper:1990:ASO,
  author =       "Alfons Kemper and Guido Moerkotte",
  title =        "Access support in object bases",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "364--374",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p364-kemper/p364-kemper.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p364-kemper/",
  abstract =     "In this work {\em access support relations\/} are
                 introduced as a means for optimizing query processing
                 in object-oriented database systems. The general idea
                 is to maintain redundant separate structures
                 (disassociated from the object representation) to store
                 object references that are frequently traversed in
                 database queries. The proposed access support relation
                 technique is no longer restricted to relate an object
                 (tuple) to an atomic value (attribute value) as in
                 conventional indexing. Rather, access support relations
                 relate objects with each other and can span over
                 reference chains which may contain collection-valued
                 components in order to support queries involving path
                 expressions. We present several alternative extensions
                 of access support relations for a given path
                 expression, the best of which has to be determined
                 according to the application-specific database usage
                 profile. An analytical cost model for access support
                 relations and their application is developed. This
                 analytical cost model is, in particular, used to
                 determine the best access support relation extension
                 and decomposition with respect to the specific database
                 configuration and application profile.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Performance",
  subject =      "Information Systems --- Database Management ---
                 Physical Design (H.2.2): {\bf Access methods};
                 Information Systems --- Database Management --- Systems
                 (H.2.4): {\bf Query processing}; Information Systems
                 --- Database Management --- Logical Design (H.2.1):
                 {\bf Data models}; Data --- Data Structures (E.1): {\bf
                 Trees}",
}

@InProceedings{Pilarski:1990:NCS,
  author =       "Slawomir Pilarski and Tiko Kameda",
  title =        "A novel checkpointing scheme for distributed database
                 systems",
  crossref =     "ACM:1990:PPN",
  pages =        "368--378",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/298514/p368-pilarski/p368-pilarski.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/298514/p368-pilarski/",
  abstract =     "We present a new checkpointing scheme for a
                 distributed database system. Our scheme records the
                 states of some selected data items and can be executed
                 at any time without stopping other activities in the
                 database system. It makes use of ``shadows'' of data
                 items to make sure that the collected data item values
                 are ``transaction-consistent''. Storage overhead is
                 low, since at most one shadow is needed for each data
                 item.",
  acknowledgement = ack-nhfb,
  classification = "C6160B (Distributed DBMS)",
  corpsource =   "Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC,
                 Canada",
  keywords =     "checkpointing scheme; data items; distributed database
                 systems; distributed databases; shadows; transaction
                 processing",
  sponsororg =   "SIGACT; SIGMOD; SIGART",
  treatment =    "P Practical",
}

@InProceedings{Olken:1990:RSH,
  author =       "Frank Olken and Doron Rotem and Ping Xu",
  title =        "Random sampling from hash files",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "375--386",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p375-olken/p375-olken.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p375-olken/",
  abstract =     "In this paper we discuss simple random sampling from
                 hash files on secondary storage. We consider both
                 iterative and batch sampling algorithms from both
                 static and dynamic hashing methods. The static methods
                 considered are open addressing hash files and hash
                 files with separate overflow chains. The dynamic
                 hashing methods considered are Linear Hash files
                 [Lit80] and Extendible Hash files [FNPS79]. We give the
                 cost of sampling in terms of the cost of successfully
                 searching a hash file and show how to exploit features
                 of the dynamic hashing methods to improve sampling
                 efficiency.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Experimentation",
  subject =      "Data --- Data Storage Representations (E.2): {\bf
                 Hash-table representations}; Theory of Computation ---
                 Analysis of Algorithms and Problem Complexity ---
                 Nonnumerical Algorithms and Problems (F.2.2): {\bf
                 Sorting and searching}; Mathematics of Computing ---
                 Probability and Statistics (G.3): {\bf Probabilistic
                 algorithms (including Monte Carlo)}; Information
                 Systems --- Information Storage and Retrieval ---
                 Information Search and Retrieval (H.3.3): {\bf Search
                 process}; Theory of Computation --- Analysis of
                 Algorithms and Problem Complexity --- General (F.2.0)",
}

@InProceedings{Chomicki:1990:PTQ,
  author =       "Jan Chomicki",
  title =        "Polynomial time query processing in temporal deductive
                 databases",
  crossref =     "ACM:1990:PPN",
  pages =        "379--391",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/298514/p379-chomicki/p379-chomicki.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/298514/p379-chomicki/",
  abstract =     "We study conditions guaranteeing polynomial time
                 computability of queries in temporal deductive
                 databases. We show that if for a given set of temporal
                 rules, the period of its least models is bounded from
                 the above by a polynomial in the database size, then
                 also the time to process yes-no queries (as well as to
                 compute finite representations of all query answers)
                 can be polynomially bounded. We present a bottom-up
                 query processing algorithm BT that is guaranteed to
                 terminate in polynomial time if the periods are
                 polynomially bounded. Polynomial periodicity is our
                 most general criterion, however it can not be directly
                 applied. Therefore, we exhibit two weaker criteria,
                 defining {\em inflationary\/} and {\em I-periodic\/}
                 sets of temporal rules. We show that it can be decided
                 whether a set of temporal rules is inflationary.
                 I-periodicity is undecidable (as we show), but it can
                 be closely approximated by a syntactic notion of {\em
                 multi-separability}.",
  acknowledgement = ack-nhfb,
  classification = "C4250 (Database theory); C6160Z (Other DBMS)",
  corpsource =   "Dept. of Comput. Sci., North Carolina Univ., Chapel
                 Hill, NC, USA",
  keywords =     "bottom-up query processing algorithm; computability;
                 database management systems; database theory;
                 I-periodic sets; inflationary sets; polynomial time
                 computability; query languages; query processing;
                 temporal deductive databases",
  sponsororg =   "SIGACT; SIGMOD; SIGART",
  treatment =    "T Theoretical or Mathematical",
}

@InProceedings{Cha:1990:KCM,
  author =       "Sang K. Cha and Gio Wiederhold",
  title =        "Kaleidoscope: a cooperative menu-guided query
                 interface",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "387--387",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p387-cha/p387-cha.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p387-cha/",
  abstract =     "Querying databases to obtain information requires the
                 user's knowledge of query language and underlying data.
                 However, because the knowledge in human long-term
                 memory is imprecise, incomplete, and often incorrect,
                 user queries are subject to various types of failure.
                 These may include spelling mistakes, the violation of
                 the syntax and semantics of a query language, and the
                 misconception of the entities and relationships in a
                 database. \par

                 Kaleidoscope is a cooperative query interface whose
                 knowledge guides users to avoid most failure during
                 query creation. We call this type of cooperative
                 behavior {\em intraquery guidance}. To enable this
                 early, active engagement in the user's process of query
                 creation, Kaleidoscope reduces the granularity of
                 user-system interaction via a context-sensitive menu.
                 The system generates valid query constituents as menu
                 choices step-by-step by interpreting a language
                 grammar, and the user creates a query following this
                 menu guidance[2]. For instance, it takes four steps to
                 create the following query [Q1] Who/ {\em 1\/}
                 authored/ {\em 2\/} `Al'/ {\em 3\/} journal papers/
                 {\em (3+)\/} in `Postquery COOP'/ {\em 4\/} \par

                 At each of such steps, as the user selects one of menu
                 choices, the system updates its partial query status
                 window. If a choice is unique as in {\em (3+)}, it is
                 taken automatically. To guide the user's entry of
                 values, the system provides a pop-up menu for each
                 value domain. \par

                 With Kaleidoscope's process of choice generation
                 tightly controlled by the system's knowledge of query
                 language and underlying data, users need not remember
                 the query language and the underlying database
                 structure but merely recognize or identify the
                 constituents coming one after another that match their
                 intended query. The system provides additional guidance
                 for users to avoid creating semantically inconsistent
                 queries. It informs the user of any derived predicates
                 on the completion of a user-selected predicate. To
                 illustrate this, consider a partially constructed SQL
                 query [Q2] SELECT * FROM professor p\#1 WHERE p\#1 dept
                 = `CS' AND p\#1 salary 40000 \par

                 Suppose that the system has an integrity constraint
                 [IC] FROM professor p IF p dept = `CS' AND p salary
                 45000 THEN p rank = `Assistant' \par

                 This rules states that a CS professor whose salary is
                 less than 45000 is an assistant professor. With the
                 replacement of rule variable p in IC by Q2's range
                 variable p\#1, IC's leading two predicates subsume Q2's
                 query condition, producing p\#1 rank = `Assistant'.
                 Because this derived predicate is not subsumed by Q2's
                 query condition, the system suspects that the user may
                 not know of it and presents it to the user.
                 \par

                 Derived predicates, together with user-selected ones,
                 constrain the user's further conjunctive extension of
                 the partial query condition. For example, the system
                 prunes the field rank (as well as the field dept) in
                 the conjunctive extension of Q2, because the derived
                 condition restricts the value of this field to a
                 constant. \par

                 As shown in examples, we apply Kaleidoscope's approach
                 to two linear-syntax languages in different levels of
                 abstraction SQL[1] and a query language whose syntax
                 and semantics cover a subset of {\em wh\/} -queries. To
                 implement the intraquery guidance, we extend
                 context-free grammar by associating context variables
                 with each grammar symbol and attaching several types of
                 procedural decorations to grammar rules. This extension
                 enables the system to capture the semantic constraints
                 and its user-guiding actions in a domain-independent
                 grammar. As the grammar is interpreted, the
                 database-specific information is fed from the system's
                 lexicon and knowledge base. The current implementation
                 of Kaleidoscope runs on a XEROX-1186 LISP machine with
                 a SUN server configured with a relational DBMS.
                 \par

                 The approach of Kaleidoscope is based on the normative
                 system assumption. The system presents its capability
                 transparent",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Languages",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Information
                 Systems --- Database Management --- Languages (H.2.3):
                 {\bf SQL}; Software --- Programming Languages ---
                 Formal Definitions and Theory (D.3.1)",
}

@InProceedings{Consens:1990:GGV,
  author =       "Mariano P. Consens and Alberto O. Mendelzon",
  title =        "The {G+\slash GraphLog Visual Query System}",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "388--388",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p388-consens/p388-consens.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p388-consens/",
  abstract =     "The video presentation ``The G + /GraphLog Visual
                 Query System'' gives an overview of the capabilities of
                 the ongoing implementation of the G + Visual Query
                 System for visualizing both data and queries as graphs.
                 The system provides an environment for expressing
                 queries in {\em GraphLog\/} [Con89, CM89, CM90], as
                 well as for browsing, displaying and editing graphs.
                 The visual query system also supports displaying the
                 answers in several different ways. \par

                 Graphs are a very natural representation for data in
                 many application domains, for example, transportation
                 networks, project scheduling, parts hierarchies, family
                 trees, concept hierarchies, and Hypertext. From a
                 broader perspective, many databases can be naturally
                 viewed as graphs. In particular, any relational
                 database in which we can identify one or more sets of
                 objects of interest and relationships between them can
                 be represented by mapping these objects into nodes and
                 relationships into edges. In the case of semantic and
                 object-oriented databases, there is a natural mapping
                 of objects to nodes and attributes to edges.
                 \par

                 GraphLog is a visual query language, based on a graph
                 representation of both data and queries, that has
                 evolved from the earlier language G + [CMW87, CMW89,
                 MW89]. GraphLog queries ask for patterns that must be
                 present or absent in the database graph. Each such
                 pattern, called a {\em query graph}, defines new edges
                 that are added to the graph whenever the pattern is
                 found. GraphLog queries are sets of query graphs,
                 called {\em graphical queries}. If, when looking at a
                 query graph in a graphical query, we do not find an
                 edge label in the database, then there must exist
                 another query graph in the graphical query defining
                 that edge. The language also supports computing
                 aggregate functions and summarizing along paths.
                 \par

                 The G + Visual Query System is currently implemented in
                 Smalltalk-80, and runs on Sun 3, Sun 4 and Macintosh II
                 workstations. A Graph Editor is available for editing
                 query graphs and displaying database graphs. It
                 supports graph ``cutting and pasting'', as well as text
                 editing of node and edge labels, node and edge
                 repositioning and re-shaping, storage and retrieval of
                 graphs as text files, etc. Automatic graph layout is
                 also provided. For editing collections of graphs (such
                 as graphical queries) a Graph Browser is available.
                 \par

                 The first answer mode supported by the G + Visual Query
                 System is to return as the result of a GraphLog query a
                 graph with the new edges defined by the graphical query
                 added to the database graph. \par

                 An alternative way of visualizing answers is by
                 high-lighting on the database graph, one at a time, the
                 paths (or just the nodes) described by the query. This
                 mode is particularly useful to locate interesting
                 starting points for browsing. \par

                 Rather than viewing the answers superimposed on the
                 database graph, the user may choose to view them in a
                 Graph Browser. The Graph Browser contains the set of
                 subgraphs of the database graph that were found to
                 satisfy the query. \par

                 Finally, the user may select to collect all the
                 subgraphs of the database graph that satisfy the query
                 together into one new graph. This graph (as well as any
                 other result graph from any of the above mentioned
                 answer modes) in turn may be queried, providing a
                 mechanism for iterative filtering of irrelevant
                 information until a manageable subgraph is obtained.",
  acknowledgement = ack-nhfb,
  generalterms = "Languages",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Mathematics of
                 Computing --- Discrete Mathematics --- Graph Theory
                 (G.2.2); Information Systems --- Database Management
                 --- Languages (H.2.3): {\bf Query languages}; Theory of
                 Computation --- Analysis of Algorithms and Problem
                 Complexity --- Nonnumerical Algorithms and Problems
                 (F.2.2): {\bf Computations on discrete structures};
                 Software --- Programming Languages --- Language
                 Classifications (D.3.2): {\bf Smalltalk-80}",
}

@InProceedings{Agrawal:1990:OUF,
  author =       "R. Agrawal and N. H. Gehani and J. Srinivasan",
  title =        "{OdeView}: a user-friendly graphical interface to
                 {Ode}",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "389--389",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p389-agrawal/p389-agrawal.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p389-agrawal/",
  abstract =     "OdeView is the graphical front end for Ode, an
                 object-oriented database system and environment. It is
                 intended for users who do not want to write programs in
                 Ode's database programming language O++ to interact
                 with Ode but instead want to use a friendlier interface
                 to Ode. OdeView is based on the graphical direct
                 manipulation paradigm that involves selection of items
                 from pop-up menus and icons that can be clicked on and
                 dragged. OdeView provides facilities for examining the
                 database schema examining class definitions, browsing
                 objects, following chains of references, displaying
                 selected portions of objects or selecting a subset of
                 the ways in which an object can be displayed
                 (projection), and retrieving specific objects
                 (selection). \par

                 Upon entering OdeView, the user is presented with a
                 scrollable ``database'' window containing the names and
                 iconified images of the current Ode databases. The user
                 can select a database to interact with by using the
                 mouse to click on the appropriate icon. OdeView then
                 opens a ``class relationship'' window which displays
                 the hierarchy relationship between the object classes
                 database. The hierarchy relationship between classes is
                 a set of dags. \par

                 The user can zoom in and zoom out to examine this dag
                 at various levels of detail. The user can also examine
                 a class in detail by clicking at the node labeled with
                 the class of interest. Clicking results in the opening
                 of a ``class information'' window that has three
                 scrollable subwindows, one showing its superclasses,
                 the second its subclasses, and the third showing the
                 meta data associated with this class. \par

                 The class information window also has a button,
                 clicking which shows the class definition. The user may
                 continue schema browsing by selecting another node in
                 the schema graph, or may click on one of the
                 superclasses or subclasses. Associated with each class
                 in Ode a the set of persistent objects of that class,
                 called cluster. The class definition window has an
                 ``objects'' button that allows users to browse through
                 the objects in the cluster. Clicking this button opens
                 the ``object set'' window which consists of two parts
                 the control and object panels. The control panel
                 consists of buttons reset, next, and previous to
                 sequence through the objects. The object panel has
                 buttons to view the object, projection (to view parts
                 of the object), and to specify the selection criteria.
                 \par

                 An Ode object can be displayed in one or more formats
                 depending upon the semantics of the display function
                 associated with the corresponding class. The object set
                 window supplies one button each for each of the object
                 display formats. For example, an employee object can be
                 displayed textually or in pictorial form, the object
                 panel for employee will provides appropriate buttons to
                 see these displays. An object may contain embedded
                 references to other objects. The object panel of an
                 object set window provides buttons for viewing these
                 referenced objects. The basic browsing paradigm
                 encouraged by OdeView is to start from an object and
                 then explore the related objects in the database by
                 following the embedded chains of references. To speed
                 up such repetitive navigations, OdeView supports {\em
                 synchronized browsing}. Once the user has displayed a
                 network of objects and the user applies a sequencing
                 operation to any object in this network, the sequencing
                 operation is automatically propagated over the network.
                 \par

                 OdeView is implemented using X-Windows and HP-Widgets
                 on a SUN workstation running the UNIX system. The video
                 takes the viewers on a tour of OdeView, showing how a
                 user interacts with OdeView to examine the database
                 schema and the objects in the database.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Languages",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4); Software --- Software Engineering ---
                 Design Tools and Techniques (D.2.2): {\bf User
                 interfaces}; Computing Methodologies --- Computer
                 Graphics --- Methodology and Techniques (I.3.6): {\bf
                 Interaction techniques}",
}

@InProceedings{Blum:1990:ISQ,
  author =       "Bruce I. Blum and Ralph D. Semmel",
  title =        "The {INA}: a simple query language with only attribute
                 names",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "390--390",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p390-blum/p390-blum.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p390-blum/",
  abstract =     "Current query languages, such as SQL, assume that the
                 user is familiar with the database schema including the
                 attribute names, types, and relation associations. When
                 a user has imperfect knowledge of this information (or
                 when he balks at the data-processing orientation of the
                 required statements), he normally asks an experienced
                 analyst to perform his and hoc query. The Intelligent
                 Navigational Assistant (INA) was developed for the U S
                 Army as a prototype query tool that permits the users
                 to specify requests using only domain terms familiar to
                 them. Once a request is made, it is converted into SQL
                 for processing 1,2 \par

                 To facilitate query formulation, the INA supports an
                 interface that allows the user to identify attributes
                 without relation associations (i.e., treats the data
                 model as a universal relation). Because an attribute
                 may appear in many relations, one of the principal
                 tasks of the INA is the determination of the
                 appropriate relation bindings. To aid in the selection
                 of terms, the INA maintains a user vocabulary and
                 provides facilities for browsing the vocabulary and
                 examining term definitions. Thus, the INA has two
                 primary functions it provides an easy-to-use interface
                 for query definition, and it converts a request into
                 SQL. \par

                 The INA prototype has been implemented as a PC-resident
                 knowledge-based system linked to a host-based DBMS. Its
                 knowledge base is the logical schema of the target
                 database, and the query transformation relies on the
                 dependencies implicit in that schema. Supporting the
                 knowledge-processing functions are the query definition
                 interface, various tools to manage the target data
                 model description, and facilities for communicating
                 with other computers. The system was developed using
                 TEDIUM@@@@, 3 and the user interface and query
                 resolution mechanism are extensions of earlier work
                 with Tequila 4 (which accessed the semantically-richer
                 TEDIUM@@@@ data model) \par

                 Work on the INA began in 1987 and was terminated in
                 1988. The system was demonstrated as a prototype with
                 an Army-supplied logical model consisting of
                 approximately 40 relations and 200 attributes. After
                 query definition, reformation, and user acceptance, the
                 SQL queries were submitted to the mainframe for
                 processing. In those tests, the INA often produced
                 better queries than those manually coded by analysts.
                 The INA currently is undergoing a beta test with a much
                 larger database schema. Its algorithms are described in
                 reference 5, and reference 3 contains details regarding
                 its implementation and semantic data model. Current
                 research includes the development of improved query
                 resolution algorithms based on an enriched semantic
                 data model",
  acknowledgement = ack-nhfb,
  generalterms = "Languages",
  subject =      "Information Systems --- Database Management ---
                 Languages (H.2.3): {\bf Query languages}; Computing
                 Methodologies --- Artificial Intelligence --- Knowledge
                 Representation Formalisms and Methods (I.2.4): {\bf
                 Representations (procedural and rule-based)};
                 Information Systems --- Models and Principles ---
                 User/Machine Systems (H.1.2); Information Systems ---
                 Database Management --- Systems (H.2.4)",
}

@InProceedings{Kuntz:1990:PGD,
  author =       "Michel Kuntz",
  title =        "{Pasta-$3$}: a graphical direct manipulation interface
                 for knowledge base management systems",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "391--391",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p391-kuntz/p391-kuntz.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p391-kuntz/",
  abstract =     "Pasta-3 is an end-user interface for D/KBMSs based on
                 the graphical Direct Manipulation (DM) interaction
                 paradigm, which relies on a bit-mapped, multi-window
                 screen and a mouse to implement clickable icons as the
                 main representation of information. This style of
                 interaction enables end users to learn quickly and
                 remember easily how the system works. Pasta-3 gives
                 complete access to the D/KBMS, since its users can
                 carry out all manipulation tasks through it schema
                 definition, schema and data browsing, query
                 formulation, and updating. These tasks can be freely
                 mixed, combined, and switched Pasta-3 interfaces to the
                 KB2 knowledge base system, implemented in Prolog and
                 built over the EDUCE system which provides a tight
                 coupling to a relational DBMS KB2 uses the
                 Entity-Relationship data model, extended with
                 inheritance and deduction rules. KB2 was developed by
                 the KB Group at ECRC. \par

                 Pasta-3 uses Direct Manipulation in the strong sense of
                 the term DM of the actual graphical representations of
                 the application data and not just DM of commands
                 operating on that data. Besides the high degree of
                 integration in the overall design, major innovations
                 with respect to earlier work include enhanced schema
                 browsing with active functionalities to facilitate
                 correct user understanding of the KB structure,
                 ``synchronized'' data browsing that exploits the
                 underlying semantic data model to make browsing more
                 powerful, and a graphical query language providing full
                 expressive power (including certain recursive queries,
                 nested subqueries, quantification). \par

                 Pasta-3 provides interactive design support that has
                 significant ergonomic advantages over the usual
                 approach to this problem. In Pasta-3 different types of
                 schema information -- the basic E-R diagram, and
                 inheritance lattices, the properties of each E-R item
                 -- are displayed in separate windows, which makes
                 accurate reading of such information much less
                 difficult than in the usual case where all these layers
                 are thrown together in a single graph, which makes
                 misinterpretation hard to avoid. \par

                 For schema and data browsing, Pasta-3 offers facilities
                 that build more semantics into the browsing processes.
                 One type of schema browsing tool is a subgraph
                 computation capability which automatically finds and
                 displays the paths that connect arbitrary E-R items.
                 This helps end users to correctly perceive the schema
                 structure. Data browsing includes ``synchronised''
                 browsing, a functionality which shows simultaneously
                 data from several Entities all sharing the same
                 Relationship and indicates which values from each
                 Entity are associated with given values from the
                 others. \par

                 Pasta-3's DM query language replaces the textual
                 language without loss of expressive power it offers a
                 new, sophisticated DM editing capability for the same
                 formal constructs. Query specification takes place in a
                 window containing icons representing the components of
                 the query expression which can be created, destroyed,
                 and modified all by clicking and dragging through the
                 mouse. Queries can be recursive and involve logical
                 variables, quantification, and subqueries. Expressions
                 mixing both KB2 statements and Prolog predicates can
                 also be formulated. \par

                 The video shows Pasta-3 actually being used, in real
                 time and under normal conditions. It includes sequences
                 demonstrating all three major functionalities schema
                 design browsing, and querying. It gives an example of
                 the subgraph computation capability and builds a simple
                 query from scratch, going through all the steps needed
                 to do so. The demonstration also includes work with
                 other types of Pasta-3 windows (e.g., property sheets).
                 \par

                 The video has an English-language sound track
                 explaining everything that is seen on the screen. The
                 camera zooms in and out in order to show full screen
                 overviews (giving a good idea of the general ``feel''
                 of the interface) and close-ups of work with mouse and
                 icons (allowing the viewer to see as much detail in the
                 video as an actual user would).",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Human Factors; Languages",
  subject =      "Computing Methodologies --- Computer Graphics ---
                 Methodology and Techniques (I.3.6): {\bf Interaction
                 techniques}; Computing Methodologies --- Computer
                 Graphics --- Hardware Architecture (I.3.1): {\bf Input
                 devices}; Information Systems --- Database Management
                 --- Languages (H.2.3): {\bf Query languages};
                 Information Systems --- Database Management --- Systems
                 (H.2.4): {\bf Query processing}",
}

@InProceedings{Kent:1990:IDS,
  author =       "Bill Kent and Peter Lyngbaek and Samir Mathur and
                 Kevin Wilkinson",
  title =        "The {Iris} database system",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "392--392",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p392-kent/p392-kent.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p392-kent/",
  abstract =     "Iris is an object-oriented database management system
                 being developed at Hewlett--Packard Laboratories [1],
                 [3]. This videotape provides an overview of the Iris
                 data model and a summary of our experiences in
                 converting a computer-integrated manufacturing
                 application to Iris. An abstract of the videotape
                 follows. \par

                 Iris is intended to meet the needs of new and emerging
                 database applications such as office and engineering
                 information systems, knowledge-based systems,
                 manufacturing applications, and hardware and software
                 design. These applications require a rich set of
                 capabilities that are not supported by the current
                 generation (i.e., relational) DBMSs. \par

                 The Iris data model is an object and function model. It
                 provides three basic constructs {\em objects, types\/}
                 and {\em functions}. As with other object systems, Iris
                 objects have a unique identifier and can only be
                 accessed and manipulated through functions. Objects are
                 classified by type. Objects that belong to the same
                 type share common functions. Types are organized into a
                 hierarchy with inherited functions. In Iris, functions
                 are used to model properties of objects, relationships
                 among objects and operations on objects. Thus, the
                 behavior of an Iris object is completely specified
                 through its participation in functions. \par

                 Iris provides good separation among its three basic
                 notions. This simplifies the data model making it
                 easier to learn and easier to implement since there are
                 fewer constructs than other object models. In addition,
                 it facilitates Iris support for the following desirable
                 features. Schema evolution: new types and functions may
                 be added at any time. Object evolution: Iris objects
                 may have multiple types and may acquire and lose types
                 dynamically. Object participation in functions may be
                 required or optional (e g, everyone has birthdate but
                 not everyone has a phone number). Data independence:
                 the implementation of a function is defined separately
                 from its interface. Thus, the implementation of a
                 function may change without affecting applications that
                 use it. Functional extensibility: an Iris function may
                 be implemented as a stored table, computed as an Iris
                 expression, or computed as a subroutine in a
                 general-purpose programming language. Thus, any
                 computation can be expressed as an Iris function Schema
                 and data uniformity: the metadata is modeled and
                 manipulated using the primitives of the data model.
                 Also, system functions (create type, delete object,
                 etc) are invoked in the same manner as user functions.
                 Thus, users need learn only one interface. Set
                 processing: Iris supports set-at-a-time processing for
                 efficient retrieval and update of collections of
                 objects. \par

                 To evaluate the usefulness of the Iris prototype, a
                 project was undertaken to convert a large relational
                 application to Iris [2]. The relational system
                 contained nearly 200 relations and 2500 attributes.
                 When transcribed to Iris, the schema size was reduced
                 by over a third. There are two reasons for this large
                 reduction. First, in the relational schema, many
                 attributes were simply foreign keys required for joins.
                 In the Iris schema, function inheritance through the
                 type hierarchy eliminates the need for many of these
                 foreign keys. A second reason for the schema reduction
                 was that compound keys were replaced by object
                 references. This permitted several attributes in a
                 relation to be replaced by a single identifier \par

                 It was noted that application programs were easier to
                 read and develop using the Iris schema. The Iris OSQL
                 (Object SQL) language was a fairly natural interface
                 for users familiar with SQL. The use of function
                 composition and function inheritance and a large number
                 of joins that, in the relational system, must be
                 expressed by comparing keys. The function-orientation
                 of Iris encouraged {\em code sharing\/} in that
                 deriving and sharing new functions was simplified.
                 \par

                 Finally, since there are few tools and methodologies
                 for using object-oriented database management systems,
                 the abi",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Languages",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4); Information Systems --- Database
                 Management --- Logical Design (H.2.1): {\bf Data
                 models}; Information Systems --- Database Management
                 --- Database Applications (H.2.8); Information Systems
                 --- Database Management --- Languages (H.2.3): {\bf
                 SQL}",
  xxauthor =     "Bill Kent and Peter Lyngback and Samir Mathur and
                 Kevin Wilkinson",
}

@InProceedings{Kabanza:1990:HIT,
  author =       "F. Kabanza and J.-M. Stevenne and P. Wolper",
  title =        "Handling Infinite Temporal Data",
  crossref =     "ACM:1990:PPN",
  pages =        "392--403",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/298514/p392-kabanza/p392-kabanza.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/298514/p392-kabanza/",
  abstract =     "In this paper, we present a powerful framework for
                 describing, storing, and reasoning about infinite
                 temporal information. This framework is an extension of
                 classical relational databases. It represents infinite
                 temporal information by generalized tuples defined by
                 linear repeating points and constraints on these
                 points. We prove that relations formed from generalized
                 tuples are closed under the operations of relational
                 algebra. A characterization of the expressiveness of
                 generalized relations is given in terms of predicates
                 definable in Presburger arithmetic. Finally, we provide
                 some complexity results.",
  acknowledgement = ack-nhfb,
  annote =       "36 papers; See also 6836.1508 1990 9th for papers",
  classification = "C4250 (Database theory); C6160D (Relational DBMS)",
  corpsource =   "Liege Univ., Belgium",
  keywords =     "ACM; complexity results; computational complexity;
                 database systems; database theory; infinite temporal
                 data; Presburger arithmetic; reasoning; relational
                 algebra; relational databases; SIGACT",
  sponsororg =   "SIGACT; SIGMOD; SIGART",
  treatment =    "T Theoretical or Mathematical",
  xxpages =      "3--17",
}

@InProceedings{Consens:1990:GVF,
  author =       "Mariano P. Consens and Alberto O. Mendelzon",
  title =        "{GraphLog}: a visual formalism for real life
                 recursion",
  crossref =     "ACM:1990:PPN",
  pages =        "404--416",
  year =         "1990",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/298514/p404-consens/p404-consens.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/298514/p404-consens/",
  abstract =     "We present a query language called GraphLog, based on
                 a graph representation of both data and queries.
                 Queries are graph patterns. Edges in queries represent
                 edges or paths in the database. Regular expressions are
                 used to qualify these paths. We characterize the
                 expressive power of the language and show that it is
                 equivalent to stratified linear Datalog, first order
                 logic with transitive closure, and non-deterministic
                 logarithmic space (assuming ordering on the domain).
                 The fact that the latter three classes coincide was not
                 previously known. We show how GraphLog can be extended
                 to incorporate aggregates and path summarization, and
                 describe briefly our current prototype
                 implementation.",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages); C6160Z (Other DBMS)",
  corpsource =   "Comput. Syst. Res. Inst., Toronto Univ., Ont.,
                 Canada",
  keywords =     "database management systems; edges; expressive power;
                 first order logic; graph representation; graph theory;
                 GraphLog; path summarization; paths; query language;
                 query languages; real life recursion; transitive
                 closure; visual formalism",
  sponsororg =   "SIGACT; SIGMOD; SIGART",
  treatment =    "P Practical",
}

@InProceedings{Gyssens:1990:GOOa,
  author =       "M. Gyssens and J. Paredaens and D. {Van Gucht}",
  title =        "A graph-oriented object database model",
  crossref =     "ACM:1990:PPN",
  pages =        "417--424",
  year =         "1990",
  bibdate =      "Mon Mar 16 10:08:58 MST 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  classification = "C6160Z (Other DBMS)",
  corpsource =   "Limburg Univ., Diepenbeek, Belgium",
  keywords =     "database management systems; elementary graph
                 operations; graph-oriented database model;
                 object-identity; object-oriented programming; query
                 languages; querying; recursive functions; set theory;
                 set-operations; transformation language; updates",
  sponsororg =   "SIGACT; SIGMOD; SIGART",
  treatment =    "P Practical",
}

@InProceedings{Gyssens:1990:GOOb,
  author =       "Marc Gyssens and Jan Paredaens and Dirk {Van Gucht}",
  title =        "A graph-oriented object model for database end-user
                 interfaces",
  crossref =     "Garcia-Molina:1990:PAS",
  pages =        "24--33",
  year =         "1990",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/93597/p24-gyssens/p24-gyssens.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/93597/p24-gyssens/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Lenat:1991:KAC,
  author =       "Douglas B. Lenat",
  title =        "Keynote address: computers versus common sense",
  crossref =     "ACM:1991:PPT",
  pages =        "1--1",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p1-lenat/p1-lenat.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p1-lenat/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hillebrand:1991:TDB,
  author =       "Gerd G. Hillebrand and Paris C. Kanellakis and Harry
                 G. Mairson and Moshe Y. Vardi",
  title =        "Tools for {Datalog} boundedness",
  crossref =     "ACM:1991:PPT",
  pages =        "1--12",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/113413/p1-hillebrand/p1-hillebrand.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/113413/p1-hillebrand/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/113413/p1-hillebrand/",
  acknowledgement = ack-nhfb,
  keywords =     "languages; theory",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Datalog. {\bf D.3.1} Software, PROGRAMMING
                 LANGUAGES, Formal Definitions and Theory. {\bf F.4.1}
                 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL
                 LANGUAGES, Mathematical Logic, Logic and constraint
                 programming.",
}

@InProceedings{Stonebraker:1991:MPO,
  author =       "Michael Stonebraker",
  title =        "Managing persistent objects in a multi-level store",
  crossref =     "ACM:1991:PPT",
  pages =        "2--11",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p2-stonebraker/p2-stonebraker.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p2-stonebraker/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Tsangaris:1991:SAC,
  author =       "Manolis M. Tsangaris and Jeffrey F. Naughton",
  title =        "A stochastic approach for clustering in object bases",
  crossref =     "ACM:1991:PPT",
  pages =        "12--21",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p12-tsangaris/p12-tsangaris.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p12-tsangaris/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Afrati:1991:DVP,
  author =       "Foto Afrati and Stavros S. Cosmadakis and Mihalis
                 Yannakakis",
  title =        "On {Datalog} vs. polynomial time (extended abstract)",
  crossref =     "ACM:1991:PPT",
  pages =        "13--25",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/113413/p13-afrati/p13-afrati.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/113413/p13-afrati/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/113413/p13-afrati/",
  acknowledgement = ack-nhfb,
  keywords =     "languages; theory",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Datalog. {\bf F.1.3} Theory of Computation,
                 COMPUTATION BY ABSTRACT DEVICES, Complexity Measures
                 and Classes, Reducibility and completeness. {\bf F.4.1}
                 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL
                 LANGUAGES, Mathematical Logic, Logic and constraint
                 programming.",
}

@InProceedings{Cheng:1991:ECC,
  author =       "Jia-Bing R. Cheng and A. R. Hurson",
  title =        "Effective clustering of complex objects in
                 object-oriented databases",
  crossref =     "ACM:1991:PPT",
  pages =        "22--31",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p22-cheng/p22-cheng.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p22-cheng/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Vadaparty:1991:PRB,
  author =       "Kumar Vadaparty",
  title =        "On the power of rule-based languages with sets",
  crossref =     "ACM:1991:PPT",
  pages =        "26--36",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/113413/p26-vadaparty/p26-vadaparty.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/113413/p26-vadaparty/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/113413/p26-vadaparty/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; languages; 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, Type structure.",
}

@InProceedings{Perrizo:1991:HHD,
  author =       "William Perrizo and Joseph Rajkumar and Prabhu Ram",
  title =        "{HYDRO}: a heterogeneous distributed database system",
  crossref =     "ACM:1991:PPT",
  pages =        "32--39",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p32-perrizo/p32-perrizo.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p32-perrizo/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Immerman:1991:EFF,
  author =       "Neil Immerman and Sushant Patnaik and David Stemple",
  title =        "The expressiveness of a family of finite set
                 languages",
  crossref =     "ACM:1991:PPT",
  pages =        "37--52",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/113413/p37-immerman/p37-immerman.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/113413/p37-immerman/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/113413/p37-immerman/",
  acknowledgement = ack-nhfb,
  keywords =     "languages",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Query languages. {\bf H.2.1} Information
                 Systems, DATABASE MANAGEMENT, Logical Design, Data
                 models.",
}

@InProceedings{Krishnamurthy:1991:LFI,
  author =       "Ravi Krishnamurthy and Witold Litwin and William
                 Kent",
  title =        "Language features for interoperability of databases
                 with schematic discrepancies",
  crossref =     "ACM:1991:PPT",
  pages =        "40--49",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p40-krishnamurthy/p40-krishnamurthy.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p40-krishnamurthy/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Jajodia:1991:TMS,
  author =       "Sushil Jajodia and Ravi Sandhu",
  title =        "Toward a multilevel secure relational data model",
  crossref =     "ACM:1991:PPT",
  pages =        "50--59",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p50-jajodia/p50-jajodia.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p50-jajodia/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Garcia-Molina:1991:NDQ,
  author =       "Hector Garcia-Molina and Kenneth Salem",
  title =        "Non-deterministic queue operations",
  crossref =     "ACM:1991:PPT",
  pages =        "53--62",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/113413/p53-garcia-molina/p53-garcia-molina.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/113413/p53-garcia-molina/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/113413/p53-garcia-molina/",
  acknowledgement = ack-nhfb,
  keywords =     "design; theory",
  subject =      "{\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.2.4} Information Systems,
                 DATABASE MANAGEMENT, Systems, Concurrency.",
}

@InProceedings{Gordin:1991:SOC,
  author =       "Douglas N. Gordin and Alexander J. Pasik",
  title =        "Set-oriented constructs: from {Rete} rule bases to
                 database systems",
  crossref =     "ACM:1991:PPT",
  pages =        "60--67",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p60-gordin/p60-gordin.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p60-gordin/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Krishnakumar:1991:BIR,
  author =       "Narayanan Krishnakumar and Arthur J. Bernstein",
  title =        "Bounded ignorance in replicated systems",
  crossref =     "ACM:1991:PPT",
  pages =        "63--74",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/113413/p63-krishnakumar/p63-krishnakumar.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/113413/p63-krishnakumar/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/113413/p63-krishnakumar/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance; theory",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Transaction processing. {\bf H.2.4}
                 Information Systems, DATABASE MANAGEMENT, Systems,
                 Concurrency.",
}

@InProceedings{Sudarshan:1991:SOB,
  author =       "S. Sudarshan and Divesh Srivastava and Raghu
                 Ramakrishnan and Jeffrey F. Naughton",
  title =        "Space optimization in the bottom-up evaluation of
                 logic programs",
  crossref =     "ACM:1991:PPT",
  pages =        "68--77",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p68-sudarshan/p68-sudarshan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p68-sudarshan/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Johnson:1991:TUB,
  author =       "Donald B. Johnson and Larry Raab",
  title =        "A tight upper bound on the benefits of replication and
                 consistency control protocols",
  crossref =     "ACM:1991:PPT",
  pages =        "75--81",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/113413/p75-johnson/p75-johnson.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/113413/p75-johnson/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/113413/p75-johnson/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Transaction processing. {\bf C.2.2} Computer
                 Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
                 Network Protocols. {\bf D.4.1} Software, OPERATING
                 SYSTEMS, Process Management, Mutual exclusion.",
}

@InProceedings{Wolfson:1991:IER,
  author =       "Ouri Wolfson and Hasanat M. Dewan and Salvatore J.
                 Stolfo and Yechiam Yemini",
  title =        "Incremental evaluation of rules and its relationship
                 to parallelism",
  crossref =     "ACM:1991:PPT",
  pages =        "78--87",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p78-wolfson/p78-wolfson.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p78-wolfson/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Wang:1991:MHS,
  author =       "Wei-hsing Wang and Meichun Hsu and Eugene Pinsky",
  title =        "Modeling hot spots in database systems (extended
                 abstract)",
  crossref =     "ACM:1991:PPT",
  pages =        "82--91",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/113413/p82-wang/p82-wang.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/113413/p82-wang/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/113413/p82-wang/",
  acknowledgement = ack-nhfb,
  keywords =     "measurement; performance",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Transaction processing. {\bf C.4} Computer
                 Systems Organization, PERFORMANCE OF SYSTEMS, Modeling
                 techniques.",
}

@InProceedings{Levy:1991:OCP,
  author =       "Eliezer Levy and Henry F. Korth and Abraham
                 Silberschatz",
  title =        "An optimistic commit protocol for distributed
                 transaction management",
  crossref =     "ACM:1991:PPT",
  pages =        "88--97",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p88-levy/p88-levy.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p88-levy/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ross:1991:MAT,
  author =       "Kenneth A. Ross",
  title =        "Modular acyclicity and tail recursion in logic
                 programs",
  crossref =     "ACM:1991:PPT",
  pages =        "92--101",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/113413/p92-ross/p92-ross.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/113413/p92-ross/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/113413/p92-ross/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; languages",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing. {\bf H.2.3} Information
                 Systems, DATABASE MANAGEMENT, Languages. {\bf F.4.1}
                 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL
                 LANGUAGES, Mathematical Logic, Logic and constraint
                 programming.",
}

@InProceedings{Agrawal:1991:UMD,
  author =       "D. Agrawal and V. Krishnaswamy",
  title =        "Using multiversion data for non-interfering execution
                 of write-only transactions",
  crossref =     "ACM:1991:PPT",
  pages =        "98--107",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p98-agrawal/p98-agrawal.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p98-agrawal/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Lakshmanan:1991:SQO,
  author =       "Laks V. S. Lakshmanan and H{\'e}ctor J.
                 Hern{\'a}ndez",
  title =        "Structural query optimization --- a uniform framework
                 for semantic query optimization in deductive
                 databases",
  crossref =     "ACM:1991:PPT",
  pages =        "102--114",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/113413/p102-lakshmanan/p102-lakshmanan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/113413/p102-lakshmanan/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/113413/p102-lakshmanan/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; languages",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing. {\bf H.2.1} Information
                 Systems, DATABASE MANAGEMENT, Logical Design, Normal
                 forms. {\bf H.2.3} Information Systems, DATABASE
                 MANAGEMENT, Languages, Datalog.",
}

@InProceedings{Chrysanthis:1991:ECO,
  author =       "Panos K. Chrysanthis and S. Raghuram and Krithi
                 Ramamritham",
  title =        "Extracting concurrency from objects: a methodology",
  crossref =     "ACM:1991:PPT",
  pages =        "108--117",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p108-chrysanthis/p108-chrysanthis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p108-chrysanthis/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chaudhuri:1991:DRT,
  author =       "Surajit Chaudhuri",
  title =        "Detecting redundant tuples during query evaluation",
  crossref =     "ACM:1991:PPT",
  pages =        "115--126",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/113413/p115-chaudhuri/p115-chaudhuri.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/113413/p115-chaudhuri/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/113413/p115-chaudhuri/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance",
  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 G.2.2} Mathematics of Computing, DISCRETE
                 MATHEMATICS, Graph Theory. {\bf F.2.2} Theory of
                 Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Nonnumerical Algorithms and Problems,
                 Computations on discrete structures.",
}

@InProceedings{Neugebauer:1991:OED,
  author =       "Leonore Neugebauer",
  title =        "Optimization and evaluation of database queries
                 including embedded interpolation procedures",
  crossref =     "ACM:1991:PPT",
  pages =        "118--127",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p118-neugebauer/p118-neugebauer.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p118-neugebauer/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Mumick:1991:ORL,
  author =       "Inderpal Singh Mumick and Hamid Pirahesh",
  title =        "Overbound and right-linear queries",
  crossref =     "ACM:1991:PPT",
  pages =        "127--141",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/113413/p127-mumick/p127-mumick.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/113413/p127-mumick/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/113413/p127-mumick/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing. {\bf G.1.6} Mathematics of
                 Computing, NUMERICAL ANALYSIS, Optimization, Linear
                 programming. {\bf H.2.1} Information Systems, DATABASE
                 MANAGEMENT, Logical Design.",
}

@InProceedings{Becker:1991:SPS,
  author =       "Bruno Becker and Hans-Werner Six and Peter Widmayer",
  title =        "Spatial priority search: an access technique for
                 scaleless maps",
  crossref =     "ACM:1991:PPT",
  pages =        "128--137",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p128-becker/p128-becker.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p128-becker/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kolovson:1991:SID,
  author =       "Curtis P. Kolovson and Michael Stonebraker",
  title =        "Segment indexes: dynamic indexing techniques for
                 multi-dimensional interval data",
  crossref =     "ACM:1991:PPT",
  pages =        "138--147",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p138-kolovson/p138-kolovson.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p138-kolovson/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Tsur:1991:DDA,
  author =       "Shalom Tsur",
  title =        "Deductive databases in action",
  crossref =     "ACM:1991:PPT",
  pages =        "142--153",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/113413/p142-tsur/p142-tsur.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/113413/p142-tsur/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/113413/p142-tsur/",
  acknowledgement = ack-nhfb,
  keywords =     "design; languages; performance; theory",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems. {\bf H.2.1} Information Systems, DATABASE
                 MANAGEMENT, Logical Design. {\bf H.2.8} Information
                 Systems, DATABASE MANAGEMENT, Database Applications.",
}

@InProceedings{Keller:1991:EAC,
  author =       "Tom Keller and Goetz Graefe and David Maier",
  title =        "Efficient assembly for complex objects",
  crossref =     "ACM:1991:PPT",
  pages =        "148--157",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p148-keller/p148-keller.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p148-keller/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ganguly:1991:MMP,
  author =       "Sumit Ganguly and Sergio Greco and Carlo Zaniolo",
  title =        "Minimum and maximum predicates in logic programming",
  crossref =     "ACM:1991:PPT",
  pages =        "154--163",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/113413/p154-ganguly/p154-ganguly.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/113413/p154-ganguly/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/113413/p154-ganguly/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; languages",
  subject =      "{\bf F.2.2} Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems, Computations on discrete
                 structures. {\bf F.4.1} Theory of Computation,
                 MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical
                 Logic, Logic and constraint programming. {\bf G.2.2}
                 Mathematics of Computing, DISCRETE MATHEMATICS, Graph
                 Theory, Path and circuit problems. {\bf H.2.0}
                 Information Systems, DATABASE MANAGEMENT, General.",
}

@InProceedings{Vandenberg:1991:ASC,
  author =       "Scott L. Vandenberg and David J. DeWitt",
  title =        "Algebraic support for complex objects with arrays,
                 identity, and inheritance",
  crossref =     "ACM:1991:PPT",
  pages =        "158--167",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p158-vandenberg/p158-vandenberg.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p158-vandenberg/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Matsliach:1991:PAF,
  author =       "Gabriel Matsliach",
  title =        "Performance analysis of file organizations that use
                 multi-bucket data leaves with partial expansions
                 (extended abstract)",
  crossref =     "ACM:1991:PPT",
  pages =        "164--180",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/113413/p164-matsliach/p164-matsliach.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/113413/p164-matsliach/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/113413/p164-matsliach/",
  acknowledgement = ack-nhfb,
  keywords =     "performance",
  subject =      "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Data models. {\bf H.3.2} Information
                 Systems, INFORMATION STORAGE AND RETRIEVAL, Information
                 Storage, File organization. {\bf E.1} Data, DATA
                 STRUCTURES, Trees. {\bf E.2} Data, DATA STORAGE
                 REPRESENTATIONS.",
}

@InProceedings{Ioannidis:1991:LDV,
  author =       "Yannis E. Ioannidis and Younkyung Cha Kang",
  title =        "Left-deep vs. bushy trees: an analysis of strategy
                 spaces and its implications for query optimization",
  crossref =     "ACM:1991:PPT",
  pages =        "168--177",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p168-ioannidis/p168-ioannidis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p168-ioannidis/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Guntzer:1991:NDU,
  author =       "U. G{\"u}ntzer and W. Kie{\ss}ling and H. Th{\"o}ne",
  title =        "New direction for uncertainty reasoning in deductive
                 databases",
  crossref =     "ACM:1991:PPT",
  pages =        "178--187",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p178-guntzer/p178-guntzer.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p178-guntzer/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Helm:1991:CBQ,
  author =       "Richard Helm and Kim Marriott and Martin Odersky",
  title =        "Constraint-based query optimization for spatial
                 databases",
  crossref =     "ACM:1991:PPT",
  pages =        "181--191",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/113413/p181-helm/p181-helm.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/113413/p181-helm/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/113413/p181-helm/",
  acknowledgement = ack-nhfb,
  keywords =     "design; languages; theory",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing. {\bf H.2.3} Information
                 Systems, DATABASE MANAGEMENT, Languages, Query
                 languages.",
}

@InProceedings{Sheng:1991:NDD,
  author =       "Yeh-Heng Sheng",
  title =        "A non-deterministic deductive database language",
  crossref =     "ACM:1991:PPT",
  pages =        "188--197",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p188-sheng/p188-sheng.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p188-sheng/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Nurmi:1991:UUR,
  author =       "Otto Nurmi and Eljas Soisalon-Soininen",
  title =        "Uncoupling updating and rebalancing in chromatic
                 binary search trees",
  crossref =     "ACM:1991:PPT",
  pages =        "192--198",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/113413/p192-nurmi/p192-nurmi.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/113413/p192-nurmi/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/113413/p192-nurmi/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.2.2} Mathematics of Computing, DISCRETE
                 MATHEMATICS, Graph Theory, Trees. {\bf F.2.2} Theory of
                 Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Nonnumerical Algorithms and Problems,
                 Sorting and searching.",
}

@InProceedings{Lou:1991:LOO,
  author =       "Yanjun Lou and Z. Meral Ozsoyoglu",
  title =        "{LLO}: an object-oriented deductive language with
                 methods and method inheritance",
  crossref =     "ACM:1991:PPT",
  pages =        "198--207",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p198-lou/p198-lou.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p198-lou/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Jakobsson:1991:MAA,
  author =       "H{\aa}kan Jakobsson",
  title =        "Mixed-approach algorithms for transitive closure
                 (extended abstract)",
  crossref =     "ACM:1991:PPT",
  pages =        "199--205",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/113413/p199-jakobsson/p199-jakobsson.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/113413/p199-jakobsson/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/113413/p199-jakobsson/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; theory",
  subject =      "{\bf G.2.2} Mathematics of Computing, DISCRETE
                 MATHEMATICS, Graph Theory, Trees. {\bf F.2.2} Theory of
                 Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Nonnumerical Algorithms and Problems,
                 Computations on discrete structures. {\bf G.2.2}
                 Mathematics of Computing, DISCRETE MATHEMATICS, Graph
                 Theory, Path and circuit problems.",
}

@InProceedings{Ross:1991:NHE,
  author =       "Kenneth A. Ross",
  title =        "On negation in {HiLog} (extended abstract)",
  crossref =     "ACM:1991:PPT",
  pages =        "206--215",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/113413/p206-ross/p206-ross.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/113413/p206-ross/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/113413/p206-ross/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; languages; theory",
  subject =      "{\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{Jagadish:1991:RTS,
  author =       "H. V. Jagadish",
  title =        "A retrieval technique for similar shapes",
  crossref =     "ACM:1991:PPT",
  pages =        "208--217",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p208-jagadish/p208-jagadish.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p208-jagadish/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Sohn:1991:TDL,
  author =       "Kirack Sohn and Allen {Van Gelder}",
  title =        "Termination detection in logic programs using argument
                 sizes (extended abstract)",
  crossref =     "ACM:1991:PPT",
  pages =        "216--226",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/113413/p216-sohn/p216-sohn.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/113413/p216-sohn/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/113413/p216-sohn/",
  acknowledgement = ack-nhfb,
  keywords =     "languages; theory",
  subject =      "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC
                 AND FORMAL LANGUAGES, Mathematical Logic, Logic and
                 constraint programming. {\bf G.1.6} Mathematics of
                 Computing, NUMERICAL ANALYSIS, Optimization, Linear
                 programming. {\bf F.3.1} Theory of Computation, LOGICS
                 AND MEANINGS OF PROGRAMS, Specifying and Verifying and
                 Reasoning about Programs. {\bf F.2.1} Theory of
                 Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Numerical Algorithms and Problems,
                 Computations on matrices. {\bf H.2.1} Information
                 Systems, DATABASE MANAGEMENT, Logical Design, Data
                 models.",
}

@InProceedings{Ahmed:1991:VMC,
  author =       "Rafi Ahmed and Shamkant B. Navathe",
  title =        "Version management of composite objects in {CAD}
                 databases",
  crossref =     "ACM:1991:PPT",
  pages =        "218--227",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p218-ahmed/p218-ahmed.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p218-ahmed/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Brodsky:1991:IIC,
  author =       "Alexander Brodsky and Yehoshua Sagiv",
  title =        "Inference of inequality constraints in logic programs
                 (extended abstracts)",
  crossref =     "ACM:1991:PPT",
  pages =        "227--240",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/113413/p227-brodsky/p227-brodsky.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/113413/p227-brodsky/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/113413/p227-brodsky/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; theory",
  subject =      "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC
                 AND FORMAL LANGUAGES, Mathematical Logic, Logic and
                 constraint programming. {\bf F.3.1} Theory of
                 Computation, LOGICS AND MEANINGS OF PROGRAMS,
                 Specifying and Verifying and Reasoning about Programs.
                 {\bf F.2.2} Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems, Sorting and searching. {\bf
                 F.3.3} Theory of Computation, LOGICS AND MEANINGS OF
                 PROGRAMS, Studies of Program Constructs.",
}

@InProceedings{Chiueh:1991:TAM,
  author =       "Tzi-cker Chiueh and Randy Katz",
  title =        "Trait: an attribute management system for {VLSI}
                 design objects",
  crossref =     "ACM:1991:PPT",
  pages =        "228--237",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p228-chiueh/p228-chiueh.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p228-chiueh/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Abiteboul:1991:OV,
  author =       "Serge Abiteboul and Anthony Bonner",
  title =        "Objects and views",
  crossref =     "ACM:1991:PPT",
  pages =        "238--247",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p238-abiteboul/p238-abiteboul.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p238-abiteboul/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Seib:1991:PDP,
  author =       "J{\"u}rgen Seib and Georg Lausen",
  title =        "Parallelizing {Datalog} programs by generalized
                 pivoting",
  crossref =     "ACM:1991:PPT",
  pages =        "241--251",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/113413/p241-seib/p241-seib.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/113413/p241-seib/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/113413/p241-seib/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; languages; theory",
  subject =      "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC
                 AND FORMAL LANGUAGES, Mathematical Logic, Logic and
                 constraint programming. {\bf H.2.3} Information
                 Systems, DATABASE MANAGEMENT, Languages, Datalog. {\bf
                 D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent
                 Programming, Parallel programming.",
}

@InProceedings{Barsalou:1991:URD,
  author =       "Thierry Barsalou and Niki Siambela and Arthur M.
                 Keller and Gio Wiederhold",
  title =        "Updating relational databases through object-based
                 views",
  crossref =     "ACM:1991:PPT",
  pages =        "248--257",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p248-barsalou/p248-barsalou.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p248-barsalou/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Malvestuto:1991:SMC,
  author =       "F. M. Malvestuto and M. Moscarini and M. Rafanelli",
  title =        "Suppressing marginal cells to protect sensitive
                 information in a two-dimensional statistical table
                 (extended abstract)",
  crossref =     "ACM:1991:PPT",
  pages =        "252--258",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/113413/p252-malvestuto/p252-malvestuto.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/113413/p252-malvestuto/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/113413/p252-malvestuto/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; security; theory",
  subject =      "{\bf G.2.2} Mathematics of Computing, DISCRETE
                 MATHEMATICS, Graph Theory. {\bf F.2.2} Theory of
                 Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Nonnumerical Algorithms and Problems,
                 Computations on discrete structures. {\bf H.2.0}
                 Information Systems, DATABASE MANAGEMENT, General,
                 Security, integrity, and protection**.",
}

@InProceedings{Kemper:1991:FMO,
  author =       "Alfons Kemper and Christoph Kilger and Guido
                 Moerkotte",
  title =        "Function materialization in object bases",
  crossref =     "ACM:1991:PPT",
  pages =        "258--267",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p258-kemper/p258-kemper.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p258-kemper/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Roy:1991:SCC,
  author =       "Shaibal Roy",
  title =        "Semantic complexity of classes of relational queries
                 and query independent data partitioning",
  crossref =     "ACM:1991:PPT",
  pages =        "259--267",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/113413/p259-roy/p259-roy.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/113413/p259-roy/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/113413/p259-roy/",
  acknowledgement = ack-nhfb,
  keywords =     "theory",
  subject =      "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Data models. {\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,
                 Probabilistic computation.",
}

@InProceedings{Ioannidis:1991:PES,
  author =       "Yannis E. Ioannidis and Stavros Christodoulakis",
  title =        "On the propagation of errors in the size of join
                 results",
  crossref =     "ACM:1991:PPT",
  pages =        "268--277",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p268-ioannidis/p268-ioannidis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p268-ioannidis/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Seshadri:1991:ESR,
  author =       "S. Seshadri and Jeffrey F. Naughton",
  title =        "On the expected size of recursive {Datalog} queries",
  crossref =     "ACM:1991:PPT",
  pages =        "268--279",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/113413/p268-seshadri/p268-seshadri.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/113413/p268-seshadri/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/113413/p268-seshadri/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; experimentation; languages; theory",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Datalog. {\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.",
}

@InProceedings{Hou:1991:ECC,
  author =       "Wen-Chi Hou and Gultekin Ozsoyoglu and Erdogan Dogdu",
  title =        "Error-constrained {COUNT} query evaluation in
                 relational databases",
  crossref =     "ACM:1991:PPT",
  pages =        "278--287",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p278-hou/p278-hou.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p278-hou/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Baudinet:1991:RIT,
  author =       "Marianne Baudinet and Marc Ni{\'e}zette and Pierre
                 Wolper",
  title =        "On the representation of infinite temporal data and
                 queries (extended abstract)",
  crossref =     "ACM:1991:PPT",
  pages =        "280--290",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/113413/p280-baudinet/p280-baudinet.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/113413/p280-baudinet/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/113413/p280-baudinet/",
  acknowledgement = ack-nhfb,
  keywords =     "languages; theory",
  subject =      "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC
                 AND FORMAL LANGUAGES, Mathematical Logic. {\bf H.2.3}
                 Information Systems, DATABASE MANAGEMENT, Languages,
                 Query languages.",
}

@InProceedings{Imielinski:1991:IOD,
  author =       "Tomasz Imielinski and Shamim Naqvi and Kumar
                 Vadaparty",
  title =        "Incomplete object --- a data model for design and
                 planning applications",
  crossref =     "ACM:1991:PPT",
  pages =        "288--297",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p288-imielinski/p288-imielinski.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p288-imielinski/",
  acknowledgement = ack-nhfb,
}

@InProceedings{VandenBussche:1991:EPS,
  author =       "Jan {Van den Bussche} and Jan Paredaens",
  title =        "The expressive power structured values in pure
                 {OODB}'s (extended abstract)",
  crossref =     "ACM:1991:PPT",
  pages =        "291--299",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/113413/p291-van_den_bussche/p291-van_den_bussche.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/113413/p291-van_den_bussche/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/113413/p291-van_den_bussche/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; languages",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems. {\bf H.2.3} Information Systems, DATABASE
                 MANAGEMENT, Languages, Query languages. {\bf G.2.2}
                 Mathematics of Computing, DISCRETE MATHEMATICS, Graph
                 Theory. {\bf F.2.2} Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems, Computations on discrete
                 structures.",
}

@InProceedings{Richardson:1991:AEO,
  author =       "Joel Richardson and Peter Schwarz",
  title =        "Aspects: extending objects to support multiple,
                 independent roles",
  crossref =     "ACM:1991:PPT",
  pages =        "298--307",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p298-richardson/p298-richardson.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p298-richardson/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Beeri:1991:SOE,
  author =       "Catriel Beeri and Tova Milo",
  title =        "Subtyping in {OODB}'s (extended abstract)",
  crossref =     "ACM:1991:PPT",
  pages =        "300--314",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/113413/p300-beeri/p300-beeri.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/113413/p300-beeri/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/113413/p300-beeri/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; languages",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems. {\bf F.3.2} Theory of Computation, LOGICS AND
                 MEANINGS OF PROGRAMS, Semantics of Programming
                 Languages, Algebraic approaches to semantics. {\bf
                 H.2.1} Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Data models. {\bf F.3.3} Theory of
                 Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies
                 of Program Constructs, Type structure.",
}

@InProceedings{Phipps:1991:GND,
  author =       "Geoffrey Phipps and Marcia A. Derr and Kenneth A.
                 Ross",
  title =        "Glue-Nail: a deductive database system",
  crossref =     "ACM:1991:PPT",
  pages =        "308--317",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p308-phipps/p308-phipps.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p308-phipps/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Grumbach:1991:TQL,
  author =       "St{\'e}phane Grumbach and Victor Vianu",
  title =        "Tractable query languages for complex object
                 databases",
  crossref =     "ACM:1991:PPT",
  pages =        "315--327",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/113413/p315-grumbach/p315-grumbach.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/113413/p315-grumbach/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/113413/p315-grumbach/",
  acknowledgement = ack-nhfb,
  keywords =     "languages; theory",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Query languages. {\bf H.2.4} Information
                 Systems, DATABASE MANAGEMENT, Systems. {\bf H.2.3}
                 Information Systems, DATABASE MANAGEMENT, Languages,
                 Data manipulation languages (DML).",
}

@InProceedings{Annevelink:1991:DPL,
  author =       "Jurgen Annevelink",
  title =        "Database programming languages: a functional
                 approach",
  crossref =     "ACM:1991:PPT",
  pages =        "318--327",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p318-annevelink/p318-annevelink.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p318-annevelink/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chen:1991:NRB,
  author =       "Qiming Chen and Yahiko Kambayashi",
  title =        "Nested relation based database knowledge
                 representation",
  crossref =     "ACM:1991:PPT",
  pages =        "328--337",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p328-chen/p328-chen.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p328-chen/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hull:1991:EDR,
  author =       "Richard Hull and Masatoshi Yoshikawa",
  title =        "On the equivalence of database restructurings
                 involving object identifiers (extended abstract)",
  crossref =     "ACM:1991:PPT",
  pages =        "328--340",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/113413/p328-hull/p328-hull.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/113413/p328-hull/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/113413/p328-hull/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; languages",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Data manipulation languages (DML). {\bf
                 H.2.1} Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Data models. {\bf H.2.3} Information
                 Systems, DATABASE MANAGEMENT, Languages, Query
                 languages. {\bf F.3.2} Theory of Computation, LOGICS
                 AND MEANINGS OF PROGRAMS, Semantics of Programming
                 Languages.",
}

@InProceedings{Shyy:1991:KHL,
  author =       "Yuh-Ming Shyy and Stanley Y. W. Su",
  title =        "{K}: a high-level knowledge base programming language
                 for advanced database applications",
  crossref =     "ACM:1991:PPT",
  pages =        "338--347",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p338-shyy/p338-shyy.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p338-shyy/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hansen:1991:EMI,
  author =       "S. C. Hansen and E. A. Unger",
  title =        "An extended memoryless inference control model:
                 accounting for dependence in table-level controls",
  crossref =     "ACM:1991:PPT",
  pages =        "348--356",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p348-hansen/p348-hansen.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p348-hansen/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Carey:1991:DCT,
  author =       "Michael J. Carey and Michael J. Franklin and Miron
                 Livny and Eugene J. Shekita",
  title =        "Data caching tradeoffs in client-server {DBMS}
                 architectures",
  crossref =     "ACM:1991:PPT",
  pages =        "357--366",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p357-carey/p357-carey.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p357-carey/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Wang:1991:CCC,
  author =       "Yongdong Wang and Lawrence A. Rowe",
  title =        "Cache consistency and concurrency control in a
                 client\slash server {DBMS} architecture",
  crossref =     "ACM:1991:PPT",
  pages =        "367--376",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p367-wang/p367-wang.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p367-wang/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Pu:1991:RCD,
  author =       "Calton Pu and Avraham Leff",
  title =        "Replica control in distributed systems: as
                 asynchronous approach",
  crossref =     "ACM:1991:PPT",
  pages =        "377--386",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p377-pu/p377-pu.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p377-pu/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ng:1991:FBA,
  author =       "Raymond Ng and Christos Faloutsos and Timos Sellis",
  title =        "Flexible buffer allocation based on marginal gains",
  crossref =     "ACM:1991:PPT",
  pages =        "387--396",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p387-ng/p387-ng.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p387-ng/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gruenwald:1991:MRA,
  author =       "Le Gruenwald and Margaret H. Eich",
  title =        "{MMDB} reload algorithms",
  crossref =     "ACM:1991:PPT",
  pages =        "397--405",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p397-gruenwald/p397-gruenwald.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p397-gruenwald/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Weikum:1991:DFA,
  author =       "Gerhard Weikum and Peter Zabback and Peter
                 Scheuermann",
  title =        "Dynamic file allocation in disk arrays",
  crossref =     "ACM:1991:PPT",
  pages =        "406--415",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p406-weikum/p406-weikum.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p406-weikum/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Srinivasan:1991:PBT,
  author =       "V. Srinivasan and Michael J. Carey",
  title =        "Performance of {B-tree} concurrency control
                 algorithms",
  crossref =     "ACM:1991:PPT",
  pages =        "416--425",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p416-srinivasan/p416-srinivasan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p416-srinivasan/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Lanka:1991:FPB,
  author =       "Sitaram Lanka and Eric Mays",
  title =        "Fully persistent {B+-trees}",
  crossref =     "ACM:1991:PPT",
  pages =        "426--435",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p426-lanka/p426-lanka.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p426-lanka/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Seeger:1991:MDB,
  author =       "Bernhard Seeger and Per-{\AA}ke Larson",
  title =        "Multi-disk {B}-trees",
  crossref =     "ACM:1991:PPT",
  pages =        "436--445",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p436-seeger/p436-seeger.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p436-seeger/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Anonymous:1991:SPH,
  author =       "Anonymous",
  title =        "Are standards the panacea for heterogeneous
                 distributed {DBMSs?}",
  crossref =     "ACM:1991:PPT",
  pages =        "446--446",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Lohman:1991:SIE,
  author =       "Guy M. Lohman and George Lapis and Tobin Lehman and
                 Rakesh Agrawal and Roberta Cochrane and John McPherson
                 and C. Mohan and Hamid Pirahesh and Jennifer Widom",
  title =        "{Starburst II}: the extender strikes back!",
  crossref =     "ACM:1991:PPT",
  pages =        "447--447",
  year =         "1991",
  bibdate =      "Wed Oct 25 08:47:36 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/115790/p447-lohman/p447-lohman.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/115790/p447-lohman/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Dozier:1992:KAA,
  author =       "Jeff Dozier",
  title =        "Keynote address: access to data in {NASA}'s {Earth}
                 observing system",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "1--1",
  year =         "1992",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p1-dozier/p1-dozier.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p1-dozier/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Beeri:1992:NDM,
  author =       "Catriel Beeri",
  title =        "New data models and languages --- the challenge",
  crossref =     "ACM:1992:PPE",
  pages =        "1--15",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/137097/p1-beeri/p1-beeri.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/137097/p1-beeri/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/137097/p1-beeri/",
  abstract =     "New data models and languages have been the focus of
                 attention in database research in the last decade. The
                 object-oriented paradigm is a convenient vehicle for
                 describing this research, its accomplishments, and for
                 considering which directions are now interesting. This
                 paper presents some concepts of object-oriented
                 databases, and then considers recent interesting
                 developments concerning query languages, object
                 identities, views and meta-data.",
  acknowledgement = ack-nhfb,
  generalterms = "Languages; Theory",
  keywords =     "languages; theory",
  subject =      "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Data models. {\bf H.2.3} Information
                 Systems, DATABASE MANAGEMENT, Languages, Query
                 languages. {\bf H.2.4} Information Systems, DATABASE
                 MANAGEMENT, Systems. {\bf F.4.1} Theory of Computation,
                 MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical
                 Logic. {\bf F.3.3} Theory of Computation, LOGICS AND
                 MEANINGS OF PROGRAMS, Studies of Program Constructs,
                 Type structure.",
}

@InProceedings{Merz:1992:DQF,
  author =       "Ulla Merz and Roger King",
  title =        "{DIRECT}: a query facility for multiple databases",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "2--2",
  year =         "1992",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p2-merz/p2-merz.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p2-merz/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chen:1992:PBK,
  author =       "Q. Chen and W. W. Chu and R.-C. Lee",
  title =        "Pattern-Based Knowledge Induction from Databases",
  crossref =     "Kim:1992:DSN",
  pages =        "2--9",
  year =         "1992",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "Also known as DASFAA '89",
  keywords =     "advanced; applications; DASFAA; database systems;
                 next-generation applications",
}

@InProceedings{Celentano:1992:CDB,
  author =       "A. Celentano and M. G. Fugini and S. Pozzi",
  title =        "Conceptual document browsing and retrieval in {{\em
                 Kabiria\/}}",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "3--3",
  year =         "1992",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p3-celentano/p3-celentano.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p3-celentano/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Johnson:1992:UDM,
  author =       "Rowland R. Johnson and Mandy Goldner and Mitch Lee and
                 Keith McKay and Robert Shectman and John Woodruff",
  title =        "{USD} --- a database management system for scientific
                 research",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "4--4",
  year =         "1992",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p4-johnson/p4-johnson.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p4-johnson/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gesmann:1992:PDS,
  author =       "Michael Gesmann and Andreas Grasnickel and Theo
                 H{\"a}rder and Christoph H{\"u}bel and Wolfgang
                 K{\"a}fer and Bernhard Mitschang and Harald
                 Sch{\"o}ning",
  title =        "{PRIMA} --- a database system supporting dynamically
                 defined composite objects",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "5--5",
  year =         "1992",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p5-gesmann/p5-gesmann.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p5-gesmann/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gray:1992:DTP,
  author =       "Jim Gray",
  title =        "Database and transaction processing benchmarks",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "6--6",
  year =         "1992",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p6-gray/p6-gray.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p6-gray/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bancilhon:1992:OOD,
  author =       "Fran{\c{c}}ois Bancilhon",
  title =        "The {O$_2$} object-oriented database system",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "7--7",
  year =         "1992",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p7-bancilhon/p7-bancilhon.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p7-bancilhon/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Orenstein:1992:AOD,
  author =       "Jack Orenstein",
  title =        "Architectures for object data management",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "8--8",
  year =         "1992",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p8-orenstein/p8-orenstein.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p8-orenstein/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ganguly:1992:QOP,
  author =       "Sumit Ganguly and Waqar Hasan and Ravi Krishnamurthy",
  title =        "Query optimization for parallel execution",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "9--18",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p9-ganguly/p9-ganguly.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p9-ganguly/",
  abstract =     "The decreasing cost of computing makes it economically
                 viable to reduce the response time of decision support
                 queries by using parallel execution to exploit
                 inexpensive resources. This goal poses the following
                 query optimization problem: {\em Minimize response time
                 subject to constraints on throughput}, which we
                 motivate as the dual of the traditional DBMS problem.
                 We address this novel problem in the context of
                 Select-Project-Join queries by extending the execution
                 space, cost model and search algorithm that are widely
                 used in commercial DBMSs. We incorporate the sources
                 and deterrents of parallelism in the traditional
                 execution space. We show that a cost model can predict
                 response time while accounting for the new aspects due
                 to parallelism. We observe that the response time
                 optimization metric violates a fundamental assumption
                 in the dynamic programming algorithm that is the
                 linchpin in the optimizers of most commercial DBMSs. We
                 extend dynamic programming and show how optimization
                 metrics which correctly predict response time may be
                 designed.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Performance; Theory",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Computing
                 Methodologies --- Artificial Intelligence --- Problem
                 Solving, Control Methods, and Search (I.2.8): {\bf
                 Dynamic programming}; Mathematics of Computing ---
                 Numerical Analysis --- Optimization (G.1.6)",
}

@InProceedings{Murakami:1992:SPK,
  author =       "K. Murakami and T. Aibara",
  title =        "Some Properties of Knowledge Information Inferred by
                 Two Interactive Default Reasoning Systems",
  crossref =     "Kim:1992:DSN",
  pages =        "10--18",
  year =         "1992",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "Also known as DASFAA '89",
  keywords =     "advanced; applications; DASFAA; database systems;
                 next-generation applications",
}

@InProceedings{Papadimitriou:1992:TBS,
  author =       "Christos H. Papadimitriou and Mihalis Yannakakis",
  title =        "Tie-breaking semantics and structural totality",
  crossref =     "ACM:1992:PPE",
  pages =        "16--22",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/137097/p16-papadimitriou/p16-papadimitriou.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/137097/p16-papadimitriou/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/137097/p16-papadimitriou/",
  abstract =     "We address the question of when the structure of a
                 Datalog program with negation guarantees the existence
                 of a fixpoint. We propose a semantics of Datalog
                 programs with negation, which we call the tie-breaking
                 semantics. The tie-breaking semantics can be computed
                 in polynomial time, and results in a fix-point whenever
                 the rule-goal graph of the program has no cycle with an
                 odd number of negative edges. We show that, in some
                 well-defined sense, this is the most general fixpoint
                 semantics of negation possible; in particular we show
                 that if a cycle with an odd number of negative edges is
                 present, then the logic program is not structurally
                 total, that is, it has an alphabetic variant which has
                 no fixpoint semantics whatsoever. Determining whether a
                 program is (nonstructurally) total is undecidable.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Languages; Theory",
  keywords =     "algorithms; languages; theory",
  subject =      "Information Systems --- Database Management ---
                 Languages (H.2.3): {\bf Datalog}; Theory of Computation
                 --- Logics and Meanings of Programs --- Semantics of
                 Programming Languages (F.3.2); Theory of Computation
                 --- Mathematical Logic and Formal Languages ---
                 Mathematical Logic (F.4.1): {\bf Logic and constraint
                 programming}",
}

@InProceedings{Qi:1992:FPE,
  author =       "R. Qi and W. Bibel",
  title =        "A Framework for the Parallel Evaluation of Recursive
                 Queries in Deductive Databases",
  crossref =     "Kim:1992:DSN",
  pages =        "19--27",
  year =         "1992",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "Also known as DASFAA '89",
  keywords =     "advanced; applications; DASFAA; database systems;
                 next-generation applications",
}

@InProceedings{Hong:1992:EIO,
  author =       "Wei Hong",
  title =        "Exploiting inter-operation parallelism in {XPRS}",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "19--28",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p19-hong/p19-hong.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p19-hong/",
  abstract =     "In this paper, we study the scheduling and
                 optimization problems of parallel query processing
                 using interoperation parallelism in a shared-memory
                 environment and propose our solutions for XPRS. We
                 first study the scheduling problem of a set of a
                 continuous sequence of independent tasks that are
                 either from a bushy tree plan of a single query or from
                 the plans of multiple queries, and present a clean and
                 simple scheduling algorithm. Our scheduling algorithm
                 achieves maximum resource utilizations by running an
                 IO-bound task and a CPU-bound task in parallel with
                 carefully calculated degrees of parallelism and
                 maintains the maximum resource utilizations by
                 dynamically adjusting the degrees of parallelism of
                 running tasks whenever necessary. Real performance
                 figures are shown to confirm the effectiveness of our
                 scheduling algorithm. We also revisit the optimization
                 problem of parallel execution plans of a single query
                 and extend our previous results to consider
                 inter-operation parallelism by introducing a new cost
                 estimation method to the query optimizer based on our
                 scheduling algorithm.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Measurement; Performance; Theory",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Concurrency}; Information Systems
                 --- Database Management --- Systems (H.2.4): {\bf Query
                 processing}; Theory of Computation --- Analysis of
                 Algorithms and Problem Complexity --- Nonnumerical
                 Algorithms and Problems (F.2.2): {\bf Sequencing and
                 scheduling}",
}

@InProceedings{Abiteboul:1992:QET,
  author =       "Serge Abiteboul and Kevin Compton and Victor Vianu",
  title =        "Queries are easier than you thought (probably)",
  crossref =     "ACM:1992:PPE",
  pages =        "23--32",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/137097/p23-abiteboul/p23-abiteboul.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/137097/p23-abiteboul/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/137097/p23-abiteboul/",
  abstract =     "The optimization of a large class of queries is
                 explored, using a powerful normal form recently proven.
                 The queries include the {\em fixpoint\/} and {\em
                 while\/} queries, and an extension of {\em while\/}
                 with arithmetic. The optimization method is evaluated
                 using a probabilistic analysis. In particular, the
                 average complexity of {\em fixpoint\/} and {\em
                 while\/} is considered and some surprising results are
                 obtained. They suggest that the worst-case complexity
                 is sometimes overly pessimistic for such queries, whose
                 average complexity is often much more reasonable than
                 the provably rare worst case. Some computational
                 properties of queries are also investigated. A
                 probabilistic notion of {\em boundedness\/} is defined,
                 and it is shown that all programs in the class
                 considered are bounded almost everywhere. An effective
                 way of using this fact is provided.",
  acknowledgement = ack-nhfb,
  generalterms = "Languages; Performance",
  keywords =     "languages; performance",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing. {\bf H.2.3} Information
                 Systems, DATABASE MANAGEMENT, Languages, Query
                 languages. {\bf G.1.6} Mathematics of Computing,
                 NUMERICAL ANALYSIS, Optimization. {\bf F.1.2} Theory of
                 Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of
                 Computation, Probabilistic computation.",
}

@InProceedings{Han:1992:CEA,
  author =       "J. Han and Wen Yu Lu",
  title =        "Compilation and Evaluation of Asynchronous Chain
                 Recursions in Deductive Databases",
  crossref =     "Kim:1992:DSN",
  pages =        "28--41",
  year =         "1992",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "Also known as DASFAA '89",
  keywords =     "advanced; applications; DASFAA; database systems;
                 next-generation applications",
}

@InProceedings{Ghandeharizadeh:1992:PAA,
  author =       "Shahram Ghandeharizadeh and David J. DeWitt and Waheed
                 Qureshi",
  title =        "A performance analysis of alternative multi-attribute
                 declustering strategies",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "29--38",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p29-ghandeharizadeh/p29-ghandeharizadeh.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p29-ghandeharizadeh/",
  abstract =     "During the past decade, parallel database systems have
                 gained increased popularity due to their high
                 performance, scalability and availability
                 characteristics. With the predicted future database
                 sizes and the complexity of queries, the scalability of
                 these systems to hundreds and thousands of processors
                 is essential for satisfying the projected demand.
                 Several studies have repeatedly demonstrated that both
                 the performance and scalability of a parallel database
                 system is contingent on the physical layout of data
                 across the processors of the system. If the data is not
                 declustered properly, the execution of an operator
                 might waste resources, reducing the overall processing
                 capability of the system. \par

                 With earlier, single attribute declustering strategies,
                 such as those found in Tandem, Teradata, Gamma, and
                 Bubba parallel database systems, a selection query
                 including a range predicate on any attribute other than
                 the partitioning attribute must be sent to all
                 processors containing tuples of the relation. By
                 directing a query with minimal resource requirements to
                 processors that contain no relevant tuples, the system
                 wastes CPU cycles, communication bandwidth, and I/O
                 bandwidth, reducing its overall processing capability.
                 As a solution, several multi-attribute declustering
                 strategies have been proposed. However, the performance
                 of these declustering techniques have not previously
                 been compared to one another nor with a single
                 attribute partitioning strategy. This paper, compares
                 the performance of Multi-Attribute GrId deClustering
                 (MAGIC) strategy and Bubba's Extended Range
                 Declustering (BERD) strategy with one another and with
                 the range partitioning strategy. Our results indicate
                 that MAGIC outperforms both range and BERD in all
                 experiments conducted in this study.",
  acknowledgement = ack-nhfb,
  generalterms = "Measurement; Performance",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Concurrency}; Computing
                 Methodologies --- Simulation and Modeling --- Model
                 Validation and Analysis (I.6.4)",
}

@InProceedings{Greiner:1992:LEQ,
  author =       "Russell Greiner",
  title =        "Learning efficient query processing strategies",
  crossref =     "ACM:1992:PPE",
  pages =        "33--46",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/137097/p33-greiner/p33-greiner.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/137097/p33-greiner/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/137097/p33-greiner/",
  abstract =     "A query processor QP uses the rules in a rule base to
                 reduce a given query to a series of attempted
                 retrievals from a database of facts. The Qp's {\em
                 expected cost\/} is the average time it requires to
                 find an answer, averaged over its anticipated set of
                 queries. This cost depends on Qp's {\em strategy},
                 which specifies the order in which it considers the
                 possible rules and retrievals. This paper provides two
                 related learning algorithms, PIB and PAO, for improving
                 the QP's strategy, i.e., for producing new strategies
                 with lower expected costs. Each algorithm first
                 monitors the Qp's operations over a set of queries,
                 observing how often each path of rules leads to a
                 sufficient set of successful retrievals, and then uses
                 these statistics to suggest a new strategy. PIB
                 hill-climbs to strategies that are, with high
                 probability, successively better; and PAO produces a
                 new strategy that probably is approximately optimal. We
                 describe how to implement both learning systems
                 unobtrusively, discuss their inherent time and space
                 complexities, and use methods from mathematical
                 statistics to prove their correctness. We also discuss
                 additional applications of these approaches to several
                 other database tasks.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Theory",
  keywords =     "algorithms; theory",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing. {\bf I.2.3} Computing
                 Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and
                 Theorem Proving. {\bf H.2.3} Information Systems,
                 DATABASE MANAGEMENT, Languages, Datalog. {\bf G.2.2}
                 Mathematics of Computing, DISCRETE MATHEMATICS, Graph
                 Theory, Graph algorithms.",
}

@InProceedings{Pirahesh:1992:ERB,
  author =       "Hamid Pirahesh and Joseph M. Hellerstein and Waqar
                 Hasan",
  title =        "Extensible/rule based query rewrite optimization in
                 {Starburst}",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "39--48",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p39-pirahesh/p39-pirahesh.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p39-pirahesh/",
  abstract =     "This paper describes the Query Rewrite facility of the
                 Starburst extensible database system, a novel phase of
                 query optimization. We present a suite of rewrite rules
                 used in Starburst to transform queries into equivalent
                 queries for faster execution, and also describe the
                 production rule engine which is used by Starburst to
                 choose and execute these rules. Examples are provided
                 demonstrating that these Query Rewrite transformations
                 lead to query execution time improvements of orders of
                 magnitude, suggesting that Query Rewrite in
                 general--and these rewrite rules in particular--are an
                 essential step in query optimization for modern
                 database systems.",
  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);
                 Computing Methodologies --- Artificial Intelligence ---
                 Knowledge Representation Formalisms and Methods
                 (I.2.4): {\bf Representations (procedural and
                 rule-based)}",
}

@InProceedings{Kim:1992:MMI,
  author =       "H.-J. Kim and S.-H. Lee and H. R. Astudillo",
  title =        "Method Maintenance Issues in Dynamic Object-Oriented
                 Databases",
  crossref =     "Kim:1992:DSN",
  pages =        "42--50",
  year =         "1992",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "Also known as DASFAA '89",
  keywords =     "advanced; applications; DASFAA; database systems;
                 next-generation applications",
}

@InProceedings{Rotem:1992:ADA,
  author =       "Doron Rotem",
  title =        "Analysis of disk arm movement for large sequential
                 reads",
  crossref =     "ACM:1992:PPE",
  pages =        "47--54",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/137097/p47-rotem/p47-rotem.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/137097/p47-rotem/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/137097/p47-rotem/",
  abstract =     "The common model for analyzing seek distances on a
                 magnetic disk uses a continuous approximation in which
                 the range of motion of the disk arm is the interval
                 [0,1]. In this model, both the current location of the
                 disk arm and the location of the next request are
                 assumed to be points uniformly distributed on the
                 interval [0,1] and therefore the expected seek distance
                 to service the next request is 1/3. In many types of
                 databases including scientific, object oriented, and
                 multimedia database systems, a disk service request may
                 involve fetching very large objects which must be
                 transferred from the disk without interruption. In this
                 paper we show that the common model does not accurately
                 reflect disk arm movement in such cases as both the
                 assumption of uniformity and the range of motion of the
                 disk arm may depend on the size of the objects. We
                 propose a more accurate model that takes into
                 consideration the distribution of the sizes of the
                 objects fetched as well as the disk arm scheduling
                 policy. We provide closed form expressions for the
                 expected seek distance in this model under various
                 assumptions on the distribution of object sizes and the
                 capability of the disk arm to read in both directions
                 and to correct its position before the next read is
                 performed.",
  acknowledgement = ack-nhfb,
  generalterms = "Performance; Theory",
  keywords =     "performance; theory",
  subject =      "{\bf B.3.2} Hardware, MEMORY STRUCTURES, Design
                 Styles, Mass storage. {\bf H.2.0} Information Systems,
                 DATABASE MANAGEMENT, General. {\bf B.3.3} Hardware,
                 MEMORY STRUCTURES, Performance Analysis and Design
                 Aids**, Formal models**.",
}

@InProceedings{Hanson:1992:RCT,
  author =       "Eric N. Hanson",
  title =        "Rule condition testing and action execution in
                 {Ariel}",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "49--58",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p49-hanson/p49-hanson.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p49-hanson/",
  abstract =     "This paper describes testing of rule conditions and
                 execution of rule actions in Ariel active DBMS. The
                 Ariel rule system is tightly coupled with query and
                 update processing. Ariel rules can have conditions
                 based on a mix of patterns, events, and transitions.
                 For testing rule conditions, Ariel makes use of a
                 discrimination network composed of a special data
                 structure for testing single-relation selection
                 conditions efficiently, and a modified version of the
                 TREAT algorithm, called A-TREAT, for testing join
                 conditions. The key modification to TREAT (which could
                 also be used in the Rete algorithm) is the use of {\em
                 virtual\/}-memory nodes which save storage since they
                 contain only the predicate associated with the memory
                 node instead of copies of data matching the predicate.
                 The rule-action executor in Ariel binds the data
                 matching a rule's condition to the action of the rule
                 at rule fire time, and executes the rule action using
                 the query processor.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Languages; Measurement; Theory",
  subject =      "Information Systems --- Database Management ---
                 Languages (H.2.3); Computing Methodologies ---
                 Artificial Intelligence --- Knowledge Representation
                 Formalisms and Methods (I.2.4)",
}

@InProceedings{Vittori:1992:NOS,
  author =       "E. Vittori and N. {Le Thanh} and G. Mopolo and Miranda
                 and S.",
  title =        "{NICE-OS}: An Object Server for Persistent Programming
                 in {NICE-C++}",
  crossref =     "Kim:1992:DSN",
  pages =        "51--59",
  year =         "1992",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "Also known as DASFAA '89",
  keywords =     "advanced; applications; DASFAA; database systems;
                 next-generation applications",
}

@InProceedings{Chaudhuri:1992:ERN,
  author =       "Surajit Chaudhuri and Moshe Y. Vardi",
  title =        "On the equivalence of recursive and nonrecursive
                 datalog programs",
  crossref =     "ACM:1992:PPE",
  pages =        "55--66",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/137097/p55-chaudhuri/p55-chaudhuri.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/137097/p55-chaudhuri/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/137097/p55-chaudhuri/",
  abstract =     "We study the problem of determining whether a given
                 recursive Datalog program is equivalent to a given
                 nonrecursive Datalog program. We prove triply
                 exponential upper and lower time bounds.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Languages; Theory",
  keywords =     "algorithms; languages; theory",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Datalog. {\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. {\bf D.3.4}
                 Software, PROGRAMMING LANGUAGES, Processors,
                 Optimization.",
}

@InProceedings{Aiken:1992:BDP,
  author =       "Alexander Aiken and Jennifer Widom and Joseph M.
                 Hellerstein",
  title =        "Behavior of database production rules: termination,
                 confluence, and observable determinism",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "59--68",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p59-aiken/p59-aiken.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p59-aiken/",
  abstract =     "Static analysis methods are given for determining
                 whether arbitrary sets of database production rules are
                 (1) guaranteed to terminate; (2) guaranteed to produce
                 a unique final database state; (3) guaranteed to
                 produce a unique stream of observable actions. When the
                 analysis determines that one of these properties is not
                 guaranteed, it isolates the rules responsible for the
                 problem and determines criteria that, if satisfied,
                 guarantee the property. The analysis methods are
                 presented in the context of the Starburst Rule System;
                 they will form the basis of an interactive development
                 environment for Starburst rule programmers.",
  acknowledgement = ack-nhfb,
  generalterms = "Theory; Verification",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4); Computing Methodologies --- Artificial
                 Intelligence --- Knowledge Representation Formalisms
                 and Methods (I.2.4)",
}

@InProceedings{Masai:1992:AFI,
  author =       "K. Masai and S. Yamamoto and H. Ishikawa and Sumiyoshi
                 and T.",
  title =        "Advanced Features of Integrated {DB\slash DC} System
                 ``{XDM}''",
  crossref =     "Kim:1992:DSN",
  pages =        "60--67",
  year =         "1992",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "Also known as DASFAA '89",
  keywords =     "advanced; applications; DASFAA; database systems;
                 next-generation applications",
}

@InProceedings{Levy:1992:CRD,
  author =       "Alon Levy and Yehoshua Sagiv",
  title =        "Constraints and redundancy in datalog",
  crossref =     "ACM:1992:PPE",
  pages =        "67--80",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/137097/p67-levy/p67-levy.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/137097/p67-levy/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/137097/p67-levy/",
  abstract =     "Two types of redundancies in datalog program are
                 considered. Redundancy based on {\em reachability\/}
                 eliminates rules and predicates that do not participate
                 in any derivation tree of a fact for the query
                 predicate. Redundancy based on {\em irrelevance\/} is
                 similar, but considers only minimal derivation trees,
                 that is, derivation trees having no pair of identical
                 atoms, such that one is an ancestor of the other.
                 Algorithms for detecting these redundancies are given,
                 including the case of programs with constraint
                 literals. These algorithms not only detect redundancies
                 in the presence of constraints, but also push
                 constraints from the given query and rules to the EDB
                 predicates. Under certain assumptions discussed in the
                 paper, the constraints are pushed to the EDB as tightly
                 as possible.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Languages; Theory; Verification",
  keywords =     "algorithms; languages; theory; verification",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Datalog. {\bf G.2.2} Mathematics of
                 Computing, DISCRETE MATHEMATICS, Graph Theory, Trees.
                 {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC
                 AND FORMAL LANGUAGES, Mathematical Logic. {\bf D.2.4}
                 Software, SOFTWARE ENGINEERING, Software/Program
                 Verification, Correctness proofs.",
}

@InProceedings{Ling:1992:SIC,
  author =       "Tok Wang Ling and Sin Yeung Lee",
  title =        "A Survey of Integrity Constraint Checking Methods in
                 Relational Databases",
  crossref =     "Kim:1992:DSN",
  pages =        "68--78",
  year =         "1992",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "Also known as DASFAA '89",
  keywords =     "advanced; applications; DASFAA; database systems;
                 next-generation applications",
}

@InProceedings{Wade:1992:FDO,
  author =       "Andrew E. Wade",
  title =        "Full distribution in {Objectivity\slash DB}",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "69--69",
  year =         "1992",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p69-wade/p69-wade.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p69-wade/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Barry:1992:IDO,
  author =       "Douglas K. Barry",
  title =        "{ITASCA Distributed ODBMS}",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "70--70",
  year =         "1992",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p70-barry/p70-barry.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p70-barry/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cruz:1992:DVL,
  author =       "Isabel F. Cruz",
  title =        "{DOODLE}: a visual language for object-oriented
                 databases",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "71--80",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p71-cruz/p71-cruz.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p71-cruz/",
  abstract =     "In this paper we introduce DOODLE, a new visual and
                 declarative language for object-oriented databases. The
                 main principle behind the language is that it is
                 possible to {\em display and query the database with
                 arbitrary pictures}. We allow the user to tailor the
                 display of the data to suit the application at hand or
                 her preferences. We want the user-defined
                 visualizations to be stored in the database, and the
                 language to express all kinds of visual manipulations.
                 For extendibility reasons, the language is
                 object-oriented. The semantics of the language is given
                 by a well-known deductive query language for
                 object-oriented databases. We hope that the formal
                 basis of our language will contribute to the
                 theoretical study of database visualizations and visual
                 query languages, a subject that we believe is of great
                 interest, but largely left unexplored.",
  acknowledgement = ack-nhfb,
  generalterms = "Languages; Theory",
  subject =      "Information Systems --- Database Management ---
                 Languages (H.2.3): {\bf Query languages}; Information
                 Systems --- Database Management --- Logical Design
                 (H.2.1): {\bf Data models}; Software --- Programming
                 Techniques --- Visual Programming (D.1.7)",
}

@InProceedings{Xu:1992:RCR,
  author =       "H. Xu and Y. Kambayashi",
  title =        "Realization of Composite Relationship Views Utilizing
                 Regular Expressions",
  crossref =     "Kim:1992:DSN",
  pages =        "79--87",
  year =         "1992",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "Also known as DASFAA '89",
  keywords =     "advanced; applications; DASFAA; database systems;
                 next-generation applications",
}

@InProceedings{Dong:1992:DEC,
  author =       "Guozhu Dong",
  title =        "Datalog expressiveness of chain queries: grammar tools
                 and characterizations",
  crossref =     "ACM:1992:PPE",
  pages =        "81--90",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/137097/p81-dong/p81-dong.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/137097/p81-dong/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/137097/p81-dong/",
  abstract =     "A chain query seeks, for each input database (viewed
                 as directed graph), all pairs of start and end nodes of
                 paths whose labels spell words in an associated
                 (possibly non context-free) language over some binary
                 predicates. We study the expressive power of Datalog
                 for chain queries. Extending context-free productions
                 with labels, we introduce a new tool called ``indexed
                 positive programmed grammarr'' (IPPG). Three variations
                 of IPPG are introduced to characterize chain queries
                 computable (i) by linear Datalog, (ii) by ``semi-linear
                 Datalog'', and (iii) by general Datalog, respectively,
                 under a natural ``addressable'' condition.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Languages",
  keywords =     "algorithms; languages",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Datalog. {\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. {\bf F.4.2}
                 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL
                 LANGUAGES, Grammars and Other Rewriting Systems,
                 Grammar types.",
}

@InProceedings{Gehani:1992:ESA,
  author =       "N. H. Gehani and H. V. Jagadish and O. Shmueli",
  title =        "Event specification in an active object-oriented
                 database",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "81--90",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p81-gehani/p81-gehani.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p81-gehani/",
  abstract =     "The concept of a trigger is central to any active
                 database. Upon the occurrence of a trigger event, the
                 trigger is ``fired'', i.e, the trigger action is
                 executed. We describe a model and a language for
                 specifying basic and composite trigger events in the
                 context of an object-oriented database. The specified
                 events can be detected efficiently using finite
                 automata. \par

                 We integrate our model with O++, the database
                 programming language for the ode object database being
                 developed at ATT Bell Labs. We propose a new
                 Event-Action model, which folds into the event
                 specification the condition part of the well-known
                 Event-Condition-Action model and avoids the multiple
                 coupling modes between the event, condition, and action
                 trigger components.",
  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}; Software --- Software Engineering ---
                 Requirements/Specifications (D.2.1)",
}

@InProceedings{Unland:1992:NTM,
  author =       "R. Unland",
  title =        "A Nested Transaction Model for Engineering
                 Applications",
  crossref =     "Kim:1992:DSN",
  pages =        "88--101",
  year =         "1992",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "Also known as DASFAA '89",
  keywords =     "advanced; applications; DASFAA; database systems;
                 next-generation applications",
}

@InProceedings{Lieuwen:1992:TBA,
  author =       "Daniel F. Lieuwen and David J. DeWitt",
  title =        "A transformation-based approach to optimizing loops in
                 database programming languages",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "91--100",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p91-lieuwen/p91-lieuwen.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p91-lieuwen/",
  abstract =     "Database programming languages like {$O$} 2, {\em E},
                 and {$O$} ++ include the ability to iterate through a
                 set. Nested iterators can be used to express joins.
                 This paper describes compile-time optimizations similar
                 to relational transformations like join reordering for
                 such programming constructs. This paper also shows how
                 to use a standard transformation-based optimizer to
                 optimize these joins. An optimizer built using the
                 EXODUS Optimizer Generator [GRAE87] was added to the
                 Bell Labs {$O$} ++ [AGRA89] compiler. We used the
                 resulting optimizing compiler to experimentally
                 validate the ideas in this paper. The experiments show
                 that this technique can significantly improve the
                 performance of database programming languages.",
  acknowledgement = ack-nhfb,
  generalterms = "Languages; Measurement; Performance",
  subject =      "Software --- Programming Languages --- Processors
                 (D.3.4): {\bf Optimization}; Information Systems ---
                 Database Management --- Languages (H.2.3): {\bf
                 Database (persistent) programming languages}; Software
                 --- Programming Languages --- Language Constructs and
                 Features (D.3.3)",
}

@InProceedings{Beeri:1992:VMS,
  author =       "Catriel Beeri and Raghu Ramakrishnan and Divesh
                 Srivastava and S. Sudarshan",
  title =        "The valid model semantics for logic programs",
  crossref =     "ACM:1992:PPE",
  pages =        "91--104",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/137097/p91-beeri/p91-beeri.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/137097/p91-beeri/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/137097/p91-beeri/",
  abstract =     "We present the valid model semantics, a new approach
                 to providing semantics for logic programs with
                 negation, set-terms and grouping. The valid model
                 semantics is a three-valued semantics, and is defined
                 in terms of a normal form computation. The valid model
                 semantics also gives meaning to the generation and use
                 of non-ground facts (i.e., facts with variables) in a
                 computation. \par

                 The formulation of the semantics in terms of a normal
                 form computation offers important insight not only into
                 the valid model semantics, but also into other
                 semantics proposed earlier. We show that the valid
                 model semantics extends the well-founded semantics in a
                 natural manner, and has several advantages over it. The
                 well-founded semantics can also be understood using a
                 variant of the normal form computations that we use;
                 the normal form computations used for valid semantics
                 seem more natural than those used for well-founded
                 semantics. \par

                 We also show that the valid model semantics has several
                 other desirable properties: it is founded ([SZ90]), it
                 is contained in every regular model ([YY90]), and it is
                 contained in every two-valued stable model.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Languages; Verification",
  keywords =     "algorithms; languages; verification",
  subject =      "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC
                 AND FORMAL LANGUAGES, Mathematical Logic, Logic and
                 constraint programming. {\bf F.3.1} Theory of
                 Computation, LOGICS AND MEANINGS OF PROGRAMS,
                 Specifying and Verifying and Reasoning about Programs.
                 {\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages. {\bf F.3.2} Theory of Computation, LOGICS
                 AND MEANINGS OF PROGRAMS, Semantics of Programming
                 Languages.",
}

@InProceedings{Rosenthal:1992:WCW,
  author =       "Arnon Rosenthal",
  title =        "What can we do to strengthen the connection between
                 theory and system builders (panel)",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "101--101",
  year =         "1992",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p101-rosenthal/p101-rosenthal.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p101-rosenthal/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kasi:1992:HPA,
  author =       "Jay Kasi",
  title =        "High performance and availability through data
                 distribution",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "102--102",
  year =         "1992",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p102-kasi/p102-kasi.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p102-kasi/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Fang:1992:SIF,
  author =       "D. Fang and D. McLeod",
  title =        "Seamless Interconnection in Federated Database
                 Systems",
  crossref =     "Kim:1992:DSN",
  pages =        "102--112",
  year =         "1992",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "Also known as DASFAA '89",
  keywords =     "advanced; applications; DASFAA; database systems;
                 next-generation applications",
}

@InProceedings{Davison:1992:PIB,
  author =       "Wayne Davison",
  title =        "Parallel index building in {Informix OnLine 6.0}",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "103--103",
  year =         "1992",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p103-davison/p103-davison.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p103-davison/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Agrawal:1992:UDC,
  author =       "D. Agrawal and A. {El Abbadi} and R. Jeffers",
  title =        "Using delayed commitment in locking protocols for
                 real-time databases",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "104--113",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p104-agrawal/p104-agrawal.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p104-agrawal/",
  abstract =     "In this paper, we propose locking protocols that are
                 useful for real-time databases. Our approach is
                 motivated from two main observations. First, locking
                 protocols are widely accepted and used in most database
                 systems. Second, in real-time databases it has been
                 shown that the blocking behavior of transactions in
                 locking protocols results in performance degradation.
                 We use a new relationship between locks called ordered
                 sharing to eliminate blocking that arises in the
                 traditional locking protocols. Ordered sharing
                 eliminates blocking of read and write operations but
                 may result in delayed commitment. Since in real-time
                 databases, timeliness and not response time is the
                 crucial factor, or protocols exploit this delay to
                 allow transactions to execute within the slacks of
                 delayed transactions. We compare the performance of the
                 proposed protocols with the two phase locking protocol
                 for real-time databases. Our experiments indicate that
                 the propose protocols significantly reduce the
                 percentage of missed deadlines in the system for a
                 variety of workloads.",
  acknowledgement = ack-nhfb,
  generalterms = "Experimentation; Measurement; Performance",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Concurrency}; Computer
                 Applications --- Computers in Other Systems (J.7): {\bf
                 Real time}; Computing Methodologies --- Simulation and
                 Modeling --- Model Validation and Analysis (I.6.4)",
}

@InProceedings{Greco:1992:GC,
  author =       "Sergio Greco and Carlo Zaniolo and Sumit Ganguly",
  title =        "Greedy by choice",
  crossref =     "ACM:1992:PPE",
  pages =        "105--113",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/137097/p105-greco/p105-greco.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/137097/p105-greco/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/137097/p105-greco/",
  abstract =     "The greedy paradigm of algorithm design is a well
                 known tool used for efficiently solving many classical
                 computational problems within the framework of
                 procedural languages. However, it is very difficult to
                 express these algorithms within the declarative
                 framework of logic-based languages. In this paper, we
                 extend the framework of Datalog-like languages to
                 provide simple and declarative formulations of such
                 problems, with computational complexities comparable to
                 those of procedural formulations. This is achieved
                 through the use of constructs, such as least and
                 choice, that have semantics reducible to that of
                 negative programs under stable model semantics.
                 Therefore, we show that the formulation of greedy
                 algorithms using these constructs lead to a syntactic
                 class of programs, called stage-stratified programs,
                 that are easily recognized at compile time. The
                 fixpoint-based implementation of these recursive
                 programs is very efficient and, combined with suitable
                 storage structures, yields asymptotic complexities
                 comparable to those obtained using procedural
                 languages.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Languages",
  keywords =     "algorithms; design; languages",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages. {\bf F.4.1} Theory of Computation,
                 MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical
                 Logic, Logic and constraint programming. {\bf G.2.2}
                 Mathematics of Computing, DISCRETE MATHEMATICS, Graph
                 Theory, Trees. {\bf F.2.2} Theory of Computation,
                 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY,
                 Nonnumerical Algorithms and Problems, Computations on
                 discrete structures.",
}

@InProceedings{Kim:1992:SOD,
  author =       "J. L. Kim",
  title =        "In Support of Optimism in a Distributed Database
                 System",
  crossref =     "Kim:1992:DSN",
  pages =        "113--119",
  year =         "1992",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "Also known as DASFAA '89",
  keywords =     "advanced; applications; DASFAA; database systems;
                 next-generation applications",
}

@InProceedings{Dan:1992:PAC,
  author =       "Asit Dan and Philip S. Yu",
  title =        "Performance analysis of coherency control policies
                 through lock retention",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "114--123",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p114-dan/p114-dan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p114-dan/",
  abstract =     "Buffer coherency control can be achieved through
                 retaining a lock (shared, exclusive, etc.) on each page
                 in the buffer, even after the requesting transaction
                 has committed. Depending upon the lock mode held for
                 retention and the compatibility of lock modes
                 specified, different retention policies can be devised.
                 In addition to tracking the validity of the buffered
                 data granules, additional capabilities can be provided
                 such as deferred writes to support no-force policy on
                 commit, (node) location identification of valid
                 granules to support remote memory accesses, and
                 shared/exclusive lock retention to reduce the number of
                 global lock requests for concurrency control. However,
                 these can have serious implications not only on the
                 performance but also on the recovery complexity. In
                 this paper, five different integrated coherency
                 policies are considered. We classify these policies
                 into three different categories according to their
                 recovery requirements. A performance study based on
                 analytic models is provided to understand the
                 trade-offs on both maximum throughputs and response
                 times of the policies with a similar level of recovery
                 complexity and the performance gain achievable through
                 increasing the level of recovery complexity.",
  acknowledgement = ack-nhfb,
  generalterms = "Measurement; Performance; Theory",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Concurrency}; Computing
                 Methodologies --- Simulation and Modeling --- Model
                 Validation and Analysis (I.6.4); Information Systems
                 --- Database Management --- Database Administration
                 (H.2.7): {\bf Logging and recovery}",
}

@InProceedings{Ross:1992:MAD,
  author =       "Kenneth A. Ross and Yehoshua Sagiv",
  title =        "Monotonic aggregation in deductive databases",
  crossref =     "ACM:1992:PPE",
  pages =        "114--126",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/137097/p114-ross/p114-ross.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/137097/p114-ross/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/137097/p114-ross/",
  abstract =     "We propose a semantics for aggregates in deductive
                 databases based on a notion of minimality. Unlike some
                 previous approaches, we form a minimal model of a
                 program component including aggregate operators, rather
                 than insisting that the aggregate apply to atoms that
                 have been fully determined, or that aggregate functions
                 are rewritten in terms of negation. In order to
                 guarantee the existence of such a minimal model we need
                 to insist that the domains over which we are
                 aggregating are complete lattices, and that the program
                 is in a sense monotonic. Our approach generalizes
                 previous approaches based on the well-founded semantics
                 and various forms of stratification. We are also able
                 to handle a large variety of monotonic (or
                 pseudo-monotonic) aggregate functions.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Theory",
  keywords =     "algorithms; theory",
  subject =      "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC
                 AND FORMAL LANGUAGES, Mathematical Logic, Logic and
                 constraint programming. {\bf F.3.2} Theory of
                 Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics
                 of Programming Languages. {\bf G.2.2} Mathematics of
                 Computing, DISCRETE MATHEMATICS, Graph Theory, Path and
                 circuit problems. {\bf H.2.0} Information Systems,
                 DATABASE MANAGEMENT, General.",
}

@InProceedings{Son:1992:ADR,
  author =       "Sang Hyuk Son and J. Lee and H. Kang",
  title =        "Approaches to Design of Real-Time Database Systems",
  crossref =     "Kim:1992:DSN",
  pages =        "120--131",
  year =         "1992",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "Also known as DASFAA '89",
  keywords =     "advanced; applications; DASFAA; database systems;
                 next-generation applications",
}

@InProceedings{Mohan:1992:EFM,
  author =       "C. Mohan and Hamid Pirahesh and Raymond Lorie",
  title =        "Efficient and flexible methods for transient
                 versioning of records to avoid locking by read-only
                 transactions",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "124--133",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p124-mohan/p124-mohan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p124-mohan/",
  abstract =     "We present efficient and flexible methods which permit
                 read-only transactions that do not mind reading a
                 possibly slightly old, but still consistent, version of
                 the data base to execute without acquiring locks. This
                 approach avoids the undesirable interferences between
                 such queries and the typically shorter update
                 transactions that cause unnecessary and costly delays.
                 Indexed access by such queries is also supported,
                 unlike by the earlier methods. Old versions of records
                 are maintained only in a {\em transient\/} fashion. Our
                 methods are characterized by their flexibility (number
                 of versions maintained and the timing of version
                 switches, supporting partial rollbacks, and different
                 recovery and buffering methods) and their efficiency
                 (logging, garbage collection, version selection, and
                 incremental, record-level versioning). Distributed data
                 base environments are also supported, including commit
                 protocols with the read-only optimization. We also
                 describe efficient methods for garbage collecting
                 unneeded older versions.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Theory",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4); Information Systems --- Database
                 Management --- Database Administration (H.2.7): {\bf
                 Logging and recovery}",
}

@InProceedings{VanGelder:1992:WFS,
  author =       "Allen {Van Gelder}",
  title =        "The well-founded semantics of aggregation",
  crossref =     "ACM:1992:PPE",
  pages =        "127--138",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/citations/proceedings/pods/137097/p127-van_gelder/",
  abstract =     "Common aggregation predicates have natural definitions
                 in logic, either as first order sentences ({\em min,
                 max,\/} etc.), or with elementary induction over a data
                 structure that represents the relation ({\em sum,
                 count,\/} etc.). The well-founded semantics for logic
                 programs provides an interpretation of such
                 definitions. The interpretation of first-order
                 aggregates seems to be quite natural and intuitively
                 satisfying, even in the presence of recursion through
                 aggregation. Care is needed to get useful results on
                 inductive aggregates, however. A basic building block
                 is the ``subset'' predicate, which states that a data
                 structure represents a subset of an IDB predicate, and
                 which is definable in the well-founded semantics. The
                 analogous ``superset'' is also definable, and their
                 combination yields a ``generic'' form of {\em findall}.
                 Surprisingly, {\em findall\/} must be used negatively
                 to obtain useful approximations when the exact relation
                 is not yet known. \par

                 Extensions to the semantics, restrictions on the input,
                 and other supplementary requirements proposed in
                 earlier studies appear to be unnecessary for the
                 purpose of {\em attaching a meaning\/} to a program
                 that involves recursion through aggregation. For
                 example, any reasonable definition of ``shortest
                 paths'' tolerates negative weight edges, correctly
                 computes shortest paths that exist, and leave tuples
                 undefined where negative-weight cycles cause the
                 shortest path not to exist. Other examples exhibit
                 similarly robust behavior, when defined carefully.
                 Connections with the generic model of computation are
                 discussed briefly.",
  acknowledgement = ack-nhfb,
  generalterms = "Languages; Theory",
  keywords =     "languages; theory",
  subject =      "{\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS
                 OF PROGRAMS, Semantics of Programming Languages. {\bf
                 F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND
                 FORMAL LANGUAGES, Mathematical Logic, Logic and
                 constraint programming. {\bf H.2.3} Information
                 Systems, DATABASE MANAGEMENT, Languages, Prolog. {\bf
                 H.2.1} Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Data models.",
}

@InProceedings{Son:1992:PER,
  author =       "S. H. Son and C.-H. Chang and Y.-K. Kim",
  title =        "Performance Evaluation of Real-Time Locking
                 Protocols",
  crossref =     "Kim:1992:DSN",
  pages =        "132--141",
  year =         "1992",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "Also known as DASFAA '89",
  keywords =     "advanced; applications; DASFAA; database systems;
                 next-generation applications",
}

@InProceedings{Low:1992:HTD,
  author =       "Chee Chin Low and Beng Chin Ooi and Hongjun Lu",
  title =        "{H}-trees: a dynamic associative search index for
                 {OODB}",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "134--143",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p134-low/p134-low.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p134-low/",
  abstract =     "The support of the superclass-subclass concept in
                 object-oriented databases (OODB) makes an instance of a
                 subclass also an instance of its superclass. As a
                 result, the access scope of a query against a class in
                 general includes the access scope of all its
                 subclasses, unless specified otherwise. To support the
                 superclass-subclass relationship efficiently, the index
                 must achieve two objectives. First, the index must
                 support efficient retrieval of instances from a single
                 class. Second, it must also support efficient retrieval
                 of instances from classes in a hierarchy of classes. In
                 this paper, we propose a new index called the H-tree
                 that supports efficient retrieval of instances of a
                 single class as well as retrieval of instances of a
                 class and its subclasses. The unique feature of H-trees
                 is that they capture the superclass-subclass
                 relationships. A performance analysis is conducted and
                 both experimental and analytical results indicate that
                 the H-tree is an efficient indexing structure for
                 OODB.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Measurement; Performance; Theory",
  subject =      "Information Systems --- Information Storage and
                 Retrieval --- Information Search and Retrieval (H.3.3):
                 {\bf Search process}; Information Systems --- Database
                 Management --- Logical Design (H.2.1): {\bf Data
                 models}; Data --- Data Structures (E.1): {\bf Trees}",
}

@InProceedings{Kanasaki:1992:CBE,
  author =       "K. Kanasaki and T. L. Kunii",
  title =        "Case-Based Evolutionary World Model for Electronic
                 Secretaries",
  crossref =     "Kim:1992:DSN",
  pages =        "142--149",
  year =         "1992",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "Also known as DASFAA '89",
  keywords =     "advanced; applications; DASFAA; database systems;
                 next-generation applications",
}

@InProceedings{Rabinovich:1992:FTC,
  author =       "Michael Rabinovich and Edward D. Lazowska",
  title =        "A fault-tolerant commit protocol for replicated
                 databases",
  crossref =     "ACM:1992:PPE",
  pages =        "139--148",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/137097/p139-rabinovich/p139-rabinovich.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/137097/p139-rabinovich/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/137097/p144-rabinovich/",
  abstract =     "When failures occur during the execution of
                 distributed commit protocols, the protocols may block
                 in some partitions to avoid inconsistent termination of
                 the transaction, thus making data items in these
                 partitions unavailable for accesses. We present a
                 protocol that incorporates two new ideas with the goal
                 of improving data availability. First, a new two-level
                 voting scheme is proposed for deciding in which
                 partitions to terminate the transaction. In this
                 scheme, a choice is made based on the number of data
                 items available in the partition rather than on the
                 number of individual nodes. Indeed, in replicated
                 systems, a criterion based on the number of nodes may
                 be misleading. Second, we propose a way to reduce
                 blocking caused by accumulating network fragmentation.
                 The idea employs the {\em views\/} mechanism previously
                 used in replica management.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms",
  keywords =     "algorithms",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Distributed databases. {\bf H.2.4} Information
                 Systems, DATABASE MANAGEMENT, Systems, Transaction
                 processing.",
  xxpages =      "144--148",
}

@InProceedings{Tsangaris:1992:POC,
  author =       "Manolis M. Tsangaris and Jeffrey F. Naughton",
  title =        "On the performance of object clustering techniques",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "144--153",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p144-tsangaris/p144-tsangaris.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p144-tsangaris/",
  abstract =     "We investigate the performance of some of the
                 best-known object clustering algorithms on four
                 different workloads based upon the Tektronix benchmark.
                 For all four workloads, stochastic clustering gave the
                 best performance for a variety of performance metrics.
                 Since stochastic clustering is computationally
                 expensive, it is interesting that for every workload
                 there was at least one cheaper clustering algorithm
                 that matched or almost matched stochastic clustering.
                 Unfortunately, for each workload, the algorithm that
                 approximated stochastic clustering was different. Our
                 experiments also demonstrated that even when the
                 workload and object graph are fixed, the choice of the
                 clustering algorithm depends upon the goals of the
                 system. For example, if the goal is to perform well on
                 traversals of small portions of the database starting
                 with a cold cache, the important metric is the
                 per-traversal expansion factor, and a well-chosen
                 placement tree will be nearly optimal; if the goal is
                 to achieve a high steady-state performance with a
                 reasonably large cache, the appropriate metric is the
                 number of pages to which the clustering algorithm maps
                 the active portion of the database. For this metric,
                 the PRP clustering algorithm, which only uses access
                 probabilities achieves nearly optimal performance.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Measurement; Performance; Theory",
  subject =      "Information Systems --- Information Storage and
                 Retrieval --- Information Search and Retrieval (H.3.3):
                 {\bf Clustering}",
}

@InProceedings{Wolfson:1992:DAD,
  author =       "Ouri Wolfson and Sushil Jajodia",
  title =        "Distributed algorithms for dynamic replication of
                 data",
  crossref =     "ACM:1992:PPE",
  pages =        "149--163",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/137097/p149-wolfson/p149-wolfson.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/137097/p149-wolfson/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/137097/p149-wolfson/",
  abstract =     "We present two distributed algorithms for dynamic
                 replication of a data-item in communication networks.
                 The algorithms are adaptive in the sense that they
                 change the replication scheme of the item (i.e. the set
                 of processors at which the data-item is replicated), as
                 the read-write pattern of the processors in the network
                 changes. Each algorithm continuously moves the
                 replication scheme towards an optimal one, where
                 optimality is defined with respect to different
                 objective functions. One algorithm optimizes the
                 communication cost objective function, and the other
                 optimizes the communication time. We also provide a
                 lower bound on the performance of any dynamic
                 replication algorithm.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Performance; Theory",
  keywords =     "algorithms; performance; theory",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Distributed databases. {\bf H.2.1} Information
                 Systems, DATABASE MANAGEMENT, Logical Design.",
}

@InProceedings{Shimada:1992:SCS,
  author =       "M. Shimada and H. Nishimoto and T. Ishizaka and A.
                 Schuetz",
  title =        "Supporting the Character Sets of {Japanese Kanji} and
                 {Korean Hangul} in the {ADABAS\slash NATURAL} System",
  crossref =     "Kim:1992:DSN",
  pages =        "150--155",
  year =         "1992",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "Also known as DASFAA '89",
  keywords =     "advanced; applications; DASFAA; database systems;
                 next-generation applications",
}

@InProceedings{Ley:1992:TRA,
  author =       "Michael Ley",
  title =        "The term retrieval abstract machine",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "154--163",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p154-ley/p154-ley.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p154-ley/",
  abstract =     "Scans through large collections of complex objects
                 often cannot be avoided. Even if sophisticated indexing
                 mechanisms are provided, it may be necessary to
                 evaluate simple predicates against data stored on disk
                 for filtering. For traditional record oriented data
                 models i/o and buffer management are the main
                 bottlenecks for this operation, the interpretation of
                 data structures is straightforward and usually not an
                 important cost factor. For heterogeneously shaped
                 complex objects it may become a dominant cost factor.
                 \par

                 In this paper we demonstrate a technique to make data
                 structure traversal inside of complex objects much
                 cheaper than naive interpretation. We compile
                 navigation necessary to evaluate condition predicates
                 and physical schema information into a program to be
                 executed by a specialized abstract machine. Our
                 approach is demonstrated for the Feature Term Data
                 Model (FTDM), but the technique is applicable to many
                 other complex data models. Main parts of this paper are
                 dedicated to the method we used to design the Term
                 Retrieval Abstract Machine (TRAM) architecture by
                 partial evaluation of a tuned interpreter.",
  acknowledgement = ack-nhfb,
  generalterms = "Languages; Measurement; Performance; Theory",
  subject =      "Information Systems --- Database Management ---
                 Database Machines (H.2.6); Information Systems ---
                 Database Management --- Logical Design (H.2.1): {\bf
                 Data models}; Information Systems --- Information
                 Storage and Retrieval --- Information Search and
                 Retrieval (H.3.3)",
}

@InProceedings{Cicchetti:1992:MMR,
  author =       "R. Cicchetti and L. Lakhal and S. Miranda",
  title =        "{MARELA}: a Matrix Relational Model for Statistical
                 Database Management",
  crossref =     "Kim:1992:DSN",
  pages =        "156--169",
  year =         "1992",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "Also known as DASFAA '89",
  keywords =     "advanced; applications; DASFAA; database systems;
                 next-generation applications",
}

@InProceedings{Bamford:1992:UMI,
  author =       "Roger Bamford",
  title =        "Using multiversioning to improve performance without
                 loss of consistency",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "164--164",
  year =         "1992",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p164-bamford/p164-bamford.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p164-bamford/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Descollonges:1992:CMT,
  author =       "Marc Descollonges",
  title =        "A concurrency model for transaction management",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "164--164",
  year =         "1992",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p164-descollonges/p164-descollonges.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p164-descollonges/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Mehrotra:1992:ETA,
  author =       "Sharad Mehrotra and Rajeev Rastogi and Yuri Breitbart
                 and Henry F. Korth and Avi Silberschatz",
  title =        "Ensuring transaction atomicity in multidatabase
                 systems",
  crossref =     "ACM:1992:PPE",
  pages =        "164--175",
  year =         "1992",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/137097/p164-mehrotra/p164-mehrotra.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/137097/p164-mehrotra/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/137097/p164-mehrotra/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; theory",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Distributed databases. {\bf H.2.4} Information
                 Systems, DATABASE MANAGEMENT, Systems, Transaction
                 processing.",
}

@InProceedings{Franklin:1992:CRC,
  author =       "Michael J. Franklin and Michael J. Zwilling and C. K.
                 Tan and Michael J. Carey and David J. DeWitt",
  title =        "Crash recovery in client-server {EXODUS}",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "165--174",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p165-franklin/p165-franklin.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p165-franklin/",
  abstract =     "In this paper, we address the correctness and
                 performance issues that arise when implementing logging
                 and crash recovery in a page-server environment. The
                 issues result from two characteristics of page-server
                 systems: (1) the fact that data is modified and cached
                 in client database buffers that are not accessible by
                 the server, and (2) the performance and cost trade-offs
                 that are inherent in a client-server environment. We
                 describe a recovery system that we have implemented for
                 the client-server version of the EXODUS storage
                 manager. The implementation supports efficient buffer
                 management policies, allows flexibility in the
                 interaction between clients and the server, and reduces
                 the server load by generating log records at clients.
                 We also present a preliminary performance analysis of
                 the implementation.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Measurement; Performance; Reliability",
  subject =      "Information Systems --- Database Management ---
                 Database Administration (H.2.7): {\bf Logging and
                 recovery}",
}

@InProceedings{Luan:1992:FAC,
  author =       "Y. Q. Luan and N. Ohbo and H. Kitagawa and X. Yu",
  title =        "Functional Approach to Chemical Structure Databases",
  crossref =     "Kim:1992:DSN",
  pages =        "170--183",
  year =         "1992",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "Also known as DASFAA '89",
  keywords =     "advanced; applications; DASFAA; database systems;
                 next-generation applications",
}

@InProceedings{Jhingran:1992:ARD,
  author =       "Anant Jhingran and Pratap Khedkar",
  title =        "Analysis of recovery in a database system using a
                 write-ahead log protocol",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "175--184",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p175-jhingran/p175-jhingran.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p175-jhingran/",
  abstract =     "In this paper we examine the recovery time in a
                 database system using a Write-Ahead Log protocol, such
                 as ARIES [9], under the assumption that the buffer
                 replacement policy is strict LRU. In particular,
                 analytical equations for log read time, data I/O, log
                 application, and undo processing time are
                 presented. Our initial model assumes a read/write ratio
                 of one, and a uniform access pattern. This is later
                 generalized to include different read/write ratios, as
                 well as a ``hot set'' model (i.e., x\% of the accesses
                 go to y\% of the data). We show that in the uniform
                 access model, recovery is dominated by data I/O costs,
                 but under extreme hot-set conditions, this may no
                 longer be true. Furthermore, since we derive analytical
                 equations, recovery can be analyzed for any set of
                 parameter conditions not discussed here.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Measurement; Reliability; Theory",
  subject =      "Information Systems --- Database Management ---
                 Database Administration (H.2.7): {\bf Logging and
                 recovery}",
}

@InProceedings{Beeri:1992:FPP,
  author =       "Catriel Beeri and Tova Milo",
  title =        "Functional and predictive programming in {OODB}'s",
  crossref =     "ACM:1992:PPE",
  pages =        "176--190",
  year =         "1992",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/137097/p176-beeri/p176-beeri.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/137097/p176-beeri/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/137097/p176-beeri/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; languages",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems. {\bf H.2.1} Information Systems, DATABASE
                 MANAGEMENT, Logical Design, Data models. {\bf D.3.2}
                 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, Object-oriented languages. {\bf D.3.3}
                 Software, PROGRAMMING LANGUAGES, Language Constructs
                 and Features, Abstract data types.",
}

@InProceedings{Oomoto:1992:DIV,
  author =       "E. Oomoto and K. Tanaka",
  title =        "Design and Implementation of a Visual Query Language
                 for Historical Databases",
  crossref =     "Kim:1992:DSN",
  pages =        "184--191",
  year =         "1992",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "Also known as DASFAA '89",
  keywords =     "advanced; applications; DASFAA; database systems;
                 next-generation applications",
}

@InProceedings{Lomet:1992:MRM,
  author =       "David B. Lomet",
  title =        "{MLR}: a recovery method for multi-level systems",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "185--194",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p185-lomet/p185-lomet.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p185-lomet/",
  abstract =     "To achieve high concurrency in a database system has
                 meant building a system that copes well with important
                 special cases. Recent work on multi-level systems
                 suggest a systematic path to high concurrency. A
                 multi-level system using locks permits restrictive low
                 level locks of a subtransaction to be replaced with
                 less restrictive high level locks when sub-transactions
                 commit, enhancing concurrency. This is possible because
                 sub-transactions can be undone via high level
                 compensation actions rather than by restoring a prior
                 lower level state. We describe a recovery scheme,
                 called Multi-Level Recovery (MLR) that logs this high
                 level undo operation with the commit record for the
                 subtransaction that it compensates, posting log records
                 to only a single log. A variant of the method copes
                 with nested transactions, and both nested and
                 multi-level transactions can be treated in a unified
                 fashion.",
  acknowledgement = ack-nhfb,
  generalterms = "Reliability; Theory",
  subject =      "Information Systems --- Database Management ---
                 Database Administration (H.2.7): {\bf Logging and
                 recovery}; Information Systems --- Database Management
                 --- Systems (H.2.4): {\bf Concurrency}",
}

@InProceedings{VandenBussche:1992:SDE,
  author =       "Jan {Van den Bussche} and Dirk {Van Gucht}",
  title =        "Semi-determinism (extended abstract)",
  crossref =     "ACM:1992:PPE",
  pages =        "191--201",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/137097/p191-van_den_bussche/p191-van_den_bussche.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/137097/p191-van_den_bussche/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/137097/p191-van_den_bussche/",
  abstract =     "We investigate under which conditions a
                 non-deterministic query is {\em semi-deterministic},
                 meaning that two different results of the query to a
                 database are isomorphic. We also consider {\em
                 uniform\/} semi-determinism, meaning that all
                 intermediate results of the computation are isomorphic.
                 Semi-determinism is a concept bridging the new trends
                 of non-determinism and object generation in database
                 query languages. Our results concern decidability, both
                 at compile time and at run time; expressibility of the
                 infamous counting queries; and completeness, which is
                 related to the issue of copy elimination raised by
                 Abiteboul and Kannelakis.",
  acknowledgement = ack-nhfb,
  generalterms = "Languages; Verification",
  keywords =     "languages; verification",
  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 H.2.4} Information Systems, DATABASE
                 MANAGEMENT, Systems.",
}

@InProceedings{Kitagawa:1992:MMD,
  author =       "F. Kitagawa and H. Ikeda",
  title =        "Multi-Media Database Language {SL\slash B5} Based on
                 Screen Flow",
  crossref =     "Kim:1992:DSN",
  pages =        "192--200",
  year =         "1992",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "Also known as DASFAA '89",
  keywords =     "advanced; applications; DASFAA; database systems;
                 next-generation applications",
}

@InProceedings{Kamel:1992:PRT,
  author =       "Ibrahim Kamel and Christos Faloutsos",
  title =        "Parallel {R}-trees",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "195--204",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p195-kamel/p195-kamel.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p195-kamel/",
  abstract =     "We consider the problem of exploiting parallelism to
                 accelerate the performance of spacial access methods
                 and specifically, R-trees [11]. Our goal is to design a
                 server for spatial data, so that to maximize the
                 throughput of range queries. This can be achieved by
                 (a) maximizing parallelism for large range queries, and
                 (b) by engaging as few disks as possible on point
                 queries [22]. \par

                 We propose a simple hardware architecture consisting of
                 one processor with several disks attached to it. On
                 this architecture, we propose to distribute the nodes
                 of a traditional R-tree, with cross-disk pointers
                 (``Multiplexed'' R-tree). The R-tree code is identical
                 to the one for a single-disk R-tree, with the only
                 addition that we have to decide which disk a newly
                 created R-tree node should be stored in. We propose and
                 examine several criteria to choose a disk for a new
                 node. The most successful one, termed ``proximity
                 index'' or PI, estimates the similarity of the new node
                 with the other R-tree nodes already on a disk, and
                 chooses the disk with the lowest similarity.
                 Experimental results show that our scheme consistently
                 outperforms all the other heuristics for node-to-disk
                 assignments, achieving up to 55\% gains over the Round
                 Robin one. Experiments also indicate that the
                 multiplexed R-tree with PI heuristic gives better
                 response time than the disk-stripping (=``Super-node'')
                 approach, and imposes lighter load on the I/O
                 sub-system. \par

                 The speed up of our method is close to linear speed up,
                 increasing with the size of the queries.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Experimentation; Measurement; Performance;
                 Theory",
  subject =      "Information Systems --- Database Management ---
                 Physical Design (H.2.2): {\bf Access methods}; Data ---
                 Data Structures (E.1): {\bf Trees}",
}

@InProceedings{Ohtomo:1992:MOV,
  author =       "M. Ohtomo and H. Ikeda",
  title =        "Map-Oriented Visual Language: {MOL}",
  crossref =     "Kim:1992:DSN",
  pages =        "201--208",
  year =         "1992",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "Also known as DASFAA '89",
  keywords =     "advanced; applications; DASFAA; database systems;
                 next-generation applications",
}

@InProceedings{Chan:1992:CMP,
  author =       "Edward P. F. Chan",
  title =        "Containment and minimization of positive conjunctive
                 queries in {OODB}'s",
  crossref =     "ACM:1992:PPE",
  pages =        "202--211",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/137097/p202-chan/p202-chan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/137097/p202-chan/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/137097/p202-chan/",
  abstract =     "With the availability of high-level declarative query
                 languages in an object-oriented database system (OODB),
                 the burden of choosing an efficient execution plan for
                 a query is transferred from the user to the database
                 system. A natural first step is to use the typing
                 constraints imposed by the schema to transform a query
                 into an equivalent one that logically accesses a
                 minimal set of objects. We propose a class of queries
                 called conjunctive queries for OODB's. A conjunctive
                 query can be expressed as an equivalent union of
                 queries in a special form called terminal conjunctive
                 queries. We first characterize the containment, and
                 hence equivalence, conditions for the class of terminal
                 conjunctive queries. We then study a subclass of
                 conjunctive queries called positive conjunctive
                 queries. We characterize the containment and
                 equivalence conditions, as well as derive an algorithm
                 for finding an exact minimization for the class of
                 positive conjunctive queries. The equivalent minimized
                 query is expressed as a union of terminal positive
                 conjunctive queries with the property that the variable
                 search space is minimal among all the unions of
                 postivie conjunctive queries.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Theory",
  keywords =     "algorithms; theory",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing. {\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.",
}

@InProceedings{Hoel:1992:QCS,
  author =       "Erik G. Hoel and Hanan Samet",
  title =        "A qualitative comparison study of data structures for
                 large line segment databases",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "205--214",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p205-hoel/p205-hoel.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p205-hoel/",
  abstract =     "A qualitative comparative study is performed of the
                 performance of three popular spatial indexing methods -
                 the R-tree, R + -tree, and the PMR quadtree-in the
                 context of processing spatial queries in large line
                 segment databases. The data is drawn from the
                 TIGER/Line files used by the Bureau of the Census to
                 deal with the road networks in the US. The goal is not
                 to find the best data structure as this is not
                 generally possible. Instead, their comparability is
                 demonstrated and an indication is given as to when and
                 why their performance differs. Tests are conducted with
                 a number of large datasets and performance is tabulated
                 in terms of the complexity of the disk activity in
                 building them, their storage requirements, and the
                 complexity of the disk activity for a number of tasks
                 that include point and window queries, as well as
                 finding the nearest line segment to a given point and
                 an enclosing polygon.",
  acknowledgement = ack-nhfb,
  generalterms = "Experimentation; Measurement; Performance; Theory",
  subject =      "Information Systems --- Information Storage and
                 Retrieval --- Content Analysis and Indexing (H.3.1):
                 {\bf Indexing methods}; Data --- Data Structures (E.1):
                 {\bf Trees}",
}

@InProceedings{Kasahara:1992:NVI,
  author =       "H. Kasahara and T. Kishimoto",
  title =        "Navigation in the Visual Information Database World",
  crossref =     "Kim:1992:DSN",
  pages =        "209--217",
  year =         "1992",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "Also known as DASFAA '89",
  keywords =     "advanced; applications; DASFAA; database systems;
                 next-generation applications",
}

@InProceedings{Turek:1992:LBM,
  author =       "John Turek and Dennis Shasha and Sundeep Prakash",
  title =        "Locking without blocking: making lock based concurrent
                 data structure algorithms nonblocking",
  crossref =     "ACM:1992:PPE",
  pages =        "212--222",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/137097/p212-turek/p212-turek.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/137097/p212-turek/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/137097/p212-turek/",
  abstract =     "Nonblocking algorithms for concurrent data structures
                 guarantee that a data structure is always accessible.
                 This is in contrast to blocking algorithms in which a
                 slow or halted process can render part or all of the
                 data structure inaccessible to other processes.
                 \par

                 This paper proposes a technique that can convert most
                 existing lock-based blocking data structure algorithms
                 into nonblocking algorithms with the same
                 functionality. Our instruction-by-instruction
                 transformation can be applied to any algorithm having
                 the following properties: \par

                 Interprocess synchronization is established solely
                 through the use of locks. \par

                 There is no possiblity of deadlock (e.g., because of a
                 well-ordering among the lock requests). \par

                 In contrast to a previous work, our transformation
                 requires only a constant amount of overhead per
                 operation and, in the absence of failures, it incurs no
                 penalty in the amount of concurrency that was available
                 in the original data structure. \par

                 The techniques in this paper may obviate the need for a
                 wholesale reinvention of techniques for nonblocking
                 concurrent data structure algorithms.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design",
  keywords =     "algorithms; design",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Distributed databases. {\bf H.2.4} Information
                 Systems, DATABASE MANAGEMENT, Systems, Concurrency.
                 {\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Data models.",
}

@InProceedings{Analyti:1992:FSM,
  author =       "Anastasia Analyti and Sakti Pramanik",
  title =        "Fast search in main memory databases",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "215--224",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p215-analyti/p215-analyti.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p215-analyti/",
  abstract =     "The objective of this paper is to develop and analyze
                 high performance hash based search methods for main
                 memory databases. We define optimal search in main
                 memory databases as the search that requires at most
                 one key comparison to locate a record. Existing hashing
                 techniques become impractical when they are adapted to
                 yield optimal search in main memory databases because
                 of their large directory size. Multi-directory hashing
                 techniques can provide significantly improved directory
                 utilization over single-directory hashing techniques. A
                 multi-directory hashing scheme, called fast search
                 multi-directory hashing, and its generalization, called
                 controlled search multi-directory hashing, are
                 presented. Both methods achieve linearly increasing
                 expected directory size with the number of records.
                 Their performance is compared to existing
                 alternatives.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Measurement; Performance; Theory;
                 Verification",
  subject =      "Information Systems --- Database Management ---
                 Physical Design (H.2.2): {\bf Access methods}; Data ---
                 Data Storage Representations (E.2): {\bf Hash-table
                 representations}; Theory of Computation --- Analysis of
                 Algorithms and Problem Complexity --- Nonnumerical
                 Algorithms and Problems (F.2.2): {\bf Sorting and
                 searching}",
}

@InProceedings{Chang:1992:SSS,
  author =       "C. C. Chang and D. J. Buehrer",
  title =        "A Survey of Some Spatial Match Query Algorithms",
  crossref =     "Kim:1992:DSN",
  pages =        "218--223",
  year =         "1992",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "Also known as DASFAA '89",
  keywords =     "advanced; applications; DASFAA; database systems;
                 next-generation applications",
}

@InProceedings{Agrawal:1992:AET,
  author =       "D. Agrawal and A. {El Abbadi} and R. Jeffers",
  title =        "An approach to eliminate transaction blocking in
                 locking protocols",
  crossref =     "ACM:1992:PPE",
  pages =        "223--235",
  year =         "1992",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/137097/p223-agrawal/p223-agrawal.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/137097/p223-agrawal/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/137097/p223-agrawal/",
  acknowledgement = ack-nhfb,
  keywords =     "experimentation; performance",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Transaction processing. {\bf H.2.4}
                 Information Systems, DATABASE MANAGEMENT, Systems,
                 Concurrency.",
}

@InProceedings{Embley:1992:IOM,
  author =       "D. W. Embley and G. Nagy",
  title =        "Intersection Operations in a Multi-Layered Spatial
                 Data Model",
  crossref =     "Kim:1992:DSN",
  pages =        "224--230",
  year =         "1992",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "Also known as DASFAA '89",
  keywords =     "advanced; applications; DASFAA; database systems;
                 next-generation applications",
}

@InProceedings{Celis:1992:DPA,
  author =       "Pedro Celis",
  title =        "Distribution, parallelism, and availability in nonstop
                 {SQL}",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "225--225",
  year =         "1992",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p225-celis/p225-celis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p225-celis/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Rabinovich:1992:IFT,
  author =       "Michael Rabinovich and Edward D. Lazowska",
  title =        "Improving fault tolerance and supporting partial
                 writes in structured coterie protocols for replicated
                 objects",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "226--235",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p226-rabinovich/p226-rabinovich.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p226-rabinovich/",
  abstract =     "This paper presents a new technique for efficiently
                 controlling replicas in distributed systems.
                 Conventional structured coterie protocols are efficient
                 but incur a penalty of reduced availability in exchange
                 for the performance gain. Further, the performance
                 advantage can only be fully realized when write
                 operations always {\em replace\/} the old data item
                 with the new value instead of {\em updating a
                 portion\/} of the data item. Our new approach
                 significantly improves availability while allowing
                 partial write operations. \par

                 After presenting our general approach, we apply it to
                 an existing structured coterie protocol and analyze the
                 availability of the resulting protocol. We also show
                 that other classes of protocols can make use of our
                 approach.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Measurement; Performance; Theory",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Distributed databases}; Computer
                 Systems Organization --- Computer-Communication
                 Networks --- Network Protocols (C.2.2): {\bf Protocol
                 verification}; Computer Systems Organization ---
                 Computer-Communication Networks --- Distributed Systems
                 (C.2.4): {\bf Distributed databases}",
}

@InProceedings{Iwaihara:1992:PNQ,
  author =       "M. Iwaihara and Y. Kambayashi",
  title =        "Processing Nondeterministic Queries Including Sets and
                 Constraints Utilizing Data Dependencies",
  crossref =     "Kim:1992:DSN",
  pages =        "231--239",
  year =         "1992",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "Also known as DASFAA '89",
  keywords =     "advanced; applications; DASFAA; database systems;
                 next-generation applications",
}

@InProceedings{Bhide:1992:ESP,
  author =       "Anupam Bhide and Ambuj Goyal and Hui-I. Hsiao and
                 Anant Jhingran",
  title =        "An efficient scheme for providing high availability",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "236--245",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p236-bhide/p236-bhide.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p236-bhide/",
  abstract =     "Replication at the partition level is a promising
                 approach for increasing availability in a Shared
                 Nothing architecture. We propose an algorithm for
                 maintaining replicas with little overhead during normal
                 failure-free processing. Our mechanism updates the
                 secondary replica in an asynchronous manner: entire
                 dirty pages are sent to the secondary at some time
                 before they are discarded from primary's buffer. A log
                 server node (hardened against failures) maintains the
                 log for each node. If a primary node fails, the
                 secondary fetches the log from the log server, applied
                 it to its replica, and brings itself to the primary's
                 last transaction-consistent state. We study the
                 performance of various policies for sending pages to
                 secondary and the corresponding trade-offs between
                 recovery time and overhead during failure-free
                 processing.",
  acknowledgement = ack-nhfb,
  generalterms = "Measurement; Performance; Reliability; Theory",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Transaction processing};
                 Information Systems --- Database Management ---
                 Database Administration (H.2.7): {\bf Logging and
                 recovery}",
}

@InProceedings{Wong:1992:TBI,
  author =       "M. H. Wong and D. Agrawal",
  title =        "Tolerating bounded inconsistency for increasing
                 concurrency in database systems",
  crossref =     "ACM:1992:PPE",
  pages =        "236--245",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/137097/p236-wong/p236-wong.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/137097/p236-wong/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/137097/p236-wong/",
  abstract =     "Recently, the scope of databases has been extended to
                 many non-standard applications, and serializability is
                 found to be too restrictive for such applications. In
                 general, two approaches are adopted to address this
                 problem. The first approach considers placing more
                 structure on data objects to exploit type specific
                 properties while keeping serializability as the
                 correctness criterion. The other approach uses explicit
                 semantics of transactions and databases to permit
                 interleaved executions of transactions that are
                 non-serializable. In this paper, we attempt to bridge
                 the gap between the two approaches by using the notion
                 of serializability with bounded inconsistency. Users
                 are free to specify the maximum level of inconsistency
                 that can be allowed in the executions of operations
                 dynamically. In particular, if no inconsistency is
                 allowed in the execution of any operation, the protocol
                 will be reduced to a standard strict two phase locking
                 protocol based on type-specific semantics of data
                 objects. Bounded inconsistency can be applied to many
                 areas which do not require exact values of the data
                 such as for gathering information for statistical
                 purpose, for making high level decisions and reasoning
                 in expert systems which can tolerate uncertainty in
                 input data.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design",
  keywords =     "algorithms; design",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Concurrency. {\bf H.2.1} Information Systems,
                 DATABASE MANAGEMENT, Logical Design, Data models.",
}

@InProceedings{Ajitomi:1992:ERA,
  author =       "N. Ajitomi and H. Kurose",
  title =        "An Enhanced {RETE} Algorithm for Large Scale Data
                 Access",
  crossref =     "Kim:1992:DSN",
  pages =        "240--249",
  year =         "1992",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "Also known as DASFAA '89",
  keywords =     "advanced; applications; DASFAA; database systems;
                 next-generation applications",
}

@InProceedings{Polyzois:1992:ERB,
  author =       "Christos A. Polyzois and Hector Garcia-Molina",
  title =        "Evaluation of remote backup algorithms for transaction
                 processing systems",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "246--255",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p246-polyzois/p246-polyzois.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p246-polyzois/",
  abstract =     "A remote backup is a copy of a primary database
                 maintained at a geographically separate location and is
                 used to increase data availability. Remote backup
                 systems are typically log-based and can be classified
                 into 2-safe and 1-safe, depending on whether
                 transactions commit at both sites simultaneously or
                 they first commit at the primary and are later
                 propagated to the backup. We have built an experimental
                 database system on which we evaluated the performance
                 of the epoch algorithm, a 1-safe algorithm we have
                 developed, and compared it with the 2-safe approach
                 under various conditions. We also report on the use of
                 multiple log streams to propagate information from the
                 primary to the backup.",
  acknowledgement = ack-nhfb,
  generalterms = "Measurement; Performance; Reliability; Theory",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Transaction processing};
                 Information Systems --- Database Management ---
                 Database Administration (H.2.7): {\bf Logging and
                 recovery}",
}

@InProceedings{Grahne:1992:KT,
  author =       "G{\"o}sta Grahne and Alberto O. Mendelzon and Peter Z.
                 Revesz",
  title =        "Knowledgebase transformations",
  crossref =     "ACM:1992:PPE",
  pages =        "246--260",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/137097/p246-grahne/p246-grahne.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/137097/p246-grahne/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/137097/p246-grahne/",
  abstract =     "We propose a language that expresses uniformly queries
                 and updates on knowledgebases consisting of finite sets
                 of relational structures. The language contains an
                 operator that ``inserts'' arbitrary first-order
                 sentences into knowledgebase. The semantics of the
                 insertion is based on the notion of {\em update\/}
                 formalized by Katsuno and Mendelzon in the context of
                 belief revision theory. Our language can express, among
                 other things, hypothetical queries and queries on
                 recursively indefinite databases. The expressive power
                 of our language lies between existential second-order
                 and general second-order queries. The data complexity
                 is in general within exponential time, although it can
                 be lowered to co-NP and to polynomial time by
                 restricting the form of queries and updates.",
  acknowledgement = ack-nhfb,
  generalterms = "Languages; Theory",
  keywords =     "languages; theory",
  subject =      "{\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, Data models.",
}

@InProceedings{Ramamohanarao:1992:PMR,
  author =       "K. Ramamohanarao and J. Shepherd and R. Sacks-Davis",
  title =        "Partial-Match Retrieval Using Multiple-Key Hashing
                 with Multiple File Copies",
  crossref =     "Kim:1992:DSN",
  pages =        "250--275",
  year =         "1992",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "Also known as DASFAA '89",
  keywords =     "advanced; applications; DASFAA; database systems;
                 next-generation applications",
}

@InProceedings{Lanzelotte:1992:OOO,
  author =       "Rosana S. G. Lanzelotte and Patrick Valduriez and
                 Mohamed Za{\"\i}t",
  title =        "Optimization of object-oriented recursive queries
                 using cost-controlled strategies",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "256--265",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p256-lanzelotte/p256-lanzelotte.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p256-lanzelotte/",
  abstract =     "Object-oriented data models are being extended with
                 recursion to gain expressive power. This complicates
                 the optimization problem which has to deal with
                 recursive queries on complex objects. Because unary
                 operations invoking methods or path expressions on
                 objects may be costly to execute, traditional
                 heuristics for optimizing recursive queries are no
                 longer valid. In this paper we propose a cost-based
                 optimization method which handles object-oriented
                 recursive queries. In particular, it is able to delay
                 the decision of pushing selective operations through
                 recursion until the effect of such a transformation can
                 be measured by a cost model. The approach integrates
                 rewriting and increases the optimization opportunities
                 for recursive queries on objects while allowing for
                 efficient optimization.",
  acknowledgement = ack-nhfb,
  generalterms = "Languages; Theory",
  subject =      "Information Systems --- Database Management ---
                 Logical Design (H.2.1): {\bf Data models}; Theory of
                 Computation --- Mathematical Logic and Formal Languages
                 --- Grammars and Other Rewriting Systems (F.4.2);
                 Software --- Programming Languages --- Processors
                 (D.3.4): {\bf Optimization}",
}

@InProceedings{Eiter:1992:CPK,
  author =       "Thomas Eiter and Georg Gottlob",
  title =        "On the complexity of propositional knowledge base
                 revision, updates, and counterfactuals",
  crossref =     "ACM:1992:PPE",
  pages =        "261--273",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/137097/p261-eiter/p261-eiter.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/137097/p261-eiter/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/137097/p261-eiter/",
  abstract =     "We study the complexity of several recently proposed
                 methods for updating or revising propositional
                 knowledge bases. In particular, we derive complexity
                 results for the following problem: given a knowledge
                 base $T$, an update $p$, and a formula $q$, decide
                 whether $q$ is derivable from {\em Top}, the updated
                 (or revised) knowledge base. This problem amounts to
                 evaluating the counterfactual $p > q$ over $T$. Besides
                 the general case, also subcases are considered, in
                 particular where $T$ is a conjunction of Horn clauses,
                 or where the size of $p$ is bounded by a constant.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Languages; Theory",
  keywords =     "algorithms; languages; theory",
  subject =      "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC
                 AND FORMAL LANGUAGES, Mathematical Logic. {\bf H.2.0}
                 Information Systems, DATABASE MANAGEMENT, General. {\bf
                 I.2.4} Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Knowledge Representation Formalisms and
                 Methods. {\bf F.1.3} Theory of Computation, COMPUTATION
                 BY ABSTRACT DEVICES, Complexity Measures and Classes.
                 {\bf I.2.3} Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Deduction and Theorem Proving,
                 Nonmonotonic reasoning and belief revision.",
}

@InProceedings{Kafer:1992:RTC,
  author =       "Wolfgang K{\"a}fer and Harald Sch{\"o}ning",
  title =        "Realizing a temporal complex-object data model",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "266--275",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p266-kafer/p266-kafer.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p266-kafer/",
  abstract =     "Support for temporal data continues to be a
                 requirement posed by many applications such as VLSI
                 design and CAD, but also in conventional applications
                 like banking and sales. Furthermore, the strong demand
                 for complex-object support is known as an inherent fact
                 in design applications, and also emerges for advance
                 ``conventional'' applications. Thus, new advanced
                 database management systems should include both
                 features, i.e., should support {\em temporal
                 complex-objects}. In this paper, we present such a
                 temporal complex-object data model. The central notion
                 of our temporal complex-object data model is a {\em
                 time slice}, representing one state of a complex
                 object. We explain the mapping of time slices onto the
                 complex objects supported by the MAD model (which we
                 use for an example of a {\em non-temporal\/}
                 complex-object data model) as well as the
                 transformation process of operations on temporal
                 complex-objects into MAD model operations. Thereby, the
                 basic properties of the MAD model are a prerequisite
                 for our approach. For example, time slices can only be
                 directly stored, if non-disjunct (i.e., over-lapping)
                 complex objects are easily handled in the underlying
                 complex-object data model.",
  acknowledgement = ack-nhfb,
  generalterms = "Documentation; Theory",
  subject =      "Information Systems --- Database Management ---
                 Logical Design (H.2.1): {\bf Data models}",
}

@InProceedings{Chomicki:1992:RTI,
  author =       "Jan Chomicki",
  title =        "Real-time integrity constraints",
  crossref =     "ACM:1992:PPE",
  pages =        "274--282",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/137097/p274-chomicki/p274-chomicki.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/137097/p274-chomicki/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/137097/p274-chomicki/",
  abstract =     "We propose that Past Metric Temporal Logic (Temporal
                 Logic with real-time operators referring to the past)
                 be used as a language for specifying real-time
                 integrity constraints. Building on our earlier work, we
                 develop efficient, history-less methods of evaluating
                 such constraints. We also argue that real-time
                 constraints should be implemented as Condition-Action
                 rules with temporal conditions.",
  acknowledgement = ack-nhfb,
  generalterms = "Languages; Theory",
  keywords =     "languages; theory",
  subject =      "Information Systems --- Database Management ---
                 Database Applications (H.2.8); Theory of Computation
                 --- Mathematical Logic and Formal Languages ---
                 Mathematical Logic (F.4.1); Information Systems ---
                 Database Management --- Logical Design (H.2.1)",
}

@InProceedings{Chang:1992:MAS,
  author =       "J. W. Chang and Y. J. Lee",
  title =        "Multikey Access Scheme Based on Term Discrimination
                 and Signature Clustering",
  crossref =     "Kim:1992:DSN",
  pages =        "276--282",
  year =         "1992",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "Also known as DASFAA '89",
  keywords =     "advanced; applications; DASFAA; database systems;
                 next-generation applications",
}

@InProceedings{Biliris:1992:PTD,
  author =       "Alexandros Biliris",
  title =        "The performance of three database storage structures
                 for managing large objects",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "276--285",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p276-biliris/p276-biliris.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p276-biliris/",
  abstract =     "This study analyzes the performance of the storage
                 structures and algorithms employed in three
                 experimental database storage systems - EXODUS,
                 Starburst, and EOS - for managing large unstructured
                 general-purpose objects. All three mechanisms are
                 segment-based in that the large object is stored in a
                 sequence of segments, each consisting of physically
                 continuous disk block. To analyze the algorithms we
                 measured object creation time, sequential scan time,
                 storage utilization in the presence of updates, and the
                 I/O cost of random reads, inserts, and deletes.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Measurement; Performance",
  subject =      "Information Systems --- Information Storage and
                 Retrieval --- Information Storage (H.3.2); Software ---
                 Operating Systems --- Storage Management (D.4.2)",
}

@InProceedings{Kitsuregawa:1992:OFD,
  author =       "M. Kitsuregawa and M. Nakano and M. Takagi",
  title =        "Overview of Functional Disk System",
  crossref =     "Kim:1992:DSN",
  pages =        "283--290",
  year =         "1992",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "Also known as DASFAA '89",
  keywords =     "advanced; applications; DASFAA; database systems;
                 next-generation applications",
}

@InProceedings{Bell:1992:IDD,
  author =       "Colin Bell and Anil Nerode and Raymond T. Ng and V. S.
                 Subrahmanian",
  title =        "Implementing deductive databases by linear
                 programming",
  crossref =     "ACM:1992:PPE",
  pages =        "283--292",
  year =         "1992",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/137097/p283-bell/p283-bell.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/137097/p283-bell/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/137097/p283-bell/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; languages; theory",
  subject =      "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC
                 AND FORMAL LANGUAGES, Mathematical Logic, Logic and
                 constraint programming. {\bf G.1.6} Mathematics of
                 Computing, NUMERICAL ANALYSIS, Optimization, Linear
                 programming. {\bf H.2.4} Information Systems, DATABASE
                 MANAGEMENT, Systems, Query processing. {\bf H.2.1}
                 Information Systems, DATABASE MANAGEMENT, Logical
                 Design. {\bf D.3.2} Software, PROGRAMMING LANGUAGES,
                 Language Classifications, C. {\bf D.3.4} Software,
                 PROGRAMMING LANGUAGES, Processors, Compilers.",
}

@InProceedings{Wang:1992:ERL,
  author =       "Yun Wang",
  title =        "Experience from a real life query optimizer",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "286--286",
  year =         "1992",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p286-wang/p286-wang.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p286-wang/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Rengarajan:1992:RVS,
  author =       "T. K. Rengarajan",
  title =        "{Rdb\slash VMS} support for multi-media databases",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "287--287",
  year =         "1992",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p287-rengarajan/p287-rengarajan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p287-rengarajan/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Mehrotra:1992:CCP,
  author =       "Sharad Mehrotra and Rajeev Rastogi and Yuri Breitbart
                 and Henry F. Korth and Avi Silberschatz",
  title =        "The concurrency control problem in multidatabases:
                 characteristics and solutions",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "288--297",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p288-mehrotra/p288-mehrotra.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p288-mehrotra/",
  abstract =     "A {\em Multidatabase System\/} (MDBS) is a collection
                 of local database management systems, each of which may
                 follow a different concurrency control protocol. This
                 heterogeneity makes the task of ensuring global
                 serializability in an MDBS environment difficult. In
                 this paper, we reduce the problem of ensuring global
                 serializability to the problem of ensuring
                 serializability in a centralized database system. We
                 identify characteristics of the concurrency control
                 problem in an MDBS environment, and additional
                 requirements on concurrency control schemes for
                 ensuring global serializability. We then develop a
                 range of concurrency control schemes that ensure global
                 serializability in an MDBS environment, and at the same
                 time meet the requirements. Finally, we study the
                 tradeoffs between the complexities of the various
                 schemes and the degree of concurrency provided by each
                 of them.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Theory",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Concurrency}",
}

@InProceedings{Scheuermann:1992:ATD,
  author =       "P. Scheuermann and G. Weikum and P. Zabback",
  title =        "Automatic Tuning of Data Placement and Load Balancing
                 in Disk Arrays",
  crossref =     "Kim:1992:DSN",
  pages =        "291--301",
  year =         "1992",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "Also known as DASFAA '89",
  keywords =     "advanced; applications; DASFAA; database systems;
                 next-generation applications",
}

@InProceedings{Ginsburg:1992:PMR,
  author =       "Seymour Ginsburg and Xiaoyang Wang",
  title =        "Pattern matching by {Rs}-operations: towards a unified
                 approach to querying sequenced data",
  crossref =     "ACM:1992:PPE",
  pages =        "293--300",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/137097/p293-ginsburg/p293-ginsburg.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/137097/p293-ginsburg/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/137097/p293-ginsburg/",
  abstract =     "A family of sequence operations (rs-operations), based
                 on pattern matching and including most of the
                 ``natural'' operations on sequences, is introduced. In
                 order to apply rs-operations to calculus-like query
                 languages, a logic about sequences (SL) is defined by
                 converting rs-operations to special predicates. To
                 illustrate the applicability of our concepts to
                 database queries, rs-operations and SL are used in an
                 algebra and a calculus, respectively, over an extended
                 relational data model containing sequences.",
  acknowledgement = ack-nhfb,
  generalterms = "Languages; Theory",
  keywords =     "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 F.2.2} Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems, Pattern matching.",
}

@InProceedings{Shasha:1992:SRG,
  author =       "Dennis Shasha and Eric Simon and Patrick Valduriez",
  title =        "Simple rational guidance for chopping up
                 transactions",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "298--307",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p298-shasha/p298-shasha.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p298-shasha/",
  abstract =     "Chopping transactions into pieces is good for
                 performance but may lead to non-serializable
                 executions. Many researchers have reacted to this fact
                 by either inventing new concurrency control mechanisms,
                 weakening serializability, or both. We adopt a
                 different approach. \par

                 We assume a user who \par

                 has only the degree 2 and degree 3 consistency options
                 offered by the vast majority of conventional database
                 systems; and \par

                 knows the set of transactions that may run during a
                 certain interval (users are likely to have such
                 knowledge for online or real-time transactional
                 applications). \par

                 Given this information, our algorithm finds the finest
                 partitioning of a set of transactions TranSet with the
                 following property; if the partitioned transactions
                 execute serializably, then TranSet executes
                 serializably. This permits users to obtain more
                 concurrency while preserving correctness. Besides
                 obtaining more inter-transaction concurrency, chopping
                 transactions in this way can enhance intra-transaction
                 parallelism. \par

                 The algorithm is inexpensive, running in {$O(n x (e +
                 m))$} time using a naive implementation where {$n$} is
                 the number of edges in the conflict graph among the
                 transactions, and $m$ is the maximum number of accesses
                 of any transaction. This makes it feasible to add as a
                 tuning knob to practical systems.",
  acknowledgement = ack-nhfb,
  generalterms = "Theory; Verification",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Transaction processing}",
}

@InProceedings{Srivastava:1992:PCS,
  author =       "Divesh Srivastava and Raghu Ramakrishnan",
  title =        "Pushing constraint selections",
  crossref =     "ACM:1992:PPE",
  pages =        "301--315",
  year =         "1992",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/137097/p301-srivastava/p301-srivastava.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/137097/p301-srivastava/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/137097/p301-srivastava/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; languages; theory",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Query languages. {\bf D.3.4} Software,
                 PROGRAMMING LANGUAGES, Processors, Optimization. {\bf
                 F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND
                 FORMAL LANGUAGES, Mathematical Logic, Logic and
                 constraint programming.",
}

@InProceedings{Kiyoki:1992:IPQ,
  author =       "Y. Kiyoki and T. Kurosawa and P. Liu and K. Kato",
  title =        "Implementation of a Parallel Query Processing System
                 Supporting Application-Specific Database Operations",
  crossref =     "Kim:1992:DSN",
  pages =        "302--309",
  year =         "1992",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "Also known as DASFAA '89",
  keywords =     "advanced; applications; DASFAA; database systems;
                 next-generation applications",
}

@InProceedings{Rahm:1992:PEE,
  author =       "Erhard Rahm",
  title =        "Performance evaluation of extended storage
                 architectures for transaction processing",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "308--317",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p308-rahm/p308-rahm.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p308-rahm/",
  abstract =     "The use of non-volatile semiconductor memory within an
                 extended storage hierarchy promises significant
                 performance improvements for transaction processing.
                 Although page-addressable semiconductor memories like
                 extended memory, solid-state disks and disk caches are
                 commercially available since several years, no detailed
                 investigation of their use for transaction processing
                 has been performed so far. We present a comprehensive
                 simulation study that compares the performance of these
                 storage types and of different usage forms. The
                 following usage forms are considered: allocation of
                 entire log and database files in non-volatile
                 semiconductor memory, using a so-called write buffer to
                 perform disk writes asynchronously, and caching of
                 database pages at intermediate storage levels (in
                 addition to main memory caching). Simulation results
                 will be presented for the debit-credit workload
                 frequently used in transaction processing benchmarks.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Documentation; Experimentation; Measurement;
                 Performance",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Transaction processing};
                 Information Systems --- Information Storage and
                 Retrieval --- Information Storage (H.3.2); Software ---
                 Operating Systems --- Storage Management (D.4.2)",
}

@InProceedings{Bonner:1992:CRM,
  author =       "Anthony J. Bonner",
  title =        "The complexity of reusing and modifying rulebases",
  crossref =     "ACM:1992:PPE",
  pages =        "316--330",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/137097/p316-bonner/p316-bonner.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/137097/p316-bonner/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/137097/p316-bonner/",
  abstract =     "This paper develops a method for reusing and modifying
                 deductive databases. Such methods are needed when new
                 rulebased applications differ only slightly from
                 existing ones or when an application is to be
                 incrementally updated. In order to facilitate reuse, we
                 extend deductive databases by the concept of {\em
                 predicate substitution}. In this way, during query
                 evaluation, not only variables, but also predicates can
                 be substituted. This paper continues our earlier work
                 on predicate substitution in two directions: (i) We
                 extend the concept to a wider class of modifications
                 rulebase, and (ii) we establish tight bounds on the
                 data complexity of Datalog augmented with substitution,
                 showing it to be EXPTIME-complete. Predicate
                 substitution thus increases the power of Datalog to
                 express database queries. The paper presents a proof
                 theory and model theory for the language, including a
                 fixpoint semantics.",
  acknowledgement = ack-nhfb,
  generalterms = "Languages; Theory",
  keywords =     "languages; theory",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Datalog. {\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 F.3.2} Theory of
                 Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics
                 of Programming Languages.",
}

@InProceedings{Cowley:1992:SDM,
  author =       "Paula J. Cowley",
  title =        "Scientific data management: real-world issues and
                 requirements",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "318--318",
  year =         "1992",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p318-cowley/p318-cowley.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p318-cowley/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chou:1992:DIP,
  author =       "Hong-Tai Chou",
  title =        "The design and implementation of persistent
                 transactions in an object database system",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "319--319",
  year =         "1992",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p319-chou/p319-chou.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p319-chou/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Harris:1992:HPM,
  author =       "Craig Harris and Madhu Reddy and Carl Woolf",
  title =        "A high performance multiversion concurrency control
                 protocol for object databases",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "320--320",
  year =         "1992",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p320-harris/p320-harris.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p320-harris/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Terry:1992:CQA,
  author =       "Douglas Terry and David Goldberg and David Nichols and
                 Brian Oki",
  title =        "Continuous queries over append-only databases",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "321--330",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p321-terry/p321-terry.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p321-terry/",
  abstract =     "In a database to which data is continually added,
                 users may wish to issue a permanent query and be
                 notified whenever data matches the query. If such {\em
                 continuous queries\/} examine only single records, this
                 can be implemented by examining each record as it
                 arrives. This is very efficient because only the
                 incoming record needs to be scanned. This simple
                 approach does not work for queries involving joins or
                 time. The Tapestry system allows users to issue such
                 queries over a database of mail and bulletin board
                 messages. The user issues a static query, such as
                 ``show me all messages that have been replied to by
                 Jones,'' as though the database were fixed and
                 unchanging. Tapestry converts the query into an
                 incremental query that efficiently finds new matches to
                 the original query as new messages are added to the
                 database. This paper describes the techniques used in
                 Tapestry, which do not depend on triggers and thus be
                 implemented on any commercial database that supports
                 SQL. Although Tapestry is designed for filtering mail
                 and news messages, its techniques are applicable to any
                 append-only database.",
  acknowledgement = ack-nhfb,
  generalterms = "Languages; Measurement; Theory",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}",
}

@InProceedings{Srinivasan:1992:CBL,
  author =       "V. Srinivasan and Michael J. Carey",
  title =        "Compensation-based on-line query processing",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "331--340",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p331-srinivasan/p331-srinivasan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p331-srinivasan/",
  abstract =     "It is well known that using conventional concurrency
                 control techniques for obtaining serializable answers
                 to long-running queries leads to an unacceptable drop
                 in system performance. As a result, most current DBMSs
                 execute such queries under a reduced degree of
                 consistency, thus providing non-serializable answers.
                 In this paper, we present a new and highly concurrent
                 approach for processing large decision support queries
                 in relational databases. In this new approach, called
                 compensation-based query processing, concurrent updates
                 to any data participating in a query are communicated
                 to the query's on-line query processor, which then
                 compensates for these updates so that the final answer
                 reflects changes caused by the updates. Very high
                 concurrency is achieved by locking data only briefly,
                 while still delivering transaction-consistent answers
                 to queries.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Theory",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}",
}

@InProceedings{vanderMeyden:1992:CQI,
  author =       "R. {van der Meyden}",
  title =        "The complexity of querying indefinite data about
                 linearly ordered domains",
  crossref =     "ACM:1992:PPE",
  pages =        "331--345",
  year =         "1992",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/citations/proceedings/pods/137097/p331-van_der_meyden/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/137097/p331-van_der_meyden/",
  acknowledgement = ack-nhfb,
  keywords =     "languages; theory",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing. {\bf J.3} Computer
                 Applications, LIFE AND MEDICAL SCIENCES, Biology and
                 genetics. {\bf G.2.2} Mathematics of Computing,
                 DISCRETE MATHEMATICS, Graph Theory, Graph algorithms.",
}

@InProceedings{Haas:1992:SSP,
  author =       "Peter J. Haas and Arun N. Swami",
  title =        "Sequential sampling procedures for query size
                 estimation",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "341--350",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p341-haas/p341-haas.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p341-haas/",
  abstract =     "We provide a procedure, based on random sampling, for
                 estimation of the size of a query result. The procedure
                 is sequential in that sampling terminates after a
                 random number of steps according to a stopping rule
                 that depends upon the observations obtained so far.
                 Enough observations are obtained so that, with a
                 pre-specified probability, the estimate differs from
                 the true size of the query result by no more than a
                 prespecified amount. Unlike previous sequential
                 estimation procedures for queries, our procedure is
                 asymptotically efficient and requires no {\em ad hoc\/}
                 pilot sample or a {\em a priori\/} assumptions about
                 data characteristics. In addition to establishing the
                 asymptotic properties of the estimation procedure, we
                 provide techniques for reducing undercoverage at small
                 sample sizes and show that the sampling cost of the
                 procedure can be reduced through stratified sampling
                 techniques.",
  acknowledgement = ack-nhfb,
  generalterms = "Experimentation; Measurement; Performance; Theory",
  subject =      "Mathematics of Computing --- Probability and
                 Statistics (G.3); Information Systems --- Database
                 Management --- Systems (H.2.4): {\bf Query
                 processing}",
}

@InProceedings{Ross:1992:RRN,
  author =       "Kenneth A. Ross",
  title =        "Relations with relation names as arguments: algebra
                 and calculus",
  crossref =     "ACM:1992:PPE",
  pages =        "346--353",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/137097/p346-ross/p346-ross.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/137097/p346-ross/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/137097/p346-ross/",
  abstract =     "We consider a version of the relational model in which
                 relation names may appear as arguments of other
                 relations. Allowing relation names as arguments
                 provides enhanced modelling capabilities, allowing some
                 object-oriented features to be expressed within the
                 relational model. We extend relational algebra with
                 operators for accessing relations, and also define a
                 relational calculus based on the logic HiLog. We prove
                 two equivalence results between extensions of
                 relational algebra provide higher expressive power than
                 relational algebra on any given database. Finally, we
                 argue that the extensions proposed here are relatively
                 easy to provide in practice, and should be expressible
                 within modern query languages.",
  acknowledgement = ack-nhfb,
  generalterms = "Languages",
  keywords =     "languages",
  subject =      "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Data models. {\bf H.2.3} Information
                 Systems, DATABASE MANAGEMENT, Languages, Query
                 languages. {\bf H.2.3} Information Systems, DATABASE
                 MANAGEMENT, Languages, Data manipulation languages
                 (DML). {\bf F.4.1} Theory of Computation, MATHEMATICAL
                 LOGIC AND FORMAL LANGUAGES, Mathematical Logic.",
}

@InProceedings{Lomet:1992:AMC,
  author =       "David Lomet and Betty Salzberg",
  title =        "Access method concurrency with recovery",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "351--360",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p351-lomet/p351-lomet.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p351-lomet/",
  abstract =     "Providing high concurrency in B + -trees has been
                 studied extensively. But few efforts have been
                 documented for combining concurrency methods with a
                 recovery scheme that preserves well-formed trees across
                 system crashes. We describe an approach for this that
                 works for a class of index trees that is a
                 generalization of the B link -tree. A major feature of
                 our method is that it works with a range of different
                 recovery methods. It achieves this by decomposing
                 structure changes in an index tree into a sequence of
                 atomic actions, each one leaving the tree well-formed
                 and each working on a separate level of the tree. All
                 atomic actions on levels of the tree above the leaf
                 level are independent of database transactions, and so
                 are of short duration.",
  acknowledgement = ack-nhfb,
  generalterms = "Reliability; Theory",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Concurrency}; Information Systems
                 --- Database Management --- Physical Design (H.2.2):
                 {\bf Access methods}; Data --- Data Structures (E.1):
                 {\bf Trees}",
}

@InProceedings{Gupta:1992:MST,
  author =       "Ashish Gupta and Inderpal Singh Mumick",
  title =        "Magic-sets transformation in nonrecursive systems",
  crossref =     "ACM:1992:PPE",
  pages =        "354--367",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/137097/p354-gupta/p354-gupta.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/137097/p354-gupta/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/137097/p354-gupta/",
  abstract =     "A nonrecursive system is any database system whose
                 query language does not support recursive queries.
                 Thus, many existing commerical SQL database systems are
                 nonrecursive systems. Query optimization is an
                 important issue for nonrecursive queries, and the
                 magic-sets transformation has been shown to improve the
                 performance of nonrecursive queries by many orders of
                 magnitude [MFPR90]. It is thus important to use the
                 magic-sets transformation in nonrecursive systems.
                 \par

                 However, there is a problem. The magic-sets
                 optimization can transform a nonrecursive query into a
                 recursive query. Since a recursive query cannot be
                 executed by a nonrecursive system, such a
                 transformation is fatal. The magic-sets transformation
                 cannot therefore be used in nonrecursive systems.
                 \par

                 In this paper we present algorithms that achieve the
                 optimization of the magic-sets transformation while
                 guaranteeing that the transformed program will be
                 nonrecursive whenever the original program is
                 nonrecursive. The algorithms can be extended to the
                 supplementary magic-sets transformation. We also define
                 a new optimization technique for recursive and
                 nonrecursive queries, {\em covered subgoal
                 elimination}, that can eliminate subgoals from a rule,
                 and can sometimes convert a recursive query into a
                 nonrecursive one. \par

                 The algorithms presented in this paper are of practical
                 relevance since they make it possible to incorporate
                 the magic-sets transformation into existing commercial
                 database systems.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Languages; Theory",
  keywords =     "algorithms; languages; theory",
  subject =      "Information Systems --- Database Management ---
                 Languages (H.2.3): {\bf SQL}; Information Systems ---
                 Database Management --- Languages (H.2.3): {\bf
                 Datalog}; Theory of Computation --- Logics and Meanings
                 of Programs --- Studies of Program Constructs (F.3.3)",
}

@InProceedings{Mohan:1992:ACI,
  author =       "C. Mohan and Inderpal Narang",
  title =        "Algorithms for creating indexes for very large tables
                 without quiescing updates",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "361--370",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p361-mohan/p361-mohan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p361-mohan/",
  abstract =     "As relational DBMSs become more and more popular and
                 as organizations grow, the sizes of individual tables
                 are increasing dramatically. Unfortunately, current
                 DBMSs do not allow updates to be performed on a table
                 while an index (e.g., a B + -tree) is being built for
                 that table, thereby decreasing the systems'
                 availability. This paper describes two algorithms in
                 order to relax this restriction. Our emphasis has been
                 to maximize concurrency, minimize overheads and cover
                 all aspects of the problem. Builds of both unique and
                 nonunique indexes are handled correctly. We also
                 describe techniques for making the index-build
                 operations restartable, without loss of all work, in
                 case a system failure were to interrupt the completion
                 of the creation of the index. In this connection, we
                 also present algorithms for making a long sort of
                 operation restartable. These include algorithms for the
                 sort and merge phases of sorting.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Theory",
  subject =      "Information Systems --- Information Storage and
                 Retrieval --- Content Analysis and Indexing (H.3.1):
                 {\bf Indexing methods}; Information Systems ---
                 Database Management --- Systems (H.2.4): {\bf
                 Concurrency}",
}

@InProceedings{Morishita:1992:ACP,
  author =       "Shinichi Morishita",
  title =        "Avoiding {Cartesian} products in programs for multiple
                 joins (extended abstract)",
  crossref =     "ACM:1992:PPE",
  pages =        "368--379",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/137097/p368-morishita/p368-morishita.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/137097/p368-morishita/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/137097/p368-morishita/",
  abstract =     "Avoiding Cartesian products is a common heuristic to
                 reduce the search space of join expressions (orderings)
                 over some set of relations. However, this heuristic
                 cannot guarantee optimal join expressions in its search
                 space because the cheapest Cartesian-product-free (CPF,
                 for short) join expression could be significantly worse
                 than an optimal non-CPF join expression. In a recent
                 PODS, Tay [9] gave some conditions on actual relations
                 that ensure the existence of an optimal CPF join
                 expression; however, the conditions turn out to be
                 applicable only in special cases. In this paper, we do
                 not put any restrictions on actual relations, and we
                 introduce a novel technique that derives {\em
                 programs\/} consisting of joins, semijoins, and
                 projections from CPF join expressions. Our main result
                 is that for every join expression, there exists an
                 equivalent CPF join expression from which we can derive
                 a program whose cost is within a constant factor of the
                 cost of an optimal join expression.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Theory",
  keywords =     "algorithms; theory",
  subject =      "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Data models. {\bf G.2.2} Mathematics of
                 Computing, DISCRETE MATHEMATICS, Graph Theory, Trees.
                 {\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing.",
}

@InProceedings{Mohan:1992:AIE,
  author =       "C. Mohan and Frank Levine",
  title =        "{ARIES\slash IM}: an efficient and high concurrency
                 index management method using write-ahead logging",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "371--380",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p371-mohan/p371-mohan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p371-mohan/",
  abstract =     "This paper provides a comprehensive treatment of index
                 management in transaction systems. We present a method,
                 called ARIESIIM (Algorithm for Recovery and Isolation
                 Exploiting Semantics for Index Management) , for
                 concurrency control and recovery of B + -trees.
                 ARIES/IM guarantees serializability and uses
                 write-ahead logging for recovery. It supports very high
                 concurrency and good performance by (1) treating as the
                 lock of a key the same lock as the one on the
                 corresponding record data in a data page (e.g., at the
                 record level), (2) not acquiring, in the interest of
                 permitting very high concurrency, commit duration locks
                 on index pages even during index structure modification
                 operations (SMOs) like page splits and page deletions,
                 and (3) allowing retrievals, inserts, and deletes to go
                 on concurrently with SMOs. During restart recovery, any
                 necessary {\em redos\/} of index changes are always
                 performed in a page-oriented fashion (i.e., without
                 traversing the index tree) and, during normal
                 processing and restart recovery, whenever possible {\em
                 undos\/} are performed in a page-oriented fashion.
                 ARIES/IM permits different granularities of locking to
                 be supported in a flexible manner. A subset of ARIES/IM
                 has been implemented in the OS/2 Extended Edition
                 Database Manager. Since the locking ideas of ARIES/IM
                 have general applicability, some of them have also been
                 implemented in SQL/DS and the VM Shared File System,
                 even though those systems use the shadow-page technique
                 for recovery.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Theory",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Concurrency}; Information Systems
                 --- Database Management --- Physical Design (H.2.2):
                 {\bf Recovery and restart}",
}

@InProceedings{Jakobsson:1992:TBT,
  author =       "H{\aa}kan Jakobsson",
  title =        "On tree-based techniques for query evaluation",
  crossref =     "ACM:1992:PPE",
  pages =        "380--392",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/137097/p380-jakobsson/p380-jakobsson.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/137097/p380-jakobsson/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/137097/p380-jakobsson/",
  abstract =     "We discuss a technique for query evaluation based on
                 storing intermediary results as trees and study two
                 applications. We first consider the problem of
                 computing the transitive closure of a graph for a
                 specific set of source nodes. Algorithms for this
                 problem can be directly applied to many nonrecursive
                 queries as well. We give a new algorithm and show that
                 it is superior to several previous algorithms. We then
                 consider Warshall's transitive closure algorithm. This
                 algorithm is not {$O(n e)$}, but we show that by using
                 trees instead flat representations of intermediary
                 results, we can derive a new version of the algorithm
                 with an {$O(n e)$} upper bound.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Theory; Verification",
  keywords =     "algorithms; theory; verification",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Mathematics of
                 Computing --- Discrete Mathematics --- Graph Theory
                 (G.2.2): {\bf Trees}; Theory of Computation ---
                 Analysis of Algorithms and Problem Complexity ---
                 Nonnumerical Algorithms and Problems (F.2.2): {\bf
                 Computations on discrete structures}",
}

@InProceedings{Carter:1992:EIM,
  author =       "Fred Carter",
  title =        "Extending {INGRES} with methods and triggers",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "381--381",
  year =         "1992",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p381-carter/p381-carter.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p381-carter/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bigelow:1992:IGC,
  author =       "Richard Bigelow",
  title =        "Implementation of general constraints in {SIM}",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "382--382",
  year =         "1992",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p382-bigelow/p382-bigelow.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p382-bigelow/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cluet:1992:GFO,
  author =       "Sophie Cluet and Claude Delobel",
  title =        "A general framework for the optimization of
                 object-oriented queries",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "383--392",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p383-cluet/p383-cluet.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p383-cluet/",
  abstract =     "The goal of this work is to integrate in a general
                 framework the different query optimization techniques
                 that have been proposed in the object-oriented context.
                 As a first step, we focus essentially on the logical
                 aspect of query optimization. In this paper, we propose
                 a formalism (i) that unifies different rewriting
                 formalisms, (ii) that allows easy and exhaustive
                 factorization of duplicated subqueries, and (iii) that
                 supports heuristics in order to reduce the optimization
                 rewriting phase. \par

                 ",
  acknowledgement = ack-nhfb,
  generalterms = "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}; Theory of Computation ---
                 Mathematical Logic and Formal Languages --- Grammars
                 and Other Rewriting Systems (F.4.2)",
}

@InProceedings{Kifer:1992:QOO,
  author =       "Michael Kifer and Won Kim and Yehoshua Sagiv",
  title =        "Querying object-oriented databases",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "393--402",
  year =         "1992",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p393-kifer/p393-kifer.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p393-kifer/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Orenstein:1992:QPO,
  author =       "Jack Orenstein and Sam Haradhvala and Benson Margulies
                 and Don Sakahara",
  title =        "Query processing in the {ObjectStore} database
                 system",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "403--412",
  year =         "1992",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p403-orenstein/p403-orenstein.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p403-orenstein/",
  abstract =     "ObjectStore is an object-oriented database system
                 supporting persistence orthogonal to type, transaction
                 management, and associative queries. Collections are
                 provided as objects. The data model is non-1NF, as
                 objects may have embedded collections. Queries are
                 integrated with the host language in the form of query
                 operators whose operands are a collection and a
                 predicate. The predicate may itself contain a (nested)
                 query operating on an embedded collection. Indexes on
                 paths may be added and removed dynamically.
                 Collections, being treated as objects, may be referred
                 to indirectly, e.g., through a by-reference argument.
                 For this reason and others, multiple execution
                 strategies are generated, and a final selection is made
                 just prior to query execution. Nested queries can
                 result in interleaved execution and strategy
                 selection.",
  acknowledgement = ack-nhfb,
  generalterms = "Languages; Theory",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Information
                 Systems --- Database Management --- Logical Design
                 (H.2.1): {\bf Schema and subschema}",
}

@InProceedings{Melmon:1992:SOS,
  author =       "Paul Melmon",
  title =        "The {Sybase Open Server}",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "413--413",
  year =         "1992",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p413-melmon/p413-melmon.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p413-melmon/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Newmann:1992:MVI,
  author =       "Scott Newmann",
  title =        "Multi-vendor interoperability through {SQL} access",
  crossref =     "Stonebraker:1992:PAS",
  pages =        "414--414",
  year =         "1992",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/130283/p414-newmann/p414-newmann.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/130283/p414-newmann/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Maier:1993:CO,
  author =       "David Maier and Bennet Vance",
  title =        "A Call to Order",
  crossref =     "ACM:1993:PPT",
  pages =        "1--16",
  year =         "1993",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/153850/p1-maier/p1-maier.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/153850/p1-maier/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/153850/p1-maier/",
  abstract =     "Scientific applications are infrequent users of
                 commercial database management systems. We feel that a
                 key reason is they do not offer good support for
                 ordered data structures, such as multidimensional
                 arrays, that are needed for natural representation of
                 many scientific data types. In this papers, we lay out
                 issues in database support of ordered structures,
                 consider possible approaches along with their
                 advantages and shortcomings, and direct the reader to
                 the wide variety of prior work outside the data
                 management field that might be successfully applied in
                 this endeavor.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Theory",
  keywords =     "ACM; algorithms; artificial; database systems; design;
                 intelligence; SIGACT; SIGART; SIGMOD; theory",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems. {\bf H.2.3} Information Systems, DATABASE
                 MANAGEMENT, Languages, Data manipulation languages
                 (DML). {\bf E.1} Data, DATA STRUCTURES, Arrays. {\bf
                 J.2} Computer Applications, PHYSICAL SCIENCES AND
                 ENGINEERING. {\bf H.2.1} Information Systems, DATABASE
                 MANAGEMENT, Logical Design, Data models.",
}

@InProceedings{Stonebraker:1993:SSB,
  author =       "Michael Stonebraker and Jim Frew and Kenn Gardels and
                 Jeff Meredith",
  title =        "The {SEQUOIA 2000} storage benchmark",
  crossref =     "Buneman:1993:PAS",
  pages =        "2--11",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p2-stonebraker/p2-stonebraker.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p2-stonebraker/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Carey:1993:B,
  author =       "Michael J. Carey and David J. DeWitt and Jeffrey F.
                 Naughton",
  title =        "The $007$ {Benchmark}",
  crossref =     "Buneman:1993:PAS",
  pages =        "12--21",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p12-carey/p12-carey.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p12-carey/",
  acknowledgement = ack-nhfb,
}

@InProceedings{VandenBussche:1993:RPR,
  author =       "Jan {Van den Bussche} and Dirk {Van Gucht} and
                 Gottfried Vossen",
  title =        "Reflective Programming in the Relational Algebra",
  crossref =     "ACM:1993:PPT",
  pages =        "17--25",
  year =         "1993",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/153850/p17-van_den_bussche/p17-van_den_bussche.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/153850/p17-van_den_bussche/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/153850/p17-van_den_bussche/",
  abstract =     "In reflective programming languages it is possible for
                 a program to generate code that is integrated into the
                 program's own execution. We introduce a reflective
                 version of the relational algebra. Reflection is
                 achieved by storing and manipulating relational algebra
                 programs as relations in the database. We then study
                 the expressibility and complexity of the reflective
                 algebra thus obtained. It turns out that there is a
                 close correspondence between reflection and bounded
                 looping. We also discuss the applicability of the
                 reflective algebra.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Languages; Theory",
  keywords =     "ACM; algorithms; artificial; database systems;
                 intelligence; languages; SIGACT; SIGART; SIGMOD;
                 theory",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Query languages. {\bf H.2.3} Information
                 Systems, DATABASE MANAGEMENT, Languages, Data
                 manipulation languages (DML). {\bf H.3.1} Information
                 Systems, INFORMATION STORAGE AND RETRIEVAL, Content
                 Analysis and Indexing, Dictionaries. {\bf H.2.4}
                 Information Systems, DATABASE MANAGEMENT, Systems.",
}

@InProceedings{Leutenegger:1993:MST,
  author =       "Scott T. Leutenegger and Daniel Dias",
  title =        "A modeling study of the {TPC-C} benchmark",
  crossref =     "Buneman:1993:PAS",
  pages =        "22--31",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p22-leutenegger/p22-leutenegger.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p22-leutenegger/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Wong:1993:NFC,
  author =       "Limsoon Wong",
  title =        "Normal Forms and Conservative Properties for Query
                 Languages over Collection Types",
  crossref =     "ACM:1993:PPT",
  pages =        "26--36",
  year =         "1993",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/153850/p26-wong/p26-wong.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/153850/p26-wong/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/153850/p26-wong/",
  abstract =     "Strong normalization results are obtained for a
                 general language for collection types. An induced
                 normal form for sets and bags is then used to show that
                 the class of functions whose input has height (that is,
                 the maximal depth of nestings of sets/bags/lists in the
                 complex object) at most $i$ and output has height at
                 most $o$ definable in a nested relational query
                 language without powerset operator is {\em
                 independent\/} of the height of intermediate
                 expressions used. Our proof holds regardless of whether
                 the language is used for querying sets, bags, or lists,
                 even in the presence of variant types. Moreover, the
                 normal forms are useful in a general approach to query
                 optimization. Paredaens and {Van Gucht} proved a
                 similar result for the special case when $i$ = $o$ = 1.
                 Their result is complemented by Hull and Su who
                 demonstrated the failure of independence when powerset
                 operator is present and $i$ = $o$ = 1. The theorem of
                 Hull and Su was generalized to all $i$ and $o$ by
                 Grumbach and Vianu. Our result generalizes Paredaens
                 and {Van Gucht}'s to all $i$ and {\em o}, providing a
                 counterpart to the theorem of Grumbach and Vianu.",
  acknowledgement = ack-nhfb,
  generalterms = "Languages; Theory",
  keywords =     "ACM; artificial; database systems; intelligence;
                 languages; SIGACT; SIGART; SIGMOD; theory",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Query languages. {\bf H.2.1} Information
                 Systems, DATABASE MANAGEMENT, Logical Design, Normal
                 forms.",
}

@InProceedings{Abiteboul:1993:MR,
  author =       "Serge Abiteboul and Georg Lausen and Heinz Uphoff and
                 Emmanuel Waller",
  title =        "Methods and rules",
  crossref =     "Buneman:1993:PAS",
  pages =        "32--41",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p32-abiteboul/p32-abiteboul.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p32-abiteboul/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Libkin:1993:SRQ,
  author =       "Leonid Libkin and Limsoon Wong",
  title =        "Semantic Representations and Query Languages for
                 {OR}-Sets",
  crossref =     "ACM:1993:PPT",
  pages =        "37--48",
  year =         "1993",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/153850/p37-libkin/p37-libkin.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/153850/p37-libkin/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/153850/p37-libkin/",
  abstract =     "Or-sets were introduced by Imielinski, Naqvi and
                 Vadaparty for dealing with limited forms of disjunctive
                 information in database queries. Independently, Rounds
                 used a similar notion for representing disjunctive and
                 conjunctive information in the context of situation
                 theory. In this paper we formulate a query language
                 with adequate expressive power for or-sets. Using the
                 notion of normalization of or-sets, queries at the
                 ``structural'' and ``conceptual'' levels are
                 distinguished. Losslessness of normalization is
                 established for a large class of queries. We have
                 obtained upper bounds for the cost of normalization. An
                 approach related to that of Rounds is used to provide
                 semantics for or-sets.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Languages; Theory",
  keywords =     "ACM; algorithms; artificial; database systems; design;
                 intelligence; languages; SIGACT; SIGART; SIGMOD;
                 theory",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Query languages. {\bf H.2.1} Information
                 Systems, DATABASE MANAGEMENT, Logical Design, Normal
                 forms. {\bf I.4.2} Computing Methodologies, IMAGE
                 PROCESSING AND COMPUTER VISION, Compression (Coding).",
}

@InProceedings{Brant:1993:ISR,
  author =       "David A. Brant and Daniel P. Miranker",
  title =        "Index support for rule activation",
  crossref =     "Buneman:1993:PAS",
  pages =        "42--48",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p42-brant/p42-brant.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p42-brant/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Grumbach:1993:TTA,
  author =       "St{\'e}phane Grumbach and Tova Milo",
  title =        "Towards Tractable Algebras for Bags",
  crossref =     "ACM:1993:PPT",
  pages =        "49--58",
  year =         "1993",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/153850/p49-grumbach/p49-grumbach.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/153850/p49-grumbach/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/153850/p49-grumbach/",
  abstract =     "Bags, i.e. sets with duplicates, are often used to
                 implement relations in database systems. In this paper
                 we study the expressive power of algebras for
                 manipulating bags. The algebra we present is a simple
                 extension of the nested relation algebra. Our aim is to
                 investigate how the use of bags in the language extends
                 its expressive power, and increases its complexity. We
                 consider two main issues, namely (i) the relationship
                 between the depth of bag nesting and the expressive
                 power, and (ii) the relationship between the algebraic
                 operations, and their complexity and expressive power.
                 We show that the bag algebra is more expressive than
                 the nested relation algebra (at all levels of nesting),
                 and that the difference may be subtle. We establish a
                 hierarchy based on the structure of algebra
                 expressions. This hierarchy is shown to be highly
                 related to the properties of the powerset operator.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Languages; Theory; Verification",
  keywords =     "ACM; artificial; database systems; design;
                 intelligence; languages; SIGACT; SIGART; SIGMOD;
                 theory; verification",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Data manipulation languages (DML). {\bf
                 H.2.1} Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Schema and subschema. {\bf H.2.4}
                 Information Systems, DATABASE MANAGEMENT, Systems. {\bf
                 H.2.1} Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Data models.",
}

@InProceedings{Gupta:1993:LVG,
  author =       "Ashish Gupta and Jennifer Widom",
  title =        "Local verification of global integrity constraints in
                 distributed databases",
  crossref =     "Buneman:1993:PAS",
  pages =        "49--58",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p49-gupta/p49-gupta.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p49-gupta/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Pang:1993:PPH,
  author =       "Hwee Hwa Pang and Michael J. Carey and Miron Livny",
  title =        "Partially preemptible hash joins",
  crossref =     "Buneman:1993:PAS",
  pages =        "59--68",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p59-pang/p59-pang.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p59-pang/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chaudhuri:1993:ORC,
  author =       "Surajit Chaudhuri and M. Y. Vardi",
  title =        "Optimization of {\em real\/} conjunctive queries",
  crossref =     "ACM:1993:PPT",
  pages =        "59--70",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/153850/p59-chaudhuri/p59-chaudhuri.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/153850/p59-chaudhuri/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/153850/p59-chaudhuri/",
  acknowledgement = ack-nhfb,
  keywords =     "ACM; artificial; database systems; intelligence;
                 performance; SIGACT; SIGART; SIGMOD; theory",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, SQL. {\bf H.2.4} Information Systems,
                 DATABASE MANAGEMENT, Systems. {\bf H.2.4} Information
                 Systems, DATABASE MANAGEMENT, Systems, Query
                 processing.",
}

@InProceedings{Lo:1993:OPA,
  author =       "Ming-Ling Lo and Ming-Syan Syan Chen and C. V.
                 Ravishankar and Philip S. Yu",
  title =        "On optimal processor allocation to support pipelined
                 hash joins",
  crossref =     "Buneman:1993:PAS",
  pages =        "69--78",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p69-lo/p69-lo.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p69-lo/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Revesz:1993:STC,
  author =       "Peter Z. Revesz",
  title =        "On the Semantics of Theory Change: Arbitration Between
                 Old and New Information",
  crossref =     "ACM:1993:PPT",
  pages =        "71--82",
  year =         "1993",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/153850/p71-revesz/p71-revesz.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/153850/p71-revesz/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/153850/p71-revesz/",
  abstract =     "Katsuno and Mendelzon divide theory change, the
                 problem of adding new information to a logical theory,
                 into two types: revision and update. We propose a third
                 type of theory change: arbitration. The key idea is the
                 following: the new information is considered neither
                 better nor worse than the old information represented
                 by the logical theory. The new information is simply
                 one voice against a set of others already incorporated
                 into the logical theory. From this follows that
                 arbitration should be commutative. First we define
                 arbitration by a set of postulates and then describe a
                 model-theoretic characterization of arbitration for the
                 case of propositional logical theories. We also study
                 weighted arbitration where different models of a theory
                 can have different weights.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Languages; Theory; Verification",
  keywords =     "ACM; algorithms; artificial; database systems;
                 intelligence; languages; SIGACT; SIGART; SIGMOD;
                 theory; verification",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems. {\bf F.4.1} Theory of Computation,
                 MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical
                 Logic. {\bf H.2.1} Information Systems, DATABASE
                 MANAGEMENT, Logical Design, Data models. {\bf H.2.3}
                 Information Systems, DATABASE MANAGEMENT, Languages,
                 SQL. {\bf H.2.3} Information Systems, DATABASE
                 MANAGEMENT, Languages, Datalog.",
}

@InProceedings{Sun:1993:IAS,
  author =       "Wei Sun and Yibei Ling and Naphtali Rishe and Yi
                 Deng",
  title =        "An instant and accurate size estimation method for
                 joins and selections in a retrieval-intensive
                 environment",
  crossref =     "Buneman:1993:PAS",
  pages =        "79--88",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p79-sun/p79-sun.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p79-sun/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Raz:1993:ECO,
  author =       "Yoav Raz",
  title =        "Extended Commitment Ordering, or Guaranteeing Global
                 Serializability by Applying Commitment Order
                 Selectively to Global Transactions",
  crossref =     "ACM:1993:PPT",
  pages =        "83--96",
  year =         "1993",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/153850/p83-raz/p83-raz.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/153850/p83-raz/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/153850/p83-raz/",
  abstract =     "The {\em Extended Commitment Ordering\/} (ECO)
                 property of transaction histories (schedules)
                 generalizes the {\em Commitment Ordering\/} (CO)
                 property defined in [Raz 90]. In a multi resource
                 manager (RM) environment ECO guarantees {\em global
                 serializability\/} when supported locally by each RM
                 that participates in {\em global transactions\/} (i.e.,
                 transactions that span more than a single RM) and
                 provides local serializability (by any mechanism). ECO
                 assumes that a RM has the knowledge to distinguish {\em
                 local transactions\/} (i.e., transactions confined to
                 that RM) from global transactions. ECO imposes an order
                 condition, similar to the CO condition, on the commit
                 events of global transactions only, and thus, it is
                 less constraining than CO. \par

                 Like CO, ECO provides a fully distributed solution to
                 the long standing problem of guaranteeing global
                 serializability across RMs with different concurrency
                 control mechanisms. Also, like CO, no communication
                 beyond {\em atomic commitment\/} (AC) protocol messages
                 is required to enforce ECO. \par

                 When RMs are provided with the information about
                 transactions being local, and are coordinated solely
                 via AC protocols (have the {\em extended knowledge
                 autonomy\/} property), ECO, applied locally together
                 with local serializability in each RM involved with
                 global transactions, is a necessary condition for
                 guaranteeing global serializability. \par

                 ECO reduces to CO when all the transactions are assumed
                 to be global (e.g., if no knowledge about the
                 transactions being local is available).",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Theory",
  keywords =     "ACM; algorithms; artificial; database systems;
                 intelligence; SIGACT; SIGART; SIGMOD; theory",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Concurrency. {\bf H.2.4} Information Systems,
                 DATABASE MANAGEMENT, Systems, Transaction processing.",
}

@InProceedings{Meseguer:1993:LSO,
  author =       "Jos{\'e} Meseguer and Xiaolei Qian",
  title =        "A logical semantics for object-oriented databases",
  crossref =     "Buneman:1993:PAS",
  pages =        "89--98",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p89-meseguer/p89-meseguer.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p89-meseguer/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Rastogi:1993:CNS,
  author =       "Rajeev Rastogi and Sharad Mehrotra and Yuri Breitbart
                 and Henry F. Korth and Avi Silberschatz",
  title =        "On Correctness of Non-Serializable Executions",
  crossref =     "ACM:1993:PPT",
  pages =        "97--108",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/153850/p97-rastogi/p97-rastogi.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/153850/p97-rastogi/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/153850/p97-rastogi/",
  acknowledgement = ack-nhfb,
  keywords =     "ACM; algorithms; artificial; database systems;
                 intelligence; SIGACT; SIGART; SIGMOD; theory;
                 verification",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Transaction processing. {\bf H.2.4}
                 Information Systems, DATABASE MANAGEMENT, Systems,
                 Concurrency. {\bf H.2.8} Information Systems, DATABASE
                 MANAGEMENT, Database Applications.",
}

@InProceedings{Anwar:1993:NPR,
  author =       "E. Anwar and L. Maugis and S. Chakravarthy",
  title =        "A new perspective on rule support for object-oriented
                 databases",
  crossref =     "Buneman:1993:PAS",
  pages =        "99--108",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p99-anwar/p99-anwar.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p99-anwar/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ananthanarayanan:1993:UCE,
  author =       "R. Ananthanarayanan and V. Gottemukkala and W. Kaefer
                 and T. J. Lehman and H. Pirahesh",
  title =        "Using the co-existence approach to achieve combined
                 functionality of object-oriented and relational
                 systems",
  crossref =     "Buneman:1993:PAS",
  pages =        "109--118",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p109-ananthanarayanan/p109-ananthanarayanan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p109-ananthanarayanan/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Levy:1993:EQR,
  author =       "Alon Levy and Inderpal Singh Mumick and Yehoshua Sagiv
                 and Oded Shmueli",
  title =        "Equivalence, query-reachability and satisfiability in
                 {Datalog} extensions",
  crossref =     "ACM:1993:PPT",
  pages =        "109--122",
  year =         "1993",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/153850/p109-levy/p109-levy.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/153850/p109-levy/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/153850/p109-levy/",
  abstract =     "We consider the problems of equivalence,
                 satisfiability and query-reachability for datalog
                 programs with negation and dense-order constraints.
                 These problems are important for optimizing datalog
                 programs. We show that both query-reachability and
                 satisfiability are decidable for programs with
                 stratified negation provided that negation is applied
                 only to EDB predicates or that all EDB predicates are
                 unary. In the latter case, we show that equivalence is
                 also decidable. The algorithms we present are also used
                 to push constraints from a given query to the EDB
                 predicates. Finally, we show that satisfiability is
                 undecidable for datalog programs with unary IDB
                 predicates, stratified negation and the interpreted
                 predicate $\not=$",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Languages; Performance; Theory",
  keywords =     "ACM; algorithms; artificial; database systems;
                 intelligence; languages; performance; SIGACT; SIGART;
                 SIGMOD; theory",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Datalog. {\bf H.2.4} Information Systems,
                 DATABASE MANAGEMENT, Systems, Query processing. {\bf
                 D.3.3} Software, PROGRAMMING LANGUAGES, Language
                 Constructs and Features, Procedures, functions, and
                 subroutines. {\bf G.2.2} Mathematics of Computing,
                 DISCRETE MATHEMATICS, Graph Theory, Trees. {\bf F.2.2}
                 Theory of Computation, ANALYSIS OF ALGORITHMS AND
                 PROBLEM COMPLEXITY, Nonnumerical Algorithms and
                 Problems, Computations on discrete structures.",
}

@InProceedings{Shatdal:1993:USV,
  author =       "Ambuj Shatdal and Jeffrey F. Naughton",
  title =        "Using shared virtual memory for parallel join
                 processing",
  crossref =     "Buneman:1993:PAS",
  pages =        "119--128",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p119-shatdal/p119-shatdal.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p119-shatdal/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Morishita:1993:AFT,
  author =       "Shinichi Morishita",
  title =        "An Alternating Fixpoint Tailored to Magic Programs",
  crossref =     "ACM:1993:PPT",
  pages =        "123--134",
  year =         "1993",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/153850/p123-morishita/p123-morishita.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/153850/p123-morishita/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/153850/p123-morishita/",
  abstract =     "We study applying the magic-sets transformation
                 technique to Datalog programs with negation that may
                 not have 2-valued well-founded models. In this general
                 setting we encounter the problem that the well-founded
                 model of the original program does not always agree
                 with the well-founded model of the magic program
                 derived by commonly used left-to-right sips on the
                 query. In order to fix this disagreement we present a
                 novel method that is obtained by slightly and naturally
                 tailoring Van Gelder's alternating fixpoint technique
                 [16] to a magic program.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Languages; Performance",
  keywords =     "ACM; algorithms; artificial; database systems;
                 intelligence; languages; performance; SIGACT; SIGART;
                 SIGMOD",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Datalog. {\bf H.2.4} Information Systems,
                 DATABASE MANAGEMENT, Systems, Query processing. {\bf
                 F.3.2} Theory of Computation, LOGICS AND MEANINGS OF
                 PROGRAMS, Semantics of Programming Languages. {\bf
                 F.3.3} Theory of Computation, LOGICS AND MEANINGS OF
                 PROGRAMS, Studies of Program Constructs.",
}

@InProceedings{Tomasic:1993:CDS,
  author =       "Anthony Tomasic and Hector Garcia-Molina",
  title =        "Caching and database scaling in distributed
                 shared-nothing information retrieval systems",
  crossref =     "Buneman:1993:PAS",
  pages =        "129--138",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p129-tomasic/p129-tomasic.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p129-tomasic/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chaudhuri:1993:FNE,
  author =       "Surajit Chaudhuri",
  title =        "Finding nonrecursive envelopes for {Datalog}
                 predicates",
  crossref =     "ACM:1993:PPT",
  pages =        "135--146",
  year =         "1993",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/153850/p135-chaudhuri/p135-chaudhuri.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/153850/p135-chaudhuri/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/153850/p135-chaudhuri/",
  abstract =     "In this paper, we study the ability of
                 data-independent conjunctive expressions ({\em
                 envelopes\/}) to approximate fixpoint of Datalog
                 predicates. We show that no effective procedure exists
                 for finding envelopes that best approximate the
                 fix-point ({\em tight envelopes\/}). Moreover, the
                 problem of determining existence of tight envelopes is
                 undecidable. The relationship between tight envelopes
                 and the boundedness property is explored. Although the
                 property of having tight envelopes seems weaker than
                 boundedness, we note that a predicate can have a tight
                 (lower) envelope iff it is bounded. On the other hand,
                 there exist Datalog predicates that are not bounded but
                 have tight (upper) envelopes. We relax our requirement
                 for tight envelopes and settle for {\em connected
                 envelopes}. An algorithm to determine connected
                 envelopes for Datalog predicates is presented. We
                 mention several applications of envelopes.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Languages; Theory; Verification",
  keywords =     "ACM; algorithms; artificial; database systems;
                 intelligence; languages; SIGACT; SIGART; SIGMOD;
                 theory; verification",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Datalog. {\bf H.3.3} Information Systems,
                 INFORMATION STORAGE AND RETRIEVAL, Information Search
                 and Retrieval, Query formulation. {\bf G.2.2}
                 Mathematics of Computing, DISCRETE MATHEMATICS, Graph
                 Theory. {\bf F.2.2} Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems, Computations on discrete
                 structures.",
}

@InProceedings{Mohan:1993:EFM,
  author =       "C. Mohan and Inderpal Narang",
  title =        "An efficient and flexible method for archiving a data
                 base",
  crossref =     "Buneman:1993:PAS",
  pages =        "139--146",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p139-mohan/p139-mohan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p139-mohan/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Derr:1993:DIG,
  author =       "Marcia A. Derr and Shinichi Morishita and Geoffrey
                 Phipps",
  title =        "Design and implementation of the glue-nail database
                 system",
  crossref =     "Buneman:1993:PAS",
  pages =        "147--156",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p147-derr/p147-derr.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p147-derr/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Schaerf:1993:NMN,
  author =       "Marco Schaerf",
  title =        "Negation and Minimality in Non-{Horn} Databases",
  crossref =     "ACM:1993:PPT",
  pages =        "147--157",
  year =         "1993",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/153850/p147-schaerf/p147-schaerf.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/153850/p147-schaerf/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/153850/p147-schaerf/",
  abstract =     "Two main approaches have been followed in the
                 literature to give a semantics to non-Horn databases.
                 The first one is based on considering the set of rules
                 composing the programs as inference rules and
                 interpreting the negation in the body as failure to
                 prove. The other approach is based on the so-called
                 closed-world assumption and its objective is to define
                 a stronger notion of consequence from a theory than the
                 classical one, where, very roughly, negative
                 information can be inferred whenever its positive
                 counterpart cannot be deduced from the theory. In this
                 work we generalize the semantics for negation in logic
                 programs, putting together the constructive nature of
                 the rule-based deductive databases with the
                 syntax-independence of the closed-world reasoning
                 rules. These generalized semantics are shown to be a
                 well-motivated and well-founded alternative to
                 closed-world assumptions since they enjoy nice semantic
                 and computational properties.",
  acknowledgement = ack-nhfb,
  generalterms = "Languages; Theory",
  keywords =     "ACM; artificial; database systems; intelligence;
                 languages; SIGACT; SIGART; SIGMOD; theory",
  subject =      "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC
                 AND FORMAL LANGUAGES, Mathematical Logic, Logic and
                 constraint programming. {\bf F.1.3} Theory of
                 Computation, COMPUTATION BY ABSTRACT DEVICES,
                 Complexity Measures and Classes. {\bf H.2.3}
                 Information Systems, DATABASE MANAGEMENT, Languages,
                 Query languages. {\bf F.3.2} Theory of Computation,
                 LOGICS AND MEANINGS OF PROGRAMS, Semantics of
                 Programming Languages.",
}

@InProceedings{Gupta:1993:MVI,
  author =       "Ashish Gupta and Inderpal Singh Mumick and V. S.
                 Subrahmanian",
  title =        "Maintaining views incrementally",
  crossref =     "Buneman:1993:PAS",
  pages =        "157--166",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p157-gupta/p157-gupta.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p157-gupta/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Eiter:1993:CAV,
  author =       "Thomas Eiter and Georg Gottlob",
  title =        "Complexity Aspects of Various Semantics for
                 Disjunctive Databases",
  crossref =     "ACM:1993:PPT",
  pages =        "158--167",
  year =         "1993",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/153850/p158-eiter/p158-eiter.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/153850/p158-eiter/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/153850/p158-eiter/",
  abstract =     "This paper addresses complexity issues for important
                 problems arising with disjunctive databases. In
                 particular, the complexity of inference of a literal
                 and a formula from a propositional disjunctive database
                 under a variety of well-known disjunctive database
                 semantics is investigated, as well deciding whether a
                 disjunctive database has a model under a particular
                 semantics. The problems are located in appropriate
                 slots of the polynomial hierarchy.",
  acknowledgement = ack-nhfb,
  generalterms = "Languages; Theory; Verification",
  keywords =     "ACM; artificial; database systems; intelligence;
                 languages; SIGACT; SIGART; SIGMOD; theory;
                 verification",
  subject =      "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC
                 AND FORMAL LANGUAGES, Mathematical Logic, Logic and
                 constraint programming. {\bf F.3.2} Theory of
                 Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics
                 of Programming Languages. {\bf H.2.4} Information
                 Systems, DATABASE MANAGEMENT, Systems. {\bf H.2.1}
                 Information Systems, DATABASE MANAGEMENT, Logical
                 Design, Data models.",
}

@InProceedings{Ramakrishnan:1993:ICD,
  author =       "Raghu Ramakrishnan and Divesh Srivastava and S.
                 Sudarshan and Praveen Seshadri",
  title =        "Implementation of the {CORAL} deductive database
                 system",
  crossref =     "Buneman:1993:PAS",
  pages =        "167--176",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p167-ramakrishnan/p167-ramakrishnan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p167-ramakrishnan/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chen:1993:QEU,
  author =       "Weidong Chen and David S. Warren",
  title =        "Query Evaluation Under the Well-Founded Semantics",
  crossref =     "ACM:1993:PPT",
  pages =        "168--179",
  year =         "1993",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/153850/p168-chen/p168-chen.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/153850/p168-chen/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/153850/p168-chen/",
  abstract =     "SLD resolution with negation as finite failure (or
                 SLDNF) reflects the procedural interpretation of
                 Horn-clause predicate logic as a programming language
                 and forms the computational basis for prolog systems.
                 Despite its advantages in memory management, SLDNF is
                 often not appropriate for query evaluation for three
                 reasons; (a) it may not terminate due to infinite
                 positive recursion; (b) it may not terminate due to
                 infinite recursion through negation; and (c) it may
                 repeatedly evaluate the same clause body literal,
                 leading to unacceptable performance. \par

                 We address all three problems for goal-oriented query
                 evaluation of arbitrary programs by presenting an
                 extension of SLDNF, called {\em SLG resolution}, with
                 the following distinctive features: \par

                 (i) SLG resolution is a partial deduction procedure,
                 consisting of several transformations. Each query is
                 transformed step by step into a set of answer clauses;
                 \par

                 (ii) SLG resolution is sound and ideally complete for
                 all non-floundering queries with respect to all
                 three-valued stable models (including the well founded
                 partial model); \par

                 (iii) SLG resolution allows an arbitrary computation
                 rule and an arbitrary control strategy for selecting
                 transformations to apply; \par

                 (iv) SLG resolution avoids both positive and negative
                 loops and always terminates for programs with the
                 bounded-term-size property; \par

                 (v) SLG resolution has a polynomial time data
                 complexity for well founded negation. \par

                 Restricted forms of SLG resolution are identified for
                 definite, locally stratified, and modularly stratified
                 programs, thereby shedding light on the role each
                 transformation plays. To provide answers to a query
                 under different three-valued stable models, SLG
                 resolution can be enhanced by further processing of the
                 derived set of answer clauses. \par

                 SLG resolution makes many more clausal specifications
                 into effective programs. With simple (user or computer
                 generated) annotations, SLDNF resolution and SLG
                 resolution can be fully integrated. Thus a system
                 including SLG resolution can be fully integrated. Thus
                 a system including SLG resolution is naturally upward
                 compatible with Prolog. For all these reasons we
                 believe that SLG resolution will provide the
                 computational basis for the next generation of logic
                 programming systems.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Languages",
  keywords =     "ACM; algorithms; artificial; database systems;
                 intelligence; languages; SIGACT; SIGART; SIGMOD",
  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 F.4.1} Theory of Computation, MATHEMATICAL
                 LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic
                 and constraint programming. {\bf F.3.2} Theory of
                 Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics
                 of Programming Languages. {\bf F.3.3} Theory of
                 Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies
                 of Program Constructs.",
}

@InProceedings{Kolodner:1993:AIG,
  author =       "Elliot K. Kolodner and William E. Weihl",
  title =        "Atomic incremental garbage collection and recovery for
                 a large stable heap",
  crossref =     "Buneman:1993:PAS",
  pages =        "177--186",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p177-kolodner/p177-kolodner.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p177-kolodner/",
  acknowledgement = ack-nhfb,
}

@InProceedings{VanGelder:1993:MJS,
  author =       "Allen {Van Gelder}",
  title =        "Multiple join size estimation by virtual domains
                 (extended abstract)",
  crossref =     "ACM:1993:PPT",
  pages =        "180--189",
  year =         "1993",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/citations/proceedings/pods/153850/p180-van_gelder/",
  abstract =     "A model is described to estimate the size of
                 intermediate relations produced by large relational
                 algebra expressions, in particular, those containing
                 several equi-joins. The intended application is within
                 query optimization searches, where fast estimates are
                 needed as many alternative plans are examined. It is
                 shown that previous methods, which use an independence
                 assumption when several attributes are joined, can lead
                 to unrealistically low size estimates. This method
                 attempts to overcome that problem by the introduction
                 of ``virtual domains'', which avoid the independence
                 assumption. The method does not require extensive
                 statistics about the database. After describing an
                 ``exact'' version, an approximation that is simpler and
                 faster is presented.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Theory",
  keywords =     "ACM; algorithms; artificial; database systems;
                 intelligence; SIGACT; SIGART; SIGMOD; theory",
  subject =      "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC
                 AND FORMAL LANGUAGES, Mathematical Logic. {\bf H.2.1}
                 Information Systems, DATABASE MANAGEMENT, Logical
                 Design, Data models. {\bf G.1.6} Mathematics of
                 Computing, NUMERICAL ANALYSIS, Optimization. {\bf
                 H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing.",
}

@InProceedings{Keen:1993:PEE,
  author =       "John S. Keen and William J. Dally",
  title =        "Performance evaluation of ephemeral logging",
  crossref =     "Buneman:1993:PAS",
  pages =        "187--196",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p187-keen/p187-keen.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p187-keen/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Haas:1993:FPE,
  author =       "Peter J. Haas and Jeffrey F. Naughton and S. Seshadri
                 and Arun N. Swami",
  title =        "Fixed-Precision Estimation of Join Selectivity",
  crossref =     "ACM:1993:PPT",
  pages =        "190--201",
  year =         "1993",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/153850/p190-haas/p190-haas.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/153850/p190-haas/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/153850/p190-haas/",
  abstract =     "We compare the performance of sampling-based
                 procedures for estimation of the selectivity of an
                 equijoin. While some of the procedures have been
                 proposed in the database sampling literature, their
                 relative performance has never been analyzed. A main
                 result of this paper is a partial ordering that
                 compares the variability of the estimators for the
                 different procedures after an arbitrary fixed number of
                 sampling steps. Prior to the current work, it was also
                 unknown whether these fixed-step estimation procedures
                 can be extended to asymptotically efficient
                 fixed-precision estimation procedures. Our second main
                 result is a general method for such an extension and a
                 proof that the method is valid for all the estimation
                 procedures under consideration. Finally, we show that,
                 under reasonable assumptions on sampling costs, the
                 partial ordering on the variability of the fixed-step
                 estimation procedures implies a partial ordering on the
                 cost of the corresponding fixed-precision estimation
                 procedures. These results lead to a new algorithm for
                 fixed-precision estimation of the selectivity of an
                 equijoin. The algorithm appears to be the best
                 available when there are no indices on the join key.
                 Our results can be extended to general select-join
                 queries.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Performance; Theory; Verification",
  keywords =     "ACM; algorithms; artificial; database systems;
                 intelligence; performance; SIGACT; SIGART; SIGMOD;
                 theory; verification",
  subject =      "Mathematics of Computing --- Probability and
                 Statistics (G.3); Information Systems --- Database
                 Management --- Systems (H.2.4): {\bf Query processing};
                 Mathematics of Computing --- Numerical Analysis ---
                 Optimization (G.1.6)",
}

@InProceedings{Hong:1993:RTT,
  author =       "D. Hong and T. Johnson and S. Chakravarthy",
  title =        "Real-time transaction scheduling: a cost conscious
                 approach",
  crossref =     "Buneman:1993:PAS",
  pages =        "197--206",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p197-hong/p197-hong.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p197-hong/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chomicki:1993:FCT,
  author =       "Jan Chomicki and Damian Niwi{\'n}ski",
  title =        "On the Feasibility of Checking Temporal Integrity
                 Constraints",
  crossref =     "ACM:1993:PPT",
  pages =        "202--213",
  year =         "1993",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/153850/p202-chomicki/p202-chomicki.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/153850/p202-chomicki/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/153850/p202-chomicki/",
  abstract =     "We analyze the computational feasibility of checking
                 temporal integrity constraints formulated in some
                 sublanguages of first-order temporal logic. Our results
                 illustrate the impact of the quantification on the
                 complexity of this problem. The presence of a single
                 quantifier in the scope of a temporal operator makes
                 the problem undecidable. On the other hand, if no
                 quantifiers are in the scope of a temporal operator and
                 all the quantifiers are universal, temporal integrity
                 checking can be done in exponential time.",
  acknowledgement = ack-nhfb,
  generalterms = "Languages; Security",
  keywords =     "ACM; artificial; database systems; intelligence;
                 languages; security; SIGACT; SIGART; SIGMOD",
  subject =      "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC
                 AND FORMAL LANGUAGES, Mathematical Logic. {\bf H.2.0}
                 Information Systems, DATABASE MANAGEMENT, General. {\bf
                 H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages.",
}

@InProceedings{Agrawal:1993:MAR,
  author =       "Rakesh Agrawal and Tomasz Imieli{\'n}ski and Arun
                 Swami",
  title =        "Mining association rules between sets of items in
                 large databases",
  crossref =     "Buneman:1993:PAS",
  pages =        "207--216",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p207-agrawal/p207-agrawal.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p207-agrawal/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Pagel:1993:TAR,
  author =       "Bernd-Uwe Pagel and Hans--Werner Six and Heinrich
                 Toben and Peter Widmayer",
  title =        "Towards an Analysis of Range Query Performance in
                 Spatial Data Structures",
  crossref =     "ACM:1993:PPT",
  pages =        "214--221",
  year =         "1993",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/153850/p214-pagel/p214-pagel.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/153850/p214-pagel/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/153850/p214-pagel/",
  abstract =     "In this paper, we motivate four different user defined
                 window query classes and derive a probabilistic model
                 for each of them. For each model, we characterize the
                 efficiency of spatial data structures in terms of the
                 expected number of data bucket accesses needed to
                 perform a window query. Our analytical approach
                 exhibits the performance phenomena independent of data
                 structure and implementation details and whether the
                 objects are points or non-point objects.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Experimentation; Performance",
  keywords =     "ACM; algorithms; artificial; database systems;
                 experimentation; intelligence; performance; SIGACT;
                 SIGART; SIGMOD",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing. {\bf H.2.1} Information
                 Systems, DATABASE MANAGEMENT, Logical Design, Data
                 models. {\bf H.2.2} Information Systems, DATABASE
                 MANAGEMENT, Physical Design, Access methods. {\bf
                 F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT
                 DEVICES, Modes of Computation, Probabilistic
                 computation.",
}

@InProceedings{Borgida:1993:LDD,
  author =       "Alex Borgida and Ronald J. Brachman",
  title =        "Loading data into description reasoners",
  crossref =     "Buneman:1993:PAS",
  pages =        "217--226",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p217-borgida/p217-borgida.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p217-borgida/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Nodine:1993:BEG,
  author =       "Mark H. Nodine and Michael T. Goodrich and Jeffrey
                 Scott Vitter",
  title =        "Blocking for External Graph Searching",
  crossref =     "ACM:1993:PPT",
  pages =        "222--232",
  year =         "1993",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/153850/p222-nodine/p222-nodine.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/153850/p222-nodine/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/153850/p222-nodine/",
  abstract =     "In this paper, we consider the problem of using disk
                 blocks efficiently in searching graphs that are too
                 large to fit in internal memory. Our model allows a
                 vertex to be represented any number of times on the
                 disk in order to take advantage of redundancy. We give
                 matching upper and lower bounds for complete {$d$}-ary
                 trees and $d$-dimensional grid graphs, as well as for
                 classes of general graphs that intuitively speaking
                 have a close to uniform number of neighbors around each
                 vertex. We also show that for the special case of grid
                 graphs blocked with isothetic hypercubes, there is a
                 provably better speed-up if even a small amount of
                 redundancy is permitted.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Verification",
  keywords =     "ACM; algorithms; artificial; database systems;
                 intelligence; SIGACT; SIGART; SIGMOD; verification",
  subject =      "{\bf H.2.2} Information Systems, DATABASE MANAGEMENT,
                 Physical Design. {\bf G.2.2} Mathematics of Computing,
                 DISCRETE MATHEMATICS, Graph Theory, Trees. {\bf F.2.2}
                 Theory of Computation, ANALYSIS OF ALGORITHMS AND
                 PROBLEM COMPLEXITY, Nonnumerical Algorithms and
                 Problems, Computations on discrete structures.",
}

@InProceedings{Wang:1993:TMA,
  author =       "X. Sean Wang and Sushil Jajodia and V. S.
                 Subrahmanian",
  title =        "Temporal modules: an approach toward federated
                 temporal databases",
  crossref =     "Buneman:1993:PAS",
  pages =        "227--236",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p227-wang/p227-wang.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p227-wang/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kanellakis:1993:IDM,
  author =       "Paris C. Kanellakis and Sridhar Ramaswamy and Darren
                 E. Vengroff and Jeffrey S. Vitter",
  title =        "Indexing for data models with constraints and classes
                 (extended abstract)",
  crossref =     "ACM:1993:PPT",
  pages =        "233--243",
  year =         "1993",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/153850/p233-kanellakis/p233-kanellakis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/153850/p233-kanellakis/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/153850/p233-kanellakis/",
  abstract =     "We examine I/O-efficient data structures that provide
                 indexing support for new data models. The database
                 languages of these models include concepts from
                 constraint programming (e.g., relational tuples are
                 generalized to conjunctions of constraints) and from
                 object-oriented programming (e.g., objects are
                 organized in class hierarchies). Let $n$ be the size of
                 the database, $c$ the number of classes, {$B$} the
                 secondary storage page size, and {$t$} the size of the
                 output of a query. Indexing by one attribute in the
                 constraint data model (for a fairly general type of
                 constraints) is equivalent to external dynamic interval
                 management, which is a special case of external dynamic
                 2-dimensional range searching. We present a
                 semi-dynamic data structure for this problem which has
                 optimal worst-case space {$O(n/B)$} pages and optimal
                 query I/O time {$O(\log_B n+t/B)$} and has {$O(\log_B
                 n+(\log_2Bn)/B)$} amortized insert I/O time. If the
                 order of the insertions is random then the expected
                 number of I/O operations needed to perform insertions
                 is reduced to {$O(\log_B n)$}. Indexing by one
                 attribute and by class name in an object-oriented
                 model, where objects are organized as a forest
                 hierarchy of classes, is also a special case of
                 external dynamic 2-dimensional range searching. Based
                 on this observation we first identify a simple
                 algorithm with good worst-case performance for the
                 class indexing problem. Using the forest structure of
                 the class hierarchy and techniques from the constraint
                 indexing problem, we improve its query I/O time from
                 {$O(\log_2c \log_B n + t/B)$} to {$O(logB +
                 \log_2B)$}.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Languages",
  keywords =     "ACM; algorithms; artificial; database systems;
                 intelligence; languages; SIGACT; SIGART; SIGMOD",
  subject =      "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Data models. {\bf H.2.3} Information
                 Systems, DATABASE MANAGEMENT, Languages, Data
                 description languages (DDL). {\bf H.3.1} Information
                 Systems, INFORMATION STORAGE AND RETRIEVAL, Content
                 Analysis and Indexing, Indexing methods.",
}

@InProceedings{Brinkhoff:1993:EPS,
  author =       "Thomas Brinkhoff and Hans-Peter Kriegel and Bernhard
                 Seeger",
  title =        "Efficient processing of spatial joints using
                 {R}-trees",
  crossref =     "Buneman:1993:PAS",
  pages =        "237--246",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p237-brinkhoff/p237-brinkhoff.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p237-brinkhoff/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Harel:1993:CRR,
  author =       "D. Harel and T. Hirst",
  title =        "Completeness Results for Recursive Data Bases",
  crossref =     "ACM:1993:PPT",
  pages =        "244--252",
  year =         "1993",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  keywords =     "ACM; artificial; database systems; intelligence;
                 SIGACT; SIGART; SIGMOD",
}

@InProceedings{Hirst:1993:CRR,
  author =       "Tirza Hirst and David Harel",
  title =        "Completeness results for recursive data bases",
  crossref =     "ACM:1993:PPT",
  pages =        "244--252",
  year =         "1993",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/153850/p244-hirst/p244-hirst.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/153850/p244-hirst/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/153850/p244-hirst/",
  abstract =     "We consider infinite recursive (i.e., computable)
                 relational data bases. Since the set of computable
                 queries on such data bases is not closed under even
                 simple relational operations, one must either make do
                 with a very humble class of queries or considerably
                 restrict the class of allowed data bases. We define two
                 query languages, one for each of these possibilities,
                 and prove their completeness. The first is the language
                 of quantifier-free first-order logic, which is shown to
                 be complete for the non-restricted case. The second is
                 an appropriately modified version of Chandra and
                 Harel's complete language QL, which is proved complete
                 for the case of ``highly symmetric'' data bases, i.e.,
                 ones whose set of automorphisms is of finite index for
                 each tuple-width. We also address the related notion of
                 BP-completeness.",
  acknowledgement = ack-nhfb,
  generalterms = "Theory; Verification",
  keywords =     "theory; verification",
  subject =      "{\bf G.2.2} Mathematics of Computing, DISCRETE
                 MATHEMATICS, Graph Theory. {\bf F.4.1} Theory of
                 Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES,
                 Mathematical Logic. {\bf H.2.3} Information Systems,
                 DATABASE MANAGEMENT, Languages, Query languages. {\bf
                 H.2.1} Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Data models.",
}

@InProceedings{Ishikawa:1993:ESF,
  author =       "Yoshiharu Ishikawa and Hiroyuki Kitagawa and Nobuo
                 Ohbo",
  title =        "Evaluation of signature files as set access facilities
                 in {OODBs}",
  crossref =     "Buneman:1993:PAS",
  pages =        "247--256",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p247-ishikawa/p247-ishikawa.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p247-ishikawa/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Escobar-Molano:1993:STC,
  author =       "Martha Escobar-Molano and Richard Hull and Dean
                 Jacobs",
  title =        "Safety and Translation of Calculus Queries with Scalar
                 Functions",
  crossref =     "ACM:1993:PPT",
  pages =        "253--264",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/153850/p253-escobar-molano/p253-escobar-molano.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/153850/p253-escobar-molano/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/153850/p253-escobar-molano/",
  acknowledgement = ack-nhfb,
  keywords =     "ACM; algorithms; artificial; database systems;
                 intelligence; languages; SIGACT; SIGART; SIGMOD;
                 theory",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Data manipulation languages (DML). {\bf
                 D.3.2} Software, PROGRAMMING LANGUAGES, Language
                 Classifications, Pascal. {\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.",
}

@InProceedings{Curewitz:1993:PPD,
  author =       "Kenneth M. Curewitz and P. Krishnan and Jeffrey Scott
                 Vitter",
  title =        "Practical prefetching via data compression",
  crossref =     "Buneman:1993:PAS",
  pages =        "257--266",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p257-curewitz/p257-curewitz.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p257-curewitz/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Denninghoff:1993:DMS,
  author =       "Karl Denninghoff and Victor Vianu",
  title =        "Database Method Schemas and Object Creation",
  crossref =     "ACM:1993:PPT",
  pages =        "265--275",
  year =         "1993",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/153850/p265-denninghoff/p265-denninghoff.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/153850/p265-denninghoff/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/153850/p265-denninghoff/",
  abstract =     "The expressiveness of various object-oriented
                 languages is investigated with respect to their ability
                 to create new objects. We focus on database method
                 schemas (dms), a model capturing the data manipulation
                 capabilities of a large class of deterministic methods
                 in object-oriented databases. The results clarify the
                 impact of various language constructs on object
                 creation. Several new constructs based on expanded
                 notions of deep equality are introduced. In particular,
                 we provide a tractable construct which yields a
                 language complete with respect to object creation. The
                 new construct is also relevant to query complexity. For
                 example, it allows expressing in polynomial time some
                 queries, like counting, requiring exponential space in
                 dms alone.",
  acknowledgement = ack-nhfb,
  generalterms = "Languages; Theory",
  keywords =     "ACM; artificial; database systems; intelligence;
                 languages; SIGACT; SIGART; SIGMOD; theory",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing. {\bf H.2.3} Information
                 Systems, DATABASE MANAGEMENT, Languages, Data
                 manipulation languages (DML). {\bf D.3.2} Software,
                 PROGRAMMING LANGUAGES, Language Classifications,
                 Object-oriented languages. {\bf H.2.1} Information
                 Systems, DATABASE MANAGEMENT, Logical Design, Data
                 models.",
}

@InProceedings{Hellerstein:1993:PMO,
  author =       "Joseph M. Hellerstein and Michael Stonebraker",
  title =        "Predicate migration: optimizing queries with expensive
                 predicates",
  crossref =     "Buneman:1993:PAS",
  pages =        "267--276",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p267-hellerstein/p267-hellerstein.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p267-hellerstein/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Wong:1993:CBS,
  author =       "Man H. Wong and Divyakant Agrawal",
  title =        "Context-Based Synchronization: An Approach Beyond
                 Semantics for Concurrency Control",
  crossref =     "ACM:1993:PPT",
  pages =        "276--287",
  year =         "1993",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/153850/p276-wong/p276-wong.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/153850/p276-wong/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/153850/p276-wong/",
  abstract =     "The expressiveness of various object-oriented
                 languages is investigated with respect to their ability
                 to create new objects. We focus on database method
                 schemas (dms), a model capturing the data manipulation
                 capabilities of a large class of deterministic methods
                 in object-oriented databases. The results clarify the
                 impact of various language constructs on object
                 creation. Several new constructs based on expanded
                 notions of deep equality are introduced. In particular,
                 we provide a tractable construct which yields a
                 language complete with respect to object creation. The
                 new construct is also relevant to query complexity. For
                 example, it allows expressing in polynomial time some
                 queries, like counting, requiring exponential space in
                 dms alone.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Theory",
  keywords =     "ACM; algorithms; artificial; database systems;
                 intelligence; SIGACT; SIGART; SIGMOD; theory",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Concurrency}; Information Systems
                 --- Database Management --- Systems (H.2.4): {\bf
                 Transaction processing}",
}

@InProceedings{Guting:1993:SOS,
  author =       "Ralf Hartmut G{\"u}ting",
  title =        "Second-order signature: a tool for specifying data
                 models, query processing, and optimization",
  crossref =     "Buneman:1993:PAS",
  pages =        "277--286",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p277-guting/p277-guting.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p277-guting/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Blakeley:1993:EBO,
  author =       "Jos{\'e} A. Blakeley and William J. McKenna and Goetz
                 Graefe",
  title =        "Experiences building the open {OODB} query optimizer",
  crossref =     "Buneman:1993:PAS",
  pages =        "287--296",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p287-blakeley/p287-blakeley.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p287-blakeley/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Rastogi:1993:SHO,
  author =       "Rajeev Rastogi and Henry F. Korth and Abraham
                 Silberschatz",
  title =        "Strict Histories in Object-Based Database Systems",
  crossref =     "ACM:1993:PPT",
  pages =        "288--299",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/153850/p288-rastogi/p288-rastogi.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/153850/p288-rastogi/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/153850/p288-rastogi/",
  acknowledgement = ack-nhfb,
  keywords =     "ACM; algorithms; artificial; database systems;
                 intelligence; SIGACT; SIGART; SIGMOD; theory",
  subject =      "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Data models. {\bf H.2.4} Information
                 Systems, DATABASE MANAGEMENT, Systems, Transaction
                 processing. {\bf H.2.4} Information Systems, DATABASE
                 MANAGEMENT, Systems, Concurrency.",
}

@InProceedings{ONeil:1993:LKP,
  author =       "Elizabeth J. O'Neil and Patrick E. O'Neil and Gerhard
                 Weikum",
  title =        "The {LRU-K} page replacement algorithm for database
                 disk buffering",
  crossref =     "Buneman:1993:PAS",
  pages =        "297--306",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p297-o_neil/p297-o_neil.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p297-o_neil/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Schek:1993:TUT,
  author =       "Hans-J{\"o}rg Schek and Gerhard Weikum and Haiyan Ye",
  title =        "Towards a Unified Theory of Concurrency Control and
                 Recovery",
  crossref =     "ACM:1993:PPT",
  pages =        "300--311",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/153850/p300-schek/p300-schek.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/153850/p300-schek/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/153850/p300-schek/",
  acknowledgement = ack-nhfb,
  keywords =     "ACM; artificial; database systems; intelligence;
                 SIGACT; SIGART; SIGMOD; theory; verification",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Concurrency. {\bf H.2.4} Information Systems,
                 DATABASE MANAGEMENT, Systems, Transaction processing.
                 {\bf G.2.2} Mathematics of Computing, DISCRETE
                 MATHEMATICS, Graph Theory.",
}

@InProceedings{Orji:1993:DDM,
  author =       "Cyril U. Orji and Jon A. Solworth",
  title =        "Doubly distorted mirrors",
  crossref =     "Buneman:1993:PAS",
  pages =        "307--316",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p307-orji/p307-orji.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p307-orji/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hou:1993:CRA,
  author =       "Robert Y. Hou and Yale N. Patt",
  title =        "Comparing rebuild algorithms for mirrored and {RAID5}
                 disk arrays",
  crossref =     "Buneman:1993:PAS",
  pages =        "317--326",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p317-hou/p317-hou.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p317-hou/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Litwin:1993:LLH,
  author =       "Witold Litwin and Marie-Anne Neimat and Donovan A.
                 Schneider",
  title =        "{LH}: {Linear Hashing} for distributed files",
  crossref =     "Buneman:1993:PAS",
  pages =        "327--336",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p327-litwin/p327-litwin.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p327-litwin/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Johnson:1993:LUD,
  author =       "Theodore Johnson and Padmashree Krishna",
  title =        "Lazy updates for distributed search structure",
  crossref =     "Buneman:1993:PAS",
  pages =        "337--346",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p337-johnson/p337-johnson.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p337-johnson/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Li:1993:ALP,
  author =       "Jianzhong Li and Doron Rotem and Jaideep Srivastava",
  title =        "Algorithms for loading parallel grid files",
  crossref =     "Buneman:1993:PAS",
  pages =        "347--356",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p347-li/p347-li.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p347-li/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Vadaparty:1993:TUV,
  author =       "K. Vadaparty and Y. A. Aslandogan and G. Ozsoyoglu",
  title =        "Towards a unified visual database access",
  crossref =     "Buneman:1993:PAS",
  pages =        "357--366",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p357-vadaparty/p357-vadaparty.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p357-vadaparty/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Watters:1993:IRR,
  author =       "Aaron Watters",
  title =        "Interpreting a reconstructed relational calculus
                 (extended abstract)",
  crossref =     "Buneman:1993:PAS",
  pages =        "367--376",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p367-watters/p367-watters.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p367-watters/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Beeri:1993:PAR,
  author =       "Catriel Beeri and Tova Milo",
  title =        "On the power of algebras with recursion",
  crossref =     "Buneman:1993:PAS",
  pages =        "377--387",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p377-beeri/p377-beeri.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p377-beeri/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Alonso:1993:DSI,
  author =       "Rafael Alonso and Henry F. Korth",
  title =        "Database system issues in nomadic computing",
  crossref =     "Buneman:1993:PAS",
  pages =        "388--392",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p388-alonso/p388-alonso.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p388-alonso/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Dayal:1993:TGT,
  author =       "Umesh Dayal and Hector Garcia-Molina and Mei Hsu and
                 Ben Kao and Ming-Chien Shan",
  title =        "Third generation {{\em TP\/}} monitors: a database
                 challenge",
  crossref =     "Buneman:1993:PAS",
  pages =        "393--397",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p393-dayal/p393-dayal.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p393-dayal/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Egenhofer:1993:WSA,
  author =       "Max J. Egenhofer",
  title =        "What's special about spatial?: database requirements
                 for vehicle navigation in geographic space",
  crossref =     "Buneman:1993:PAS",
  pages =        "398--402",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p398-egenhofer/p398-egenhofer.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p398-egenhofer/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ordille:1993:DCG,
  author =       "Joann J. Ordille and Barton P. Miller",
  title =        "Database challenges in global information systems",
  crossref =     "Buneman:1993:PAS",
  pages =        "403--407",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p403-ordille/p403-ordille.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p403-ordille/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Zdonik:1993:IDS,
  author =       "Stanley B. Zdonik",
  title =        "Incremental database systems: databases from the
                 ground up",
  crossref =     "Buneman:1993:PAS",
  pages =        "408--412",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p408-zdonik/p408-zdonik.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p408-zdonik/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Carey:1993:THD,
  author =       "Michael J. Carey and Laura M. Haas and Miron Livny",
  title =        "Tapes hold data, too: challenges of tuples on tertiary
                 store",
  crossref =     "Buneman:1993:PAS",
  pages =        "413--417",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p413-carey/p413-carey.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p413-carey/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Jagadish:1993:IMD,
  author =       "H. V. Jagadish",
  title =        "Issues in multimedia databases",
  crossref =     "Buneman:1993:PAS",
  pages =        "419--419",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p419-jagadish/p419-jagadish.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p419-jagadish/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Motro:1993:WTA,
  author =       "Amihai Motro",
  title =        "What to teach about databases",
  crossref =     "Buneman:1993:PAS",
  pages =        "420--420",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p420-motro/p420-motro.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p420-motro/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Shan:1993:PAD,
  author =       "Ming-Chien Shan",
  title =        "{Pegasus} architecture and design principles",
  crossref =     "Buneman:1993:PAS",
  pages =        "422--425",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p422-shan/p422-shan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p422-shan/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bukhres:1993:ISB,
  author =       "Omran Bukhres and Jiansan Chen and Rob Pezzoli",
  title =        "An {InterBase} system at {BNR}",
  crossref =     "Buneman:1993:PAS",
  pages =        "426--429",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p426-bukhres/p426-bukhres.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p426-bukhres/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Klein:1993:ODC,
  author =       "Johannes Klein and Francis Upton",
  title =        "Open {DECdtm}: constraint based transaction
                 management",
  crossref =     "Buneman:1993:PAS",
  pages =        "430--433",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p430-klein/p430-klein.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p430-klein/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Wiederhold:1993:III,
  author =       "Gio Wiederhold",
  title =        "Intelligent integration of information",
  crossref =     "Buneman:1993:PAS",
  pages =        "434--437",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p434-wiederhold/p434-wiederhold.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p434-wiederhold/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Vieille:1993:DOO,
  author =       "Laurent Vieille",
  title =        "A deductive and object-oriented database system: why
                 and how?",
  crossref =     "Buneman:1993:PAS",
  pages =        "438--438",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p438-vieille/p438-vieille.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p438-vieille/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Stonebraker:1993:MD,
  author =       "Michael Stonebraker",
  title =        "The {Miro DBMS}",
  crossref =     "Buneman:1993:PAS",
  pages =        "439--439",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p439-stonebraker/p439-stonebraker.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p439-stonebraker/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Velez:1993:MTM,
  author =       "Fernando V{\'e}lez",
  title =        "Modularity and tuning mechanisms in the {O$_2$
                 System}",
  crossref =     "Buneman:1993:PAS",
  pages =        "440--440",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p440-velez/p440-velez.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p440-velez/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Wade:1993:SLV,
  author =       "Andrew E. Wade",
  title =        "Single logical view over enterprise-wide distributed
                 databases",
  crossref =     "Buneman:1993:PAS",
  pages =        "441--441",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p441-wade/p441-wade.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p441-wade/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Mohan:1993:IRD,
  author =       "C. Mohan",
  title =        "{IBM}'s relational {DBMS} products: features and
                 technologies",
  crossref =     "Buneman:1993:PAS",
  pages =        "445--448",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p445-mohan/p445-mohan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p445-mohan/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Fushimi:1993:GCD,
  author =       "Shinya Fushimi and Masaru Kitsuregawa",
  title =        "{GREO}: a commercial database processor based on a
                 pipelined hardware sorter",
  crossref =     "Buneman:1993:PAS",
  pages =        "449--452",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p449-fushimi/p449-fushimi.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p449-fushimi/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Tseng:1993:PDP,
  author =       "Emy Tseng and David Reiner",
  title =        "Parallel database processing on the {KSR1} computer",
  crossref =     "Buneman:1993:PAS",
  pages =        "453--455",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p453-tseng/p453-tseng.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p453-tseng/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Jin:1993:CCR,
  author =       "W. Woody Jin and Marek Rusinkiewicz and Linda Ness and
                 Amit Sheth",
  title =        "Concurrency control and recovery of multidatabase work
                 flows in telecommunication applications",
  crossref =     "Buneman:1993:PAS",
  pages =        "456--459",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p456-jin/p456-jin.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p456-jin/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Sherman:1993:AED,
  author =       "Mark Sherman",
  title =        "Architecture of the {Encina} distributed transaction
                 processing family",
  crossref =     "Buneman:1993:PAS",
  pages =        "460--463",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p460-sherman/p460-sherman.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p460-sherman/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Colton:1993:RDD,
  author =       "Malcolm Colton",
  title =        "Replicated data in a distributed environment",
  crossref =     "Buneman:1993:PAS",
  pages =        "464--466",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p464-colton/p464-colton.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p464-colton/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Singhal:1993:DOO,
  author =       "Anoop Singhal and Robert M. Arlein and Chi-Yuan Lo",
  title =        "{DDB}: an object oriented design data manager for
                 {VLSI CAD}",
  crossref =     "Buneman:1993:PAS",
  pages =        "467--470",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p467-singhal/p467-singhal.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p467-singhal/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Nassif:1993:IAM,
  author =       "Rodolphe Nassif and Don Mitchusson",
  title =        "Issues and approaches for migration\slash cohabitation
                 between legacy and new systems",
  crossref =     "Buneman:1993:PAS",
  pages =        "471--474",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p471-nassif/p471-nassif.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p471-nassif/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Thieman:1993:IDN,
  author =       "James R. Thieman",
  title =        "The international directory network and connected data
                 information systems for research in the earth and space
                 sciences",
  crossref =     "Buneman:1993:PAS",
  pages =        "475--478",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p475-thieman/p475-thieman.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p475-thieman/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Mukhopadhyay:1993:IUA,
  author =       "Debajyoti Mukhopadhyay",
  title =        "Interoperability using {APPC}",
  crossref =     "Buneman:1993:PAS",
  pages =        "479--482",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p479-mukhopadhyay/p479-mukhopadhyay.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p479-mukhopadhyay/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Sheth:1993:MII,
  author =       "Amit P. Sheth and George Karabatis",
  title =        "Multidatabase interdependencies in industry",
  crossref =     "Buneman:1993:PAS",
  pages =        "483--486",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p483-sheth/p483-sheth.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p483-sheth/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cohen:1993:RIB,
  author =       "David Cohen and Gary Larson and Larry Berke",
  title =        "Role of interoperability in business application
                 development",
  crossref =     "Buneman:1993:PAS",
  pages =        "487--490",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p487-cohen/p487-cohen.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p487-cohen/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Woelk:1993:TSU,
  author =       "Darrell Woelk and Paul Attie and Phil Cannata and Greg
                 Meredith and Amit Sheth and Munindar Singh and
                 Christine Tomlinson",
  title =        "Task scheduling using intertask dependencies in
                 {Carnot}",
  crossref =     "Buneman:1993:PAS",
  pages =        "491--494",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p491-woelk/p491-woelk.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p491-woelk/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Mannai:1993:EIO,
  author =       "Dhamir N. Mannai and Khaled Bugrara",
  title =        "Enhancing inter-operability and data sharing in
                 medical information systems",
  crossref =     "Buneman:1993:PAS",
  pages =        "495--498",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p495-mannai/p495-mannai.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p495-mannai/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Woyna:1993:MBS,
  author =       "Mark A. Woyna and John H. Christiansen and Christopher
                 W. Hield and Kathy Lee Simunich",
  title =        "Modeling battlefield sensor environments with an
                 object database management system",
  crossref =     "Buneman:1993:PAS",
  pages =        "499--501",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p499-woyna/p499-woyna.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p499-woyna/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Schaller:1993:ICM,
  author =       "Tony Schaller",
  title =        "The {INtersect} concept for multidatabase system
                 integration in the pharmaceutical industry",
  crossref =     "Buneman:1993:PAS",
  pages =        "502--504",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p502-schaller/p502-schaller.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p502-schaller/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gemis:1993:GGO,
  author =       "Marc Gemis and Jan Paredaens and Inge Thyssens and Jan
                 {Van den Bussche}",
  title =        "{GOOD}: a graph-oriented object database system",
  crossref =     "Buneman:1993:PAS",
  pages =        "505--510",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p505-gemis/p505-gemis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p505-gemis/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Consens:1993:HHB,
  author =       "Mariano Consens and Alberto Mendelzon",
  title =        "Hy+: a {Hygraph-based} query and visualization
                 system",
  crossref =     "Buneman:1993:PAS",
  pages =        "511--516",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p511-consens/p511-consens.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p511-consens/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chu:1993:DIC,
  author =       "Wesley W. Chu and Matthew Merzbacher and Ladislav
                 Berkovich",
  title =        "The design and implementation of {CoBase}",
  crossref =     "Buneman:1993:PAS",
  pages =        "517--522",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p517-chu/p517-chu.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p517-chu/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Keller:1993:PSB,
  author =       "Arthur M. Keller and Richard Jensen and Shailesh
                 Agarwal",
  title =        "Persistence software: bridging object-oriented
                 programming and relational databases",
  crossref =     "Buneman:1993:PAS",
  pages =        "523--528",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p523-keller/p523-keller.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p523-keller/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kupper:1993:NCN,
  author =       "D. K{\"u}pper and M. Storbel and D. R{\"o}sner",
  title =        "{NAUDA}: a cooperative natural language interface to
                 relational databases",
  crossref =     "Buneman:1993:PAS",
  pages =        "529--533",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p529-kupper/p529-kupper.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p529-kupper/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bukhres:1993:IMP,
  author =       "O. Bukhres and J. Chen and A. Elmagarmid and X. Liu
                 and J. Mullen",
  title =        "{InterBase}: a multidatabase prototype systems",
  crossref =     "Buneman:1993:PAS",
  pages =        "534--539",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p534-bukhres/p534-bukhres.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p534-bukhres/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Su:1993:OKO,
  author =       "Stanley Y. W. Su and Herman X. Lam and Srinivasa
                 Eddula and Javier Arroyo and Neeta Prasad and Ronghao
                 Zhuang",
  title =        "{OSAM}*.{KBMS}: an object-oriented knowledge base
                 management system for supporting advanced
                 applications",
  crossref =     "Buneman:1993:PAS",
  pages =        "540--541",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p540-su/p540-su.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p540-su/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Moenkeberg:1993:CPS,
  author =       "Axel Moenkeberg and Peter Zabback and Christof Hasse
                 and Gerhard Weikum",
  title =        "The {COMFORT} prototype: a step towards automated
                 database performance tuning",
  crossref =     "Buneman:1993:PAS",
  pages =        "542--543",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p542-moenkeberg/p542-moenkeberg.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p542-moenkeberg/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ramakrishnan:1993:CDD,
  author =       "Raghu Ramakrishnan and William G. Roth and Praveen
                 Seshadri and Divesh Srivastava and S. Sudarshan",
  title =        "The {CORAL} deductive database system",
  crossref =     "Buneman:1993:PAS",
  pages =        "544--545",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p544-ramakrishnan/p544-ramakrishnan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p544-ramakrishnan/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Andersson:1993:SP,
  author =       "M. Andersson and A.-M. Auddino and Y. Dupont and E.
                 Fontana and M. Gentile and S. Spaccapietra",
  title =        "The {``SUPER''} project",
  crossref =     "Buneman:1993:PAS",
  pages =        "546--547",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p546-andersson/p546-andersson.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p546-andersson/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Polyachenko:1993:ICP,
  author =       "Boris E. Polyachenko and Filipp I. Andon",
  title =        "Instrumental complex of parallel software system
                 development and operating environment support for
                 distributed processing within multitransputer systems,
                 {TRANSSOFT}",
  crossref =     "Buneman:1993:PAS",
  pages =        "548--549",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p548-polyachenko/p548-polyachenko.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p548-polyachenko/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cacace:1993:LP,
  author =       "F. Cacace and S. Ceri and S. Crespi-Reghizzi and P.
                 Fraternali and S. Paraboschi and L. Tanca",
  title =        "The {LOGRES} prototype",
  crossref =     "Buneman:1993:PAS",
  pages =        "550--551",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p550-cacace/p550-cacace.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p550-cacace/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ford:1993:OOM,
  author =       "Steve Ford and Jos{\'e} A. Blakeley and Thomas J.
                 Bannon",
  title =        "Open {OODB}: a modular object-oriented {DBMS}",
  crossref =     "Buneman:1993:PAS",
  pages =        "552--553",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p552-ford/p552-ford.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p552-ford/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hasan:1993:PGD,
  author =       "W. Hasan and M. Heytens and C. Kolovson and M.-A.
                 Neimat and S. Potamianos and D. Schneider",
  title =        "Papyrus {GIS} demonstration",
  crossref =     "Buneman:1993:PAS",
  pages =        "554--555",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p554-hasan/p554-hasan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p554-hasan/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Rakow:1993:VVS,
  author =       "Thomas C. Rakow and Peter Muth",
  title =        "The {V$^3$} video server--managing analog and digital
                 video clips",
  crossref =     "Buneman:1993:PAS",
  pages =        "556--557",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p556-rakow/p556-rakow.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p556-rakow/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Muth:1993:VON,
  author =       "Peter Muth and Thomas C. Rakow",
  title =        "{VODAK} open nested transactions--visualizing database
                 internals",
  crossref =     "Buneman:1993:PAS",
  pages =        "558--559",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p558-muth/p558-muth.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p558-muth/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Luniewski:1993:IOU,
  author =       "Allen Luniewski and Peter Schwarz and Kurt Shoens and
                 Jim Stamos and John Thomas",
  title =        "Information organization using {Rufus}",
  crossref =     "Buneman:1993:PAS",
  pages =        "560--561",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p560-luniewski/p560-luniewski.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p560-luniewski/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Arens:1993:SRI,
  author =       "Yigal Arens and Craig Knoblock",
  title =        "{SIMS}: {Retrieving} and integrating information from
                 multiple sources",
  crossref =     "Buneman:1993:PAS",
  pages =        "562--563",
  year =         "1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/170035/p562-arens/p562-arens.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/170035/p562-arens/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Harel:1994:WPW,
  author =       "David Harel",
  title =        "Will {I} be pretty, will {I} be rich?: some thoughts
                 on theory {vs.} practice in systems engineering",
  crossref =     "ACM:1994:PPT",
  pages =        "1--3",
  year =         "1994",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/182591/p1-harel/p1-harel.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/182591/p1-harel/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/182591/p1-harel/",
  acknowledgement = ack-nhfb,
  keywords =     "ACM; computability; database systems; design;
                 languages; SIGACT; SIGART; SIGMOD; theory",
  subject =      "{\bf H.2.0} Information Systems, DATABASE MANAGEMENT,
                 General. {\bf H.2.4} Information Systems, DATABASE
                 MANAGEMENT, Systems. {\bf H.1.1} Information Systems,
                 MODELS AND PRINCIPLES, Systems and Information
                 Theory.",
}

@InProceedings{Barbara:1994:SWC,
  author =       "Daniel Barbar{\'a} and Tomasz Imieli{\'n}ski",
  title =        "Sleepers and workaholics: caching strategies in mobile
                 environments",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "1--12",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p1-barbara/p1-barbara.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p1-barbara/",
  abstract =     "In the mobile wireless computing environment of the
                 future a large number of users equipped with low
                 powered palm-top machines will query databases over the
                 wireless communication channels. Palmtop based units
                 will often be disconnected for prolonged periods of
                 time due to the battery power saving measures; palmtops
                 will also frequently relocate between different cells
                 and connect to different data servers at different
                 times. Caching of frequently accessed data items will
                 be an important technique that will reduce contention
                 on the narrow bandwidth wireless channel. However,
                 cache invalidation strategies will be severely affected
                 by the disconnection and mobility of the clients. The
                 server may no longer know which clients are currently
                 residing under its cell and which of them are currently
                 on. We propose a taxonomy of different cache
                 invalidation strategies and study the impact of
                 client's disconnection times on their performance. We
                 determine that for the units which are often
                 disconnected (sleepers) the best cache invalidation
                 strategy is based on signatures previously used for
                 efficient file comparison. On the other hand, for units
                 which are connected most of the time (workaholics), the
                 best cache invalidation strategy is based on the
                 periodic broadcast of changed data items.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Performance",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Computer
                 Systems Organization --- Computer-Communication
                 Networks --- General (C.2.0): {\bf Data
                 communications}; Computer Systems Organization ---
                 Computer System Implementation --- Microcomputers
                 (C.5.3): {\bf Personal computers}; Computer Systems
                 Organization --- Computer-Communication Networks ---
                 Network Architecture and Design (C.2.1): {\bf Network
                 topology}; Hardware --- Memory Structures --- Design
                 Styles (B.3.2): {\bf Cache memories}",
}

@InProceedings{Faloutsos:1994:BUI,
  author =       "Christos Faloutsos and Ibrahim Kamel",
  title =        "Beyond Uniformity and Independence: Analysis of
                 {R}-trees Using the Concept of Fractal Dimension",
  crossref =     "ACM:1994:PPT",
  pages =        "4--13",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/182591/p4-faloutsos/p4-faloutsos.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/182591/p4-faloutsos/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/182591/p4-faloutsos/",
  abstract =     "We propose the concept of fractal dimension of a set
                 of points, in order to quantify the deviation from the
                 uniformity distribution. Using measurements on real
                 data sets (road intersections of U.S. counties, star
                 coordinates from NASA's Infrared-Ultraviolet Explorer
                 etc.) we provide evidence that real data indeed are
                 skewed, and, moreover, we show that they behave as
                 mathematical fractals, with a measurable, non-integer
                 fractal dimension. \par

                 Armed with this tool, we then show its practical use in
                 predicting the performance of spatial access methods,
                 and specifically of the R-trees. We provide the {\em
                 first\/} analysis of R-trees for skewed distributions
                 of points: We develop a formula that estimates the
                 number of disk accesses for range queries, given only
                 the fractal dimension of the point set, and its count.
                 Experiments on real data sets show that the formula is
                 very accurate: the relative error is usually below 5\%,
                 and it rarely exceeds 10\%. \par

                 We believe that the fractal dimension will help replace
                 the uniformity and independence assumptions, allowing
                 more accurate analysis for {\em any\/} spatial access
                 method, as well as better estimates for query
                 optimization on multi-attribute queries.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Experimentation; Measurement; Theory",
  keywords =     "ACM; algorithms; computability; database systems;
                 experimentation; measurement; SIGACT; SIGART; SIGMOD;
                 theory",
  subject =      "{\bf F.2.2} Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems, Geometrical problems and
                 computations. {\bf F.2.2} Theory of Computation,
                 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY,
                 Nonnumerical Algorithms and Problems, Sorting and
                 searching. {\bf E.1} Data, DATA STRUCTURES, Trees.",
}

@InProceedings{Huang:1994:DRM,
  author =       "Yixiu Huang and Prasad Sistla and Ouri Wolfson",
  title =        "Data replication for mobile computers",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "13--24",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p13-huang/p13-huang.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p13-huang/",
  abstract =     "Users of mobile computers will soon have online access
                 to a large number of databases via wireless networks.
                 Because of limited bandwidth, wireless communication is
                 more expensive than wire communication. In this paper
                 we present and analyze various static and dynamic data
                 allocation methods. The objective is to optimize the
                 communication cost between a mobile computer and the
                 stationary computer that stores the online database.
                 Analysis is performed in two cost models. One is
                 connection (or time) based, as in cellular telephones,
                 where the user is charged per minute of connection. The
                 other is message based, as in packet radio networks,
                 where the user is charged per message. Our analysis
                 addresses both, the average case and the worst case for
                 determining the best allocation method.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Performance; Theory",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Distributed databases}; Hardware
                 --- Memory Structures --- Design Styles (B.3.2): {\bf
                 Cache memories}; Computer Systems Organization ---
                 Computer-Communication Networks --- General (C.2.0):
                 {\bf Data communications}",
}

@InProceedings{Haas:1994:RCS,
  author =       "Peter J. Haas and Jeffrey F. Naughton and Arun N.
                 Swami",
  title =        "On the Relative Cost of Sampling for Join Selectivity
                 Estimation",
  crossref =     "ACM:1994:PPT",
  pages =        "14--24",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/182591/p14-haas/p14-haas.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/182591/p14-haas/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/182591/p14-haas/",
  abstract =     "We compare the cost of estimating the selectivity of a
                 ``star join'' using sampling procedure {\em t-cross\/}
                 to the cost of simply computing the join and obtaining
                 the exact answer. Our bounds and approximations for the
                 relative cost of sampling show how this cost depends on
                 the size of the input relations, the number of input
                 relations, and the precision criterion used by the
                 estimation procedure. We also demonstrate the
                 deleterious effect of dangling tuples and the mixed
                 effect of data skew on the relative cost of sampling.
                 These results provide insight into when sampling should
                 or should not be used for join selectivity
                 estimation.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Theory",
  keywords =     "ACM; algorithms; computability; database systems;
                 SIGACT; SIGART; SIGMOD; theory",
  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, Probabilistic computation. {\bf G.3}
                 Mathematics of Computing, PROBABILITY AND STATISTICS,
                 Probabilistic algorithms (including Monte Carlo).",
}

@InProceedings{Ramaswamy:1994:PCE,
  author =       "Sridhar Ramaswamy and Sairam Subramanian",
  title =        "Path caching (extended abstract): a technique for
                 optimal external searching",
  crossref =     "ACM:1994:PPT",
  pages =        "25--35",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/182591/p25-ramaswamy/p25-ramaswamy.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/182591/p25-ramaswamy/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/182591/p25-ramaswamy/",
  abstract =     "External 2-dimensional searching is a fundamental
                 problem with many applications in relational,
                 object-oriented, spatial, and temporal databases. For
                 example, interval intersection can be reduced to
                 2-sided, 2-dimensional searching and indexing class
                 hierarchies of objects to 3-sided, 2-dimensional
                 searching. {\em Path caching\/} is a new technique that
                 can be used to transform a number of time/space
                 efficient data structures for internal 2-dimensional
                 searching (such as segment trees, interval trees, and
                 priority search trees) into I/O efficient external
                 ones. Let $n$ be the size of the database, {$B$} the
                 page size, and $t$ the output size of a query. Using
                 path caching, we provide the first data structure with
                 optimal I/O query time {$O(\log B n + t/B)$} for
                 2-sided, 2-dimensional searching. Furthermore, we show
                 that path caching requires a small space overhead
                 {$O(n/B\log_2\log_2B)$} and is simple enough to admit
                 dynamic updates in optimal {$O(\log B n)$} amortized
                 time. We also extend this data structure to handle
                 3-sided, 2-dimensional searching with optimal I/O
                 query-time, at the expense of slightly higher storage
                 and update overheads.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Languages; Theory",
  keywords =     "algorithms; languages; theory",
  subject =      "{\bf F.2.2} Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems, Sorting and searching. {\bf
                 H.2.1} Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Data models. {\bf E.1} Data, DATA
                 STRUCTURES, Trees. {\bf H.2.4} Information Systems,
                 DATABASE MANAGEMENT, Systems, Query processing.",
}

@InProceedings{Ramaswamy:1994:PCT,
  author =       "S. Ramaswamy and S. Subramanian",
  title =        "Path Caching: a Technique for Optimal External
                 Searching",
  crossref =     "ACM:1994:PPT",
  pages =        "25--35",
  year =         "1994",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  keywords =     "ACM; computability; database systems; SIGACT; SIGART;
                 SIGMOD; theory",
}

@InProceedings{Imielinski:1994:EEI,
  author =       "Tomasz Imielinski and S. Viswanathan and B. R.
                 Badrinath",
  title =        "Energy efficient indexing on air",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "25--36",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p25-imielinski/p25-imielinski.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p25-imielinski/",
  abstract =     "We consider wireless broadcasting of data as a way of
                 disseminating information to a massive number of users.
                 Organizing and accessing information on wireless
                 communication channels is different from the problem of
                 organizing and accessing data on the disk. We describe
                 two methods, (1, $m$) {\em Indexing\/} and {\em
                 Distributed Indexing}, for organizing and accessing
                 broadcast data. We demonstrate that the proposed
                 algorithms lead to significant improvement of battery
                 life, while retaining a low access time.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Performance",
  subject =      "Computer Systems Organization ---
                 Computer-Communication Networks --- General (C.2.0):
                 {\bf Data communications}; Information Systems ---
                 Information Storage and Retrieval --- Content Analysis
                 and Indexing (H.3.1): {\bf Indexing methods}; Data ---
                 Files (E.5): {\bf Organization/structure}; Data ---
                 Data Structures (E.1): {\bf Trees}",
}

@InProceedings{Chen:1994:ORT,
  author =       "Ling Tony Chen and Doron Rotem",
  title =        "Optimal response time retrieval of replicated data
                 (extended abstract)",
  crossref =     "ACM:1994:PPT",
  pages =        "36--44",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/182591/p36-chen/p36-chen.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/182591/p36-chen/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/182591/p36-chen/",
  abstract =     "This work deals with the problem of finding efficient
                 access plans for retrieving a set of pages from a
                 multi-disk system with replicated data. This paper
                 contains two results related to this problem: (a) We
                 solve the problem of finding an optimal access path by
                 transforming it into a network flow problem. We also
                 indicate how our method may be employed in dynamic
                 environments where some (or all) of the disks have a
                 preexisting load, are heterogeneous, and reside on
                 different servers. (b) We present a lower bound for the
                 worst case response time of a request under all
                 replication schemes, and also discuss the replication
                 scheme that results in this lower bound. We then use
                 simulation to show how this replication scheme can also
                 greatly reduce the average case response time.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Performance; Theory;
                 Verification",
  keywords =     "ACM; algorithms; computability; database systems;
                 design; performance; SIGACT; SIGART; SIGMOD; theory;
                 verification",
  subject =      "{\bf G.2.2} Mathematics of Computing, DISCRETE
                 MATHEMATICS, Graph Theory, Network problems. {\bf
                 H.2.2} Information Systems, DATABASE MANAGEMENT,
                 Physical Design, Access methods. {\bf F.2.2} Theory of
                 Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Nonnumerical Algorithms and Problems,
                 Computations on discrete structures.",
}

@InProceedings{Ahn:1994:SCP,
  author =       "Ilsoo Ahn",
  title =        "{SIGMOD} challenges paper: database issues in
                 telecommunications network management",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "37--43",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p37-ahn/p37-ahn.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p37-ahn/",
  abstract =     "Various types of computer systems are used behind the
                 scenes in many parts of the telecommunications network
                 to ensure its efficient and trouble-free operation.
                 These systems are large, complex, and expensive
                 real-time computer systems that are mission critical,
                 and contains a database engine as a critical component.
                 These systems share some of common database issues with
                 conventional applications, but they also exhibit rather
                 unique characteristics that present challenging
                 database issues. Major DBMS issues for network
                 management include choosing the right data model,
                 handling two different kinds of data in terms of
                 integrity and recovery constraints, supporting temporal
                 queries, satisfying real-time performance and high
                 availability requirements, and several miscellaneous
                 issues. Some of these issues have been investigated in
                 various areas of database researches, but most of them
                 largely remain in the research stage. Advances in these
                 areas that result in actual integrated implementations
                 for data-intensive, real-time and temporal applications
                 are eagerly awaited.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Languages; Performance",
  subject =      "Information Systems --- Database Management ---
                 Database Applications (H.2.8); Information Systems ---
                 Database Management --- Systems (H.2.4): {\bf Query
                 processing}; Computer Systems Organization ---
                 Computer-Communication Networks --- General (C.2.0):
                 {\bf Data communications}; Information Systems ---
                 Database Management --- Logical Design (H.2.1): {\bf
                 Data models}",
}

@InProceedings{Biliris:1994:ASS,
  author =       "A. Biliris and S. Dar and N. Gehani and H. V. Jagadish
                 and K. Ramamritham",
  title =        "{ASSET}: a system for supporting extended
                 transactions",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "44--54",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p44-biliris/p44-biliris.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p44-biliris/",
  abstract =     "Extended transaction models in databases were
                 motivated by the needs of complex applications such as
                 CAD and software engineering. Transactions in such
                 applications have diverse needs, for example, they may
                 be long lived and they may need to cooperate. We
                 describe ASSET, a system for supporting extended
                 transactions. ASSET consists of a set of transaction
                 primitives that allow users to define custom
                 transaction semantics to match the needs of specific
                 applications. We show how the transaction primitives
                 can be used to specify a variety of transaction models,
                 including nested transactions, split transactions, and
                 sagas. Application-specific transaction models with
                 relaxed correctness criteria, and computations
                 involving workflows, can also be specified using the
                 primitives. We describe the implementation of the ASSET
                 primitives in the context of the Ode database.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Languages",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Transaction processing};
                 Information Systems --- Database Management --- Logical
                 Design (H.2.1): {\bf Data models}; Theory of
                 Computation --- Logics and Meanings of Programs ---
                 Studies of Program Constructs (F.3.3); Information
                 Systems --- Database Management --- Languages (H.2.3)",
}

@InProceedings{Gupta:1994:CCP,
  author =       "Ashish Gupta and Yehoshua Sagiv and Jeffrey D. Ullman
                 and Jennifer Widom",
  title =        "Constraint Checking with Partial Information",
  crossref =     "ACM:1994:PPT",
  pages =        "45--55",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/182591/p45-gupta/p45-gupta.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/182591/p45-gupta/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/182591/p45-gupta/",
  abstract =     "Constraints are a valuable tool for managing
                 information across multiple databases, as well as for
                 general purposes of assuring data integrity. However,
                 efficient implementation of constraint checking is
                 difficult. In this paper we explore techniques for
                 assuring constraint satisfaction without performing a
                 complete evaluation of the constraints. We consider
                 methods that use only constraint definitions, methods
                 that use constraints and updates, and methods that use
                 constraints, updates, and ``local'' data.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Languages; Theory; Verification",
  keywords =     "ACM; algorithms; computability; database systems;
                 languages; SIGACT; SIGART; SIGMOD; theory;
                 verification",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing. {\bf H.2.0} Information
                 Systems, DATABASE MANAGEMENT, General. {\bf H.2.3}
                 Information Systems, DATABASE MANAGEMENT, Languages,
                 Datalog. {\bf H.2.3} Information Systems, DATABASE
                 MANAGEMENT, Languages, Query languages.",
}

@InProceedings{Mohan:1994:ACM,
  author =       "C. Mohan and Inderpal Narang",
  title =        "{ARIES\slash CSA}: a method for database recovery in
                 client-server architectures",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "55--66",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p55-mohan/p55-mohan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p55-mohan/",
  abstract =     "This paper presents an algorithm, called ARIES/CSA (
                 {\em Algorithm for Recovery and Isolation Exploiting
                 Semantics for Client-Server Architectures\/}), for
                 performing recovery correctly in client-server (CS)
                 architectures. In CS, the server manages the disk
                 version of the database. The clients, after obtaining
                 database pages from the server, cache them in their
                 buffer pools. Clients perform their updates on the
                 cached pages and produce log records. The log records
                 are buffered locally in virtual storage and later sent
                 to the single log at the server. ARIES/CSA supports a
                 write-ahead logging (WAL), fine-granularity (e.g.,
                 record) locking, partial rollbacks and flexible buffer
                 management policies like {\em steal\/} and {\em
                 no-force}. It does not require that the clocks on the
                 clients and the server be synchronized. Checkpointing
                 by the server and the clients allows for flexible and
                 easier recovery.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Performance",
  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}; Information
                 Systems --- Database Management --- Database
                 Administration (H.2.7): {\bf Logging and recovery}",
}

@InProceedings{Stuckey:1994:CQC,
  author =       "Peter J. Stuckey and S. Sudarshan",
  title =        "Compiling query constraints (extended abstract)",
  crossref =     "ACM:1994:PPT",
  pages =        "56--67",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/182591/p56-stuckey/p56-stuckey.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/182591/p56-stuckey/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/182591/p56-stuckey/",
  abstract =     "We present a general technique to push query
                 constraints (such as {\em length\/} 1000) into database
                 views and (constraint) logic programs. We introduce the
                 notion of parametrized constraints, which help us push
                 constraints with argument values that are known only at
                 run time, and develop techniques for pushing
                 parametrized constraints into predicate/view
                 definitions. Our technique provides a way of compiling
                 programs with constraint queries into programs with
                 parametrized constraints compiled in, and which can be
                 executed on systems, such as database query evaluation
                 systems, that do not handle full constraint solving.
                 Thereby our technique can push constraint selections
                 that earlier constraint query rewriting techniques
                 could not. Our technique is independent of the actual
                 constraint domain, and we illustrate its use with
                 equality constraints on structures (which are useful in
                 object-oriented query languages) and linear arithmetic
                 constraints.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Performance; Theory",
  keywords =     "ACM; algorithms; computability; database systems;
                 performance; SIGACT; SIGART; SIGMOD; 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. {\bf G.1.6} Mathematics of Computing,
                 NUMERICAL ANALYSIS, Optimization, Constrained
                 optimization.",
}

@InProceedings{Zhang:1994:ERA,
  author =       "Aidong Zhang and Marian Nodine and Bharat Bhargava and
                 Omran Bukhres",
  title =        "Ensuring relaxed atomicity for flexible transactions
                 in multidatabase systems",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "67--78",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p67-zhang/p67-zhang.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p67-zhang/",
  abstract =     "Global transaction management requires cooperation
                 from local sites to ensure the consistent and reliable
                 execution of global transactions in a distributed
                 database system. In a heterogeneous distributed
                 database (or multidatabase) environment, various local
                 sites make conflicting assertions of autonomy over the
                 execution of global transactions. A flexible
                 transaction model for the specification of global
                 transactions makes it possible to deal robustly with
                 these conflicting requirements. This paper presents an
                 approach that preserves the {\em semi-atomicity\/} (a
                 weaker form of atomicity) of flexible transactions,
                 allowing local sites to autonomously maintain
                 serializability and recoverability. We offer a
                 fundamental characterization of the flexible
                 transaction model and precisely define the
                 semi-atomicity. We investigate the commit dependencies
                 among the subtransactions of a flexible transaction.
                 These dependencies are used to control the commitment
                 order of the subtransactions. We next identify those
                 restrictions that must be placed upon a flexible
                 transaction to ensure the maintenance of its
                 semi-atomicity. As atomicity is a restrictive
                 criterion, semi-atomicity enhances the class of
                 executable global transactions.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Reliability",
  subject =      "Information Systems --- Database Management ---
                 Database Administration (H.2.7): {\bf Logging and
                 recovery}; Information Systems --- Database Management
                 --- Systems (H.2.4): {\bf Transaction processing};
                 Information Systems --- Database Management --- Systems
                 (H.2.4): {\bf Distributed databases}",
}

@InProceedings{Sohn:1994:CAA,
  author =       "Kirack Sohn",
  title =        "Constraints among argument sizes in logic programs
                 (extended abstract)",
  crossref =     "ACM:1994:PPT",
  pages =        "68--74",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/182591/p68-sohn/p68-sohn.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/182591/p68-sohn/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/182591/p68-sohn/",
  abstract =     "In logic programs the argument sizes of derivable
                 facts w.r.t. an $n$-ary predicate are viewed as a set
                 of points in {\em Rn}, which are approximated by their
                 convex hull. {\em Interargument constraint\/} w.r.t. a
                 predicate is essentially a set of constraints that
                 every derivable fact of the predicate satisfies. We
                 formalize such constraints by a fixpoint of {\em
                 recursive transformation\/} similar to immediate
                 consequence operator. However, the transformation does
                 not necessarily converge finitely. Approximating
                 polycones to their affine hulls provides useful
                 interargument constraints in many practical programs,
                 guaranteeing finite convergence. For a class of linear
                 recursive logic programs satisfying {\em
                 translativeness\/} property, precise interargument
                 constraints can be obtained by an analysis of
                 structures of recursive transformations.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Theory; Verification",
  keywords =     "ACM; algorithms; computability; database systems;
                 SIGACT; SIGART; SIGMOD; theory; verification",
  subject =      "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC
                 AND FORMAL LANGUAGES, Mathematical Logic, Logic and
                 constraint programming. {\bf F.4.1} Theory of
                 Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES,
                 Mathematical Logic, Recursive function theory. {\bf
                 F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS
                 AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
                 Problems, Geometrical problems and computations. {\bf
                 F.3.2} Theory of Computation, LOGICS AND MEANINGS OF
                 PROGRAMS, Semantics of Programming Languages. {\bf
                 H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems.",
}

@InProceedings{Agrawal:1994:TDM,
  author =       "Rakesh Agrawal",
  title =        "Tutorial: Data Mining",
  crossref =     "ACM:1994:PPT",
  pages =        "75--76",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/182591/p75-agrawal/p75-agrawal.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/182591/p75-agrawal/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/182591/p75-agrawal/",
  abstract =     "We view database mining as the efficient construction
                 and verification of models of patterns embedded in
                 large databases. Many of the database mining problems
                 have been motivated by the practical decision support
                 problems faced by most large retail organizations. In
                 the Quest project at the IBM Almaden Research center,
                 we have focussed on three classes of database mining
                 problems involving classification, associations, and
                 sequences. In this tutorial, I will draw upon my Quest
                 experience to present my perspective of database
                 mining, describe current work, and present some open
                 problems.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Verification",
  keywords =     "ACM; algorithms; computability; database systems;
                 design; SIGACT; SIGART; SIGMOD; theory; verification",
  subject =      "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Data models. {\bf H.2.4} Information
                 Systems, DATABASE MANAGEMENT, Systems.",
  xxtitle =      "Tutorial database mining",
}

@InProceedings{Kivinen:1994:PSK,
  author =       "Jyrki Kivinen and Heikki Mannila",
  title =        "The Power of Sampling in Knowledge Discovery",
  crossref =     "ACM:1994:PPT",
  pages =        "77--85",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/182591/p77-kivinen/p77-kivinen.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/182591/p77-kivinen/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/182591/p77-kivinen/",
  abstract =     "We consider the problem of approximately verifying the
                 truth of sentences of tuple relational calculus in a
                 given relation $M$ by considering only a random sample
                 of $M$. We define two different measures for the error
                 of a universal sentence in a relation. For a set of $n$
                 universal sentences each with at most $k$ universal
                 quantifiers, we give upper and lower bounds for the
                 sample sizes required for having a high probability
                 that all the sentences with error at least $\epsilon$
                 can be detected as false by considering the sample. The
                 sample sizes are {$O((\log n)/\epsilon)$} or
                 {$O((|M|1-1/k) \log n /\epsilon)$}, depending on the
                 error measure used. We also consider
                 universal-existential sentences.",
  acknowledgement = ack-nhfb,
  generalterms = "Measurement; Theory; Verification",
  keywords =     "ACM; computability; database systems; measurement;
                 SIGACT; SIGART; SIGMOD; theory; verification",
  subject =      "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Data models. {\bf F.4.1} Theory of
                 Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES,
                 Mathematical Logic. {\bf H.2.4} Information Systems,
                 DATABASE MANAGEMENT, Systems, Query processing.",
}

@InProceedings{Berson:1994:SSM,
  author =       "Steven Berson and Shahram Ghandeharizadeh and Richard
                 Muntz and Xiangyu Ju",
  title =        "Staggered striping in multimedia information systems",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "79--90",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p79-berson/p79-berson.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p79-berson/",
  abstract =     "Multimedia information systems have emerged as an
                 essential component of many application domains ranging
                 from library information systems to entertainment
                 technology. However, most implementations of these
                 systems cannot support the continuous display of
                 multimedia objects and suffer from frequent disruptions
                 and delays termed {\em hiccups}. This is due to the low
                 I/O bandwidth of the current disk technology, the high
                 bandwidth requirement of multimedia objects, and the
                 large size of these objects that almost always requires
                 them to be disk resident. One approach to resolve this
                 limitation is to decluster a multimedia object across
                 multiple disk drives in order to employ the aggregate
                 bandwidth of several disks to support the continuous
                 retrieval (and display) of objects. This paper
                 describes staggered striping as a novel technique to
                 provide effective support for multiple users accessing
                 the different objects in the database. Detailed
                 simulations confirm the superiority of staggered
                 striping.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Languages; Performance",
  subject =      "Information Systems --- Database Management ---
                 Physical Design (H.2.2): {\bf Access methods};
                 Information Systems --- Information Interfaces and
                 Presentation --- Multimedia Information Systems
                 (H.5.1): {\bf Video (e.g., tape, disk, DVI)}; Hardware
                 --- Memory Structures --- Performance Analysis and
                 Design Aids** (B.3.3): {\bf Simulation**}; Hardware ---
                 Memory Structures --- Design Styles (B.3.2): {\bf Mass
                 storage}",
}

@InProceedings{Chaudhuri:1994:CDA,
  author =       "Surajit Chaudhuri and Phokion G. Kolaitis",
  title =        "Can {Datalog} be approximated?",
  crossref =     "ACM:1994:PPT",
  pages =        "86--96",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/182591/p86-chaudhuri/p86-chaudhuri.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/182591/p86-chaudhuri/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/182591/p86-chaudhuri/",
  abstract =     "In this paper, we investigate whether recursive
                 Datalog predicates can be approximated by finite unions
                 of conjunctive queries. We introduce a quantitative
                 notion of error and examine two types of approximation,
                 namely, {\em absolute approximation\/} and {\em
                 relative approximation}. We also stipulate that the
                 approximations obey certain qualitative criteria,
                 namely we require them to be {\em upper envelopes\/} or
                 {\em lower envelopes\/} of the Datalog predicate they
                 approximate. We establish that {\em absolute
                 approximation\/} by finite unions of conjunctive
                 queries is not possible, which means that no unbounded
                 Datalog predicate can be approximated by a finite union
                 of conjunctive queries in such a way that the error is
                 bounded uniformly by the same constant on all finite
                 databases. After this, we examine {\em relative
                 approximations}, i.e., approximations that guarantee
                 bounds for the error relative to the size of the
                 Datalog predicate under consideration. Although such
                 approximations exist in some cases, we show that for
                 several large and well-studied classes of unbounded
                 Datalog predicates it is not possible to find finite
                 unions of conjunctive queries that satisfy the
                 aforementioned qualitative criteria and have the
                 property that the relative error of the approximation
                 is bounded by a constant. Finally, we consider
                 first-order approximations and obtain sharp negative
                 results for the approximability of the {\em transitive
                 closure\/} query and the {\em cycle\/} query by
                 first-order queries.",
  acknowledgement = ack-nhfb,
  generalterms = "Languages; Performance; Theory; Verification",
  keywords =     "ACM; computability; database systems; languages;
                 performance; SIGACT; SIGART; SIGMOD; theory;
                 verification",
  subject =      "Information Systems --- Database Management ---
                 Languages (H.2.3): {\bf Datalog}; Information Systems
                 --- Database Management --- Systems (H.2.4): {\bf Query
                 processing}; Mathematics of Computing --- Numerical
                 Analysis --- Optimization (G.1.6); Mathematics of
                 Computing --- Discrete Mathematics --- Graph Theory
                 (G.2.2)",
}

@InProceedings{Gibbs:1994:DMT,
  author =       "Simon Gibbs and Christian Breiteneder and Dennis
                 Tsichritzis",
  title =        "Data modeling of time-based media",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "91--102",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p91-gibbs/p91-gibbs.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p91-gibbs/",
  abstract =     "Many aspects of time-based media--complex data
                 encoding, compression, ``quality factors,''
                 timing--appear problematic from a data modeling
                 standpoint. This paper proposes {\em timed streams\/}
                 as the basic abstraction for modeling time-based media.
                 Several media-independent structuring mechanisms are
                 introduced and a data model is presented which, rather
                 than leaving the interpretation of multimedia data to
                 applications, addresses the complex organization and
                 relationships present in multimedia.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Performance",
  subject =      "Information Systems --- Database Management ---
                 Logical Design (H.2.1): {\bf Data models}; Information
                 Systems --- Database Management --- Systems (H.2.4);
                 Information Systems --- Information Interfaces and
                 Presentation --- Multimedia Information Systems
                 (H.5.1): {\bf Audio input/output}; Information Systems
                 --- Information Interfaces and Presentation ---
                 Multimedia Information Systems (H.5.1): {\bf Video
                 (e.g., tape, disk, DVI)}",
}

@InProceedings{Afrati:1994:BAD,
  author =       "Foto N. Afrati",
  title =        "Bonded arity {Datalog} ($\not=$) queries on graphs",
  crossref =     "ACM:1994:PPT",
  pages =        "97--106",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/182591/p97-afrati/p97-afrati.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/182591/p97-afrati/",
  abstract =     "We show that there are Datalog ($\not=$) queries on
                 graphs (i.e., the extensional database contains a
                 single binary relation) that require recursively
                 defined predicates of arbitrarily large width. More
                 specifically, we prove that fixed subgraph
                 homeomorphism queries require width of recursively
                 defined predicates which is at least equal to the
                 number of arcs in the pattern graph.",
  acknowledgement = ack-nhfb,
  generalterms = "Languages; Theory; Verification",
  keywords =     "ACM; computability; database systems; languages;
                 SIGACT; SIGART; SIGMOD; theory; verification",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Datalog. {\bf F.2.2} Theory of Computation,
                 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY,
                 Nonnumerical Algorithms and Problems, Computations on
                 discrete structures. {\bf G.2.2} Mathematics of
                 Computing, DISCRETE MATHEMATICS, Graph Theory, Trees.",
}

@InProceedings{Mumick:1994:IMS,
  author =       "Inderpal Singh Mumick and Hamid Pirahesh",
  title =        "Implementation of magic-sets in a relational database
                 system",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "103--114",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p103-mumick/p103-mumick.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p103-mumick/",
  abstract =     "We describe the implementation of the magic-sets
                 transformation in the Starburst extensible relational
                 database system. To our knowledge this is the first
                 implementation of the magic-sets transformation in a
                 relational database system. The Starburst
                 implementation has many novel features that make our
                 implementation especially interesting to database
                 practitioners (in addition to database researchers).
                 (1) We use a cost-based heuristic for {\em determining
                 join orders\/} (sips) before applying magic. (2) We
                 push all equality and {\em non-equality\/} predicates
                 using magic, replacing traditional predicate pushdown
                 optimizations. (3) We apply magic to {\em full SQL\/}
                 with duplicates, aggregation, null values, and
                 subqueries. (4) We {\em integrate\/} magic with other
                 relational optimization techniques. (5) The
                 implementation is {\em extensible}. \par

                 Our implementation demonstrates the feasibility of the
                 magic-sets transformation for commercial relational
                 systems, and provides a mechanism to implement magic as
                 an integral part of a new database system, or as an
                 add-on to an existing database system.",
  acknowledgement = ack-nhfb,
  generalterms = "Languages; Performance",
  subject =      "Information Systems --- Database Management ---
                 Logical Design (H.2.1): {\bf Data models}; Information
                 Systems --- Database Management --- Languages (H.2.3):
                 {\bf SQL}; Information Systems --- Database Management
                 --- Systems (H.2.4): {\bf Query processing}",
}

@InProceedings{Chaudhuri:1994:CEB,
  author =       "Surajit Chaudhuri and Moshe Y. Vardi",
  title =        "On the complexity of equivalence between recursive and
                 nonrecursive {Datalog} programs",
  crossref =     "ACM:1994:PPT",
  pages =        "107--116",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/182591/p107-chaudhuri/p107-chaudhuri.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/182591/p107-chaudhuri/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/182591/p107-chaudhuri/",
  abstract =     "In a previous paper, we have proved tight complexity
                 bounds for the equivalence of recursive and
                 nonrecursive Datalog programs: triply exponential time
                 in general and doubly-exponential space for linear
                 programs. In this paper, we show that under realistic
                 restrictions on the classes programs under
                 consideration, equivalence of recursive and
                 nonrecursive programs can be less intractable; for the
                 classes of programs we consider the complexity of
                 equivalence ranges from NP to co-NEXPTIME.",
  acknowledgement = ack-nhfb,
  generalterms = "Languages; Theory",
  keywords =     "ACM; computability; database systems; languages;
                 SIGACT; SIGART; SIGMOD; theory",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Datalog. {\bf F.4.1} Theory of Computation,
                 MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical
                 Logic, Logic and constraint programming. {\bf H.3.3}
                 Information Systems, INFORMATION STORAGE AND RETRIEVAL,
                 Information Search and Retrieval, Query formulation.
                 {\bf G.1.6} Mathematics of Computing, NUMERICAL
                 ANALYSIS, Optimization.",
}

@InProceedings{Wang:1994:CPD,
  author =       "Jason Tsong-Li Wang and Gung-Wei Chirn and Thomas G.
                 Marr and Bruce Shapiro and Dennis Shasha and Kaizhong
                 Zhang",
  title =        "Combinatorial pattern discovery for scientific data:
                 some preliminary results",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "115--125",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p115-wang/p115-wang.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p115-wang/",
  abstract =     "Suppose you are given a set of natural entities (e.g.,
                 proteins, organisms, weather patterns, etc.) that
                 possess some important common externally observable
                 properties. You also have a structural description of
                 the entities (e.g., sequence, topological, or
                 geometrical data) and a distance metric. Combinatorial
                 pattern discovery is the activity of finding patterns
                 in the structural data that might explain these common
                 properties based on the metric. \par

                 This paper presents an example of combinatorial pattern
                 discovery: the discovery of patterns in protein
                 databases. The structural representation we consider
                 are strings and the distance metric is string edit
                 distance permitting variable length don't cares. Our
                 techniques incorporate string matching algorithms and
                 novel heuristics for discovery and optimization, most
                 of which generalize to other combinatorial structures.
                 Experimental results of applying the techniques to both
                 generated data and functionally related protein
                 families obtained from the Cold Spring Harbor
                 Laboratory show the effectiveness of the proposed
                 techniques. When we apply the discovered patterns to
                 perform protein classification, they give information
                 that is complementary to the best protein classifier
                 available today.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Experimentation; Measurement;
                 Performance",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Theory of
                 Computation --- Analysis of Algorithms and Problem
                 Complexity --- Nonnumerical Algorithms and Problems
                 (F.2.2): {\bf Pattern matching}; Computer Applications
                 --- Life and Medical Sciences (J.3): {\bf Biology and
                 genetics}; Data --- Data Structures (E.1): {\bf Trees};
                 Mathematics of Computing --- Discrete Mathematics ---
                 Combinatorics (G.2.1)",
}

@InProceedings{Hua:1994:DBS,
  author =       "Kien A. Hua and S. D. Lang and Wen K. Lee",
  title =        "A Decomposition-Based Simulated Annealing Technique
                 for Data Clustering",
  crossref =     "ACM:1994:PPT",
  pages =        "117--128",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/182591/p117-hua/p117-hua.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/182591/p117-hua/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/182591/p117-hua/",
  abstract =     "It has been demonstrated that {\em simulated
                 annealing\/} provides high-quality results for the data
                 clustering problem. However, existing simulated
                 annealing schemes are memory-based algorithms; they are
                 not suited for solving large problems such as data
                 clustering which typically are too big to fit in the
                 memory space in its entirety. Various buffer
                 replacement policies, assuming either temporal or
                 spatial locality, are not useful in this case since
                 simulated annealing is based on a randomized search
                 process. Poor locality of references will cause the
                 memory to thrash because too many replacements are
                 required. This phenomenon will incur excessive disk
                 accesses and force the machine to run at the speed of
                 the I/O subsystem. In this paper, we formulate the data
                 clustering problem as a {\em graph partition problem\/}
                 (GPP), and propose a decomposition-based approach to
                 address the issue of excessive disk accesses during
                 annealing. We apply the statistical sampling technique
                 to randomly select subgraphs of the GPP into memory for
                 annealing. Both the analytical and experimental studies
                 indicate that the decomposition-based approach can
                 dramatically reduce the costly disk I/O activities
                 while obtaining excellent optimized results.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Theory; Verification",
  keywords =     "ACM; algorithms; computability; database systems;
                 SIGACT; SIGART; SIGMOD; theory; verification",
  subject =      "Mathematics of Computing --- Probability and
                 Statistics (G.3): {\bf Probabilistic algorithms
                 (including Monte Carlo)}; Theory of Computation ---
                 Analysis of Algorithms and Problem Complexity ---
                 Nonnumerical Algorithms and Problems (F.2.2): {\bf
                 Computations on discrete structures}; Information
                 Systems --- Database Management --- Systems (H.2.4);
                 Mathematics of Computing --- Numerical Analysis ---
                 Optimization (G.1.6); Mathematics of Computing ---
                 Discrete Mathematics --- Graph Theory (G.2.2)",
}

@InProceedings{Gravano:1994:EGT,
  author =       "Luis Gravano and H{\'e}ctor Garc{\'\i}a-Molina and
                 Anthony Tomasic",
  title =        "The effectiveness of {GIOSS} for the text database
                 discovery problem",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "126--137",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p126-gravano/p126-gravano.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p126-gravano/",
  abstract =     "The popularity of on-line document databases has led
                 to a new problem: finding which text databases (out of
                 many candidate choices) are the most relevant to a
                 user. Identifying the relevant databases for a given
                 query is the {\em text database discovery problem}. The
                 first part of this paper presents a practical solution
                 based on estimating the result size of a query and a
                 database. The method is termed {\em GlOSS} --- {\em
                 Glossary of Servers Server}. The second part of this
                 paper evaluates the effectiveness of {\em GlOSS\/}
                 based on a trace of real user queries. In addition, we
                 analyze the storage cost of our approach.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Experimentation; Languages; Performance",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Computing
                 Methodologies --- Document and Text Processing ---
                 General (I.7.0); Data --- Files (E.5): {\bf
                 Organization/structure}",
}

@InProceedings{Alonso:1994:RRC,
  author =       "G. Alonso and D. Agrawal and A. {El Abbadi}",
  title =        "Reducing Recovery Constraints on Locking Based
                 Protocols",
  crossref =     "ACM:1994:PPT",
  pages =        "129--138",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/182591/p129-alonso/p129-alonso.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/182591/p129-alonso/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/182591/p129-alonso/",
  abstract =     "Serializability is the standard correctness criterion
                 for concurrency control. To ensure correctness in the
                 presence of failures, recoverability is also imposed.
                 Pragmatic considerations result in further constraints,
                 for instance, the existing log-based recovery
                 implementations that use before-images warrant that
                 transaction executions be strict. Strict executions are
                 restrictive, thus sacrificing concurrency and
                 throughput. In this paper we identify the relation
                 between the recovery mechanism and the restrictions
                 imposed by concurrency control protocols. In
                 particular, we propose a new inverse operation that can
                 be integrated with the underlying recovery mechanism.
                 In order to establish the viability of our approach, we
                 demonstrate the new implementation by making minor
                 modifications to the conventional recovery
                 architecture. This inverse operation is also designed
                 to avoid the undesirable phenomenon of cascading aborts
                 when transactions execute conflicting write
                 operations.",
  acknowledgement = ack-nhfb,
  generalterms = "Performance; Theory",
  keywords =     "ACM; computability; database systems; performance;
                 SIGACT; SIGART; SIGMOD; theory",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Concurrency. {\bf H.2.4} Information Systems,
                 DATABASE MANAGEMENT, Systems, Transaction processing.
                 {\bf H.2.7} Information Systems, DATABASE MANAGEMENT,
                 Database Administration, Logging and recovery.",
}

@InProceedings{Ioannidis:1994:IPE,
  author =       "Yannis E. Ioannidis and Yezdi Lashkari",
  title =        "Incomplete path expressions and their disambiguation",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "138--149",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p138-ioannidis/p138-ioannidis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p138-ioannidis/",
  abstract =     "When we, humans, talk to each other we have no trouble
                 disambiguating what another person means, although our
                 statements are almost never meticulously specified down
                 to very last detail. We ``fill in the gaps'' using our
                 common-sense knowledge about the world. We present a
                 powerful mechanism that allows users of object-oriented
                 database systems to specify certain types of ad-hoc
                 queries in a manner closer to the way we pose questions
                 to each other. Specifically, the system accepts as
                 input queries with incomplete, and therefore ambiguous,
                 path expressions. From them, it generates queries with
                 fully-specified path expressions that are consistent
                 with those given as input and capture what the user
                 most likely meant by them. This is achieved by mapping
                 the problem of path expression disambiguation to an
                 optimal path computation (in the transitive closure
                 sense) over a directed graph that represents the
                 schema. Our method works by exploiting the semantics of
                 the kinds of relationships in the schema and requires
                 no special knowledge about the contents of the
                 underlying database, i.e., it is domain independent. In
                 a limited set of experiments with human subjects, the
                 proposed mechanism was very successful in
                 disambiguating incomplete path expressions.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Experimentation; Languages; Performance",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Information
                 Systems --- Database Management --- Logical Design
                 (H.2.1): {\bf Data models}; Information Systems ---
                 Information Interfaces and Presentation --- User
                 Interfaces (H.5.2): {\bf Interaction styles}; Theory of
                 Computation --- Analysis of Algorithms and Problem
                 Complexity --- Nonnumerical Algorithms and Problems
                 (F.2.2): {\bf Computations on discrete structures};
                 Mathematics of Computing --- Discrete Mathematics ---
                 Graph Theory (G.2.2): {\bf Path and circuit problems}",
}

@InProceedings{Agrawal:1994:RSA,
  author =       "D. Agrawal and J. L. Bruno and A. {El Abbadi} and V.
                 Krishnasawamy",
  title =        "Relative Serializability: An Approach for Relaxing the
                 Atomicity of Transactions",
  crossref =     "ACM:1994:PPT",
  pages =        "139--149",
  year =         "1994",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  keywords =     "ACM; computability; database systems; SIGACT; SIGART;
                 SIGMOD; theory",
}

@InProceedings{Agrawal:1994:RSE,
  author =       "D. Agrawal and J. L. Bruno and A. {El Abbadi} and V.
                 Krishnaswamy",
  title =        "Relative serializability (extended abstract): an
                 approach for relaxing the atomicity of transactions",
  crossref =     "ACM:1994:PPT",
  pages =        "139--149",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/182591/p139-agrawal/p139-agrawal.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/182591/p139-agrawal/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/182591/p139-agrawal/",
  abstract =     "In the presence of semantic information,
                 serializability is too strong a correctness criterion
                 and unnecessarily restricts concurrency. We use the
                 semantic information of a transaction to provide
                 different atomicity views of the transaction to other
                 transactions. The proposed approach improves
                 concurrency and allows interleavings among transactions
                 which are non-serializable, but which nonetheless
                 preserve the consistency of the database and are
                 acceptable to other users. We develop a graph-based
                 tool whose acyclicity is both a necessary and
                 sufficient condition for the correctness of an
                 execution. Our theory encompasses earlier proposals
                 that incorporate semantic information of transactions.
                 Furthermore it is the first approach that provides an
                 efficient graph based tool for recognizing correct
                 schedules without imposing any restrictions on the
                 application domain. Our approach is widely applicable
                 to many advanced database applications such as systems
                 with long-lived transactions and collaborative
                 environments.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Theory; Verification",
  keywords =     "algorithms; theory; verification",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Transaction processing. {\bf H.2.4}
                 Information Systems, DATABASE MANAGEMENT, Systems,
                 Concurrency. {\bf G.2.2} Mathematics of Computing,
                 DISCRETE MATHEMATICS, Graph Theory, Graph algorithms.",
}

@InProceedings{Tannen:1994:TLC,
  author =       "Val Tannen",
  title =        "Tutorial: Languages for Collection Types",
  crossref =     "ACM:1994:PPT",
  pages =        "150--154",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/182591/p150-tannen/p150-tannen.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/182591/p150-tannen/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/182591/p150-tannen/",
  acknowledgement = ack-nhfb,
  generalterms = "Languages; Theory",
  keywords =     "ACM; computability; database systems; languages;
                 SIGACT; SIGART; SIGMOD; theory",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Query languages. {\bf H.2.3} Information
                 Systems, DATABASE MANAGEMENT, Languages, SQL. {\bf
                 F.3.2} Theory of Computation, LOGICS AND MEANINGS OF
                 PROGRAMS, Semantics of Programming Languages, Algebraic
                 approaches to semantics.",
}

@InProceedings{Cole:1994:ODQ,
  author =       "Richard L. Cole and Goetz Graefe",
  title =        "Optimization of dynamic query evaluation plans",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "150--160",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p150-cole/p150-cole.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p150-cole/",
  abstract =     "Traditional query optimizers assume accurate knowledge
                 of run-time parameters such as selectivities and
                 resource availability during plan optimization, i.e.,
                 at compile time. In reality, however, this assumption
                 is often not justified. Therefore, the ``static'' plans
                 produced by traditional optimizers may not be optimal
                 for many of their actual run-time invocations. Instead,
                 we propose a novel optimization model that assigns the
                 bulk of the optimization effort to compile-time and
                 delays carefully selected optimization decisions until
                 run-time. Our previous work defined the run-time
                 primitives, ``dynamic plans'' using ``choose-plan''
                 operators, for executing such delayed decisions, but
                 did not solve the problem of constructing dynamic plans
                 at compile-time. The present paper introduces
                 techniques that solve this problem. Experience with a
                 working prototype optimizer demonstrates (i) that the
                 additional optimization and start-up overhead of
                 dynamic plans compared to static plans is dominated by
                 their advantage at run-time, (ii) that dynamic plans
                 are as robust as the ``brute-force'' remedy of run-time
                 optimization, i.e., dynamic plans maintain their
                 optimality even if parameters change between
                 compile-time and run-time, and (iii) that the start-up
                 overhead of dynamic plans is significantly less than
                 the time required for complete optimization at
                 run-time. In other words, our proposed techniques are
                 superior to both techniques considered to-date, namely
                 compile-time optimization into a single static plan as
                 well as run-time optimization. Finally, we believe that
                 the concepts and technology described can be
                 transferred to commercial query optimizers in order to
                 improve the performance of embedded queries with host
                 variables in the query predicate and to adapt to
                 run-time system loads unpredictable at compile time.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Experimentation; Performance;
                 Verification",
  subject =      "Mathematics of Computing --- Numerical Analysis ---
                 Optimization (G.1.6); Information Systems --- Database
                 Management --- Logical Design (H.2.1): {\bf Data
                 models}; Information Systems --- Database Management
                 --- Systems (H.2.4): {\bf Query processing}",
}

@InProceedings{Libkin:1994:NTS,
  author =       "Leonid Libkin and Limsoon Wong",
  title =        "New Techniques for Studying Set Languages, Bag
                 Languages, and Aggregate Functions",
  crossref =     "ACM:1994:PPT",
  pages =        "155--166",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/182591/p155-libkin/p155-libkin.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/182591/p155-libkin/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/182591/p155-libkin/",
  abstract =     "We provide new techniques for the analysis of the
                 expressive power of query languages for nested
                 collections. These languages may use set or bag
                 semantics and may be further complicated by the
                 presence of aggregate functions. We exhibit certain
                 classes of graphs and prove that the properties of
                 these graphs that can be tested in such languages are
                 either finite or cofinite. This result settles the
                 conjectures of Grumbach, Milo, and Paredaens that
                 parity test, transitive closure, and balanced binary
                 tree test are not expressible in bag languages like the
                 PTIME fragment of BALG of Grumbach and Milo and {\em
                 BQL \/} of Libkin and Wong. Moreover, it implies that
                 many recursive queries, including simple ones like the
                 test for a chain, cannot be expressed in a nested
                 relational language even when aggregate functions are
                 available. In an attempt to generalize the
                 finite-cofiniteness result, we study the bounded degree
                 property which says that the number of distinct in- and
                 out-degrees in the output of a graph query does not
                 depend on the size of the input if the input is
                 ``simple''. We show that such a property implies a
                 number of inexpressibility results in a uniform
                 fashion. We then prove the bounded degree property for
                 the nested relational language.",
  acknowledgement = ack-nhfb,
  generalterms = "Languages; Theory; Verification",
  keywords =     "ACM; computability; database systems; languages;
                 SIGACT; SIGART; SIGMOD; theory; verification",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Query languages. {\bf F.2.2} Theory of
                 Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Nonnumerical Algorithms and Problems,
                 Computations on discrete structures. {\bf G.2.2}
                 Mathematics of Computing, DISCRETE MATHEMATICS, Graph
                 Theory. {\bf F.4.1} Theory of Computation, MATHEMATICAL
                 LOGIC AND FORMAL LANGUAGES, Mathematical Logic.",
}

@InProceedings{Chen:1994:ASE,
  author =       "Chungmin Melvin Chen and Nick Roussopoulos",
  title =        "Adaptive selectivity estimation using query feedback",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "161--172",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p161-chen/p161-chen.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p161-chen/",
  abstract =     "In this paper, we propose a novel approach for
                 estimating the record selectivities of database
                 queries. The real attribute value distribution is
                 adaptively approximated by a curve-fitting function
                 using a query feedback mechanism. This approach has the
                 advantage of requiring no extra database access
                 overhead for gathering statistics and of being able to
                 continuously adapt the value distribution through
                 queries and updates. Experimental results show that the
                 estimation accuracy of this approach is comparable to
                 traditional methods based on statistics gathering.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Experimentation; Performance",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Computing
                 Methodologies --- Symbolic and Algebraic Manipulation
                 --- Languages and Systems (I.1.3): {\bf Maple};
                 Mathematics of Computing --- Numerical Analysis ---
                 Numerical Linear Algebra (G.1.3)",
}

@InProceedings{Suciu:1994:QLN,
  author =       "Dan Suciu and Val Breazu-Tannen",
  title =        "A Query Language for {NC}",
  crossref =     "ACM:1994:PPT",
  pages =        "167--178",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/182591/p167-suciu/p167-suciu.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/182591/p167-suciu/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/182591/p167-suciu/",
  abstract =     "We show that a form of divide and conquer recursion on
                 sets together with the relational algebra expresses
                 exactly the queries over ordered relational databases
                 which are {\em NC\/}-computable. At a finer level, we
                 relate $k$ nested uses of recursion exactly to {\em
                 ACk}, $k \geq 1$. We also give corresponding results
                 for complex objects.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Languages; Theory; Verification",
  keywords =     "ACM; computability; database systems; design;
                 languages; SIGACT; SIGART; SIGMOD; theory;
                 verification",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Query languages. {\bf F.1.2} Theory of
                 Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of
                 Computation, Parallelism and concurrency. {\bf F.2.0}
                 Theory of Computation, ANALYSIS OF ALGORITHMS AND
                 PROBLEM COMPLEXITY, General. {\bf F.1.3} Theory of
                 Computation, COMPUTATION BY ABSTRACT DEVICES,
                 Complexity Measures and Classes.",
}

@InProceedings{Swami:1994:EPF,
  author =       "Arun Swami and K. Bernhard Schiefer",
  title =        "Estimating page fetches for index scans with finite
                 {LRU} buffers",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "173--184",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p173-swami/p173-swami.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p173-swami/",
  abstract =     "We describe an algorithm for estimating the number of
                 page fetches for a partial or complete scan of a B-tree
                 index. The algorithm obtains estimates for the number
                 of page fetches for an index scan when given the number
                 of tuples selected and the number of LRU buffers
                 currently available. The algorithm has an initial phase
                 that is performed exactly once before any estimates are
                 calculated. This initial phase, involving LRU buffer
                 modeling, requires a scan of all the index entries and
                 calculates the number of page fetches for different
                 buffer sizes. An approximate empirical model is
                 obtained from this data. Subsequently, an inexpensive
                 estimation procedure is called by the query optimizer
                 whenever it needs an estimate of the page fetches for
                 the index scan. This procedure utilizes the empirical
                 model obtained in the initial phase.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Experimentation; Performance",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Data --- Data
                 Structures (E.1): {\bf Trees}; Data --- Files (E.5):
                 {\bf Organization/structure}",
}

@InProceedings{Colby:1994:QLL,
  author =       "Latha S. Colby and Edward L. Robertson and Lawrence V.
                 Saxton and Dirk {Van Gucht}",
  title =        "A Query Language for List-Based Complex Objects",
  crossref =     "ACM:1994:PPT",
  pages =        "179--189",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/182591/p179-colby/p179-colby.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/182591/p179-colby/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/182591/p179-colby/",
  abstract =     "We present a language for querying list-based complex
                 objects. The language is shown to express precisely the
                 polynomial-time generic list-object functions. The
                 iteration mechanism of the language is based on a new
                 approach wherein, in addition to the list over which
                 the iteration is performed, a second list is used to
                 control the number of iteration steps. During the
                 iteration, the intermediate results can be moved to the
                 output list as well as reinserted into the list being
                 iterated over. A simple syntactic constraint allows the
                 growth rate of the intermediate results to be tightly
                 controlled which, in turn, restricts the expressiveness
                 of the language to PTIME.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Languages; Theory; Verification",
  keywords =     "ACM; algorithms; computability; database systems;
                 languages; SIGACT; SIGART; SIGMOD; theory;
                 verification",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Query languages. {\bf E.1} Data, DATA
                 STRUCTURES, Lists, stacks, and queues. {\bf D.3.1}
                 Software, PROGRAMMING LANGUAGES, Formal Definitions and
                 Theory, Syntax. {\bf D.3.1} Software, PROGRAMMING
                 LANGUAGES, Formal Definitions and Theory, Semantics.",
}

@InProceedings{Hsiao:1994:PEM,
  author =       "Hui-I. Hsiao and Ming-Syan Chen and Philip S. Yu",
  title =        "On parallel execution of multiple pipelined hash
                 joins",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "185--196",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p185-hsiao/p185-hsiao.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p185-hsiao/",
  abstract =     "In this paper we study parallel execution of multiple
                 pipelined hash joins. Specifically, we deal with two
                 issues, processor allocation and the use of hash
                 filters, to improve parallel execution of hash joins.
                 We first present a scheme to transform a bushy
                 execution tree to an allocation tree, where each node
                 denotes a pipeline. Then, processors are allocated to
                 the nodes in the allocation tree based on the concept
                 of synchronous execution time such that inner relations
                 (i.e., hash tables) in a pipeline can be made available
                 approximately the same time. In addition, the approach
                 of hash filtering is investigated to further improve
                 the overall performance. Performance studies are
                 conducted via simulation to demonstrate the importance
                 of processor allocation and to evaluate various schemes
                 using hash filters. Simulation results indicate that
                 processor allocation based on the allocation tree
                 significantly outperforms that based on the original
                 bushy tree, and that the effect of hash filtering
                 becomes prominent as the number of relations in a query
                 increases.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Performance",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Data --- Data
                 Storage Representations (E.2): {\bf Hash-table
                 representations}; Mathematics of Computing --- Discrete
                 Mathematics --- Graph Theory (G.2.2): {\bf Trees}",
}

@InProceedings{Mumick:1994:UFS,
  author =       "Inderpal Singh Mumick and Oded Shmueli",
  title =        "Universal finiteness and satisfiability (extended
                 abstract)",
  crossref =     "ACM:1994:PPT",
  pages =        "190--200",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/182591/p190-mumick/p190-mumick.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/182591/p190-mumick/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/182591/p190-mumick/",
  abstract =     "The problem of determining whether, for every
                 extensional database, a given predicate in a given
                 program has a finite number of derivations is called
                 the universal finiteness problem. The problem of
                 determining whether a given predicate in a given
                 program has a non-empty extension for some extensional
                 database is called the satisfiability problem. We show
                 that the universal finiteness problem can be reduced to
                 the satisfiability problem. Thus all decidability
                 results for satisfiability can be applied to universal
                 finiteness--for example, we can infer that the
                 universal finiteness problem is decidable for Datalog
                 extended with negation on base predicates. The
                 satisfiability problem can be easily reduced to the
                 universal finiteness problem, so that all
                 undecidability results for satisfiability can be
                 applied to universal finiteness. For example we can
                 infer that the universal finiteness problem is
                 undecidable for Datalog extended with stratified
                 negation. \par

                 Many recursive programs have infinite number of
                 derivations only when ed b relations have data cycles.
                 It is thus of particular interest to study universal
                 finiteness in the presence of acyclicity constraints on
                 the ed b relations. We define acyclicity constraints in
                 terms of non-satisfiability of a specific recursive
                 program. We show that both the problems of universal
                 finiteness and satisfiability of Datalog in the
                 presence of acyclicity constraints (on one or more ed b
                 relations) remain decidable for a language {$L$}
                 whenever the problems are decidable for language {$L$}
                 in absence of such constraints. We also show that the
                 problems are undecidable for arbitrary constraints
                 expressed in terms of non-satisfiability of a recursive
                 program.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Languages; Theory; Verification",
  keywords =     "ACM; algorithms; computability; database systems;
                 languages; SIGACT; SIGART; SIGMOD; theory;
                 verification",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, SQL. {\bf H.2.3} Information Systems,
                 DATABASE MANAGEMENT, Languages, Datalog. {\bf D.3.3}
                 Software, PROGRAMMING LANGUAGES, Language Constructs
                 and Features, Procedures, functions, and subroutines.",
}

@InProceedings{Brinkhoff:1994:MSP,
  author =       "Thomas Brinkhoff and Hans-Peter Kriegel and Ralf
                 Schneider and Bernhard Seeger",
  title =        "Multi-step processing of spatial joins",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "197--208",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p197-brinkhoff/p197-brinkhoff.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p197-brinkhoff/",
  abstract =     "Spatial joins are one of the most important operations
                 for combining spatial objects of several relations. In
                 this paper, spatial join processing is studied in
                 detail for extended spatial objects in two-dimensional
                 data space. We present an approach for spatial join
                 processing that is based on three steps. First, a
                 spatial join is performed on the minimum bounding
                 rectangles of the objects returning a set of
                 candidates. Various approaches for accelerating this
                 step of join processing have been examined at the last
                 year's conference [BKS 93a]. In this paper, we focus on
                 the problem how to compute the answers from the set of
                 candidate which is handled by the following two steps.
                 First of all, sophisticated approximations are used to
                 identify answers as well as to filter out false hits
                 from the set of candidates. For this purpose, we
                 investigate various types of conservative and
                 progressive approximations. In the last step, the exact
                 geometry of the remaining candidates has to be tested
                 against the join predicate. The time required for
                 computing spatial join predicates can essentially be
                 reduced when objects are adequately organized in main
                 memory. In our approach, objects are first decomposed
                 into simple components which are exclusively organized
                 by a main-memory resident spatial data structure.
                 Overall, we present a complete approach of spatial join
                 processing on complex spatial objects. The performance
                 of the individual steps of our approach is evaluated
                 with data sets from real cartographic applications. The
                 results show that our approach reduces the total
                 execution time of the spatial join by factors.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Performance",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Theory of
                 Computation --- Analysis of Algorithms and Problem
                 Complexity --- Nonnumerical Algorithms and Problems
                 (F.2.2): {\bf Sorting and searching}; Theory of
                 Computation --- Analysis of Algorithms and Problem
                 Complexity --- Nonnumerical Algorithms and Problems
                 (F.2.2): {\bf Geometrical problems and computations};
                 Data --- Data Structures (E.1): {\bf Trees}",
}

@InProceedings{Suciu:1994:ACO,
  author =       "Dan Suciu and Jan Paredaens",
  title =        "Any Algorithm in the Complex Object Algebra with
                 Powerset Needs Exponential Space to Compute Transitive
                 Closure",
  crossref =     "ACM:1994:PPT",
  pages =        "201--209",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/182591/p201-suciu/p201-suciu.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/182591/p201-suciu/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/182591/p201-suciu/",
  abstract =     "The Abiteboul and Beeri algebra for complex objects
                 can express a query whose meaning is transitive
                 closure, but the algorithm is naturally associated to
                 this query needs exponential space. We show that any
                 other query in the algebra which expresses transitive
                 closure needs exponential space. This proves that in
                 general the powerset is an intractable operator for
                 implementing fixpoint queries.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Languages; Theory; Verification",
  keywords =     "ACM; algorithms; computability; database systems;
                 languages; SIGACT; SIGART; SIGMOD; theory;
                 verification",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing. {\bf H.2.3} Information
                 Systems, DATABASE MANAGEMENT, Languages. {\bf H.2.1}
                 Information Systems, DATABASE MANAGEMENT, Logical
                 Design.",
}

@InProceedings{Lo:1994:SJU,
  author =       "Ming-Ling Lo and Chinya V. Ravishankar",
  title =        "Spatial joins using seeded trees",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "209--220",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p209-lo/p209-lo.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p209-lo/",
  abstract =     "Existing methods for spatial joins assume the
                 existence of indices for the participating data sets.
                 This assumption is not realistic for applications
                 involving multiple map layer overlays or for queries
                 involving non-spatial selections. In this paper, we
                 explore a spatial join method that dynamically
                 constructs index trees called {\em seeded trees\/} at
                 join time. This methods uses knowledge of the data sets
                 involved in the join process. \par

                 Seeded trees are R-tree like structures, and are
                 divided into the {\em seed levels\/} and the {\em grown
                 levels}. The nodes in the seed levels are used to guide
                 tree growth during tree construction. The seed levels
                 can also be used to filter out some input data during
                 construction, thereby reducing tree size. We develop a
                 technique that uses intermediate linked lists during
                 tree construction and significantly speeds up the tree
                 construction process. The technique allows a large
                 number of random disk accesses during tree construction
                 to be replaced by smaller numbers of sequential
                 accesses. \par

                 Our performance studies show that spatial joins using
                 seeded trees outperform those using other methods
                 significantly in terms of disk I/O. The CPU penalties
                 incurred are also lower except when seed-level
                 filtering is used.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Experimentation; Performance",
  subject =      "Information Systems --- Database Management ---
                 Logical Design (H.2.1): {\bf Data models}; Information
                 Systems --- Database Management --- Systems (H.2.4);
                 Data --- Data Structures (E.1): {\bf Trees}; Data ---
                 Files (E.5): {\bf Organization/structure}",
}

@InProceedings{Patnaik:1994:DFP,
  author =       "Sushant Patnaik and Neil Immerman",
  title =        "{Dyn-FO}: a Parallel, Dynamic Complexity Class",
  crossref =     "ACM:1994:PPT",
  pages =        "210--221",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/182591/p210-patnaik/p210-patnaik.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/182591/p210-patnaik/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/182591/p210-patnaik/",
  abstract =     "Traditionally, computational complexity has considered
                 only static problems. Classical Complexity Classes such
                 as NC, P, NP, and PSPACE are defined in terms of the
                 complexity of checking--upon presentation of an entire
                 input--whether the input satisfies a certain property.
                 \par

                 For many, if not most, applications of computers
                 including: databases, text editors, program
                 development, it is more appropriate to model the
                 process as a dynamic one. There is a fairly large
                 object being worked on over a period of time. The
                 object is repeatedly modified by users and computations
                 are performed. \par

                 Thus a dynamic algorithm for a certain class of queries
                 is one that can maintain an input object, e.g., a
                 database, and process changes to the database as well
                 as answering queries about the current database.
                 \par

                 Here, we introduce the complexity class, Dynamic
                 First-Order Logic (Dyn-FO). This is the class of
                 properties S, for which there is an algorithm that can
                 perform inserts, deletes and queries from S, such that
                 each unit insert, delete, or query is first-order
                 computable. This corresponds to the sets of properties
                 that can be maintained and queried in first-order
                 logic, i.e., relational calculus, on a relational
                 database. \par

                 We investigate the complexity class Dyn-FO. We show
                 that many interesting properties are in Dyn-FO
                 including, among others, graph connectivity, k-edge
                 connectivity, and the computation of minimum spanning
                 trees. Furthermore, we show that several NP complete
                 optimization problems admit approximation algorithms in
                 Dyn-FO. Note that none of these problems is in static
                 FO, and this fact has been used to justify increasing
                 the power of query languages beyond first-order. It is
                 thus striking that these problems are indeed dynamic
                 first-order, and thus, were computable in first-order
                 database languages all along. \par

                 We also define ``bounded expansion reductions'' which
                 honor dynamic complexity classes. We prove that certain
                 standard complete problems for static complexity
                 classes, such as AGAP for P remain complete via these
                 new reductions. On the other hand, we prove that other
                 such problems including GAP for NL and 1GAP for L are
                 no longer complete via bounded expansion reductions.
                 Furthermore, we show that a version of AGAP called
                 AGAP+ is not in Dyn-FO unless all of P is contained in
                 parallel linear time. \par

                 Our results shed light on some of the interesting
                 differences between static and dynamic complexity.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Theory; Verification",
  keywords =     "ACM; algorithms; computability; database systems;
                 SIGACT; SIGART; SIGMOD; theory; verification",
  subject =      "{\bf F.1.3} Theory of Computation, COMPUTATION BY
                 ABSTRACT DEVICES, Complexity Measures and Classes,
                 Reducibility and completeness. {\bf H.2.4} Information
                 Systems, DATABASE MANAGEMENT, Systems, Query
                 processing. {\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, Lambda calculus and
                 related systems.",
  xxtitle =      "{Dyn-FO} (preliminary version): a parallel, dynamic
                 complexity class",
}

@InProceedings{Pang:1994:MMR,
  author =       "Hwee Hwa Pang and Michael J. Carey and Miron Livny",
  title =        "Managing memory for real-time queries",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "221--232",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p221-pang/p221-pang.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p221-pang/",
  abstract =     "The demanding performance objectives that real-time
                 database systems (RTDBS) face necessitate the use of
                 priority resource scheduling. This paper introduces a
                 {\em Priority Memory Management\/} (PMM) algorithm that
                 is designed to schedule queries in RTDBS. PMM attempts
                 to minimize the number of missed deadlines by adapting
                 both its multiprogramming level and its memory
                 allocation strategy to the characteristics of the
                 offered workload. A series of simulation experiments
                 confirms that PMM's admission control and memory
                 allocation mechanisms are very effective for real-time
                 query scheduling.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Experimentation; Performance",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Theory of
                 Computation --- Analysis of Algorithms and Problem
                 Complexity --- Nonnumerical Algorithms and Problems
                 (F.2.2): {\bf Sequencing and scheduling}; Computing
                 Methodologies --- Simulation and Modeling ---
                 Applications (I.6.3)",
}

@InProceedings{Hillebrand:1994:FDQ,
  author =       "Gerd G. Hillebrand and Paris C. Kanellakis",
  title =        "Functional database query languages as typed lambda
                 calculi of fixed order (extended abstract)",
  crossref =     "ACM:1994:PPT",
  pages =        "222--231",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/182591/p222-hillebrand/p222-hillebrand.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/182591/p222-hillebrand/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/182591/p222-hillebrand/",
  abstract =     "We present a functional framework for database query
                 languages, which is analogous to the conventional
                 logical framework of first-order and fixpoint formulas
                 over finite structures. We use atomic constants of
                 order 0, equality among these constants, variables,
                 application, lambda abstraction, and {\em let\/}
                 abstraction; all typed using fixed order {\$ TLI=i \/}
                 or simply-typed list iteration of order $i$+3 with
                 equality, and {\em MLI=i \/} or ML-typed list iteration
                 of order $i$+3 with equality; we use $i$+3 since our
                 list representation of databases requires at least
                 order 3. We show that: FO-queries {\em \&sube;TLI=0 \/}
                 {\em \&sube;MLI=0 \/} {\em \&sube;LOGSPACE-queries \/}
                 {\em \&sube;TLI=1 \/} {\em =MLI=1 \/} = PTIME-queries
                 {\em \&sube; \/} TLI2, where equality is no longer a
                 primitive in TLI2. We also show that ML type inference,
                 restricted to fixed order, is polynomial in the size of
                 the program typed. Since programming by using low order
                 functionalities and type inference is common in
                 functional languages, our results indicate that such
                 programs suffice for expressing efficient computations
                 and that their ML-types can be efficiently inferred.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Languages; Theory; Verification",
  keywords =     "ACM; algorithms; computability; database systems;
                 languages; SIGACT; SIGART; SIGMOD; theory;
                 verification",
  subject =      "{\bf F.1.3} Theory of Computation, COMPUTATION BY
                 ABSTRACT DEVICES, Complexity Measures and Classes,
                 Reducibility and completeness. {\bf H.2.4} Information
                 Systems, DATABASE MANAGEMENT, Systems, Query
                 processing. {\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, Lambda calculus and
                 related systems.",
}

@InProceedings{Mendelzon:1994:OM,
  author =       "Alberto O. Mendelzon and Tova Milo and Emmanuel
                 Waller",
  title =        "Object Migration",
  crossref =     "ACM:1994:PPT",
  pages =        "232--242",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/182591/p232-mendelzon/p232-mendelzon.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/182591/p232-mendelzon/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/182591/p232-mendelzon/",
  abstract =     "We study a mechanism that supports the migration of
                 objects from one class of an OODB to another, thereby
                 enabling us to model the same object playing different
                 roles throughout its lifetime. Object migration may
                 introduce typing conflicts due to the different typing
                 constraints imposed by the classes. We present a
                 coercion-like adaptation process that automatically
                 resolves these conflicts. The process combines
                 re-classification of objects and modification of
                 attributes. We study the computational complexity of
                 the problem, and show that the adaptation process can
                 be performed efficiently in databases with covariant
                 schemas.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Languages; Theory",
  keywords =     "ACM; algorithms; computability; database systems;
                 design; languages; SIGACT; SIGART; SIGMOD; theory",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems. {\bf F.1.3} Theory of Computation, COMPUTATION
                 BY ABSTRACT DEVICES, Complexity Measures and Classes.
                 {\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Data models. {\bf D.3.2} Software,
                 PROGRAMMING LANGUAGES, Language Classifications, C.",
}

@InProceedings{Nyberg:1994:ARM,
  author =       "Chris Nyberg and Tom Barclay and Zarka Cvetanovic and
                 Jim Gray and Dave Lomet",
  title =        "{AlphaSort}: a {RISC} machine sort",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "233--242",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p233-nyberg/p233-nyberg.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p233-nyberg/",
  abstract =     "A new sort algorithm, called AlphaSort, demonstrates
                 that commodity processors and disks can handle
                 commercial batch workloads. Using Alpha AXP processors,
                 commodity memory, and arrays of SCSI disks, AlphaSort
                 runs the industry-standard sort benchmark in seven
                 seconds. This beats the best published record on a
                 32-cpu 32-disk Hypercube by 8:1. On another benchmark,
                 AlphaSort sorted more than a gigabyte in a minute.
                 \par

                 AlphaSort is a cache-sensitive memory-intensive sort
                 algorithm. It uses file striping to get high disk
                 bandwidth. It uses QuickSort to generate runs and uses
                 replacement-selection to merge the runs. It uses shared
                 memory multiprocessors to break the sort into subsort
                 chores. \par

                 Because startup times are becoming a significant part
                 of the total time, we propose two new benchmarks: (1)
                 Minutesort: how much can you sort in a minute, and (2)
                 DollarSort: how much can you sort for a dollar.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Measurement; Performance",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Transaction processing}; Theory
                 of Computation --- Analysis of Algorithms and Problem
                 Complexity --- Nonnumerical Algorithms and Problems
                 (F.2.2): {\bf Sorting and searching}; Mathematics of
                 Computing --- Discrete Mathematics --- Graph Theory
                 (G.2.2): {\bf Trees}",
}

@InProceedings{Gray:1994:QGB,
  author =       "Jim Gray and Prakash Sundaresan and Susanne Englert
                 and Ken Baclawski and Peter J. Weinberger",
  title =        "Quickly generating billion-record synthetic
                 databases",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "243--252",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p243-gray/p243-gray.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p243-gray/",
  abstract =     "Evaluating database system performance often requires
                 generating synthetic databases--ones having certain
                 statistical properties but filled with dummy
                 information. When evaluating different database
                 designs, it is often necessary to generate several
                 databases and evaluate each design. As database sizes
                 grow to terabytes, generation often takes longer than
                 evaluation. This paper presents several database
                 generation techniques. In particular it discusses: (1)
                 Parallelism to get generation speedup and scaleup. (2)
                 Congruential generators to get dense unique uniform
                 distributions. (3) Special-case discrete logarithms to
                 generate indices concurrent to the base table
                 generation. (4) Modification of (2) to get exponential,
                 normal, and self-similar distributions. \par

                 The discussion is in terms of generating billion-record
                 SQL databases using C programs running on a
                 shared-nothing computer system consisting of a hundred
                 processors, with a thousand discs. The ideas apply to
                 smaller databases, but large databases present the more
                 difficult problems.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Performance",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Concurrency}; Information Systems
                 --- Database Management --- Physical Design (H.2.2);
                 Information Systems --- Database Management --- Logical
                 Design (H.2.1); Mathematics of Computing --- Numerical
                 Analysis --- General (G.1.0): {\bf Parallel
                 algorithms}; Data --- Data Structures (E.1): {\bf
                 Trees}",
}

@InProceedings{Calvanese:1994:MOO,
  author =       "Diego Calvanese and Maurizio Lenzerini",
  title =        "Making Object-Oriented Schemas More Expressive",
  crossref =     "ACM:1994:PPT",
  pages =        "243--254",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/182591/p243-calvanese/p243-calvanese.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/182591/p243-calvanese/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/182591/p243-calvanese/",
  abstract =     "Current object-oriented data models lack several
                 important features that would allow one to express
                 relevant knowledge about the classes of schema. In
                 particular, there is no data model supporting
                 simultaneously the inverse of the functions represented
                 by attributes, the union, the intersection and the
                 complement of classes, the possibility of using
                 nonbinary relations, and the possibility of expressing
                 cardinality constraints on attributes and relations. In
                 this paper we define a new data model, called {\em
                 CAR}, which extends the basic core of current
                 object-oriented data models with all the above
                 mentioned features. A technique is then presented both
                 for checking the consistency of class definitions, and
                 for computing the logical sequences of the knowledge
                 represented in the schema. Finally, the inherent
                 complexity of reasoning in {\em CAR\/} is investigated,
                 and the complexity of our inferencing technique is
                 studied, depending on various assumptions on the
                 schema.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Theory; Verification",
  keywords =     "ACM; algorithms; computability; database systems;
                 SIGACT; SIGART; SIGMOD; theory; verification",
  subject =      "Information Systems --- Database Management ---
                 Logical Design (H.2.1): {\bf Data models}; Information
                 Systems --- Database Management --- Systems (H.2.4);
                 Theory of Computation --- Computation by Abstract
                 Devices --- Complexity Measures and Classes (F.1.3)",
}

@InProceedings{Vingralek:1994:DFO,
  author =       "Radek Vingralek and Yuri Breitbart and Gerhard
                 Weikum",
  title =        "Distributed file organization with scalable cost\slash
                 performance",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "253--264",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p253-vingralek/p253-vingralek.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p253-vingralek/",
  abstract =     "This paper presents a distributed file organization
                 for record-structured, disk-resident files with
                 key-based exact-match access. The file is organized
                 into buckets that are spread across multiple servers,
                 where a server may hold multiple buckets. Client
                 requests are serviced by mapping keys onto buckets and
                 looking up the corresponding server in an address
                 table. Dynamic growth in terms of file size and access
                 load is supported by bucket splits and migration onto
                 other existing or newly acquired servers. \par

                 The significant and challenging problem addressed here
                 is how to achieve scalability so that both the file
                 size and the client throughput can be scaled up by
                 linearly increasing the number of servers and
                 dynamically redistributing data. Unlike previous work
                 with similar objectives, our data redistribution
                 considers explicitly the cost/performance ratio of the
                 system by aiming to minimize the number of servers that
                 are acquired to provide the required performance. A new
                 server is acquired only if the overall server
                 utilization in the system does not drop below a
                 specified threshold. Preliminary simulation results
                 show that the goal of scalability with controlled
                 cost/performance is indeed achieved to a large
                 extent.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Experimentation; Performance",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Distributed databases}; Data ---
                 Files (E.5): {\bf Organization/structure}; Data ---
                 Data Storage Representations (E.2): {\bf Hash-table
                 representations}",
}

@InProceedings{Ohori:1994:PCV,
  author =       "Atsushi Ohori and Keishi Tajima",
  title =        "A polymorphic calculus for views and object sharing
                 (extended abstract)",
  crossref =     "ACM:1994:PPT",
  pages =        "255--266",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/182591/p255-ohori/p255-ohori.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/182591/p255-ohori/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/182591/p255-ohori/",
  abstract =     "We present a typed polymorphic calculus that supports
                 a general mechanism for view definition and object
                 sharing among classes. In this calculus, a class can
                 contain inclusion specifications of objects from other
                 classes. Each such specification consists of a {\em
                 predicate\/} determining the subset of objects to be
                 included and a {\em viewing function\/} under which
                 those included objects are manipulated. Both predicates
                 and viewing functions can be any type consistent
                 programs definable in the polymorphic calculus.
                 Inclusion specifications among classes can be cyclic,
                 allowing mutually recursive class definitions. These
                 features achieve flexible view definitions and wide
                 range of class organizations in a compact and elegant
                 way. Moreover, the calculus provides a suitable set of
                 operations for views and classes so that the programmer
                 can manipulate views and classes just the same way as
                 one deals with ordinary records and sets. \par

                 The proposed calculus uniformly integrates views and
                 classes in a polymorphic type system of a database
                 programming language similar to Machiavelli. The
                 calculus has a {\em type inference algorithm\/} that
                 relieves the programmer from complicated type
                 declarations of views and classes. The polymorphic type
                 system of the calculus is also shown to be sound, which
                 guarantees complete static check of type consistency of
                 programs involving classes and views. Through these
                 properties, the programmer can enjoy full advantages of
                 polymorphism and type inference when writing
                 object-oriented database programs.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Languages; Verification",
  keywords =     "ACM; algorithms; computability; database systems;
                 languages; SIGACT; SIGART; SIGMOD; theory;
                 verification",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages. {\bf D.3.2} Software, PROGRAMMING LANGUAGES,
                 Language Classifications, Object-oriented languages.
                 {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS
                 OF PROGRAMS, Studies of Program Constructs, Type
                 structure. {\bf F.3.3} Theory of Computation, LOGICS
                 AND MEANINGS OF PROGRAMS, Studies of Program
                 Constructs, Functional constructs.",
}

@InProceedings{Kroll:1994:DST,
  author =       "Brigitte Kr{\"o}ll and Peter Widmayer",
  title =        "Distributing a search tree among a growing number of
                 processors",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "265--276",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p265-kroll/p265-kroll.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p265-kroll/",
  abstract =     "Databases are growing steadily, and distributed
                 computer systems are more and more easily available.
                 This provides an opportunity to satisfy the
                 increasingly tighter efficiency requirements by means
                 of distributed data structures. The design and analysis
                 of these structures under efficiency aspects, however,
                 has not yet been studied sufficiently. To our
                 knowledge, a single scalable, distributed data
                 structure has been proposed so far. It is a distributed
                 variant of linear hashing with uncontrolled splits,
                 and, as a consequence, performs efficiently for data
                 distributions that are close to uniform, but not
                 necessarily for others. In addition, it does not
                 support queries that refer to the linear order of keys,
                 such as nearest neighbor or range queries. We propose a
                 distributed search tree that avoids these problems,
                 since it inherits desirable properties from
                 non-distributed trees. Our experiments show that our
                 structure does indeed combine a guarantee for good
                 storage space utilization with high query efficiency.
                 Nevertheless, we feel that further research in the area
                 of scalable, distributed data structures is dearly
                 needed; it should eventually lead to a body of
                 knowledge that is comparable with the non-distributed,
                 classical data structures field.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Experimentation",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Distributed databases};
                 Mathematics of Computing --- Discrete Mathematics ---
                 Graph Theory (G.2.2): {\bf Trees}; Theory of
                 Computation --- Analysis of Algorithms and Problem
                 Complexity --- Nonnumerical Algorithms and Problems
                 (F.2.2): {\bf Computations on discrete structures};
                 Data --- Data Structures (E.1): {\bf Trees}",
}

@InProceedings{Eiter:1994:ADD,
  author =       "Thomas Eiter and Georg Gottlob and Heikki Mannila",
  title =        "Adding disjunction to datalog (extended abstract)",
  crossref =     "ACM:1994:PPT",
  pages =        "267--278",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/182591/p267-eiter/p267-eiter.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/182591/p267-eiter/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/182591/p267-eiter/",
  abstract =     "We study the expressive power and complexity of
                 disjunctive datalog, i.e., datalog with disjunctive
                 rule heads, under three different semantics: the
                 minimal model semantics, the perfect models semantics,
                 and the stable model semantics. We show that the brave
                 variants of these semantics express the same set of
                 queries. In fact, they precisely capture the complexity
                 of class $\Sigma P/2$. The combined complexity of
                 disjunctive datalog is shown to be NEXPTIME
                 NP-complete.",
  acknowledgement = ack-nhfb,
  generalterms = "Languages; Theory; Verification",
  keywords =     "ACM; computability; database systems; languages;
                 SIGACT; SIGART; SIGMOD; theory; verification",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Datalog. {\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 F.2.2} Theory of
                 Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Nonnumerical Algorithms and Problems,
                 Computations on discrete structures. {\bf H.2.1}
                 Information Systems, DATABASE MANAGEMENT, Logical
                 Design, Normal forms.",
}

@InProceedings{Dewan:1994:PDL,
  author =       "Hasanat M. Dewan and Salvatore J. Stolfo and Mauricio
                 Hern{\'a}ndez and Jae-Jun Hwang",
  title =        "Predictive dynamic load balancing of parallel and
                 distributed rule and query processing",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "277--288",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p277-dewan/p277-dewan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p277-dewan/",
  abstract =     "Expert Databases are environments that support the
                 processing of rule programs against a disk resident
                 database. They occupy a position intermediate between
                 active and deductive databases, with respect to the
                 level of abstraction of the underlying rule language.
                 The operational semantics of the rule language
                 influences the problem solving strategy, while the
                 architecture of the processing environment determines
                 efficiency and scalability. \par

                 In this paper, we present elements of the PARADISER
                 architecture and its kernel rule language, PARULEL. The
                 PARADISER environment provides support for parallel and
                 distributed evaluation of rule programs, as well as
                 static and dynamic load balancing protocols that
                 predictively balance a computation at runtime. This
                 combination of features results in a scalable database
                 rule and complex query processing architecture. We
                 validate our claims by analyzing the performance of the
                 system for two realistic test cases. In particular, we
                 show how the performance of a parallel implementation
                 of transitive closure is significantly improved by
                 predictive dynamic load balancing.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Languages; Performance; Verification",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Distributed databases};
                 Information Systems --- Database Management --- Systems
                 (H.2.4): {\bf Query processing}; Software ---
                 Programming Languages --- Formal Definitions and Theory
                 (D.3.1): {\bf Syntax}; Theory of Computation ---
                 Analysis of Algorithms and Problem Complexity ---
                 Nonnumerical Algorithms and Problems (F.2.2): {\bf
                 Computations on discrete structures}; Mathematics of
                 Computing --- Discrete Mathematics --- Graph Theory
                 (G.2.2): {\bf Path and circuit problems}; Theory of
                 Computation --- Logics and Meanings of Programs ---
                 Semantics of Programming Languages (F.3.2): {\bf
                 Operational semantics}",
}

@InProceedings{Paredaens:1994:TTS,
  author =       "Jan Paredaens and Jan {Van den Bussche} and Dirk {Van
                 Gucht}",
  title =        "Towards a theory of spatial database queries (extended
                 abstract)",
  crossref =     "ACM:1994:PPT",
  pages =        "279--288",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/182591/p279-paredaens/p279-paredaens.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/182591/p279-paredaens/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/182591/p279-paredaens/",
  abstract =     "A general model for spatial databases is considered,
                 which extends the relational model by allowing as tuple
                 components not only atomic values but also geometrical
                 figures. The model, which is inspired by the work of
                 Kanellakis, Kuper and Revesz on constraint query
                 languages, includes a calculus and an algebra which are
                 equivalent. Given this framework, the concept of
                 spatial database query is investigated. Thereto,
                 Chandra and Harel's well-known consistency criterion
                 for classical relational queries is adapted. Various
                 adaptations are proposed, depending on the kinds of
                 geometry in which the spatial information in the
                 database is to be interpreted. The consistency problem
                 for calculus queries is studied. Expressiveness issues
                 are examined. The main purpose of the paper is to open
                 up new grounds for theoretical research in the area of
                 spatial database systems. Consequently, many open
                 problems are indicated.",
  acknowledgement = ack-nhfb,
  generalterms = "Languages; Theory; Verification",
  keywords =     "ACM; computability; database systems; languages;
                 SIGACT; SIGART; SIGMOD; theory; verification",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing. {\bf H.2.1} Information
                 Systems, DATABASE MANAGEMENT, Logical Design, Data
                 models. {\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.",
}

@InProceedings{Grumbach:1994:FRD,
  author =       "St{\'e}phane Grumbach and Jianwen Su",
  title =        "Finitely representable databases (extended abstract)",
  crossref =     "ACM:1994:PPT",
  pages =        "289--300",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/182591/p289-grumbach/p289-grumbach.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/182591/p289-grumbach/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/182591/p289-grumbach/",
  abstract =     "We study classes of infinite but finitely
                 representable databases based on constraints, motivated
                 by new database applications such as geographical
                 databases. The mathematical framework is based on
                 classical decidable first-order theories. We
                 investigate the theory of finitely representable models
                 and prove that it differs strongly from both classical
                 model theory and finite model theory. In particular, we
                 show that most of the well known theorems of either one
                 fail (compactness, completeness, locality, 0/1 laws,
                 etc.). An immediate consequence is the lack of tools to
                 consider the definability of queries in the relational
                 calculus over finitely representable databases. We
                 illustrate this very challenging problem through some
                 classical examples.",
  acknowledgement = ack-nhfb,
  generalterms = "Languages; Theory; Verification",
  keywords =     "ACM; computability; database systems; languages;
                 SIGACT; SIGART; SIGMOD; theory; verification",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing. {\bf H.2.3} Information
                 Systems, DATABASE MANAGEMENT, Languages, Query
                 languages. {\bf F.2.2} Theory of Computation, ANALYSIS
                 OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems, Computations on discrete
                 structures. {\bf H.2.1} Information Systems, DATABASE
                 MANAGEMENT, Logical Design, Data models. {\bf F.4.1}
                 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL
                 LANGUAGES, Mathematical Logic.",
}

@InProceedings{Tomasic:1994:IUI,
  author =       "Anthony Tomasic and H{\'e}ctor Garc{\'\i}a-Molina and
                 Kurt Shoens",
  title =        "Incremental updates of inverted lists for text
                 document retrieval",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "289--300",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p289-tomasic/p289-tomasic.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p289-tomasic/",
  abstract =     "With the proliferation of the world's ``information
                 highways'' a renewed interest in efficient document
                 indexing techniques has come about. In this paper, the
                 problem of incremental updates of inverted lists is
                 addressed using a new dual-structure index. The index
                 dynamically separates long and short inverted lists and
                 optimizes retrieval, update, and storage of each type
                 of list. To study the behavior of the index, a space of
                 engineering trade-offs which range from optimizing
                 update time to optimizing query performance is
                 described. We quantitatively explore this space by
                 using actual data and hardware in combination with a
                 simulation of an information retrieval system. We then
                 describe the best algorithm for a variety of
                 criteria.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Documentation; Experimentation;
                 Performance",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Information
                 Systems --- Information Storage and Retrieval ---
                 Content Analysis and Indexing (H.3.1): {\bf Indexing
                 methods}; Data --- Data Structures (E.1): {\bf Lists,
                 stacks, and queues}",
}

@InProceedings{Gonnet:1994:TDD,
  author =       "Gaston H. Gonnet",
  title =        "Text dominated databases, theory practice and
                 experience (abstract)",
  crossref =     "ACM:1994:PPT",
  pages =        "301--302",
  year =         "1994",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/182591/p301-gonnet/p301-gonnet.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/182591/p301-gonnet/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/182591/p301-gonnet/",
  acknowledgement = ack-nhfb,
  keywords =     "languages; theory",
  subject =      "{\bf H.2.8} Information Systems, DATABASE MANAGEMENT,
                 Database Applications. {\bf I.7.0} Computing
                 Methodologies, DOCUMENT AND TEXT PROCESSING, General.
                 {\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Data models. {\bf H.3.3} Information
                 Systems, INFORMATION STORAGE AND RETRIEVAL, Information
                 Search and Retrieval, Search process.",
}

@InProceedings{Gonnet:1994:TTD,
  author =       "G. H. Gonnet",
  title =        "Tutorial: Text Dominated Databases, Theory Practice
                 and Experience",
  crossref =     "ACM:1994:PPT",
  pages =        "301--302",
  year =         "1994",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  keywords =     "ACM; computability; database systems; SIGACT; SIGART;
                 SIGMOD; theory",
}

@InProceedings{Consens:1994:OQF,
  author =       "Mariano P. Consens and Tova Milo",
  title =        "Optimizing queries on files",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "301--312",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p301-consens/p301-consens.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p301-consens/",
  abstract =     "We present a framework which allows the user to access
                 and manipulate data uniformly, regardless of whether it
                 resides in a database or in the file system (or in
                 both). A key issue is the performance of the system. We
                 show that text indexing, combined with newly developed
                 optimization techniques, can be used to provide an
                 efficient high level interface to information stored in
                 files. Furthermore, using these techniques, some
                 queries can be evaluated significantly faster than in
                 standard database implementations. We also study the
                 tradeoff between efficiency and the amount of
                 indexing.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Performance; Theory",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Data --- Files
                 (E.5): {\bf Optimization**}; Data --- Data Structures
                 (E.1): {\bf Trees}; Information Systems --- Information
                 Storage and Retrieval --- Content Analysis and Indexing
                 (H.3.1): {\bf Indexing methods}; Computing
                 Methodologies --- Symbolic and Algebraic Manipulation
                 --- General (I.1.0)",
}

@InProceedings{Grahne:1994:RAS,
  author =       "G{\"o}sta Grahne and Matti Nyk{\"a}nen and Esko
                 Ukkonen",
  title =        "Reasoning about Strings in Databases",
  crossref =     "ACM:1994:PPT",
  pages =        "303--312",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/182591/p303-grahne/p303-grahne.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/182591/p303-grahne/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/182591/p303-grahne/",
  abstract =     "In order to enable the database programmer to reason
                 about relations over strings of arbitrary length we
                 introduce alignment logic, a modal extension of
                 relational calculus. In addition to relations, a state
                 in the model consists of a two-dimensional array where
                 the strings are aligned on top of each other. The basic
                 modality in the language (a transpose, or ``slide'')
                 allows for a rearrangement of the alignment, and more
                 complex formulas can be formed using a syntax
                 reminiscent of regular expressions, in addition to the
                 usual connectives and quantifiers. It turns out that
                 the computational counterpart of the string-based
                 portion of the logic is the class of multitape two-way
                 finite state automata, which are devices particularly
                 well suited for the implementation of string matching.
                 A computational counterpart of the full logic is
                 obtained from relational algebra by extending the
                 selection operator into filters based on these
                 multitape machines. Safety of formulas in alignment
                 logic implies that new strings generated from old ones
                 have to be of bounded length. While an undecidable
                 property in general, this boundedness is decidable for
                 an important subclass of formulas. As far as expressive
                 power is concerned, alignment logic includes previous
                 proposals for querying string databases, and gives full
                 Turing computability. The language can be restricted to
                 define exactly regular sets and sets in the polynomial
                 hierarchy.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Languages; Theory",
  keywords =     "ACM; algorithms; computability; database systems;
                 design; languages; SIGACT; SIGART; SIGMOD; theory",
  subject =      "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Data models. {\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. {\bf H.2.4} Information Systems, DATABASE
                 MANAGEMENT, Systems, Query processing.",
}

@InProceedings{Christophides:1994:SDN,
  author =       "V. Christophides and S. Abiteboul and S. Cluet and M.
                 Scholl",
  title =        "From structured documents to novel query facilities",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "313--324",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p313-christophides/p313-christophides.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p313-christophides/",
  abstract =     "Structured documents (e.g., SGML) can benefit a lot
                 from database support and more specifically from
                 object-oriented database (OODB) management systems.
                 This paper describes a natural mapping from SGML
                 documents into OODB's and a formal extension of two
                 OODB query languages (one SQL-like and the other
                 calculus) in order to deal with SGML document
                 retrieval. \par

                 Although motivated by structured documents, the
                 extensions of query languages that we present are
                 general and useful for a variety of other OODB
                 applications. A key element is the introduction of
                 paths as first class citizens. The new features allow
                 to query data (and to some extent schema) without exact
                 knowledge of the schema in a simple and homogeneous
                 fashion.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Languages",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Information
                 Systems --- Database Management --- Languages (H.2.3):
                 {\bf Query languages}; Theory of Computation ---
                 Analysis of Algorithms and Problem Complexity ---
                 Nonnumerical Algorithms and Problems (F.2.2): {\bf
                 Sorting and searching}; Data --- Files (E.5): {\bf
                 Organization/structure}",
}

@InProceedings{Hellerstein:1994:PPP,
  author =       "Joseph M. Hellerstein",
  title =        "Practical predicate placement",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "325--335",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p325-hellerstein/p325-hellerstein.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p325-hellerstein/",
  abstract =     "Recent work in query optimization has addressed the
                 issue of placing expensive predicates in a query plan.
                 In this paper we explore the predicate placement
                 options considered in the Montage DBMS, presenting a
                 family of algorithms that form successively more
                 complex and effective optimization solutions. Through
                 analysis and performance measurements of Montage SQL
                 queries, we classify queries and highlight the simplest
                 solution that will optimize each class correctly. We
                 demonstrate limitations of previously published
                 algorithms, and discuss the challenges and feasibility
                 of implementing the various algorithms in a
                 commercial-grade system.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Languages; Performance; Theory",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Information
                 Systems --- Database Management --- Languages (H.2.3):
                 {\bf Query languages}; Data --- Files (E.5): {\bf
                 Organization/structure}; Mathematics of Computing ---
                 Numerical Analysis --- Optimization (G.1.6)",
}

@InProceedings{Kemper:1994:ODQ,
  author =       "A. Kemper and G. Moerkotte and K. Peithner and M.
                 Steinbrunn",
  title =        "Optimizing disjunctive queries with expensive
                 predicates",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "336--347",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p336-kemper/p336-kemper.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p336-kemper/",
  abstract =     "In this work, we propose and assess a technique called
                 {\em bypass processing\/} for optimizing the evaluation
                 of disjunctive queries with expensive predicates. The
                 technique is particularly useful for optimizing
                 selection predicates that contain terms whose
                 evaluation costs vary tremendously; e.g., the
                 evaluation of a nested subquery or the invocation of a
                 user-defined function in an object-oriented or extended
                 relational model may be orders of magnitude more
                 expensive than an attribute access (and comparison).
                 The idea of bypass processing consists of avoiding the
                 evaluation of such expensive terms whenever the outcome
                 of the entire selection predicate can already be
                 induced by testing other, less expensive terms. In
                 order to validate the viability of bypass evaluation,
                 we extend a previously developed optimizer architecture
                 and incorporate three alternative optimization
                 algorithms for generating bypass processing plans.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Performance",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Theory of
                 Computation --- Analysis of Algorithms and Problem
                 Complexity --- Nonnumerical Algorithms and Problems
                 (F.2.2): {\bf Sorting and searching}; Mathematics of
                 Computing --- Numerical Analysis --- Optimization
                 (G.1.6)",
}

@InProceedings{Galindo-Legaria:1994:OD,
  author =       "C{\'e}sar A. Galindo-Legaria",
  title =        "Outerjoins as disjunctions",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "348--358",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p348-galindo-legaria/p348-galindo-legaria.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p348-galindo-legaria/",
  abstract =     "The outerjoin operator is currently available in the
                 query language of several major DBMSs, and it is
                 included in the proposed SQL2 standard draft. However,
                 ``associativity problems'' of the operator have been
                 pointed out since its introduction. In this paper we
                 propose a shift in the intuition behind outerjoin:
                 Instead of computing the join while also {\em
                 preserving\/} its arguments, outerjoin delivers tuples
                 that come {\em either\/} from the join {\em or\/} from
                 the arguments. Queries with joins and outerjoins
                 deliver tuples that come from one out of several joins,
                 where a single relation is a trivial join. An advantage
                 of this view is that, in contrast to preservation, {\em
                 disjunction\/} is commutative and associative, which is
                 a significant property for intuition, formalisms, and
                 generation of execution plans. \par

                 Based on a disjunctive normal form, we show that some
                 data merging queries cannot be evaluated by means of
                 binary outerjoins, and give alternative procedures to
                 evaluate those queries. We also explore several
                 evaluation strategies for outerjoin queries, including
                 the use of semijoin programs to reduce base
                 relations.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Performance",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Information
                 Systems --- Database Management --- Logical Design
                 (H.2.1): {\bf Normal forms}; Information Systems ---
                 Database Management --- Languages (H.2.3): {\bf Query
                 languages}; Mathematics of Computing --- Discrete
                 Mathematics --- Graph Theory (G.2.2): {\bf Graph
                 algorithms}",
}

@InProceedings{Carey:1994:FGS,
  author =       "Michael J. Carey and Michael J. Franklin and Markos
                 Zaharioudakis",
  title =        "Fine-grained sharing in a page server {OODBMS}",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "359--370",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p359-carey/p359-carey.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p359-carey/",
  abstract =     "For reasons of simplicity and communication
                 efficiency, a number of existing object-oriented
                 database management systems are based on page server
                 architectures; data pages are their minimum unit of
                 transfer and client caching. Despite their efficiency,
                 page servers are often criticized as being too
                 restrictive when it comes to concurrency, as existing
                 systems use pages as the minimum locking unit as well.
                 In this paper we show how to support object-level
                 locking in a page server context. Several approaches
                 are described, including an adaptive granularity
                 approach that uses page-level locking for most pages
                 but switches to object-level locking when finer-grained
                 sharing is demanded. We study the performance of these
                 approaches, comparing them to both a pure page server
                 and a pure object server. For the range of workloads
                 that we have examined, our results indicate that a page
                 server is clearly preferable to an object server.
                 Moreover, the adaptive page server is shown to provide
                 very good performance, generally outperforming the pure
                 page server, the pure object server, and the other
                 alternatives as well.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Experimentation; Performance",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Distributed databases};
                 Information Systems --- Database Management ---
                 Physical Design (H.2.2); Information Systems ---
                 Database Management --- Logical Design (H.2.1): {\bf
                 Data models}",
}

@InProceedings{Cook:1994:PSP,
  author =       "Jonathan E. Cook and Alexander L. Wolf and Benjamin G.
                 Zorn",
  title =        "Partition selection policies in object database
                 garbage collection",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "371--382",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p371-cook/p371-cook.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p371-cook/",
  abstract =     "The automatic reclamation of storage for unreferenced
                 objects is very important in object databases. Existing
                 language system algorithms for automatic storage
                 reclamation have been shown to be inappropriate. In
                 this paper, we investigate methods to improve the
                 performance of algorithms for automatic for automatic
                 storage reclamation of object databases. These
                 algorithms are based on a technique called {\em
                 partitioned garbage collection}, in which a subset of
                 the entire database is collected independently of the
                 rest. Specifically, we investigate the policy that is
                 used to select what partition in the database should be
                 collected. The policies that we propose and investigate
                 are based on the intuition that the values of
                 overwritten pointers provide good hints about where to
                 find garbage. Using trace-driven simulation, we show
                 that one of our policies requires less I/O to collect
                 more garbage than any existing implementable policy and
                 performs close to a near-optimal policy over a wide
                 range of database sizes and object connectivities.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Performance",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4); Software --- Operating Systems ---
                 Storage Management (D.4.2): {\bf
                 Allocation/deallocation strategies}; Data --- Files
                 (E.5): {\bf Organization/structure}",
}

@InProceedings{Carey:1994:SPA,
  author =       "Michael J. Carey and David J. DeWitt and Michael J.
                 Franklin and Nancy E. Hall and Mark L. McAuliffe and
                 Jeffrey F. Naughton and Daniel T. Schuh and Marvin H.
                 Solomon and C. K. Tan and Odysseas G. Tsatalos and Seth
                 J. White and Michael J. Zwilling",
  title =        "Shoring up persistent applications",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "383--394",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p383-carey/p383-carey.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p383-carey/",
  abstract =     "SHORE (Scalable Heterogeneous Object REpository) is a
                 persistent object system under development at the
                 University of Wisconsin. SHORE represents a merger of
                 object-oriented database and file system technologies.
                 In this paper we give the goals and motivation for
                 SHORE, and describe how SHORE provides features of both
                 technologies. We also describe some novel aspects of
                 the SHORE architecture, including a symmetric
                 peer-to-peer server architecture, server customization
                 through an extensible {\em value-added server\/}
                 facility, and support for scalability on multiprocessor
                 systems. An initial version of SHORE is already
                 operational, and we expect a release of Version 1 in
                 mid-1994.",
  acknowledgement = ack-nhfb,
  generalterms = "Languages; Performance",
  subject =      "Information Systems --- Database Management ---
                 Logical Design (H.2.1): {\bf Data models}; Software ---
                 Programming Languages --- Language Classifications
                 (D.3.2): {\bf E}; Theory of Computation --- Logics and
                 Meanings of Programs --- Studies of Program Constructs
                 (F.3.3): {\bf Type structure}; Software --- Programming
                 Languages --- Language Classifications (D.3.2): {\bf
                 C++}",
}

@InProceedings{White:1994:QHP,
  author =       "Seth J. White and David J. DeWitt",
  title =        "{QuickStore}: a high performance mapped object store",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "395--406",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p395-white/p395-white.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p395-white/",
  abstract =     "This paper presents, QuickStore, a memory-mapped
                 storage system for persistent C++ built on top of the
                 EXODUS Storage Manager. QuickStore provides fast access
                 to in-memory objects by allowing application programs
                 to access objects via normal virtual memory pointers.
                 The paper also presents the results of a detailed
                 performance study using the OO7 benchmark. The study
                 compares the performance of QuickStore with the latest
                 implementation of the E programming language. These
                 systems exemplify the two basic approaches (hardware
                 and software) that have been used to implement
                 persistence in object-oriented database systems. Both
                 systems use the same underlying storage manager and
                 compiler allowing us to make a truly apples-to-apples
                 comparison of the hardware and software techniques.",
  acknowledgement = ack-nhfb,
  generalterms = "Experimentation; Languages; Performance",
  subject =      "Software --- Programming Languages --- Language
                 Classifications (D.3.2): {\bf E}; Software ---
                 Programming Languages --- Language Classifications
                 (D.3.2): {\bf C++}; Software --- Programming Languages
                 --- Language Classifications (D.3.2): {\bf EXODUS};
                 Information Systems --- Database Management --- Logical
                 Design (H.2.1)",
}

@InProceedings{McIver:1994:SAL,
  author =       "William J. McIver and Roger King",
  title =        "Self-adaptive, on-line reclustering of complex object
                 data",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "407--418",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p407-mciver/p407-mciver.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p407-mciver/",
  abstract =     "A likely trend in the development of future CAD, CASE
                 and office information systems will be the use of
                 object-oriented database systems to manage their
                 internal data stores. The entities that these
                 applications will retrieve, such as electronic parts
                 and their connections or customer service records, are
                 typically large complex objects composed of many
                 interconnected heterogeneous objects, not thousands of
                 tuples. These applications may exhibit widely shifting
                 usage patterns due to their interactive mode of
                 operation. Such a class of applications would demand
                 clustering methods that are appropriate for clustering
                 large complex objects and that can adapt on-line to the
                 shifting usage patterns. While most object-oriented
                 clustering methods allow grouping of heterogeneous
                 objects, they are usually static and can only be
                 changed off-line. We present one possible architecture
                 for performing complex object reclustering in an
                 on-line manner that is adaptive to changing usage
                 patterns. Our architecture involves the decomposition
                 of a clustering method into concurrently operating
                 components that each handle one of the fundamental
                 tasks involved in reclustering, namely statistics
                 collection, cluster analysis, and reorganization. We
                 present the results of an experiment performed to
                 evaluate its behavior. These results show that the
                 average miss rate for object accesses can be
                 effectively reduced using a combination of rules that
                 we have developed for deciding when cluster analyses
                 and reorganizations should be performed.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Experimentation; Measurement",
  subject =      "Information Systems --- Database Management ---
                 Logical Design (H.2.1): {\bf Data models}; Information
                 Systems --- Database Management --- Physical Design
                 (H.2.2); Information Systems --- Database Management
                 --- Systems (H.2.4): {\bf Transaction processing}",
}

@InProceedings{Faloutsos:1994:FSM,
  author =       "Christos Faloutsos and M. Ranganathan and Yannis
                 Manolopoulos",
  title =        "Fast subsequence matching in time-series databases",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "419--429",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p419-faloutsos/p419-faloutsos.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p419-faloutsos/",
  abstract =     "We present an efficient indexing method to locate
                 1-dimensional subsequences within a collection of
                 sequences, such that the subsequences match a given
                 (query) pattern within a specified tolerance. The idea
                 is to map each data sequences into a small set of
                 multidimensional rectangles in feature space. Then,
                 these rectangles can be readily indexed using
                 traditional spatial access methods, like the R*-tree
                 [9]. In more detail, we use a sliding window over the
                 data sequence and extract its features; the result is a
                 trail in feature space. We propose an efficient and
                 effective algorithm to divide such trails into
                 sub-trails, which are subsequently represented by their
                 Minimum Bounding Rectangles (MBRs). We also examine
                 queries of varying lengths, and we show how to handle
                 each case efficiently. We implemented our method and
                 carried out experiments on synthetic and real data
                 (stock price movements). We compared the method to
                 sequential scanning, which is the only obvious
                 competitor. The results were excellent: our method
                 accelerated the search time from 3 times up to 100
                 times.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Theory; Verification",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Data --- Data
                 Structures (E.1): {\bf Trees}; Information Systems ---
                 Information Storage and Retrieval --- Content Analysis
                 and Indexing (H.3.1): {\bf Indexing methods}; Theory of
                 Computation --- Analysis of Algorithms and Problem
                 Complexity --- Nonnumerical Algorithms and Problems
                 (F.2.2): {\bf Sorting and searching}",
}

@InProceedings{Seshadri:1994:SQP,
  author =       "Praveen Seshadri and Miron Livny and Raghu
                 Ramakrishnan",
  title =        "Sequence query processing",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "430--441",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p430-seshadri/p430-seshadri.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p430-seshadri/",
  abstract =     "Many applications require the ability to manipulate
                 sequences of data. We motivate the importance of
                 sequence query processing, and present a framework for
                 the optimization of sequence queries based on several
                 novel techniques. These include query transformations,
                 optimizations that utilize meta-data, and caching of
                 intermediate results. We present a bottom-up algorithm
                 that generates an efficient query evaluation plan based
                 on cost estimates. This work also identifies a number
                 of directions in which future research can be
                 directed.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Languages; Theory",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Theory of
                 Computation --- Analysis of Algorithms and Problem
                 Complexity --- Nonnumerical Algorithms and Problems
                 (F.2.2): {\bf Sequencing and scheduling}; Mathematics
                 of Computing --- Discrete Mathematics --- Graph Theory
                 (G.2.2): {\bf Graph algorithms}",
}

@InProceedings{Sagonas:1994:XED,
  author =       "Konstantinos Sagonas and Terrance Swift and David S.
                 Warren",
  title =        "{XSB} as an efficient deductive database engine",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "442--453",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p442-sagonas/p442-sagonas.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p442-sagonas/",
  abstract =     "This paper describes the XSB system, and its use as an
                 in-memory deductive database engine. XSB began from a
                 Prolog foundation, and traditional Prolog systems are
                 known to have serious deficiencies when used as
                 database systems. Accordingly, XSB has a fundamental
                 bottom-up extension, introduced through tabling (or
                 memoing)[4], which makes it appropriate as an
                 underlying query engine for deductive database systems.
                 Because it eliminates redundant computation, the
                 tabling extension makes XSB able to compute all
                 modularly stratified datalog programs finitely and with
                 polynomial data complexity. For non-stratified
                 programs, a meta-interpreter with the same properties
                 is provided. In addition XSB significantly extends and
                 improves the indexing capabilities over those of
                 standard Prolog. Finally, its syntactic basis in HiLog
                 [2], lends it flexibility for data modelling. \par

                 The implementation of XSB derives from the WAM [25],
                 the most common Prolog engine. XSB inherits the WAM's
                 efficiency and can take advantage of extensive compiler
                 technology developed for Prolog. As a result,
                 performance comparisons indicate that XSB is
                 significantly faster than other deductive database
                 systems for a wide range of queries and stratified rule
                 sets. XSB is under continuous development, and version
                 1.3 is available through anonymous ftp.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Design; Performance",
  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}; Information Systems ---
                 Database Management --- Languages (H.2.3): {\bf
                 Prolog}; Mathematics of Computing --- Discrete
                 Mathematics --- Graph Theory (G.2.2): {\bf Trees}; Data
                 --- Data Storage Representations (E.2): {\bf Hash-table
                 representations}",
}

@InProceedings{Dar:1994:PST,
  author =       "Shaul Dar and Raghu Ramakrishnan",
  title =        "A performance study of transitive closure algorithms",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "454--465",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p454-dar/p454-dar.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p454-dar/",
  abstract =     "We present a comprehensive performance evaluation of
                 transitive closure (reachability) algorithms for
                 databases. The study is based upon careful
                 implementations of the algorithms, measures page I/O,
                 and covers algorithms for full transitive closure as
                 well as {\em partial\/} transitive closure (finding all
                 successors of each node in a set of given source
                 nodes). We examine a wide range of acyclic graphs with
                 varying density and ``locality'' of arcs in the graph.
                 We also consider query parameters such as the
                 selectivity of the query, and system parameters such as
                 the buffer size and the page and successor list
                 replacement policies. We show that significant cost
                 tradeoffs exist between the algorithms in this spectrum
                 and identify the factors that influence the performance
                 of the algorithms. \par

                 An important aspect of our work is that we measure a
                 number of different cost metrics, giving us a good
                 understanding of the predictive power of these metrics
                 with respect to I/O cost. This is especially
                 significant since metrics such as number of tuples
                 generated or number of successor list operations have
                 been widely used to compare transitive closure
                 algorithms in the literature. Our results strongly
                 suggest that these other metrics cannot be reliability
                 used to predict I/O cost of transitive closure
                 evaluation.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Experimentation; Measurement;
                 Performance",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Mathematics of
                 Computing --- Discrete Mathematics --- Graph Theory
                 (G.2.2): {\bf Trees}; Mathematics of Computing ---
                 Discrete Mathematics --- Graph Theory (G.2.2): {\bf
                 Graph algorithms}; Theory of Computation --- Analysis
                 of Algorithms and Problem Complexity --- Nonnumerical
                 Algorithms and Problems (F.2.2): {\bf Computations on
                 discrete structures}",
}

@InProceedings{Anonymous:1994:PDS,
  author =       "Anonymous",
  title =        "Parallel database systems in the 1990's",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "466--466",
  year =         "1994",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Daniels:1994:OSR,
  author =       "Dean Daniels and Lip Boon Doo and Alan Downing and
                 Curtis Elsbernd and Gary Hallmark and Sandeep Jain and
                 Bob Jenkins and Peter Lim and Gordon Smith and Benny
                 Souder and Jim Stamos",
  title =        "{Oracle}'s symmetric replication technology and
                 implications for application design",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "467--467",
  year =         "1994",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p467-daniels/p467-daniels.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p467-daniels/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Dietterich:1994:DDD,
  author =       "Daniel J. Dietterich",
  title =        "{DEC} data distributor: for data replication and data
                 warehousing",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "468--468",
  year =         "1994",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p468-dietterich/p468-dietterich.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p468-dietterich/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gorelik:1994:SRS,
  author =       "Alex Gorelik and Yongdong Wang and Mark Deppe",
  title =        "{Sybase} replication server",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "469--469",
  year =         "1994",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p469-gorelik/p469-gorelik.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p469-gorelik/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Laursen:1994:OMS,
  author =       "Andrew Laursen and Jeffrey Olkin and Mark Porter",
  title =        "{Oracle} media server: providing consumer based
                 interactive access to multimedia data",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "470--477",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p470-laursen/p470-laursen.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p470-laursen/",
  abstract =     "Currently, most data accessed on large servers is
                 structured data stored in traditional databases.
                 Networks are LAN based and clients range from simple
                 terminals to powerful workstations. The user is
                 corporate and the application developer is an MIS
                 professional. \par

                 With the introduction of broadband communications to
                 the home and better than 100-to-1 compression
                 techniques, a new form of network-based computing is
                 emerging. Structured data is still important, but the
                 bulk of data becomes unstructured: audio, video, news
                 feeds, etc. The predominant user becomes the consumer.
                 The predominant client device becomes the television
                 set. The application developer becomes the storyboard
                 developer, director, or the video production engineer.
                 \par

                 The Oracle Media Server supports access to all types of
                 conventional data stored in Oracle relational and text
                 databases. In addition, we have developed a real-time
                 stream server that supports storage and playback of
                 real-time audio and video data. The Media Server also
                 provides access to data stored in file systems or as
                 binary large objects (images, executables, etc.)
                 \par

                 The Oracle Media Server provides a platform for
                 distributed client-server computing and access to data
                 over asymmetric real-time networks. A service mechanism
                 allows applications to be split such that client
                 devices (set-top boxes, personal digital assistants,
                 etc.) can focus on presentation, while backend services
                 running in a distributed server complex, provide access
                 to data via messaging or lightweight RPC (Remote
                 Procedure Call).",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Reliability",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Distributed databases};
                 Information Systems --- Database Management --- Logical
                 Design (H.2.1): {\bf Data models}; Data --- Coding and
                 Information Theory (E.4): {\bf Data compaction and
                 compression}; Information Systems --- Database
                 Management --- Systems (H.2.4): {\bf ORACLE}",
}

@InProceedings{Kulkarni:1994:OOE,
  author =       "Krishna G. Kulkarni",
  title =        "Object-oriented extensions in {SQL3}: a status
                 report",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "478--478",
  year =         "1994",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p478-kulkarni/p478-kulkarni.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p478-kulkarni/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Martin:1994:CCO,
  author =       "Bruce E. Martin",
  title =        "{COSS}: the common object services specifications",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "479--479",
  year =         "1994",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p479-martin/p479-martin.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p479-martin/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cattell:1994:OSO,
  author =       "R. G. G. Cattell",
  title =        "{ODMG-93}: a standard for object-oriented {DBMSs}",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "480--480",
  year =         "1994",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p480-cattell/p480-cattell.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p480-cattell/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kim:1994:UXU,
  author =       "Won Kim",
  title =        "{UniSQL\slash X} unified relational and
                 object-oriented database system",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "481--481",
  year =         "1994",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p481-kim/p481-kim.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p481-kim/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ubell:1994:MED,
  author =       "Michael Ubell",
  title =        "The {Montage} extensible {DataBlade} architecture",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "482--482",
  year =         "1994",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p482-ubell/p482-ubell.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p482-ubell/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Pirahesh:1994:OOF,
  author =       "Hamid Pirahesh",
  title =        "Object-oriented features of {DB2} client\slash
                 server",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "483--483",
  year =         "1994",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p483-pirahesh/p483-pirahesh.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p483-pirahesh/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Vaskevitch:1994:DCT,
  author =       "David Vaskevitch",
  title =        "Database in crisis and transition: a technical agenda
                 for the year 2001",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "484--489",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p484-vaskevitch/p484-vaskevitch.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p484-vaskevitch/",
  abstract =     "The current paper outlines a number of important
                 changes that face the database community and presents
                 an agenda for how some of these challenges can be met.
                 This database agenda is currently being addressed in
                 the Enterprise Group at Microsoft Corporation. The
                 paper concludes with a scenario for 2001 which reflects
                 the Microsoft vision of ``Information at your
                 fingertips.''",
  acknowledgement = ack-nhfb,
  generalterms = "Economics; Languages; Theory",
  subject =      "Information Systems --- Database Management ---
                 Logical Design (H.2.1): {\bf Data models}; Information
                 Systems --- Database Management --- Systems (H.2.4);
                 Information Systems --- Database Management ---
                 Languages (H.2.3)",
}

@InProceedings{Ballinger:1994:ETD,
  author =       "Carrie Ballinger",
  title =        "Evolving teradata decision support for massively
                 parallel processing with {UNIX}",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "490--490",
  year =         "1994",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p490-ballinger/p490-ballinger.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p490-ballinger/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Englert:1994:NSS,
  author =       "Susanne Englert",
  title =        "Nonstop {SQL}: scalability and availability for
                 decision support",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "491--491",
  year =         "1994",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p491-englert/p491-englert.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p491-englert/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Fernandez:1994:RBW,
  author =       "Phillip M. Fernandez",
  title =        "Red brick warehouse: a read-mostly {RDBMS} for open
                 {SMP} platforms",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "492--492",
  year =         "1994",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p492-fernandez/p492-fernandez.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p492-fernandez/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Melling:1994:EIA,
  author =       "Wesley P. Melling",
  title =        "Enterprise information architectures--they're finally
                 changing",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "493--504",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p493-melling/p493-melling.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p493-melling/",
  abstract =     "Substantive changes in the business environment--and
                 aggressive initiatives in business process
                 reengineering--are driving corresponding changes in the
                 information technology architectures of large
                 enterprises. Those changes are enabled by the
                 convergence of a long list of maturing new
                 technologies. As one of its many implications, the new
                 IT architecture demands revised assumptions about the
                 design and deployment of databases. This paper reviews
                 the components of the architectural shift now in
                 process, and offers strategic planning assumptions for
                 database professionals.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Management; Performance; Standardization",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Transaction processing};
                 Information Systems --- Database Management ---
                 Database Applications (H.2.8); Information Systems ---
                 Database Management --- Physical Design (H.2.2);
                 Computing Milieux --- Computers and Society ---
                 Organizational Impacts (K.4.3)",
}

@InProceedings{Singh:1994:RTP,
  author =       "Munindar P. Singh and Christine Tomlinson and Darrell
                 Woelk",
  title =        "Relaxed transaction processing",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "505--505",
  year =         "1994",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p505-singh/p505-singh.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p505-singh/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Flokstra:1994:IDD,
  author =       "Jan Flokstra and Maurice van Keulen and Jacek
                 Skowronek",
  title =        "The {IMPRESS DDT}: a database design toolbox based on
                 a formal specification language",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "506--506",
  year =         "1994",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p506-flokstra/p506-flokstra.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p506-flokstra/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bryan:1994:MPA,
  author =       "G. M. Bryan and W. E. Moore and B. J. Curry and K. W.
                 Lodge and J. Geyer",
  title =        "The {MEDUSA} project: autonomous data management in a
                 shared-nothing parallel database machine",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "507--507",
  year =         "1994",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p507-bryan/p507-bryan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p507-bryan/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Missikoff:1994:MSC,
  author =       "M. Missikoff and M. Toiati",
  title =        "{MOSAICO}---a system for conceptual modeling and rapid
                 prototyping of object-oriented database application",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "508--508",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p508-missikoff/p508-missikoff.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p508-missikoff/",
  abstract =     "The system Mosaico [MT94] has been conceived to
                 support the design, conceptual modeling, and rapid
                 prototyping of data intensive applications based on
                 Object-Oriented Databases (OODBS). The application is
                 modeled through a graphical user interface and the
                 produced model is encoded in {\em TQL++}, the design
                 language on which Mosaico is based.",
  acknowledgement = ack-nhfb,
  generalterms = "Design; Languages; Verification",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Software ---
                 Software Engineering --- Miscellaneous (D.2.m): {\bf
                 Rapid prototyping**}; Software --- Programming
                 Languages --- Language Classifications (D.3.2): {\bf
                 Object-oriented languages}",
}

@InProceedings{Kuhn:1994:LBM,
  author =       "Eva K{\"u}hn and Thomas Tschernko and Konrad Schwarz",
  title =        "A language based multidatabase system",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "509--509",
  year =         "1994",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p509-kuhn/p509-kuhn.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p509-kuhn/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Grossman:1994:PSP,
  author =       "R. L. Grossman and X. Qin",
  title =        "Ptool: a scalable persistent object manager",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "510--510",
  year =         "1994",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p510-grossman/p510-grossman.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p510-grossman/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Theodoulidis:1994:OTD,
  author =       "Babis Theodoulidis and Aziz Ait-Braham and George
                 Andrianopoulos and Jayant Chaudhary and George Karvelis
                 and Simon Sou",
  title =        "The {ORES} temporal database management system",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "511--511",
  year =         "1994",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p511-theodoulidis/p511-theodoulidis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p511-theodoulidis/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Sagonas:1994:XDD,
  author =       "Konstantinos Sagonas and Terrance Swift and David S.
                 Warren",
  title =        "{XSB} as a deductive database",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "512--512",
  year =         "1994",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p512-sagonas/p512-sagonas.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p512-sagonas/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Dogac:1994:MOO,
  author =       "Asuman Dogac and Budak Arpinar and Cem Evrendilek and
                 Cetin Ozkan and Ilker Altintas and Ilker Durusoy and
                 Mehmet Altinel and Tansel Okay and Yuksel Saygin",
  title =        "{METU} object-oriented {DBMS}",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "513--513",
  year =         "1994",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p513-dogac/p513-dogac.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p513-dogac/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Agrawal:1994:QPD,
  author =       "R. Agrawal and M. Carey and C. Faloutsos and S. Ghosh
                 and M. Houtsma and T. Imieli{\'n}ski and B. Iyer and A.
                 Mahboob and H. Miranda and R. Srikant and A. Swami",
  title =        "Quest: a project on database mining",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "514--514",
  year =         "1994",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p514-agrawal/p514-agrawal.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p514-agrawal/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Catarci:1994:QDG,
  author =       "Tiziana Catarci and Giuseppe Santucci",
  title =        "Query by diagram: a graphical environment for querying
                 databases",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "515--515",
  year =         "1994",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p515-catarci/p515-catarci.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p515-catarci/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Han:1994:DSP,
  author =       "Jiawei Han and Yongjian Fu and Yue Huang and Yandong
                 Cai and Nick Cercone",
  title =        "{DBLearn}: a system prototype for knowledge discovery
                 in relational databases",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "516--516",
  year =         "1994",
  bibdate =      "Wed Oct 25 12:40:13 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p516-han/p516-han.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p516-han/",
  abstract =     "A prototyped data mining system, DBLearn, has been
                 developed, which efficiently and effectively extracts
                 different kinds of knowledge rules from relational
                 databases. It has the following features: high level
                 learning interfaces, tightly integrated with commercial
                 relational database systems, automatic refinement of
                 concept hierarchies, efficient discovery algorithms and
                 good performance. Substantial extensions of its
                 knowledge discovery power towards knowledge mining in
                 object-oriented, deductive and spatial databases are
                 under research and development.",
  acknowledgement = ack-nhfb,
  generalterms = "Algorithms; Experimentation; Languages; Performance",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Query processing}; Information
                 Systems --- Database Management --- Languages (H.2.3):
                 {\bf Query languages}",
}

@InProceedings{Biliris:1994:EEO,
  author =       "Alexandros Biliris and Euthimios Panagos",
  title =        "{EOS}: an extensible object store",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "517--517",
  year =         "1994",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p517-biliris/p517-biliris.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p517-biliris/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hwang:1994:MFD,
  author =       "S.-Y. Hwang and E.-P. Lim and H.-R. Yang and S.
                 Musukula and K. Mediratta and M. Ganesh and D. Clements
                 and J. Stenoien and J. Srivastava",
  title =        "The {MYRIAD} federated database prototype",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "518--518",
  year =         "1994",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p518-hwang/p518-hwang.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p518-hwang/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Brinkhoff:1994:GSE,
  author =       "Thomas Brinkhoff and Hans-Peter Kriegel and Ralf
                 Schneider and Bernhard Seeger",
  title =        "{GENESYS}: a system for efficient spatial query
                 processing",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "519--519",
  year =         "1994",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p519-brinkhoff/p519-brinkhoff.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p519-brinkhoff/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Blakeley:1994:OOD,
  author =       "Jos{\'e} A. Blakeley",
  title =        "Open object database management systems",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "520--520",
  year =         "1994",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p520-blakeley/p520-blakeley.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p520-blakeley/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Mohan:1994:SCA,
  author =       "C. Mohan",
  title =        "A survey and critique of advanced transaction models",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "521--521",
  year =         "1994",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p521-mohan/p521-mohan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p521-mohan/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Jagadish:1994:DN,
  author =       "H. V. Jagadish",
  title =        "Databases for networks",
  crossref =     "Snodgrass:1994:PAS",
  pages =        "522--522",
  year =         "1994",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/191839/p522-jagadish/p522-jagadish.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/191839/p522-jagadish/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Berenson:1995:CAS,
  author =       "Hal Berenson and Phil Bernstein and Jim Gray and Jim
                 Melton and Elizabeth O'Neil and Patrick O'Neil",
  title =        "A critique of {ANSI SQL} isolation levels",
  crossref =     "ACM:1995:PAS",
  pages =        "1--10",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p1-berenson/p1-berenson.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p1-berenson/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Papadimitriou:1995:DMA,
  author =       "Christos H. Papadimitriou",
  title =        "Database Metatheory: Asking the Big Queries",
  crossref =     "ACM:1995:PPF",
  pages =        "1--10",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:41 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/212433/p1-papadimitriou/p1-papadimitriou.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/212433/p1-papadimitriou/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/212433/p1-papadimitriou/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1995 ACM SIGMOD
                 international conference on management of data; Also
                 known as PODS 1995",
  keywords =     "ACM; database systems; SIGACT; theory",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems. {\bf H.2.0} Information Systems, DATABASE
                 MANAGEMENT, General. {\bf H.2.1} Information Systems,
                 DATABASE MANAGEMENT, Logical Design, Data models. {\bf
                 H.1.1} Information Systems, MODELS AND PRINCIPLES,
                 Systems and Information Theory. {\bf F.4.0} Theory of
                 Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES,
                 General.",
}

@InProceedings{Kabanza:1995:HIT,
  author =       "F. Kabanza and J.-M. Stevenne and P. Wolper",
  title =        "Handling Infinite Temporal Data",
  crossref =     "ACM:1995:PPF",
  pages =        "3--17",
  year =         "1995",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "36 papers; See also 6836.1508 1990 9th for papers",
  keywords =     "ACM; database systems; SIGACT",
}

@InProceedings{Consens:1995:AQT,
  author =       "Mariano P. Consens and Tova Milo",
  title =        "Algebras for querying text regions (extended
                 abstract)",
  crossref =     "ACM:1995:PPF",
  pages =        "11--22",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:41 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/212433/p11-consens/p11-consens.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/212433/p11-consens/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/212433/p11-consens/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1995 ACM SIGMOD
                 international conference on management of data; Also
                 known as PODS 1995",
  keywords =     "ACM; database systems; documentation; languages;
                 performance; SIGACT; theory",
  subject =      "{\bf I.5.4} Computing Methodologies, PATTERN
                 RECOGNITION, Applications, Text processing. {\bf H.2.3}
                 Information Systems, DATABASE MANAGEMENT, Languages,
                 Query languages. {\bf F.2.2} Theory of Computation,
                 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY,
                 Nonnumerical Algorithms and Problems, Pattern matching.
                 {\bf H.3.1} Information Systems, INFORMATION STORAGE
                 AND RETRIEVAL, Content Analysis and Indexing, Indexing
                 methods. {\bf I.1.0} Computing Methodologies, SYMBOLIC
                 AND ALGEBRAIC MANIPULATION, General.",
}

@InProceedings{Molesky:1995:RPS,
  author =       "Lory D. Molesky and Krithi Ramamritham",
  title =        "Recovery protocols for shared memory database
                 systems",
  crossref =     "ACM:1995:PAS",
  pages =        "11--22",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p11-molesky/p11-molesky.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p11-molesky/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Lipton:1995:QSE,
  author =       "R. J. Lipton and J. F. Naughton",
  title =        "Query Size Estimation by Adaptive Sampling",
  crossref =     "ACM:1995:PPF",
  pages =        "18--25",
  year =         "1995",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "36 papers; See also 6836.1508 1990 9th for papers",
  keywords =     "ACM; database systems; SIGACT",
}

@InProceedings{Adya:1995:EOC,
  author =       "Atul Adya and Robert Gruber and Barbara Liskov and
                 Umesh Maheshwari",
  title =        "Efficient optimistic concurrency control using loosely
                 synchronized clocks",
  crossref =     "ACM:1995:PAS",
  pages =        "23--34",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p23-adya/p23-adya.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p23-adya/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Mecca:1995:SDT,
  author =       "Giansalvatore Mecca and Anthony J. Bonner",
  title =        "Sequences, {Datalog} and transducers",
  crossref =     "ACM:1995:PPF",
  pages =        "23--35",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:41 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/212433/p23-mecca/p23-mecca.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/212433/p23-mecca/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/212433/p23-mecca/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1995 ACM SIGMOD
                 international conference on management of data; Also
                 known as PODS 1995",
  keywords =     "ACM; database systems; languages; SIGACT; theory;
                 verification",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Query languages. {\bf H.2.4} Information
                 Systems, DATABASE MANAGEMENT, Systems. {\bf H.2.3}
                 Information Systems, DATABASE MANAGEMENT, Languages,
                 Datalog. {\bf J.3} Computer Applications, LIFE AND
                 MEDICAL SCIENCES, Biology and genetics.",
}

@InProceedings{Kanellakis:1995:CQL,
  author =       "P. C. Kanellakis and G. M. Kuper and P. Z. Revesz",
  title =        "Constraint Query Languages",
  crossref =     "ACM:1995:PPF",
  pages =        "26--52",
  year =         "1995",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "36 papers; See also 6836.1508 1990 9th for papers",
  keywords =     "ACM; database systems; SIGACT",
}

@InProceedings{Brodsky:1995:LLQ,
  author =       "Alexander Brodsky and Yoram Kornatzky",
  title =        "The {{\em LyriC\/}} language: querying constraint
                 objects",
  crossref =     "ACM:1995:PAS",
  pages =        "35--46",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p35-brodsky/p35-brodsky.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p35-brodsky/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Jagadish:1995:SBQ,
  author =       "H. V. Jagadish and Alberto O. Mendelzon and Tova
                 Milo",
  title =        "Similarity-Based Queries",
  crossref =     "ACM:1995:PPF",
  pages =        "36--45",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:41 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/212433/p36-jagadish/p36-jagadish.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/212433/p36-jagadish/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/212433/p36-jagadish/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1995 ACM SIGMOD
                 international conference on management of data; Also
                 known as PODS 1995",
  keywords =     "ACM; algorithms; database systems; languages;
                 performance; SIGACT; theory; verification",
  subject =      "{\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.8} Information Systems, DATABASE
                 MANAGEMENT, Database Applications. {\bf G.1.2}
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Approximation, Linear approximation.",
}

@InProceedings{Kanellakis:1995:CPD,
  author =       "Paris Kanellakis",
  title =        "Constraint programming and database languages: a
                 tutorial",
  crossref =     "ACM:1995:PPF",
  pages =        "46--53",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:41 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/212433/p46-kanellakis/p46-kanellakis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/212433/p46-kanellakis/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/212433/p46-kanellakis/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; languages",
  subject =      "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Data models. {\bf H.2.3} Information
                 Systems, DATABASE MANAGEMENT, Languages, Query
                 languages. {\bf H.2.8} Information Systems, DATABASE
                 MANAGEMENT, Database Applications. {\bf H.2.0}
                 Information Systems, DATABASE MANAGEMENT, General.",
}

@InProceedings{Kanellakis:1995:TCP,
  author =       "P. Kanellakis",
  title =        "Tutorial: Constraint Programming and Database
                 Languages",
  crossref =     "ACM:1995:PPF",
  pages =        "46--53",
  year =         "1995",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1995 ACM SIGMOD
                 international conference on management of data; Also
                 known as PODS 1995",
  keywords =     "ACM; database systems; SIGACT",
}

@InProceedings{Fegaras:1995:TEC,
  author =       "Leonidas Fegaras and David Maier",
  title =        "Towards an effective calculus for object query
                 languages",
  crossref =     "ACM:1995:PAS",
  pages =        "47--58",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p47-fegaras/p47-fegaras.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p47-fegaras/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Agrawal:1995:CSL,
  author =       "D. Agrawal and A. {El Abbadi}",
  title =        "Constrained Shared Locks for Increasing Concurrency in
                 Databases",
  crossref =     "ACM:1995:PPF",
  pages =        "53--63",
  year =         "1995",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "36 papers; See also 6836.1508 1990 9th for papers",
  keywords =     "ACM; database systems; SIGACT",
}

@InProceedings{Brodsky:1995:SPO,
  author =       "Alexander Brodsky and Catherine Lassez and Jean-Louis
                 Lassez and Michael J. Maher",
  title =        "Separability of Polyhedra for Optimal Filtering of
                 Spatial and Constraint Data",
  crossref =     "ACM:1995:PPF",
  pages =        "54--65",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:41 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/212433/p54-brodsky/p54-brodsky.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/212433/p54-brodsky/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/212433/p54-brodsky/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1995 ACM SIGMOD
                 international conference on management of data; Also
                 known as PODS 1995",
  keywords =     "ACM; algorithms; database systems; design;
                 performance; SIGACT; theory; verification",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing. {\bf H.3.1} Information
                 Systems, INFORMATION STORAGE AND RETRIEVAL, Content
                 Analysis and Indexing, Indexing methods. {\bf F.2.2}
                 Theory of Computation, ANALYSIS OF ALGORITHMS AND
                 PROBLEM COMPLEXITY, Nonnumerical Algorithms and
                 Problems, Geometrical problems and computations.",
}

@InProceedings{Gardarin:1995:OFE,
  author =       "Georges Gardarin and Fernando Machuca and Philippe
                 Pucheral",
  title =        "{OFL}: a functional execution model for object query
                 languages",
  crossref =     "ACM:1995:PAS",
  pages =        "59--70",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p59-gardarin/p59-gardarin.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p59-gardarin/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Schlipf:1995:EPL,
  author =       "J. S. Schlipf",
  title =        "The Expressive Powers of the Logic Programming
                 Semantics",
  crossref =     "ACM:1995:PPF",
  pages =        "64--86",
  year =         "1995",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "36 papers; See also 6836.1508 1990 9th for papers",
  keywords =     "ACM; database systems; SIGACT",
}

@InProceedings{Grumbach:1995:DOC,
  author =       "St{\'e}phane Grumbach and Jianwen Su",
  title =        "Dense-order constraint databases (extended abstract)",
  crossref =     "ACM:1995:PPF",
  pages =        "66--77",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:41 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/212433/p66-grumbach/p66-grumbach.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/212433/p66-grumbach/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/212433/p66-grumbach/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1995 ACM SIGMOD
                 international conference on management of data; Also
                 known as PODS 1995",
  keywords =     "ACM; algorithms; database systems; languages; SIGACT;
                 theory; verification",
  subject =      "{\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, Data models. {\bf H.2.3}
                 Information Systems, DATABASE MANAGEMENT, Languages,
                 Datalog.",
}

@InProceedings{Roussopoulos:1995:NNQ,
  author =       "Nick Roussopoulos and Stephen Kelley and
                 Fr{\'e}d{\'e}ric Vincent",
  title =        "Nearest neighbor queries",
  crossref =     "ACM:1995:PAS",
  pages =        "71--79",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p71-roussopoulos/p71-roussopoulos.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p71-roussopoulos/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chomicki:1995:MIR,
  author =       "Jan Chomicki and Gabriel Kuper",
  title =        "Measuring Infinite Relations",
  crossref =     "ACM:1995:PPF",
  pages =        "78--85",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:41 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/212433/p78-chomicki/p78-chomicki.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/212433/p78-chomicki/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/212433/p78-chomicki/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1995 ACM SIGMOD
                 international conference on management of data; Also
                 known as PODS 1995",
  keywords =     "ACM; algorithms; database systems; languages; SIGACT;
                 theory; verification",
  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 I.2.1} Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Applications and Expert Systems. {\bf
                 H.2.0} Information Systems, DATABASE MANAGEMENT,
                 General.",
}

@InProceedings{Freeston:1995:GSD,
  author =       "Michael Freeston",
  title =        "A general solution of the $n$-dimensional {B-tree}
                 problem",
  crossref =     "ACM:1995:PAS",
  pages =        "80--91",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p80-freeston/p80-freeston.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p80-freeston/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Pagel:1995:WQO,
  author =       "Bernd-Uwe Pagel and Hans-Werner Six and Mario Winter",
  title =        "Window Query-Optimal Clustering of Spatial Objects",
  crossref =     "ACM:1995:PPF",
  pages =        "86--94",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:41 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/212433/p86-pagel/p86-pagel.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/212433/p86-pagel/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/212433/p86-pagel/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1995 ACM SIGMOD
                 international conference on management of data; Also
                 known as PODS 1995",
  keywords =     "ACM; algorithms; database systems; experimentation;
                 measurement; performance; SIGACT",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing. {\bf H.2.1} Information
                 Systems, DATABASE MANAGEMENT, Logical Design, Data
                 models. {\bf E.1} Data, DATA STRUCTURES, Trees. {\bf
                 G.1.6} Mathematics of Computing, NUMERICAL ANALYSIS,
                 Optimization. {\bf G.3} Mathematics of Computing,
                 PROBABILITY AND STATISTICS, Probabilistic algorithms
                 (including Monte Carlo).",
}

@InProceedings{Saraiya:1995:ETD,
  author =       "Y. P. Saraiya",
  title =        "On the Efficiency of Transforming Database Logic
                 Programs",
  crossref =     "ACM:1995:PPF",
  pages =        "87--109",
  year =         "1995",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "36 papers; See also 6836.1508 1990 9th for papers",
  keywords =     "ACM; database systems; SIGACT",
}

@InProceedings{Papadias:1995:TRW,
  author =       "Dimitris Papadias and Timos Sellis and Yannis
                 Theodoridis and Max J. Egenhofer",
  title =        "Topological relations in the world of minimum bounding
                 rectangles: a study with {R}-trees",
  crossref =     "ACM:1995:PAS",
  pages =        "92--103",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p92-papadias/p92-papadias.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p92-papadias/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Levy:1995:AQU,
  author =       "Alon Y. Levy and Alberto O. Mendelzon and Yehoshua
                 Sagiv and D. Srivastava",
  title =        "Answering queries using views (extended abstract)",
  crossref =     "ACM:1995:PPF",
  pages =        "95--104",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:41 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/212433/p95-levy/p95-levy.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/212433/p95-levy/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/212433/p95-levy/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1995 ACM SIGMOD
                 international conference on management of data; Also
                 known as PODS 1995",
  keywords =     "ACM; algorithms; database systems; SIGACT; theory;
                 verification",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing. {\bf F.1.3} Theory of
                 Computation, COMPUTATION BY ABSTRACT DEVICES,
                 Complexity Measures and Classes, Reducibility and
                 completeness. {\bf F.4.2} Theory of Computation,
                 MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and
                 Other Rewriting Systems. {\bf H.2.1} Information
                 Systems, DATABASE MANAGEMENT, Logical Design, Data
                 models.",
}

@InProceedings{Shatdal:1995:APA,
  author =       "Ambuj Shatdal and Jeffrey F. Naughton",
  title =        "Adaptive parallel aggregation algorithms",
  crossref =     "ACM:1995:PAS",
  pages =        "104--114",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p104-shatdal/p104-shatdal.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p104-shatdal/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Rajaraman:1995:AQU,
  author =       "Anand Rajaraman and Yehoshua Sagiv and Jeffrey D.
                 Ullman",
  title =        "Answering queries using templates with binding
                 patterns (extended abstract)",
  crossref =     "ACM:1995:PPF",
  pages =        "105--112",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:41 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/212433/p105-rajaraman/p105-rajaraman.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/212433/p105-rajaraman/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/212433/p105-rajaraman/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1995 ACM SIGMOD
                 international conference on management of data; Also
                 known as PODS 1995",
  keywords =     "ACM; algorithms; database systems; SIGACT; theory;
                 verification",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing. {\bf F.1.3} Theory of
                 Computation, COMPUTATION BY ABSTRACT DEVICES,
                 Complexity Measures and Classes, Reducibility and
                 completeness. {\bf H.2.1} Information Systems, DATABASE
                 MANAGEMENT, Logical Design, Data models. {\bf H.2.3}
                 Information Systems, DATABASE MANAGEMENT, Languages,
                 SQL.",
}

@InProceedings{Kolaitis:1995:EPD,
  author =       "P. G. Kolaitis and M. Y. Vardi",
  title =        "On the Expressive Power of Datalog: Tools and a Case
                 Study",
  crossref =     "ACM:1995:PPF",
  pages =        "110--134",
  year =         "1995",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "36 papers; See also 6836.1508 1990 9th for papers",
  keywords =     "ACM; database systems; SIGACT",
}

@InProceedings{Jagadish:1995:VMI,
  author =       "H. V. Jagadish and Inderpal Singh Mumick and Abraham
                 Silberschatz",
  title =        "View maintenance issues for the chronicle data model
                 (extended abstract)",
  crossref =     "ACM:1995:PPF",
  pages =        "113--124",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:41 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/212433/p113-jagadish/p113-jagadish.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/212433/p113-jagadish/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/212433/p113-jagadish/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1995 ACM SIGMOD
                 international conference on management of data; Also
                 known as PODS 1995",
  keywords =     "ACM; algorithms; database systems; languages;
                 performance; SIGACT; theory; verification",
  subject =      "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Data models. {\bf H.2.4} Information
                 Systems, DATABASE MANAGEMENT, Systems, Transaction
                 processing. {\bf H.2.3} Information Systems, DATABASE
                 MANAGEMENT, Languages, SQL. {\bf H.2.8} Information
                 Systems, DATABASE MANAGEMENT, Database Applications.",
}

@InProceedings{Wilschut:1995:PEM,
  author =       "Annita N. Wilschut and Jan Flokstra and Peter M. G.
                 Apers",
  title =        "Parallel evaluation of multi-join queries",
  crossref =     "ACM:1995:PAS",
  pages =        "115--126",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p115-wilschut/p115-wilschut.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p115-wilschut/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Goodman:1995:RPG,
  author =       "Nathan Goodman",
  title =        "Research problems in genome databases",
  crossref =     "ACM:1995:PPF",
  pages =        "125--125",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:41 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/212433/p125-goodman/p125-goodman.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/212433/p125-goodman/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/212433/p125-goodman/",
  acknowledgement = ack-nhfb,
  keywords =     "theory",
  subject =      "{\bf H.2.8} Information Systems, DATABASE MANAGEMENT,
                 Database Applications. {\bf J.3} Computer Applications,
                 LIFE AND MEDICAL SCIENCES, Biology and genetics.",
}

@InProceedings{Picouet:1995:SEI,
  author =       "Phillippe Picouet and Victor Vianu",
  title =        "Semantics and expressiveness issues in active
                 databases (extended abstract)",
  crossref =     "ACM:1995:PPF",
  pages =        "126--138",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:41 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/212433/p126-picouet/p126-picouet.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/212433/p126-picouet/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/212433/p126-picouet/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1995 ACM SIGMOD
                 international conference on management of data; Also
                 known as PODS 1995",
  keywords =     "ACM; algorithms; database systems; languages; SIGACT;
                 theory; verification",
  subject =      "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Data models. {\bf H.2.3} Information
                 Systems, DATABASE MANAGEMENT, Languages, Datalog. {\bf
                 H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems.",
}

@InProceedings{Hernandez:1995:MPP,
  author =       "Mauricio A. Hern{\'a}ndez and Salvatore J. Stolfo",
  title =        "The merge\slash purge problem for large databases",
  crossref =     "ACM:1995:PAS",
  pages =        "127--138",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p127-hernandez/p127-hernandez.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p127-hernandez/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Seshadri:1995:ESR,
  author =       "S. Seshadri and J. F. Naughton",
  title =        "On the Expected Size of Recursive Datalog Queries",
  crossref =     "ACM:1995:PPF",
  pages =        "137--148",
  year =         "1995",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  keywords =     "ACM; database systems; SIGACT",
}

@InProceedings{Dong:1995:SBF,
  author =       "Guozhu Dong and Jianwen Su",
  title =        "Space-bounded {FOIES} (extended abstract)",
  crossref =     "ACM:1995:PPF",
  pages =        "139--150",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:41 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/212433/p139-dong/p139-dong.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/212433/p139-dong/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/212433/p139-dong/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1995 ACM SIGMOD
                 international conference on management of data; Also
                 known as PODS 1995",
  keywords =     "ACM; algorithms; database systems; SIGACT; theory;
                 verification",
  subject =      "{\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,
                 Computations on discrete structures. {\bf G.2.2}
                 Mathematics of Computing, DISCRETE MATHEMATICS, Graph
                 Theory, Graph algorithms. {\bf G.2.2} Mathematics of
                 Computing, DISCRETE MATHEMATICS, Graph Theory, Trees.",
}

@InProceedings{Ramaswamy:1995:OIC,
  author =       "Sridhar Ramaswamy and Paris C. Kanellakis",
  title =        "{OODB} indexing by class-division",
  crossref =     "ACM:1995:PAS",
  pages =        "139--150",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p139-ramaswamy/p139-ramaswamy.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p139-ramaswamy/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Grumbach:1995:TQL,
  author =       "S. Grumbach and V. Vianu",
  title =        "Tractable Query Languages for Complex Object
                 Databases",
  crossref =     "ACM:1995:PPF",
  pages =        "149--167",
  year =         "1995",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  keywords =     "ACM; database systems; SIGACT",
}

@InProceedings{Aref:1995:HTI,
  author =       "Walid Aref and Daniel Barbar{\'a} and Padmavathi
                 Vallabhaneni",
  title =        "The handwritten trie: indexing electronic ink",
  crossref =     "ACM:1995:PAS",
  pages =        "151--162",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p151-aref/p151-aref.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p151-aref/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cadoli:1995:SRK,
  author =       "Marco Cadoli and Francesco M. Donini and Paolo
                 Liberatore and Marco Schaerf",
  title =        "The Size of a Revised Knowledge Base",
  crossref =     "ACM:1995:PPF",
  pages =        "151--162",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:41 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/212433/p151-cadoli/p151-cadoli.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/212433/p151-cadoli/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/212433/p151-cadoli/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1995 ACM SIGMOD
                 international conference on management of data; Also
                 known as PODS 1995",
  keywords =     "ACM; algorithms; database systems; SIGACT; theory",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing. {\bf I.2.3} Computing
                 Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and
                 Theorem Proving, Nonmonotonic reasoning and belief
                 revision. {\bf F.1.3} Theory of Computation,
                 COMPUTATION BY ABSTRACT DEVICES, Complexity Measures
                 and Classes.",
}

@InProceedings{Levy:1995:SQO,
  author =       "Alon Y. Levy and Yehoshua Sagiv",
  title =        "Semantic query optimization in {Datalog} programs
                 (extended abstract)",
  crossref =     "ACM:1995:PPF",
  pages =        "163--173",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:41 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/212433/p163-levy/p163-levy.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/212433/p163-levy/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/212433/p163-levy/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1995 ACM SIGMOD
                 international conference on management of data; Also
                 known as PODS 1995",
  keywords =     "ACM; database systems; performance; SIGACT; theory;
                 verification",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing. {\bf G.2.2} Mathematics of
                 Computing, DISCRETE MATHEMATICS, Graph Theory, Trees.
                 {\bf D.3.4} Software, PROGRAMMING LANGUAGES,
                 Processors, Optimization. {\bf H.2.3} Information
                 Systems, DATABASE MANAGEMENT, Languages, Datalog. {\bf
                 F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND
                 FORMAL LANGUAGES, Mathematical Logic. {\bf F.3.1}
                 Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS,
                 Specifying and Verifying and Reasoning about
                 Programs.",
}

@InProceedings{Faloutsos:1995:FFA,
  author =       "Christos Faloutsos and King-Ip Lin",
  title =        "{{\em FastMap\/}}: a fast algorithm for indexing,
                 data-mining and visualization of traditional and
                 multimedia datasets",
  crossref =     "ACM:1995:PAS",
  pages =        "163--174",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p163-faloutsos/p163-faloutsos.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p163-faloutsos/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Johnson:1995:TUB,
  author =       "D. B. Johnson and L. Raab",
  title =        "A Tight Upper Bound on the Benefits of Replica Control
                 Protocols",
  crossref =     "ACM:1995:PPF",
  pages =        "168--176",
  year =         "1995",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  keywords =     "ACM; database systems; SIGACT",
}

@InProceedings{Wood:1995:MFC,
  author =       "Peter T. Wood",
  title =        "Magic factoring of closure programs (extended
                 abstract)",
  crossref =     "ACM:1995:PPF",
  pages =        "174--183",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:41 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/212433/p174-wood/p174-wood.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/212433/p174-wood/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/212433/p174-wood/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1995 ACM SIGMOD
                 international conference on management of data; Also
                 known as PODS 1995",
  keywords =     "ACM; algorithms; database systems; languages; SIGACT;
                 theory; verification",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Datalog. {\bf F.2.2} Theory of Computation,
                 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY,
                 Nonnumerical Algorithms and Problems, Computations on
                 discrete structures. {\bf D.3.4} Software, PROGRAMMING
                 LANGUAGES, Processors, Optimization.",
}

@InProceedings{Park:1995:EHB,
  author =       "Jong Soo Park and Ming-Syan Chen and Philip S. Yu",
  title =        "An effective hash-based algorithm for mining
                 association rules",
  crossref =     "ACM:1995:PAS",
  pages =        "175--186",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p175-park/p175-park.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p175-park/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Afrati:1995:DVP,
  author =       "F. Afrati and S. S. Cosmadakis and M. Yannakakis",
  title =        "On Datalog vs. Polynomial Time",
  crossref =     "ACM:1995:PPF",
  pages =        "177--196",
  year =         "1995",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  keywords =     "ACM; database systems; SIGACT",
}

@InProceedings{Ross:1995:STC,
  author =       "Kenneth A. Ross",
  title =        "Structural Totality and Constraint Stratification",
  crossref =     "ACM:1995:PPF",
  pages =        "184--195",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:41 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/212433/p184-ross/p184-ross.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/212433/p184-ross/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/212433/p184-ross/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1995 ACM SIGMOD
                 international conference on management of data; Also
                 known as PODS 1995",
  keywords =     "ACM; algorithms; database systems; languages; SIGACT;
                 theory",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Datalog. {\bf F.4.1} Theory of Computation,
                 MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical
                 Logic, Logic and constraint programming. {\bf F.3.3}
                 Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS,
                 Studies of Program Constructs. {\bf H.2.0} Information
                 Systems, DATABASE MANAGEMENT, General.",
}

@InProceedings{White:1995:ICR,
  author =       "Seth J. White and David J. DeWitt",
  title =        "Implementing crash recovery in {QuickStore}: a
                 performance study",
  crossref =     "ACM:1995:PAS",
  pages =        "187--198",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p187-white/p187-white.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p187-white/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chang:1995:UWG,
  author =       "Ti-Pin Chang and Richard Hull",
  title =        "Using witness generators to support bi-directional
                 update between object-based databases (extended
                 abstract)",
  crossref =     "ACM:1995:PPF",
  pages =        "196--207",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:41 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/212433/p196-chang/p196-chang.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/212433/p196-chang/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/212433/p196-chang/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1995 ACM SIGMOD
                 international conference on management of data; Also
                 known as PODS 1995",
  keywords =     "ACM; algorithms; database systems; languages; SIGACT;
                 theory; verification",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems. {\bf F.3.1} Theory of Computation, LOGICS AND
                 MEANINGS OF PROGRAMS, Specifying and Verifying and
                 Reasoning about Programs. {\bf F.3.2} Theory of
                 Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics
                 of Programming Languages. {\bf F.4.1} Theory of
                 Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES,
                 Mathematical Logic, Logic and constraint programming.",
}

@InProceedings{Helm:1995:SQO,
  author =       "R. Helm and K. Marriott and M. Odersky",
  title =        "Spatial Query Optimization: From {Boolean} Constraints
                 to Range Queries",
  crossref =     "ACM:1995:PPF",
  pages =        "197--210",
  year =         "1995",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  keywords =     "ACM; database systems; SIGACT",
}

@InProceedings{Acharya:1995:BDD,
  author =       "Swarup Acharya and Rafael Alonso and Michael Franklin
                 and Stanley Zdonik",
  title =        "Broadcast disks: data management for asymmetric
                 communication environments",
  crossref =     "ACM:1995:PAS",
  pages =        "199--210",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p199-acharya/p199-acharya.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p199-acharya/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Andries:1995:AUM,
  author =       "Marc Andries and Luca Cabibbo and Jan Paredaens and
                 Jan {Van den Bussche}",
  title =        "Applying an update method to a set of receivers
                 (extended abstract)",
  crossref =     "ACM:1995:PPF",
  pages =        "208--218",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:41 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/212433/p208-andries/p208-andries.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/212433/p208-andries/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/212433/p208-andries/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1995 ACM SIGMOD
                 international conference on management of data; Also
                 known as PODS 1995",
  keywords =     "ACM; algorithms; database systems; languages; SIGACT;
                 theory; verification",
  subject =      "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Data models. {\bf H.2.4} Information
                 Systems, DATABASE MANAGEMENT, Systems. {\bf H.2.3}
                 Information Systems, DATABASE MANAGEMENT, Languages,
                 SQL. {\bf H.2.1} Information Systems, DATABASE
                 MANAGEMENT, Logical Design, Normal forms.",
}

@InProceedings{Garcia-Molina:1995:NDQ,
  author =       "H. Garc{\'\i}a-Molina and K. Salem",
  title =        "Non-deterministic Queue Operations",
  crossref =     "ACM:1995:PPF",
  pages =        "211--222",
  year =         "1995",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  keywords =     "ACM; database systems; SIGACT",
}

@InProceedings{Gupta:1995:AMV,
  author =       "Ashish Gupta and Inderpal S. Mumick and Kenneth A.
                 Ross",
  title =        "Adapting materialized views after redefinitions",
  crossref =     "ACM:1995:PAS",
  pages =        "211--222",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p211-gupta/p211-gupta.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p211-gupta/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Libkin:1995:NID,
  author =       "Leonid Libkin",
  title =        "Normalizing Incomplete Databases",
  crossref =     "ACM:1995:PPF",
  pages =        "219--230",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:41 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/212433/p219-libkin/p219-libkin.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/212433/p219-libkin/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/212433/p219-libkin/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1995 ACM SIGMOD
                 international conference on management of data; Also
                 known as PODS 1995",
  keywords =     "ACM; algorithms; database systems; design;
                 experimentation; languages; SIGACT; theory",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing. {\bf H.2.3} Information
                 Systems, DATABASE MANAGEMENT, Languages, Query
                 languages. {\bf E.1} Data, DATA STRUCTURES, Trees. {\bf
                 H.2.1} Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Data models. {\bf H.2.1} Information
                 Systems, DATABASE MANAGEMENT, Logical Design, Normal
                 forms.",
}

@InProceedings{Hou:1995:EDC,
  author =       "Wen-Chi Hou and Zhongyang Zhang",
  title =        "Enhancing database correctness: a statistical
                 approach",
  crossref =     "ACM:1995:PAS",
  pages =        "223--232",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p223-hou/p223-hou.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p223-hou/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Beeri:1995:SO,
  author =       "C. Beeri and T. Milo",
  title =        "Subtyping in {OODBs}",
  crossref =     "ACM:1995:PPF",
  pages =        "223--243",
  year =         "1995",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  keywords =     "ACM; database systems; SIGACT",
}

@InProceedings{Kolaitis:1995:CGD,
  author =       "Phokion G. Kolaitis",
  title =        "Combinatorial games in database theory",
  crossref =     "ACM:1995:PPF",
  pages =        "231--232",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:41 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/212433/p231-kolaitis/p231-kolaitis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/212433/p231-kolaitis/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/212433/p231-kolaitis/",
  acknowledgement = ack-nhfb,
  keywords =     "languages; theory",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Query languages. {\bf G.2.1} Mathematics of
                 Computing, DISCRETE MATHEMATICS, Combinatorics,
                 Combinatorial algorithms. {\bf G.2.2} Mathematics of
                 Computing, DISCRETE MATHEMATICS, Graph Theory, Graph
                 algorithms.",
}

@InProceedings{Kolaitis:1995:TCG,
  author =       "P. Kolaitis",
  title =        "Tutorial:Combinatorial Games In Database Theory",
  crossref =     "ACM:1995:PPF",
  pages =        "231--232",
  year =         "1995",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1995 ACM SIGMOD
                 international conference on management of data; Also
                 known as PODS 1995",
  keywords =     "ACM; database systems; SIGACT",
}

@InProceedings{Chaudhri:1995:SLP,
  author =       "Vinay K. Chaudhri and Vassos Hadzilacos",
  title =        "Safe Locking Policies for Dynamic Databases",
  crossref =     "ACM:1995:PPF",
  pages =        "233--244",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:41 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/212433/p233-chaudhri/p233-chaudhri.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/212433/p233-chaudhri/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/212433/p233-chaudhri/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1995 ACM SIGMOD
                 international conference on management of data; Also
                 known as PODS 1995",
  keywords =     "ACM; algorithms; database systems; SIGACT; theory;
                 verification",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Concurrency. {\bf H.2.2} Information Systems,
                 DATABASE MANAGEMENT, Physical Design, Deadlock
                 avoidance. {\bf H.2.4} Information Systems, DATABASE
                 MANAGEMENT, Systems, Transaction processing. {\bf
                 G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS,
                 Graph Theory, Graph algorithms.",
}

@InProceedings{Ioannidis:1995:BHO,
  author =       "Yannis E. Ioannidis and Viswanath Poosala",
  title =        "Balancing histogram optimality and practicality for
                 query result size estimation",
  crossref =     "ACM:1995:PAS",
  pages =        "233--244",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p233-ioannidis/p233-ioannidis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p233-ioannidis/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ganguly:1995:EPD,
  author =       "S. Ganguly and S. Greco and C. Zaniolo",
  title =        "Extrema Predicates in Deductive Databases",
  crossref =     "ACM:1995:PPF",
  pages =        "244--259",
  year =         "1995",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  keywords =     "ACM; database systems; SIGACT",
}

@InProceedings{Keidar:1995:IRA,
  author =       "Idit Keidar and Danny Dolev",
  title =        "Increasing the resilience of atomic commit, at no
                 additional cost",
  crossref =     "ACM:1995:PPF",
  pages =        "245--254",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:41 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/212433/p245-keidar/p245-keidar.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/212433/p245-keidar/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/212433/p245-keidar/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1995 ACM SIGMOD
                 international conference on management of data; Also
                 known as PODS 1995",
  keywords =     "ACM; algorithms; database systems; reliability;
                 SIGACT; verification",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Distributed databases. {\bf H.2.4} Information
                 Systems, DATABASE MANAGEMENT, Systems, Transaction
                 processing.",
}

@InProceedings{Adelberg:1995:AUS,
  author =       "B. Adelberg and H. Garcia-Molina and B. Kao",
  title =        "Applying update streams in a soft real-time database
                 system",
  crossref =     "ACM:1995:PAS",
  pages =        "245--256",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p245-adelberg/p245-adelberg.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p245-adelberg/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chekuri:1995:SPP,
  author =       "Chandra Chekuri and Waqar Hasan and Rajeev Motwani",
  title =        "Scheduling Problems in Parallel Query Optimization",
  crossref =     "ACM:1995:PPF",
  pages =        "255--265",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:41 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/212433/p255-chekuri/p255-chekuri.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/212433/p255-chekuri/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/212433/p255-chekuri/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1995 ACM SIGMOD
                 international conference on management of data; Also
                 known as PODS 1995",
  keywords =     "ACM; algorithms; database systems; languages;
                 performance; SIGACT; theory",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing. {\bf H.2.3} Information
                 Systems, DATABASE MANAGEMENT, Languages, SQL. {\bf
                 H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Concurrency. {\bf G.2.2} Mathematics of
                 Computing, DISCRETE MATHEMATICS, Graph Theory, Trees.
                 {\bf F.2.2} Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems, Sequencing and scheduling.",
}

@InProceedings{Bettini:1995:SAQ,
  author =       "Claudio Bettini and X. Sean Wang and Elisa Bertino and
                 Sushil Jajodia",
  title =        "Semantic assumptions and query evaluation in temporal
                 databases",
  crossref =     "ACM:1995:PAS",
  pages =        "257--268",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p257-bettini/p257-bettini.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p257-bettini/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Vardi:1995:CBV,
  author =       "Moshe Y. Vardi",
  title =        "On the complexity of bounded-variable queries
                 (extended abstract)",
  crossref =     "ACM:1995:PPF",
  pages =        "266--276",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:41 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/212433/p266-vardi/p266-vardi.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/212433/p266-vardi/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/212433/p266-vardi/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1995 ACM SIGMOD
                 international conference on management of data; Also
                 known as PODS 1995",
  keywords =     "ACM; database systems; languages; SIGACT; theory;
                 verification",
  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 F.4.1} Theory of Computation, MATHEMATICAL
                 LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf
                 F.1.3} Theory of Computation, COMPUTATION BY ABSTRACT
                 DEVICES, Complexity Measures and Classes.",
}

@InProceedings{Sistla:1995:TCI,
  author =       "A. Prasad Sistla and Ouri Wolfson",
  title =        "Temporal conditions and integrity constraints in
                 active database systems",
  crossref =     "ACM:1995:PAS",
  pages =        "269--280",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p269-sistla/p269-sistla.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p269-sistla/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Stolboushkin:1995:FQD,
  author =       "Alexei P. Stolboushkin and Michael A. Taitslin",
  title =        "Finite Queries do not Have Effective Syntax",
  crossref =     "ACM:1995:PPF",
  pages =        "277--285",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:41 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/212433/p277-stolboushkin/p277-stolboushkin.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/212433/p277-stolboushkin/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/212433/p277-stolboushkin/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1995 ACM SIGMOD
                 international conference on management of data; Also
                 known as PODS 1995",
  keywords =     "ACM; algorithms; database systems; languages; SIGACT;
                 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. {\bf D.3.1} Software, PROGRAMMING
                 LANGUAGES, Formal Definitions and Theory, Syntax. {\bf
                 H.2.1} Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Data models.",
}

@InProceedings{Davison:1995:DRB,
  author =       "Diane L. Davison and Goetz Graefe",
  title =        "Dynamic resource brokering for multi-user query
                 execution",
  crossref =     "ACM:1995:PAS",
  pages =        "281--292",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p281-davison/p281-davison.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p281-davison/",
  acknowledgement = ack-nhfb,
}

@InProceedings{DeRougemont:1995:RQ,
  author =       "M. {De Rougemont}",
  title =        "The Reliability of Queries",
  crossref =     "ACM:1995:PPF",
  pages =        "286--291",
  year =         "1995",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1995 ACM SIGMOD
                 international conference on management of data; Also
                 known as PODS 1995",
  keywords =     "ACM; database systems; SIGACT",
}

@InProceedings{deRougemont:1995:RQE,
  author =       "Michel de Rougemont",
  title =        "The reliability of queries (extended abstract)",
  crossref =     "ACM:1995:PPF",
  pages =        "286--291",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:41 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/citations/proceedings/pods/212433/p286-de_rougemont/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/212433/p286-de_rougemont/",
  acknowledgement = ack-nhfb,
  keywords =     "languages; reliability; theory; verification",
  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 F.4.1} Theory of Computation, MATHEMATICAL
                 LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf
                 F.1.3} Theory of Computation, COMPUTATION BY ABSTRACT
                 DEVICES, Complexity Measures and Classes. {\bf H.2.3}
                 Information Systems, DATABASE MANAGEMENT, Languages,
                 Datalog. {\bf H.2.4} Information Systems, DATABASE
                 MANAGEMENT, Systems, Query processing.",
}

@InProceedings{Du:1995:RMQ,
  author =       "Weimin Du and Ming-Chien Shan and Umeshwar Dayal",
  title =        "Reducing multidatabase query response time by tree
                 balancing",
  crossref =     "ACM:1995:PAS",
  pages =        "293--303",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p293-du/p293-du.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p293-du/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bhargava:1995:HBR,
  author =       "Gautam Bhargava and Piyush Goel and Bala Iyer",
  title =        "Hypergraph based reorderings of outer join queries
                 with complex predicates",
  crossref =     "ACM:1995:PAS",
  pages =        "304--315",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p304-bhargava/p304-bhargava.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p304-bhargava/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Zhuge:1995:VMW,
  author =       "Yue Zhuge and H{\'e}ctor Garc{\'\i}a-Molina and
                 Joachim Hammer and Jennifer Widom",
  title =        "View maintenance in a warehousing environment",
  crossref =     "ACM:1995:PAS",
  pages =        "316--327",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p316-zhuge/p316-zhuge.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p316-zhuge/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Griffin:1995:IMV,
  author =       "Timothy Griffin and Leonid Libkin",
  title =        "Incremental maintenance of views with duplicates",
  crossref =     "ACM:1995:PAS",
  pages =        "328--339",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p328-griffin/p328-griffin.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p328-griffin/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Lu:1995:EMM,
  author =       "James J. Lu and Guido Moerkotte and Joachim Schue and
                 V. S. Subrahmanian",
  title =        "Efficient maintenance of materialized mediated views",
  crossref =     "ACM:1995:PAS",
  pages =        "340--351",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p340-lu/p340-lu.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p340-lu/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Freedman:1995:SSV,
  author =       "Craig S. Freedman and David J. DeWitt",
  title =        "The {SPIFFI} scalable video-on-demand system",
  crossref =     "ACM:1995:PAS",
  pages =        "352--363",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p352-freedman/p352-freedman.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p352-freedman/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Berson:1995:FTD,
  author =       "Steven Berson and Leana Golubchik and Richard R.
                 Muntz",
  title =        "Fault tolerant design of multimedia servers",
  crossref =     "ACM:1995:PAS",
  pages =        "364--375",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p364-berson/p364-berson.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p364-berson/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Dan:1995:OVP,
  author =       "Asit Dan and Dinkar Sitaram",
  title =        "An online video placement policy based on bandwidth to
                 space ratio {(BSR)}",
  crossref =     "ACM:1995:PAS",
  pages =        "376--385",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p376-dan/p376-dan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p376-dan/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Abiteboul:1995:DIF,
  author =       "Serge Abiteboul and Sophie Cluet and Tova Milo",
  title =        "A database interface for file update",
  crossref =     "ACM:1995:PAS",
  pages =        "386--397",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p386-abiteboul/p386-abiteboul.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p386-abiteboul/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Brin:1995:CDM,
  author =       "Sergey Brin and James Davis and H{\'e}ctor
                 Garc{\'\i}a-Molina",
  title =        "Copy detection mechanisms for digital documents",
  crossref =     "ACM:1995:PAS",
  pages =        "398--409",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p398-brin/p398-brin.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p398-brin/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chaudhuri:1995:JQE,
  author =       "Surajit Chaudhuri and Umeshwar Dayal and Tak W. Yan",
  title =        "Join queries with external text sources: execution and
                 optimization techniques",
  crossref =     "ACM:1995:PAS",
  pages =        "410--422",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p410-chaudhuri/p410-chaudhuri.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p410-chaudhuri/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Microsoft:1995:OOR,
  author =       "{Fox Development Team Microsoft}",
  title =        "Object-oriented, rapid application development in a
                 {PC} database environment",
  crossref =     "ACM:1995:PAS",
  pages =        "423--424",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/citations/proceedings/mod/223784/p423-fox_development_team_microsoft/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Microsoft:1995:UFF,
  author =       "{The Access Team Microsoft}",
  title =        "Upsizing form file server to client server
                 architectures",
  crossref =     "ACM:1995:PAS",
  pages =        "425--426",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/citations/proceedings/mod/223784/p425-the_access_team_microsoft/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Moore:1995:LNS,
  author =       "Kenneth Moore",
  title =        "The {Lotus} notes storage system",
  crossref =     "ACM:1995:PAS",
  pages =        "427--428",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p427-moore/p427-moore.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p427-moore/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gettys:1995:DOR,
  author =       "William L. Gettys",
  title =        "{DIRECTV} and {Oracle Rdb}: the challenge of {VLDB}
                 transaction processing",
  crossref =     "ACM:1995:PAS",
  pages =        "429--430",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p429-gettys/p429-gettys.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p429-gettys/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hope:1995:ETP,
  author =       "Greg Hope",
  title =        "Enterprise transaction processing on {Windows NT}",
  crossref =     "ACM:1995:PAS",
  pages =        "431--432",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p431-hope/p431-hope.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p431-hope/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ivinskis:1995:HAC,
  author =       "Kestutis Ivinskis",
  title =        "High availability of commercial applications",
  crossref =     "ACM:1995:PAS",
  pages =        "433--434",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p433-ivinskis/p433-ivinskis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p433-ivinskis/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Buneman:1995:DYW,
  author =       "Peter Buneman and David Maier",
  title =        "The data that you won't find in databases: tutorial
                 panel on data exchange formats",
  crossref =     "ACM:1995:PAS",
  pages =        "435--435",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p435-buneman/p435-buneman.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p435-buneman/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gray:1995:PDS,
  author =       "Jim Gray",
  title =        "Parallel database systems 101",
  crossref =     "ACM:1995:PAS",
  pages =        "436--436",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p436-gray/p436-gray.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p436-gray/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ellison:1995:KA,
  author =       "Larry J. Ellison",
  title =        "Keynote address",
  crossref =     "ACM:1995:PAS",
  pages =        "437--437",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p437-ellison/p437-ellison.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p437-ellison/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Epstein:1995:KA,
  author =       "Robert S. Epstein",
  title =        "Keynote {Address}",
  crossref =     "ACM:1995:PAS",
  pages =        "438--438",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p438-epstein/p438-epstein.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p438-epstein/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Goldring:1995:TEU,
  author =       "Rob Goldring",
  title =        "Things every update replication customer should know
                 (abstract)",
  crossref =     "ACM:1995:PAS",
  pages =        "439--440",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p439-goldring/p439-goldring.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p439-goldring/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Shyy:1995:VRS,
  author =       "Yuh-Ming Shyy and H. Stephen Au-Yeung and C. P. Chou",
  title =        "{VERSANT} replication: supporting fault-tolerant
                 object databases",
  crossref =     "ACM:1995:PAS",
  pages =        "441--442",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p441-shyy/p441-shyy.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p441-shyy/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Woelk:1995:CID,
  author =       "D. Woelk and B. Bohrer and N. Jacobs and K. Ong and C.
                 Tomlinson and C. Unnikrishnan",
  title =        "{Carnot} and {InfoSleuth}: database technology and the
                 {World Wide Web}",
  crossref =     "ACM:1995:PAS",
  pages =        "443--444",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p443-woelk/p443-woelk.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p443-woelk/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Edelstein:1995:RPT,
  author =       "Herb Edelstein",
  title =        "Research and products--are they relevant to each
                 other? (panel session)",
  crossref =     "ACM:1995:PAS",
  pages =        "445--445",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p445-edelstein/p445-edelstein.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p445-edelstein/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Squire:1995:DET,
  author =       "Case Squire",
  title =        "Data extraction and transformation for the data
                 warehouse",
  crossref =     "ACM:1995:PAS",
  pages =        "446--447",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p446-squire/p446-squire.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p446-squire/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bansal:1995:RWR,
  author =       "Sanju K. Bansal",
  title =        "Real world requirements for decision
                 support--implications for {RDBMS}",
  crossref =     "ACM:1995:PAS",
  pages =        "448--448",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p448-bansal/p448-bansal.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p448-bansal/",
  acknowledgement = ack-nhfb,
}

@InProceedings{French:1995:OSF,
  author =       "Clark D. French",
  title =        "``One size fits all'' database architectures do not
                 work for {DSS}",
  crossref =     "ACM:1995:PAS",
  pages =        "449--450",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p449-french/p449-french.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p449-french/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Perna:1995:LIA,
  author =       "Janet Perna",
  title =        "Leveraging the information asset",
  crossref =     "ACM:1995:PAS",
  pages =        "451--452",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p451-perna/p451-perna.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p451-perna/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Olson:1995:CYA,
  author =       "Michael A. Olson",
  title =        "Cover your assets",
  crossref =     "ACM:1995:PAS",
  pages =        "453--453",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p453-olson/p453-olson.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p453-olson/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Atkinson:1995:UCA,
  author =       "Robert Atkinson",
  title =        "Use of a component architecture in integrating
                 relational and non-relational",
  crossref =     "ACM:1995:PAS",
  pages =        "454--454",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p454-atkinson/p454-atkinson.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p454-atkinson/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kleissner:1995:EOF,
  author =       "Charly Kleissner",
  title =        "{Enterprise Objects Framework}: a second generation
                 object-relational enabler",
  crossref =     "ACM:1995:PAS",
  pages =        "455--459",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p455-kleissner/p455-kleissner.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p455-kleissner/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Baru:1995:ODP,
  author =       "Chaitanya Baru and Gilles Fecteau",
  title =        "An overview of {DB2} parallel edition",
  crossref =     "ACM:1995:PAS",
  pages =        "460--462",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p460-baru/p460-baru.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p460-baru/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gerber:1995:IOX,
  author =       "Bob Gerber",
  title =        "{Informix} online {XPS}",
  crossref =     "ACM:1995:PAS",
  pages =        "463--463",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p463-gerber/p463-gerber.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p463-gerber/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Levine:1995:OMA,
  author =       "Charles Levine",
  title =        "Order-of-magnitude advantage on {TPC-C} through
                 massive parallelism",
  crossref =     "ACM:1995:PAS",
  pages =        "464--465",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p464-levine/p464-levine.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p464-levine/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Deutsch:1995:OSP,
  author =       "Donald R. Deutsch",
  title =        "Objects and {SQL} (panel session): strange
                 relations?",
  crossref =     "ACM:1995:PAS",
  pages =        "466--466",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p466-deutsch/p466-deutsch.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p466-deutsch/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Faloutsos:1995:IMD,
  author =       "Christos Faloutsos",
  title =        "Indexing multimedia databases",
  crossref =     "ACM:1995:PAS",
  pages =        "467--467",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p467-faloutsos/p467-faloutsos.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p467-faloutsos/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Melton:1995:OET,
  author =       "Jim Melton and Nelson Mendoca Mattos",
  title =        "An overview of the emerging third-generation {SQL}
                 standard",
  crossref =     "ACM:1995:PAS",
  pages =        "468--468",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p468-melton/p468-melton.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p468-melton/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Sheth:1995:WAA,
  author =       "Amit Sheth",
  title =        "Workflow automation: applications, technology and
                 research",
  crossref =     "ACM:1995:PAS",
  pages =        "469--469",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p469-sheth/p469-sheth.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p469-sheth/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Norrie:1995:IAC,
  author =       "Moira C. Norrie",
  title =        "Integration approaches for {CIM}",
  crossref =     "ACM:1995:PAS",
  pages =        "470--470",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p470-norrie/p470-norrie.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p470-norrie/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gibson:1995:TST,
  author =       "Garth A. Gibson",
  title =        "Tutorial on storage technology: {RAID} and beyond",
  crossref =     "ACM:1995:PAS",
  pages =        "471--471",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p471-gibson/p471-gibson.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p471-gibson/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Imielinski:1995:DIR,
  author =       "T. Imielinski and A. Virmani",
  title =        "{DataMine--interactive} rule discovery system",
  crossref =     "ACM:1995:PAS",
  pages =        "472--472",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p472-imielinski/p472-imielinski.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p472-imielinski/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ceri:1995:ATC,
  author =       "Stefano Ceri and Piero Fraternali and Stefano
                 Paraboschi and Giuseppe Psaila",
  title =        "The {Algres} testbed of {CHIMERA}: an active
                 object-oriented database system",
  crossref =     "ACM:1995:PAS",
  pages =        "473--473",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p473-ceri/p473-ceri.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p473-ceri/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Collet:1995:NS,
  author =       "C. Collet and T. Coupaye",
  title =        "The {NAOS} system",
  crossref =     "ACM:1995:PAS",
  pages =        "474--474",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p474-collet/p474-collet.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p474-collet/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ashley:1995:QIC,
  author =       "Jonathan Ashley and Myron Flickner and James Hafner
                 and Denis Lee and Wayne Niblack and Dragutin Petkovic",
  title =        "The query by image content {(QBIC)} system",
  crossref =     "ACM:1995:PAS",
  pages =        "475--475",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p475-ashley/p475-ashley.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p475-ashley/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Buchmann:1995:RAO,
  author =       "A. P. Buchmann and A. Deutsch and J. Zimmermann and M.
                 Higa",
  title =        "The {REACH} active {OODBMS}",
  crossref =     "ACM:1995:PAS",
  pages =        "476--476",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p476-buchmann/p476-buchmann.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p476-buchmann/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Massari:1995:QQI,
  author =       "Antonio Massari and Stefano Pavani and Lorenzo
                 Saladini and Panos K. Chrysanthis",
  title =        "{QBI}: query by icons",
  crossref =     "ACM:1995:PAS",
  pages =        "477--477",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p477-massari/p477-massari.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p477-massari/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Shklar:1995:ISS,
  author =       "Leon Shklar and Amit Sheth and Vipul Kashyap and
                 Satish Thatte",
  title =        "{InfoHarness}: a system for search and retrieval of
                 heterogeneous information",
  crossref =     "ACM:1995:PAS",
  pages =        "478--478",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p478-shklar/p478-shklar.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p478-shklar/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Thomas:1995:DIA,
  author =       "J. Thomas and S. De{\ss}loch and N. Mattos",
  title =        "Design and implementation of advanced knowledge
                 processing in the {KBMS KRISYS}",
  crossref =     "ACM:1995:PAS",
  pages =        "479--479",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p479-thomas/p479-thomas.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p479-thomas/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gatziu:1995:SAD,
  author =       "Stella Gatziu and Andreas Geppert and Klaus R.
                 Dittrich",
  title =        "The {SAMOS} active {DBMS} prototype",
  crossref =     "ACM:1995:PAS",
  pages =        "480--480",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p480-gatziu/p480-gatziu.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p480-gatziu/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Radeke:1995:EFD,
  author =       "E. Radeke and R. B{\"o}ttger and B. Burkert and Y.
                 Engel and G. Kachel and S. Kolmschlag and D. Nolte",
  title =        "Efendi: federated database system of {Cadlab}",
  crossref =     "ACM:1995:PAS",
  pages =        "481--481",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p481-radeke/p481-radeke.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p481-radeke/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Keim:1995:VSV,
  author =       "Daniel A. Keim and Hans-Peter Kriegel",
  title =        "{VisDB}: a system for visualizing large databases",
  crossref =     "ACM:1995:PAS",
  pages =        "482--482",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p482-keim/p482-keim.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p482-keim/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hammer:1995:ITM,
  author =       "Joachim Hammer and H{\'e}ctor Garc{\'\i}a-Molina and
                 Kelly Ireland and Yannis Papakonstantinou and Jeffrey
                 Ullman and Jennifer Widom",
  title =        "Information translation, mediation, and mosaic-based
                 browsing in the {TSIMMIS} system",
  crossref =     "ACM:1995:PAS",
  pages =        "483--483",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p483-hammer/p483-hammer.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p483-hammer/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Li:1995:SSP,
  author =       "Wen-Syan Li and Chris Clifton",
  title =        "Semint: a system prototype for semantic integration in
                 heterogeneous databases",
  crossref =     "ACM:1995:PAS",
  pages =        "484--484",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p484-li/p484-li.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p484-li/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Team:1995:PDS,
  author =       "The Paradise Team",
  title =        "{Paradise}: a database system for {GIS} applications",
  crossref =     "ACM:1995:PAS",
  pages =        "485--485",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p485-the_paradise_team/p485-the_paradise_team.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p485-the_paradise_team/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Team:1995:SCB,
  author =       "{The SHORE Team}",
  title =        "{Shore}: combining the best features of {OODBMS} and
                 file systems",
  crossref =     "ACM:1995:PAS",
  pages =        "486--486",
  year =         "1995",
  bibdate =      "Sat Oct 28 08:28:02 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p486-the_shore_team/p486-the_shore_team.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p486-the_shore_team/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Wang:1995:PMP,
  author =       "Jason T. L. Wang and Kaizhong Zhang and Dennis
                 Shasha",
  title =        "Pattern matching and pattern discovery in scientific,
                 program, and document databases",
  crossref =     "ACM:1995:PAS",
  pages =        "487--487",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p487-wang/p487-wang.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p487-wang/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Grossman:1995:PLW,
  author =       "R. L. Grossman and D. Hanley and X. Qin",
  title =        "{PTool}: a light weight persistent object manager",
  crossref =     "ACM:1995:PAS",
  pages =        "488--488",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p488-grossman/p488-grossman.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p488-grossman/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Dreyer:1995:UCT,
  author =       "Werner Dreyer and Angelika Kotz Dittrich and Duri
                 Schmidt",
  title =        "Using the {CALANDA} time series management system",
  crossref =     "ACM:1995:PAS",
  pages =        "489--489",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p489-dreyer/p489-dreyer.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p489-dreyer/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Jonker:1995:EMD,
  author =       "Willem Jonker and Heribert Sch{\"u}tz",
  title =        "The {ECRC} multi database system",
  crossref =     "ACM:1995:PAS",
  pages =        "490--490",
  year =         "1995",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/223784/p490-jonker/p490-jonker.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/223784/p490-jonker/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Goodman:1995:TRP,
  author =       "N. Goodman",
  title =        "Tutorial: Research Problems in Genome Databases p.
                 125",
  crossref =     "ACM:1995:PPF",
  pages =        "??--??",
  year =         "1995",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1995 ACM SIGMOD
                 international conference on management of data; Also
                 known as PODS 1995",
  keywords =     "ACM; database systems; SIGACT",
}

@InProceedings{Aho:1996:AIG,
  author =       "Alfred V. Aho",
  title =        "Accessing information from globally distributed
                 knowledge repositories (extended abstract)",
  crossref =     "ACM:1996:PPF",
  pages =        "1--4",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/237661/p1-aho/p1-aho.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/237661/p1-aho/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/237661/p1-aho/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1996 ACM SIGMOD
                 international conference on management of data. Also
                 known as PODS 1996",
  keywords =     "ACM; database systems; PODS; SIGACT; SIGART; SIGMOD;
                 theory",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems. {\bf H.5.1} Information Systems, INFORMATION
                 INTERFACES AND PRESENTATION, Multimedia Information
                 Systems.",
}

@InProceedings{Srikant:1996:MQA,
  author =       "Ramakrishnan Srikant and Rakesh Agrawal",
  title =        "Mining quantitative association rules in large
                 relational tables",
  crossref =     "Jagadish:1996:PAS",
  pages =        "1--12",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p1-srikant/p1-srikant.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p1-srikant/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Benedikt:1996:REP,
  author =       "Michael Benedikt and Guozhu Dong and Leonid Libkin and
                 Limsoon Wong",
  title =        "Relational Expressive Power of Constraint Query
                 Languages",
  crossref =     "ACM:1996:PPF",
  pages =        "5--16",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/237661/p5-benedikt/p5-benedikt.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/237661/p5-benedikt/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/237661/p5-benedikt/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1996 ACM SIGMOD
                 international conference on management of data. Also
                 known as PODS 1996",
  keywords =     "ACM; database systems; PODS; SIGACT; SIGART; SIGMOD;
                 theory; verification",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Query languages.",
}

@InProceedings{Fukuda:1996:DMU,
  author =       "Takeshi Fukuda and Yasukiko Morimoto and Shinichi
                 Morishita and Takeshi Tokuyama",
  title =        "Data mining using two-dimensional optimized
                 association rules: scheme, algorithms, and
                 visualization",
  crossref =     "Jagadish:1996:PAS",
  pages =        "13--23",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p13-fukuda/p13-fukuda.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p13-fukuda/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Stolboushkin:1996:LVO,
  author =       "Alexei P. Stolboushkin and Michael A. Taitslin",
  title =        "Linear vs. order constraint queries over rational
                 databases (extended abstract)",
  crossref =     "ACM:1996:PPF",
  pages =        "17--27",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/237661/p17-stolboushkin/p17-stolboushkin.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/237661/p17-stolboushkin/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/237661/p17-stolboushkin/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1996 ACM SIGMOD
                 international conference on management of data. Also
                 known as PODS 1996",
  keywords =     "ACM; database systems; PODS; SIGACT; SIGART; SIGMOD;
                 theory; verification",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing.",
}

@InProceedings{Selfridge:1996:IID,
  author =       "Peter G. Selfridge and Divesh Srivastava and Lynn O.
                 Wilson",
  title =        "{IDEA}: interactive data exploration and analysis",
  crossref =     "Jagadish:1996:PAS",
  pages =        "24--34",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p24-selfridge/p24-selfridge.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p24-selfridge/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Grumbach:1996:TPC,
  author =       "St{\'e}phane Grumbach and Jianwen Su",
  title =        "Towards practical constraint databases (extended
                 abstract)",
  crossref =     "ACM:1996:PPF",
  pages =        "28--39",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/237661/p28-grumbach/p28-grumbach.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/237661/p28-grumbach/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/237661/p28-grumbach/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1996 ACM SIGMOD
                 international conference on management of data. Also
                 known as PODS 1996",
  keywords =     "ACM; database systems; PODS; SIGACT; SIGART; SIGMOD;
                 theory; verification",
  subject =      "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Data models.",
}

@InProceedings{Vance:1996:RBJ,
  author =       "Bennet Vance and David Maier",
  title =        "Rapid bushy join-order optimization with {Cartesian}
                 products",
  crossref =     "Jagadish:1996:PAS",
  pages =        "35--46",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p35-vance/p35-vance.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p35-vance/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chomicki:1996:VIA,
  author =       "J. Chomicki and D. Q. Goldin and G. M. Kuper",
  title =        "Variable Independence and Aggregation Closure",
  crossref =     "ACM:1996:PPF",
  pages =        "40--48",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/237661/p40-chomicki/p40-chomicki.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/237661/p40-chomicki/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/237661/p40-chomicki/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1996 ACM SIGMOD
                 international conference on management of data. Also
                 known as PODS 1996",
  keywords =     "ACM; database systems; PODS; SIGACT; SIGART; SIGMOD;
                 theory; verification",
  subject =      "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Data models.",
}

@InProceedings{Goel:1996:SQO,
  author =       "Piyush Goel and Bala Iyer",
  title =        "{SQL} query optimization: reordering for a general
                 class of queries",
  crossref =     "Jagadish:1996:PAS",
  pages =        "47--56",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p47-goel/p47-goel.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p47-goel/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Abiteboul:1996:TVF,
  author =       "Serge Abiteboul and Laurent Herr and Jan {Van den
                 Bussche}",
  title =        "Temporal Versus First-Order Logic to Query Temporal
                 Databases",
  crossref =     "ACM:1996:PPF",
  pages =        "49--57",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/237661/p49-abiteboul/p49-abiteboul.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/237661/p49-abiteboul/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/237661/p49-abiteboul/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1996 ACM SIGMOD
                 international conference on management of data. Also
                 known as PODS 1996",
  keywords =     "ACM; database systems; PODS; SIGACT; SIGART; SIGMOD;
                 theory; verification",
  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.",
}

@InProceedings{Simmen:1996:FTO,
  author =       "David Simmen and Eugene Shekita and Timothy Malkemus",
  title =        "Fundamental techniques for order optimization",
  crossref =     "Jagadish:1996:PAS",
  pages =        "57--67",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p57-simmen/p57-simmen.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p57-simmen/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Toman:1996:PVI,
  author =       "David Toman",
  title =        "Point vs. interval-based query languages for temporal
                 databases (extended abstract)",
  crossref =     "ACM:1996:PPF",
  pages =        "58--67",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/237661/p58-toman/p58-toman.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/237661/p58-toman/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/237661/p58-toman/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1996 ACM SIGMOD
                 international conference on management of data. Also
                 known as PODS 1996",
  keywords =     "ACM; database systems; PODS; SIGACT; SIGART; SIGMOD;
                 theory; verification",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Query languages.",
}

@InProceedings{Bettini:1996:TCT,
  author =       "Claudio Bettini and X. Sean Wang and Sushil Jajodia",
  title =        "Testing complex temporal relationships involving
                 multiple granularities and its application to data
                 mining (extended abstract)",
  crossref =     "ACM:1996:PPF",
  pages =        "68--78",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/237661/p68-bettini/p68-bettini.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/237661/p68-bettini/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/237661/p68-bettini/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1996 ACM SIGMOD
                 international conference on management of data. Also
                 known as PODS 1996",
  keywords =     "ACM; database systems; PODS; SIGACT; SIGART; SIGMOD;
                 theory; verification",
  subject =      "{\bf F.1.1} Theory of Computation, COMPUTATION BY
                 ABSTRACT DEVICES, Models of Computation, Automata. {\bf
                 H.2.0} Information Systems, DATABASE MANAGEMENT,
                 General.",
}

@InProceedings{OConnell:1996:TCB,
  author =       "W. O'Connell and I. T. Ieong and D. Schrader and C.
                 Watson and G. Au and A. Biliris and S. Choo and P.
                 Colin and G. Linderman and E. Panagos and J. Wang and
                 T. Walter",
  title =        "A {Teradata} content-based multimedia object manager
                 for massively parallel architectures",
  crossref =     "Jagadish:1996:PAS",
  pages =        "68--78",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/citations/proceedings/mod/233269/p68-o_connell/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Anonymous:1996:MPC,
  author =       "Anonymous",
  title =        "In memoriam: {Paris C. Kanellakis}",
  crossref =     "ACM:1996:PPF",
  pages =        "79--79",
  year =         "1996",
  bibdate =      "Thu Mar 12 18:52:24 MST 1998",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org:80/pubs/citations/proceedings/pods/237661/p79-????/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hull:1996:MPC,
  author =       "Richard Hull",
  title =        "In memoriam: {Paris C. Kanellakis}",
  crossref =     "ACM:1996:PPF",
  pages =        "79--79",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/237661/p79-hull/p79-hull.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/237661/p79-hull/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ozden:1996:FTA,
  author =       "Banu {\"O}zden and Rajeev Rastogi and Prashant Shenoy
                 and Avi Silberschatz",
  title =        "Fault-tolerant architectures for continuous media
                 servers",
  crossref =     "Jagadish:1996:PAS",
  pages =        "79--90",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p79-ozden/p79-ozden.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p79-ozden/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Egenhofer:1996:GDS,
  author =       "Max J. Egenhofer",
  title =        "Geographic database systems: issues and research
                 needs",
  crossref =     "ACM:1996:PPF",
  pages =        "80--80",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/237661/p80-egenhofer/p80-egenhofer.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/237661/p80-egenhofer/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/237661/p80-egenhofer/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1996 ACM SIGMOD
                 international conference on management of data. Also
                 known as PODS 1996",
  keywords =     "ACM; database systems; PODS; SIGACT; SIGART; SIGMOD;
                 theory",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems.",
}

@InProceedings{Papadimitriou:1996:TQS,
  author =       "C. H. Papadimitriou and D. Suciu and V. Vianu",
  title =        "Topological Queries in Spatial Databases",
  crossref =     "ACM:1996:PPF",
  pages =        "81--92",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/237661/p81-papadimitriou/p81-papadimitriou.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/237661/p81-papadimitriou/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/237661/p81-papadimitriou/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1996 ACM SIGMOD
                 international conference on management of data. Also
                 known as PODS 1996",
  keywords =     "ACM; database systems; PODS; SIGACT; SIGART; SIGMOD;
                 theory; verification",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing.",
}

@InProceedings{Chaudhuri:1996:OQM,
  author =       "Surajit Chaudhuri and Luis Gravano",
  title =        "Optimizing queries over multimedia repositories",
  crossref =     "Jagadish:1996:PAS",
  pages =        "91--102",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p91-chaudhuri/p91-chaudhuri.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p91-chaudhuri/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gyssens:1996:TPQ,
  author =       "Marc Gyssens and Laks V. S. Lakshmanan and Iyer N.
                 Subramanian",
  title =        "Tables as a paradigm for querying and restructuring
                 (extended abstract)",
  crossref =     "ACM:1996:PPF",
  pages =        "93--103",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/237661/p93-gyssens/p93-gyssens.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/237661/p93-gyssens/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/237661/p93-gyssens/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1996 ACM SIGMOD
                 international conference on management of data. Also
                 known as PODS 1996",
  keywords =     "ACM; database systems; PODS; SIGACT; SIGART; SIGMOD;
                 theory",
  subject =      "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Data models. {\bf H.2.4} Information
                 Systems, DATABASE MANAGEMENT, Systems, Query
                 processing.",
}

@InProceedings{Zhang:1996:BED,
  author =       "Tian Zhang and Raghu Ramakrishnan and Miron Livny",
  title =        "{BIRCH}: an efficient data clustering method for very
                 large databases",
  crossref =     "Jagadish:1996:PAS",
  pages =        "103--114",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p103-zhang/p103-zhang.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p103-zhang/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Beeri:1996:GP,
  author =       "C. Beeri and T. Milo and P. Ta-Shma",
  title =        "On Genericity and Parametricity",
  crossref =     "ACM:1996:PPF",
  pages =        "104--116",
  year =         "1996",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1996 ACM SIGMOD
                 international conference on management of data. Also
                 known as PODS 1996",
  keywords =     "ACM; database systems; PODS; SIGACT; SIGART; SIGMOD",
}

@InProceedings{Beeri:1996:GPE,
  author =       "Catriel Beeri and Tova Milo and Paula Ta-Shma",
  title =        "On genericity and parametricity (extended abstract)",
  crossref =     "ACM:1996:PPF",
  pages =        "104--116",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/237661/p104-beeri/p104-beeri.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/237661/p104-beeri/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/237661/p104-beeri/",
  acknowledgement = ack-nhfb,
  keywords =     "theory",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Query languages.",
}

@InProceedings{Zou:1996:LRS,
  author =       "Chendong Zou and Betty Salzberg",
  title =        "On-line reorganization of sparsely-populated
                 {B$^+$-trees}",
  crossref =     "Jagadish:1996:PAS",
  pages =        "115--124",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p115-zou/p115-zou.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p115-zou/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Benedikt:1996:VPD,
  author =       "Michael Benedikt and Timothy Griffin and Leonid
                 Libkin",
  title =        "Verifiable Properties of Database Transactions",
  crossref =     "ACM:1996:PPF",
  pages =        "117--127",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/237661/p117-benedikt/p117-benedikt.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/237661/p117-benedikt/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/237661/p117-benedikt/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1996 ACM SIGMOD
                 international conference on management of data. Also
                 known as PODS 1996",
  keywords =     "ACM; database systems; PODS; SIGACT; SIGART; SIGMOD;
                 theory; verification",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Transaction processing.",
}

@InProceedings{Achyutuni:1996:TTL,
  author =       "Kiran J. Achyutuni and Edward Omiecinski and Shamkant
                 B. Navathe",
  title =        "Two techniques for on-line index modification in
                 shared nothing parallel databases",
  crossref =     "Jagadish:1996:PAS",
  pages =        "125--136",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p125-achyutuni/p125-achyutuni.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p125-achyutuni/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Maher:1996:CCT,
  author =       "Michael J. Maher and Divesh Srivastava",
  title =        "Chasing Constrained Tuple-Generating Dependencies",
  crossref =     "ACM:1996:PPF",
  pages =        "128--138 (or 127--138??)",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/237661/p128-maher/p128-maher.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/237661/p128-maher/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1996 ACM SIGMOD
                 international conference on management of data. Also
                 known as PODS 1996",
  keywords =     "ACM; database systems; PODS; SIGACT; SIGART; SIGMOD;
                 theory",
  subject =      "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
                 Logical Design. {\bf H.2.4} Information Systems,
                 DATABASE MANAGEMENT, Systems.",
}

@InProceedings{Adali:1996:QCO,
  author =       "S. Adali and K. S. Candan and Y. Papakonstantinou and
                 V. S. Subrahmanian",
  title =        "Query caching and optimization in distributed mediator
                 systems",
  crossref =     "Jagadish:1996:PAS",
  pages =        "137--146",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/citations/proceedings/mod/233269/p137-adali/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Wong:1996:RTF,
  author =       "Man Hon Wong",
  title =        "Recovery for Transaction Failures in Object-Based
                 Databases",
  crossref =     "ACM:1996:PPF",
  pages =        "139--149",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/237661/p139-wong/p139-wong.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/237661/p139-wong/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/237661/p139-wong/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1996 ACM SIGMOD
                 international conference on management of data. Also
                 known as PODS 1996",
  keywords =     "ACM; database systems; PODS; SIGACT; SIGART; SIGMOD;
                 theory; verification",
  subject =      "{\bf H.2.2} Information Systems, DATABASE MANAGEMENT,
                 Physical Design, Recovery and restart.",
}

@InProceedings{Franklin:1996:PTC,
  author =       "Michael J. Franklin and Bj{\"o}rn Th{\'o}r J{\'o}nsson
                 and Donald Kossmann",
  title =        "Performance tradeoffs for client-server query
                 processing",
  crossref =     "Jagadish:1996:PAS",
  pages =        "149--160",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p149-franklin/p149-franklin.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p149-franklin/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Pagel:1996:WQR,
  author =       "Bernd-Uwe Pagel and Hans-Werner Six",
  title =        "Are Window Queries Representative for Arbitrary Range
                 Queries?",
  crossref =     "ACM:1996:PPF",
  pages =        "150--160",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/237661/p150-pagel/p150-pagel.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/237661/p150-pagel/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/237661/p150-pagel/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1996 ACM SIGMOD
                 international conference on management of data. Also
                 known as PODS 1996",
  keywords =     "ACM; database systems; measurement; performance; PODS;
                 SIGACT; SIGART; SIGMOD; theory",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing.",
}

@InProceedings{Theodoridis:1996:MPR,
  author =       "Yannis Theodoridis and Timos Sellis",
  title =        "A Model for the Prediction of {R}-tree Performance",
  crossref =     "ACM:1996:PPF",
  pages =        "161--171",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/237661/p161-theodoridis/p161-theodoridis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/237661/p161-theodoridis/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/237661/p161-theodoridis/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1996 ACM SIGMOD
                 international conference on management of data. Also
                 known as PODS 1996",
  keywords =     "ACM; database systems; measurement; performance; PODS;
                 SIGACT; SIGART; SIGMOD; theory; verification",
  subject =      "{\bf I.6.4} Computing Methodologies, SIMULATION AND
                 MODELING, Model Validation and Analysis. {\bf D.4.8}
                 Software, OPERATING SYSTEMS, Performance. {\bf H.2.0}
                 Information Systems, DATABASE MANAGEMENT, General. {\bf
                 E.1} Data, DATA STRUCTURES, Trees.",
}

@InProceedings{Blakeley:1996:DAM,
  author =       "Jos{\'e} A. Blakeley",
  title =        "Data access for the masses through {OLE DB}",
  crossref =     "Jagadish:1996:PAS",
  pages =        "161--172",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p161-blakeley/p161-blakeley.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p161-blakeley/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ganguly:1996:EAC,
  author =       "Sumit Ganguly and Akshay Goel and Avi Silberschatz",
  title =        "Efficient and accurate cost models for parallel query
                 optimization (extended abstract)",
  crossref =     "ACM:1996:PPF",
  pages =        "172--181",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/237661/p172-ganguly/p172-ganguly.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/237661/p172-ganguly/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/237661/p172-ganguly/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1996 ACM SIGMOD
                 international conference on management of data. Also
                 known as PODS 1996",
  keywords =     "ACM; database systems; measurement; performance; PODS;
                 SIGACT; SIGART; SIGMOD; theory",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing. {\bf D.4.8} Software,
                 OPERATING SYSTEMS, Performance, Modeling and
                 prediction.",
}

@InProceedings{Gray:1996:DRS,
  author =       "Jim Gray and Pat Helland and Patrick O'Neil and Dennis
                 Shasha",
  title =        "The dangers of replication and a solution",
  crossref =     "Jagadish:1996:PAS",
  pages =        "173--182",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p173-gray/p173-gray.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p173-gray/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Fukuda:1996:MOA,
  author =       "Takeshi Fukuda and Yasuhido Morimoto and Shinichi
                 Morishita and Takeshi Tokuyama",
  title =        "Mining Optimized Association Rules for Numeric
                 Attributes",
  crossref =     "ACM:1996:PPF",
  pages =        "182--191",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/237661/p182-fukuda/p182-fukuda.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/237661/p182-fukuda/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/237661/p182-fukuda/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1996 ACM SIGMOD
                 international conference on management of data. Also
                 known as PODS 1996",
  keywords =     "ACM; algorithms; database systems; measurement;
                 performance; PODS; SIGACT; SIGART; SIGMOD; theory;
                 verification",
  subject =      "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
                 Logical Design.",
}

@InProceedings{Mogi:1996:HMM,
  author =       "Kazuhiko Mogi and Masaru Kitsuregawa",
  title =        "Hot mirroring: a method of hiding parity update
                 penalty and degradation during rebuilds for {RAID5}",
  crossref =     "Jagadish:1996:PAS",
  pages =        "183--194",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p183-mogi/p183-mogi.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p183-mogi/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Jagadish:1996:MCB,
  author =       "H. V. Jagadish and Alberto O. Mendelzon and Inderpal
                 Singh Mumick",
  title =        "Managing conflicts between rules (extended abstract)",
  crossref =     "ACM:1996:PPF",
  pages =        "192--201",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/237661/p192-jagadish/p192-jagadish.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/237661/p192-jagadish/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/237661/p192-jagadish/",
  acknowledgement = ack-nhfb,
  keywords =     "theory",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing.",
}

@InProceedings{Jagadish:1996:MRC,
  author =       "H. V. Jagadish and A. O. Mendelzon and I. S. Mumick",
  title =        "Managing Rule Conflicts in an Active Database",
  crossref =     "ACM:1996:PPF",
  pages =        "192--201",
  year =         "1996",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1996 ACM SIGMOD
                 international conference on management of data. Also
                 known as PODS 1996",
  keywords =     "ACM; database systems; PODS; SIGACT; SIGART; SIGMOD",
}

@InProceedings{Hillyer:1996:RSO,
  author =       "Bruce K. Hillyer and Avi Silberschatz",
  title =        "Random {I/O} scheduling in online tertiary storage
                 systems",
  crossref =     "Jagadish:1996:PAS",
  pages =        "195--204",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p195-hillyer/p195-hillyer.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p195-hillyer/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bertino:1996:SAI,
  author =       "Elisa Bertino and Barbara Catania",
  title =        "Static analysis of intensional databases in
                 {U-Datalog} (extended abstract)",
  crossref =     "ACM:1996:PPF",
  pages =        "202--212",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/237661/p202-bertino/p202-bertino.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/237661/p202-bertino/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/237661/p202-bertino/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1996 ACM SIGMOD
                 international conference on management of data. Also
                 known as PODS 1996",
  keywords =     "ACM; database systems; PODS; SIGACT; SIGART; SIGMOD;
                 theory; verification",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Query languages.",
}

@InProceedings{Harinarayan:1996:IDC,
  author =       "Venky Harinarayan and Anand Rajaraman and Jeffrey D.
                 Ullman",
  title =        "Implementing data cubes efficiently",
  crossref =     "Jagadish:1996:PAS",
  pages =        "205--216",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p205-harinarayan/p205-harinarayan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p205-harinarayan/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Manber:1996:FDR,
  author =       "Udi Manber",
  title =        "Future directions and research problems in the {World
                 Wide Web}",
  crossref =     "ACM:1996:PPF",
  pages =        "213--215",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/237661/p213-manber/p213-manber.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/237661/p213-manber/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/237661/p213-manber/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1996 ACM SIGMOD
                 international conference on management of data. Also
                 known as PODS 1996",
  keywords =     "ACM; database systems; PODS; SIGACT; SIGART; SIGMOD;
                 theory",
  subject =      "{\bf H.2.0} Information Systems, DATABASE MANAGEMENT,
                 General. {\bf H.3.4} Information Systems, INFORMATION
                 STORAGE AND RETRIEVAL, Systems and Software, World Wide
                 Web (WWW).",
}

@InProceedings{Fagin:1996:CFI,
  author =       "Ronald Fagin",
  title =        "Combining fuzzy information from multiple systems
                 (extended abstract)",
  crossref =     "ACM:1996:PPF",
  pages =        "216--226",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/237661/p216-fagin/p216-fagin.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/237661/p216-fagin/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/237661/p216-fagin/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1996 ACM SIGMOD
                 international conference on management of data. Also
                 known as PODS 1996",
  keywords =     "ACM; database systems; PODS; SIGACT; SIGART; SIGMOD;
                 theory; verification",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems.",
}

@InProceedings{Rao:1996:PBS,
  author =       "Sudhir G. Rao and Antonio Badia and Dirk van Gucht",
  title =        "Providing better support for a class of decision
                 support queries",
  crossref =     "Jagadish:1996:PAS",
  pages =        "217--227",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p217-rao/p217-rao.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p217-rao/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Levy:1996:AQU,
  author =       "Alon Y. Levy and Anand Rajaraman and Jeffrey D.
                 Ullman",
  title =        "Answering queries using limited external query
                 processors (extended abstract)",
  crossref =     "ACM:1996:PPF",
  pages =        "227--237",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/237661/p227-levy/p227-levy.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/237661/p227-levy/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/237661/p227-levy/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1996 ACM SIGMOD
                 international conference on management of data. Also
                 known as PODS 1996",
  keywords =     "ACM; database systems; PODS; SIGACT; SIGART; SIGMOD;
                 theory",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing.",
}

@InProceedings{Libkin:1996:QLM,
  author =       "Leonid Libkin and Rona Machlin and Limsoon Wong",
  title =        "A query language for multidimensional arrays: design,
                 implementation, and optimization techniques",
  crossref =     "Jagadish:1996:PAS",
  pages =        "228--239",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p228-libkin/p228-libkin.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p228-libkin/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Rajaraman:1996:IIO,
  author =       "Anand Rajaraman and Jeffrey D. Ullman",
  title =        "Integrating information by outerjoins and full
                 disjunctions (extended abstract)",
  crossref =     "ACM:1996:PPF",
  pages =        "238--248",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/237661/p238-rajaraman/p238-rajaraman.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/237661/p238-rajaraman/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/237661/p238-rajaraman/",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1996 ACM SIGMOD
                 international conference on management of data. Also
                 known as PODS 1996",
  keywords =     "ACM; database systems; PODS; SIGACT; SIGART; SIGMOD;
                 theory; verification",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems.",
}

@InProceedings{Agarwal:1996:SSS,
  author =       "Ramesh C. Agarwal",
  title =        "A super scalar sort algorithm for {RISC} processors",
  crossref =     "Jagadish:1996:PAS",
  pages =        "240--246",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p240-agarwal/p240-agarwal.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p240-agarwal/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Lo:1996:SHJ,
  author =       "Ming-Ling Lo and Chinya V. Ravishankar",
  title =        "Spatial hash-joins",
  crossref =     "Jagadish:1996:PAS",
  pages =        "247--258",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p247-lo/p247-lo.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p247-lo/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Patel:1996:PBS,
  author =       "Jignesh M. Patel and David J. DeWitt",
  title =        "Partition based spatial-merge join",
  crossref =     "Jagadish:1996:PAS",
  pages =        "259--270",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p259-patel/p259-patel.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p259-patel/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ganguly:1996:BSS,
  author =       "Sumit Ganguly and Phillip B. Gibbons and Yossi Matias
                 and Avi Silberschatz",
  title =        "Bifocal sampling for skew-resistant join size
                 estimation",
  crossref =     "Jagadish:1996:PAS",
  pages =        "271--281",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p271-ganguly/p271-ganguly.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p271-ganguly/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Krishnan:1996:EAS,
  author =       "P. Krishnan and Jeffrey Scott Vitter and Bala Iyer",
  title =        "Estimating alphanumeric selectivity in the presence of
                 wildcards",
  crossref =     "Jagadish:1996:PAS",
  pages =        "282--293",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p282-krishnan/p282-krishnan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p282-krishnan/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Poosala:1996:IHS,
  author =       "Viswanath Poosala and Peter J. Haas and Yannis E.
                 Ioannidis and Eugene J. Shekita",
  title =        "Improved histograms for selectivity estimation of
                 range predicates",
  crossref =     "Jagadish:1996:PAS",
  pages =        "294--305",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p294-poosala/p294-poosala.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p294-poosala/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Doherty:1996:SMP,
  author =       "Michael Doherty and Richard Hull and Mohammed
                 Rupawalla",
  title =        "Structures for manipulating proposed updates in
                 object-oriented databases",
  crossref =     "Jagadish:1996:PAS",
  pages =        "306--317",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p306-doherty/p306-doherty.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p306-doherty/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Liskov:1996:SES,
  author =       "B. Liskov and A. Adya and M. Castro and S. Ghemawat
                 and R. Gruber and U. Maheshwari and A. C. Myers and M.
                 Day and L. Shrira",
  title =        "Safe and efficient sharing of persistent objects in
                 {Thor}",
  crossref =     "Jagadish:1996:PAS",
  pages =        "318--329",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p318-liskov/p318-liskov.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p318-liskov/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Blott:1996:OAO,
  author =       "Stephen Blott and Lukas Relly and Hans-J{\"o}rg
                 Schek",
  title =        "An open abstract-object storage system",
  crossref =     "Jagadish:1996:PAS",
  pages =        "330--340",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p330-blott/p330-blott.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p330-blott/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Tajima:1996:SDS,
  author =       "Keishi Tajima",
  title =        "Static detection of security flaws in object-oriented
                 databases",
  crossref =     "Jagadish:1996:PAS",
  pages =        "341--352",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p341-tajima/p341-tajima.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p341-tajima/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Brown:1996:GOB,
  author =       "Kurt P. Brown and Michael J. Carey and Miron Livny",
  title =        "Goal-oriented buffer management revisited",
  crossref =     "Jagadish:1996:PAS",
  pages =        "353--364",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p353-brown/p353-brown.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p353-brown/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Garofalakis:1996:MDR,
  author =       "Minos N. Garofalakis and Yannis E. Ioannidis",
  title =        "Multi-dimensional resource scheduling for parallel
                 queries",
  crossref =     "Jagadish:1996:PAS",
  pages =        "365--376",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p365-garofalakis/p365-garofalakis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p365-garofalakis/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cook:1996:SAS,
  author =       "Jonathan E. Cook and Artur W. Klauser and Alexander L.
                 Wolf and Benjamin G. Zorn",
  title =        "Semi-automatic, self-adaptive control of garbage
                 collection rates in object databases",
  crossref =     "Jagadish:1996:PAS",
  pages =        "377--388",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p377-cook/p377-cook.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p377-cook/",
  acknowledgement = ack-nhfb,
}

@InProceedings{McAuliffe:1996:TEE,
  author =       "Mark L. McAuliffe and Michael J. Carey and Marvin H.
                 Solomon",
  title =        "Towards effective and efficient free space
                 management",
  crossref =     "Jagadish:1996:PAS",
  pages =        "389--400",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p389-mcauliffe/p389-mcauliffe.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p389-mcauliffe/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cherniack:1996:RLI,
  author =       "Mitch Cherniack and Stanley B. Zdonik",
  title =        "Rule languages and internal algebras for rule-based
                 optimizers",
  crossref =     "Jagadish:1996:PAS",
  pages =        "401--412",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p401-cherniack/p401-cherniack.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p401-cherniack/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Christophides:1996:EQG,
  author =       "Vassilis Christophides and Sophie Cluet and Guido
                 Moerkotte",
  title =        "Evaluating queries with generalized path expressions",
  crossref =     "Jagadish:1996:PAS",
  pages =        "413--422",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p413-christophides/p413-christophides.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p413-christophides/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hellerstein:1996:QET,
  author =       "Joseph M. Hellerstein and Jeffrey F. Naughton",
  title =        "Query execution techniques for caching expensive
                 methods",
  crossref =     "Jagadish:1996:PAS",
  pages =        "423--434",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p423-hellerstein/p423-hellerstein.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p423-hellerstein/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Seshadri:1996:CBO,
  author =       "Praveen Seshadri and Joseph M. Hellerstein and Hamid
                 Pirahesh and T. Y. Cliff Leung and Raghu Ramakrishnan
                 and Divesh Srivastava and Peter J. Stuckey and S.
                 Sudarshan",
  title =        "Cost-based optimization for magic: algebra and
                 implementation",
  crossref =     "Jagadish:1996:PAS",
  pages =        "435--446",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p435-seshadri/p435-seshadri.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p435-seshadri/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ross:1996:MVM,
  author =       "Kenneth A. Ross and Divesh Srivastava and S.
                 Sudarshan",
  title =        "Materialized view maintenance and integrity constraint
                 checking: trading space for time",
  crossref =     "Jagadish:1996:PAS",
  pages =        "447--458",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p447-ross/p447-ross.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p447-ross/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Morpain:1996:MDC,
  author =       "Claire Morpain and Mich{\'e}le Cart and Jean
                 Ferri{\'e} and Jean-Fran{\c{c}}ois Pons",
  title =        "Maintaining database consistency in presence of value
                 dependencies in multidatabase systems",
  crossref =     "Jagadish:1996:PAS",
  pages =        "459--468",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p459-morpain/p459-morpain.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p459-morpain/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Colby:1996:ADV,
  author =       "Latha S. Colby and Timothy Griffin and Leonid Libkin
                 and Inderpal Singh Mumick and Howard Trickey",
  title =        "Algorithms for deferred view maintenance",
  crossref =     "Jagadish:1996:PAS",
  pages =        "469--480",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p469-colby/p469-colby.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p469-colby/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hull:1996:FSD,
  author =       "Richard Hull and Gang Zhou",
  title =        "A framework for supporting data integration using the
                 materialized and virtual approaches",
  crossref =     "Jagadish:1996:PAS",
  pages =        "481--492",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p481-hull/p481-hull.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p481-hull/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chawathe:1996:CDH,
  author =       "Sudarshan S. Chawathe and Anand Rajaraman and Hector
                 Garcia-Molina and Jennifer Widom",
  title =        "Change detection in hierarchically structured
                 information",
  crossref =     "Jagadish:1996:PAS",
  pages =        "493--504",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p493-chawathe/p493-chawathe.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p493-chawathe/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Buneman:1996:QLO,
  author =       "Peter Buneman and Susan Davidson and Gerd Hillebrand
                 and Dan Suciu",
  title =        "A query language and optimization techniques for
                 unstructured data",
  crossref =     "Jagadish:1996:PAS",
  pages =        "505--516",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p505-buneman/p505-buneman.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p505-buneman/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Goyal:1996:GPD,
  author =       "Nita Goyal and Charles Hoch and Ravi Krishnamurthy and
                 Brian Meckler and Michael Suckow",
  title =        "Is {GUI} programming a database research problem?",
  crossref =     "Jagadish:1996:PAS",
  pages =        "517--528",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p517-goyal/p517-goyal.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p517-goyal/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Nguyen:1996:ARD,
  author =       "Tam Nguyen and V. Srinivasan",
  title =        "Accessing relational databases from the {World Wide
                 Web}",
  crossref =     "Jagadish:1996:PAS",
  pages =        "529--540",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p529-nguyen/p529-nguyen.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p529-nguyen/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Fernandez:1996:IOE,
  author =       "Phil Fernandez and Donovan Schneider",
  title =        "The ins and outs (and everything in between) of data
                 warehousing",
  crossref =     "Jagadish:1996:PAS",
  pages =        "541--541",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p541-fernandez/p541-fernandez.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p541-fernandez/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bernstein:1996:RSE,
  author =       "Pillip A. Bernstein",
  title =        "Repository system engineering",
  crossref =     "Jagadish:1996:PAS",
  pages =        "542--542",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p542-bernstein/p542-bernstein.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p542-bernstein/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Keim:1996:DV,
  author =       "Daniel A. Keim",
  title =        "databases and visualization",
  crossref =     "Jagadish:1996:PAS",
  pages =        "543--543",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p543-keim/p543-keim.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p543-keim/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Mohan:1996:SAW,
  author =       "C. Mohan",
  title =        "State of the art in workflow management research and
                 products",
  crossref =     "Jagadish:1996:PAS",
  pages =        "544--544",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p544-mohan/p544-mohan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p544-mohan/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Han:1996:DMT,
  author =       "Jiawei Han",
  title =        "Data mining techniques",
  crossref =     "Jagadish:1996:PAS",
  pages =        "545--545",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p545-han/p545-han.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p545-han/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Piatko:1996:TTT,
  author =       "Peter Piatko and Roman Yangarber and Daoi Lin and
                 Dennis Shasha",
  title =        "Thinksheet: a tool for tailoring complex documents",
  crossref =     "Jagadish:1996:PAS",
  pages =        "546--546",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p546-piatko/p546-piatko.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p546-piatko/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bohm:1996:HAS,
  author =       "Klemens B{\"o}hm and Karl Aberer",
  title =        "{HyperStorM--administering} structured documents using
                 object-oriented database technology",
  crossref =     "Jagadish:1996:PAS",
  pages =        "547--547",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p547-bohm/p547-bohm.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p547-bohm/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Lefler:1996:DST,
  author =       "Mark Lefler and Mark Stokrp and Craig Wong",
  title =        "{DBSim}: a simulation tool for predicting database
                 performance",
  crossref =     "Jagadish:1996:PAS",
  pages =        "548--548",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p548-lefler/p548-lefler.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p548-lefler/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Quass:1996:LLO,
  author =       "Dallan Quass and Jennifer Widom and Roy Goldman and
                 Kevin Haas and Qingshan Luo and Jason McHugh and
                 Svetlozar Nestorov and Anand Rajaraman and Hugo Rivero
                 and Serge Abiteboul and Jeff Ullman and Janet Wiener",
  title =        "{LORE}: a {Lightweight Object REpository} for
                 semistructured data",
  crossref =     "Jagadish:1996:PAS",
  pages =        "549--549",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p549-quass/p549-quass.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p549-quass/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Han:1996:DIM,
  author =       "Jaiwei Han and Youngjian Fu and Wei Wang and Jenny
                 Chiang and Osmar R. Za{\"\i}ane and Krzysztof
                 Koperski",
  title =        "{DBMiner}: interactive mining of multiple-level
                 knowledge in relational databases",
  crossref =     "Jagadish:1996:PAS",
  pages =        "550--550",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p550-han/p550-han.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p550-han/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Choo:1996:PCB,
  author =       "S. Choo and W. O'Connell and G. Linerman and H. Chen
                 and K. Ganapathy and A. Biliris and E. Panagos and D.
                 Schrader",
  title =        "prospector: a content-based multimedia server for
                 massively parallel architectures",
  crossref =     "Jagadish:1996:PAS",
  pages =        "551--551",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p551-choo/p551-choo.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p551-choo/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Dogac:1996:MID,
  author =       "Asuman Dogac and Ugur Halici and Ebru Kilic and Gokhan
                 Ozhan and Fatma Ozcan and Sena Nural and Cevdet Dengi
                 and Sema Mancuhan and Budak Arpinar and Pinar Koksal
                 and Cem Evrendilek",
  title =        "{METU} interoperable database system",
  crossref =     "Jagadish:1996:PAS",
  pages =        "552--552",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p552-dogac/p552-dogac.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p552-dogac/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Fukuda:1996:SSO,
  author =       "Takeshi Fukuda and Yasuhiko Morimoto and Shinichi
                 Morishita and Takeshi Tokuyama",
  title =        "{SONAR}: system for optimized numeric association
                 rules",
  crossref =     "Jagadish:1996:PAS",
  pages =        "553--553",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p553-fukuda/p553-fukuda.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p553-fukuda/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hung:1996:CAC,
  author =       "Patrick C. K. Hung and Helen P. Yeung and Kamalakar
                 Karlapalem",
  title =        "{CapBasED-AMS}: a capability-based and event-driven
                 activity management system",
  crossref =     "Jagadish:1996:PAS",
  pages =        "554--554",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p554-hung/p554-hung.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p554-hung/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Rundensteiner:1996:MPO,
  author =       "E. A. Rundensteiner and H. A. Kuno and Y.-G. Ra and V.
                 Crestana-Taube and M. C. Jones and P. J. Marron",
  title =        "The {MultiView} project: object-oriented view
                 technology and applications",
  crossref =     "Jagadish:1996:PAS",
  pages =        "555--555",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p555-rundensteiner/p555-rundensteiner.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p555-rundensteiner/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Biliris:1996:BSS,
  author =       "A. Biliris and T. A. Funkhouser and W. O'Connell and
                 E. Panagos",
  title =        "{BeSS}: storage support for interactive visualization
                 systems",
  crossref =     "Jagadish:1996:PAS",
  pages =        "556--556",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p556-biliris/p556-biliris.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p556-biliris/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Roth:1996:GP,
  author =       "M. Tork Roth and M. Arya and L. Haas and M. Carey and
                 W. Cody and R. Fagin and P. Schwarz and J. Thomas and
                 E. Wimmers",
  title =        "The {Garlic} project",
  crossref =     "Jagadish:1996:PAS",
  pages =        "557--557",
  year =         "1996",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/233269/p557-roth/p557-roth.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/233269/p557-roth/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ozden:1997:MSD,
  author =       "Banu {\"O}zden and Rajeev Rastogi and Avi
                 Silberschatz",
  title =        "Multimedia support for databases",
  crossref =     "ACM:1997:PPS",
  pages =        "1--11",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/263661/p1-ozden/p1-ozden.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/263661/p1-ozden/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/263661/p1-ozden/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; measurement; performance",
  subject =      "{\bf H.5.1} Information Systems, INFORMATION
                 INTERFACES AND PRESENTATION, Multimedia Information
                 Systems. {\bf I.1.2} Computing Methodologies, SYMBOLIC
                 AND ALGEBRAIC MANIPULATION, Algorithms, Analysis of
                 algorithms.",
}

@InProceedings{Berchtold:1997:FPS,
  author =       "Stefan Berchtold and Christian B{\"o}hm and Bernhard
                 Braunm{\"u}ller and Daniel A. Keim and Hans-Peter
                 Kriegel",
  title =        "Fast parallel similarity search in multimedia
                 databases",
  crossref =     "Peckman:1997:PAS",
  pages =        "1--12",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p1-berchtold/p1-berchtold.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p1-berchtold/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Papadimitriou:1997:CDQ,
  author =       "Christos H. Papadimitriou and Mihalis Yannakakis",
  title =        "On the complexity of database queries (extended
                 abstract)",
  crossref =     "ACM:1997:PPS",
  pages =        "12--19",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/263661/p12-papadimitriou/p12-papadimitriou.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/263661/p12-papadimitriou/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/263661/p12-papadimitriou/",
  acknowledgement = ack-nhfb,
  keywords =     "languages; measurement; performance; verification",
  subject =      "{\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, Query formulation. {\bf H.2.3}
                 Information Systems, DATABASE MANAGEMENT, Languages,
                 Query languages.",
}

@InProceedings{Rafiei:1997:SBQ,
  author =       "Davood Rafiei and Alberto Mendelzon",
  title =        "Similarity-based queries for time series data",
  crossref =     "Peckman:1997:PAS",
  pages =        "13--25",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p13-rafiei/p13-rafiei.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p13-rafiei/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Levy:1997:DCQ,
  author =       "Alon Y. Levy and Dan Suciu",
  title =        "Deciding containment for queries with complex objects
                 (extended abstract)",
  crossref =     "ACM:1997:PPS",
  pages =        "20--31",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/263661/p20-levy/p20-levy.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/263661/p20-levy/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/263661/p20-levy/",
  acknowledgement = ack-nhfb,
  keywords =     "languages; performance; verification",
  subject =      "{\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, Query formulation. {\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, Model theory. {\bf I.6.3} Computing
                 Methodologies, SIMULATION AND MODELING, Applications.",
}

@InProceedings{Chawathe:1997:MCD,
  author =       "Sudarshan S. Chawathe and Hector Garcia-Molina",
  title =        "Meaningful change detection in structured data",
  crossref =     "Peckman:1997:PAS",
  pages =        "26--37",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p26-chawathe/p26-chawathe.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p26-chawathe/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ibarra:1997:CED,
  author =       "Oscar H. Ibarra and Jianwen Su",
  title =        "On the containment and equivalence of database queries
                 with linear constraints (extended abstract)",
  crossref =     "ACM:1997:PPS",
  pages =        "32--43",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/263661/p32-ibarra/p32-ibarra.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/263661/p32-ibarra/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/263661/p32-ibarra/",
  acknowledgement = ack-nhfb,
  keywords =     "languages; performance; verification",
  subject =      "{\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, Query formulation. {\bf H.2.3}
                 Information Systems, DATABASE MANAGEMENT, Languages,
                 Query languages. {\bf H.4.2} Information Systems,
                 INFORMATION SYSTEMS APPLICATIONS, Types of Systems,
                 Decision support. {\bf H.2.1} Information Systems,
                 DATABASE MANAGEMENT, Logical Design, Schema and
                 subschema.",
}

@InProceedings{ONeil:1997:IQP,
  author =       "Patrick O'Neil and Dallan Quass",
  title =        "Improved query performance with variant indexes",
  crossref =     "Peckman:1997:PAS",
  pages =        "38--49",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p38-o_neil/p38-o_neil.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p38-o_neil/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Albert:1997:CQE,
  author =       "Joseph Albert and Yanis Ioannidis and Raghu
                 Ramakrishnan",
  title =        "Conjunctive query equivalence of keyed relational
                 schemas (extended abstract)",
  crossref =     "ACM:1997:PPS",
  pages =        "44--50",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/263661/p44-albert/p44-albert.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/263661/p44-albert/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/263661/p44-albert/",
  acknowledgement = ack-nhfb,
  keywords =     "performance",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing. {\bf H.2.1} Information
                 Systems, DATABASE MANAGEMENT, Logical Design, Schema
                 and subschema. {\bf H.2.0} Information Systems,
                 DATABASE MANAGEMENT, General.",
}

@InProceedings{Zaharioudakis:1997:HCC,
  author =       "Markos Zaharioudakis and Michael J. Carey",
  title =        "Highly concurrent cache consistency for indices in
                 client-server database systems",
  crossref =     "Peckman:1997:PAS",
  pages =        "50--61",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p50-zaharioudakis/p50-zaharioudakis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p50-zaharioudakis/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hull:1997:MSH,
  author =       "Richard Hull",
  title =        "Managing semantic heterogeneity in databases: a
                 theoretical prospective",
  crossref =     "ACM:1997:PPS",
  pages =        "51--61",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/263661/p51-hull/p51-hull.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/263661/p51-hull/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/263661/p51-hull/",
  acknowledgement = ack-nhfb,
  keywords =     "languages; performance",
  subject =      "{\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS
                 OF PROGRAMS, Semantics of Programming Languages. {\bf
                 H.2.0} Information Systems, DATABASE MANAGEMENT,
                 General. {\bf H.2.1} Information Systems, DATABASE
                 MANAGEMENT, Logical Design, Schema and subschema.",
}

@InProceedings{Gyssens:1997:CGQ,
  author =       "Marc Gyssens and Jan {Van den Bussche} and Dirk {Van
                 Gucht}",
  title =        "Complete geometrical query languages (extended
                 abstract)",
  crossref =     "ACM:1997:PPS",
  pages =        "62--67",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/263661/p62-gyssens/p62-gyssens.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/263661/p62-gyssens/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/263661/p62-gyssens/",
  acknowledgement = ack-nhfb,
  keywords =     "languages; measurement; performance; verification",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Query languages. {\bf H.2.0} Information
                 Systems, DATABASE MANAGEMENT, General. {\bf H.2.1}
                 Information Systems, DATABASE MANAGEMENT, Logical
                 Design, Data models.",
}

@InProceedings{Kornacker:1997:CRG,
  author =       "Marcel Kornacker and C. Mohan and Joseph M.
                 Hellerstein",
  title =        "Concurrency and recovery in generalized search trees",
  crossref =     "Peckman:1997:PAS",
  pages =        "62--72",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p62-kornacker/p62-kornacker.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p62-kornacker/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Dumortier:1997:DSL,
  author =       "Freddy Dumortier and Marc Gyssens and Luc Vandeurzen
                 and Dirk {Van Gucht}",
  title =        "On the decidability of semi-linearity for
                 semi-algebraic sets and its implications for spatial
                 databases (extended abstract)",
  crossref =     "ACM:1997:PPS",
  pages =        "68--77",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/263661/p68-dumortier/p68-dumortier.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/263661/p68-dumortier/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/263661/p68-dumortier/",
  acknowledgement = ack-nhfb,
  keywords =     "languages; measurement; performance; verification",
  subject =      "{\bf H.2.0} Information Systems, DATABASE MANAGEMENT,
                 General. {\bf F.4.1} Theory of Computation,
                 MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical
                 Logic. {\bf G.2.0} Mathematics of Computing, DISCRETE
                 MATHEMATICS, General. {\bf H.2.3} Information Systems,
                 DATABASE MANAGEMENT, Languages, Query languages.",
}

@InProceedings{Ho:1997:RQO,
  author =       "Ching-Tien Ho and Rakesh Agrawal and Nimrod Megiddo
                 and Ramakrishnan Srikant",
  title =        "Range queries in {OLAP} data cubes",
  crossref =     "Peckman:1997:PAS",
  pages =        "73--88",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p73-ho/p73-ho.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p73-ho/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Berchtold:1997:CMN,
  author =       "Stefan Berchtold and Christian B{\"o}hm and Daniel A.
                 Keim and Hans-Peter Kriegel",
  title =        "A cost model for nearest neighbor search in
                 high-dimensional data space",
  crossref =     "ACM:1997:PPS",
  pages =        "78--86",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/263661/p78-berchtold/p78-berchtold.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/263661/p78-berchtold/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/263661/p78-berchtold/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; experimentation; measurement;
                 performance",
  subject =      "{\bf H.2.0} Information Systems, DATABASE MANAGEMENT,
                 General. {\bf G.2.0} Mathematics of Computing, DISCRETE
                 MATHEMATICS, General. {\bf F.2.2} Theory of
                 Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Nonnumerical Algorithms and Problems,
                 Sequencing and scheduling. {\bf G.4} Mathematics of
                 Computing, MATHEMATICAL SOFTWARE, Algorithm design and
                 analysis. {\bf H.3.1} Information Systems, INFORMATION
                 STORAGE AND RETRIEVAL, Content Analysis and Indexing,
                 Indexing methods.",
}

@InProceedings{Benedikt:1997:LRD,
  author =       "Michael Benedikt and Leonid Libkin",
  title =        "Languages for relational databases over interpreted
                 structures",
  crossref =     "ACM:1997:PPS",
  pages =        "87--98",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/263661/p87-benedikt/p87-benedikt.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/263661/p87-benedikt/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/263661/p87-benedikt/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; languages; performance; verification",
  subject =      "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
                 Systems. {\bf H.2.3} Information Systems, DATABASE
                 MANAGEMENT, Languages, Query languages. {\bf G.4}
                 Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Algorithm design and analysis. {\bf F.3.2} Theory of
                 Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics
                 of Programming Languages.",
}

@InProceedings{Roussopoulos:1997:COB,
  author =       "Nick Roussopoulos and Yannis Kotidis and Mema
                 Roussopoulos",
  title =        "Cubetree: organization of and bulk incremental updates
                 on the data cube",
  crossref =     "Peckman:1997:PAS",
  pages =        "89--99",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p89-roussopoulos/p89-roussopoulos.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p89-roussopoulos/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Beeri:1997:RQU,
  author =       "Catriel Beeri and Alon Y. Levy and Marie-Christine
                 Rousset",
  title =        "Rewriting queries using views in description logics",
  crossref =     "ACM:1997:PPS",
  pages =        "99--108",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/263661/p99-beeri/p99-beeri.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/263661/p99-beeri/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/263661/p99-beeri/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; languages; performance; verification",
  subject =      "{\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, Query formulation. {\bf H.2.3}
                 Information Systems, DATABASE MANAGEMENT, Languages,
                 Query languages. {\bf G.4} Mathematics of Computing,
                 MATHEMATICAL SOFTWARE, Algorithm design and analysis.
                 {\bf F.4.2} Theory of Computation, MATHEMATICAL LOGIC
                 AND FORMAL LANGUAGES, Grammars and Other Rewriting
                 Systems, Parallel rewriting systems.",
}

@InProceedings{Mumick:1997:MDC,
  author =       "Inderpal Singh Mumick and Dallan Quass and Barinderpal
                 Singh Mumick",
  title =        "Maintenance of data cubes and summary tables in a
                 warehouse",
  crossref =     "Peckman:1997:PAS",
  pages =        "100--111",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p100-mumick/p100-mumick.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p100-mumick/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Duschka:1997:ARQ,
  author =       "Oliver M. Duschka and Michael R. Genesereth",
  title =        "Answering recursive queries using views",
  crossref =     "ACM:1997:PPS",
  pages =        "109--116",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/263661/p109-duschka/p109-duschka.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/263661/p109-duschka/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/263661/p109-duschka/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; languages; performance; verification",
  subject =      "{\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, Query formulation. {\bf I.1.2}
                 Computing Methodologies, SYMBOLIC AND ALGEBRAIC
                 MANIPULATION, Algorithms, Analysis of algorithms. {\bf
                 H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Datalog.",
}

@InProceedings{Tsuei:1997:DBS,
  author =       "Thin-Fong Tsuei and Allan N. Packer and Keng-Tai Ko",
  title =        "Database buffer size investigation for {OLTP}
                 workloads",
  crossref =     "Peckman:1997:PAS",
  pages =        "112--122",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p112-tsuei/p112-tsuei.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p112-tsuei/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Buneman:1997:SD,
  author =       "Peter Buneman",
  title =        "Semistructured data",
  crossref =     "ACM:1997:PPS",
  pages =        "117--121",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/263661/p117-buneman/p117-buneman.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/263661/p117-buneman/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/263661/p117-buneman/",
  acknowledgement = ack-nhfb,
  keywords =     "languages; performance",
  subject =      "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Schema and subschema. {\bf H.2.0}
                 Information Systems, DATABASE MANAGEMENT, General. {\bf
                 H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages.",
}

@InProceedings{Abiteboul:1997:RPQ,
  author =       "Serge Abiteboul and Victor Vianu",
  title =        "Regular path queries with constraints",
  crossref =     "ACM:1997:PPS",
  pages =        "122--133",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/263661/p122-abiteboul/p122-abiteboul.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/263661/p122-abiteboul/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/263661/p122-abiteboul/",
  acknowledgement = ack-nhfb,
  keywords =     "languages; performance; verification",
  subject =      "{\bf G.2.2} Mathematics of Computing, DISCRETE
                 MATHEMATICS, Graph Theory, Path and circuit problems.
                 {\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, Query formulation. {\bf H.5.1}
                 Information Systems, INFORMATION INTERFACES AND
                 PRESENTATION, Multimedia Information Systems. {\bf
                 H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages, Datalog.",
}

@InProceedings{Doppelhammer:1997:DPR,
  author =       "Joachen Doppelhammer and Thomas H{\"o}ppler and Alfons
                 Kemper and Donald Kossmann",
  title =        "Database performance in the real world: {TPC-D} and
                 {SAP R/3}",
  crossref =     "Peckman:1997:PAS",
  pages =        "123--134",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p123-doppelhammer/p123-doppelhammer.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p123-doppelhammer/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Mendelzon:1997:FMW,
  author =       "Alberto O. Mendelzon and Tova Milo",
  title =        "Formal models of {Web} queries",
  crossref =     "ACM:1997:PPS",
  pages =        "134--143",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/263661/p134-mendelzon/p134-mendelzon.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/263661/p134-mendelzon/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/263661/p134-mendelzon/",
  acknowledgement = ack-nhfb,
  keywords =     "documentation; performance",
  subject =      "{\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, Query formulation. {\bf H.2.1}
                 Information Systems, DATABASE MANAGEMENT, Logical
                 Design, Data models. {\bf H.3.3} Information Systems,
                 INFORMATION STORAGE AND RETRIEVAL, Information Search
                 and Retrieval, Retrieval models. {\bf C.2.1} Computer
                 Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
                 Network Architecture and Design, Internet.",
}

@InProceedings{Carey:1997:BOR,
  author =       "Michael J. Carey and David J. DeWitt and Jeffrey F.
                 Naughton and Mohammad Asgarian and Paul Brown and
                 Johannes E. Gehrke and Dhaval N. Shah",
  title =        "The {BUCKY} object-relational benchmark",
  crossref =     "Peckman:1997:PAS",
  pages =        "135--146",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p135-carey/p135-carey.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p135-carey/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Atzeni:1997:CP,
  author =       "Paolo Atzeni and Giansalvatore Mecca",
  title =        "Cut and paste",
  crossref =     "ACM:1997:PPS",
  pages =        "144--153",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/263661/p144-atzeni/p144-atzeni.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/263661/p144-atzeni/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/263661/p144-atzeni/",
  acknowledgement = ack-nhfb,
  keywords =     "documentation; languages; performance",
  subject =      "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
                 Languages. {\bf C.2.1} Computer Systems Organization,
                 COMPUTER-COMMUNICATION NETWORKS, Network Architecture
                 and Design, Internet. {\bf I.7.2} Computing
                 Methodologies, DOCUMENT AND TEXT PROCESSING, Document
                 Preparation. {\bf H.5.2} Information Systems,
                 INFORMATION INTERFACES AND PRESENTATION, User
                 Interfaces. {\bf F.2.2} Theory of Computation, ANALYSIS
                 OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems, Pattern matching.",
}

@InProceedings{Adelberg:1997:SRS,
  author =       "Brad Adelberg and Hector Garcia-Molina and Jennifer
                 Widom",
  title =        "The {STRIP} rule system for efficiently maintaining
                 derived data",
  crossref =     "Peckman:1997:PAS",
  pages =        "147--158",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p147-adelberg/p147-adelberg.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p147-adelberg/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Nerjes:1997:SSG,
  author =       "Guido Nerjes and Peter Muth and Gerhard Weikum",
  title =        "Stochastic service guarantees for continuous data on
                 multi-zone disks",
  crossref =     "ACM:1997:PPS",
  pages =        "154--160",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/263661/p154-nerjes/p154-nerjes.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/263661/p154-nerjes/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/263661/p154-nerjes/",
  acknowledgement = ack-nhfb,
  keywords =     "measurement; performance",
  subject =      "{\bf H.5.1} Information Systems, INFORMATION
                 INTERFACES AND PRESENTATION, Multimedia Information
                 Systems. {\bf F.1.2} Theory of Computation, COMPUTATION
                 BY ABSTRACT DEVICES, Modes of Computation,
                 Probabilistic computation. {\bf H.2.1} Information
                 Systems, DATABASE MANAGEMENT, Logical Design, Data
                 models. {\bf I.6.3} Computing Methodologies, SIMULATION
                 AND MODELING, Applications. {\bf I.6.4} Computing
                 Methodologies, SIMULATION AND MODELING, Model
                 Validation and Analysis.",
}

@InProceedings{Zhao:1997:ABA,
  author =       "Yihong Zhao and Prasad M. Deshpande and Jeffrey F.
                 Naughton",
  title =        "An array-based algorithm for simultaneous
                 multidimensional aggregates",
  crossref =     "Peckman:1997:PAS",
  pages =        "159--170",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p159-zhao/p159-zhao.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p159-zhao/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Agrawal:1997:EAR,
  author =       "D. Agrawal and A. {El Abbadi} and R. C. Steinke",
  title =        "Epidemic algorithms in replicated databases (extended
                 abstract)",
  crossref =     "ACM:1997:PPS",
  pages =        "161--172",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/263661/p161-agrawal/p161-agrawal.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/263661/p161-agrawal/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/263661/p161-agrawal/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance",
  subject =      "{\bf C.2.0} Computer Systems Organization,
                 COMPUTER-COMMUNICATION NETWORKS, General. {\bf H.2.0}
                 Information Systems, DATABASE MANAGEMENT, General. {\bf
                 G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Algorithm design and analysis. {\bf H.2.4} Information
                 Systems, DATABASE MANAGEMENT, Systems, Transaction
                 processing.",
}

@InProceedings{Hellerstein:1997:OA,
  author =       "Joseph M. Hellerstein and Peter J. Haas and Helen J.
                 Wang",
  title =        "Online aggregation",
  crossref =     "Peckman:1997:PAS",
  pages =        "171--182",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p171-hellerstein/p171-hellerstein.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p171-hellerstein/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Breitbart:1997:RCB,
  author =       "Yuri Breitbart and Henry F. Korth",
  title =        "Replication and consistency: being lazy helps
                 sometimes",
  crossref =     "ACM:1997:PPS",
  pages =        "173--184",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/263661/p173-breitbart/p173-breitbart.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/263661/p173-breitbart/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/263661/p173-breitbart/",
  acknowledgement = ack-nhfb,
  keywords =     "performance; standardization; verification",
  subject =      "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Data models. {\bf H.5.1} Information
                 Systems, INFORMATION INTERFACES AND PRESENTATION,
                 Multimedia Information Systems. {\bf C.2.2} Computer
                 Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
                 Network Protocols. {\bf G.2.0} Mathematics of
                 Computing, DISCRETE MATHEMATICS, General. {\bf H.2.2}
                 Information Systems, DATABASE MANAGEMENT, Physical
                 Design, Deadlock avoidance. {\bf F.1.2} Theory of
                 Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of
                 Computation, Probabilistic computation.",
}

@InProceedings{Acharya:1997:BPP,
  author =       "Swarup Acharya and Michael Franklin and Stanley
                 Zdonik",
  title =        "Balancing push and pull for data broadcast",
  crossref =     "Peckman:1997:PAS",
  pages =        "183--194",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p183-acharya/p183-acharya.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p183-acharya/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Shoshani:1997:OSD,
  author =       "Arie Shoshani",
  title =        "{OLAP} and statistical databases: similarities and
                 differences",
  crossref =     "ACM:1997:PPS",
  pages =        "185--196",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/263661/p185-shoshani/p185-shoshani.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/263661/p185-shoshani/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/263661/p185-shoshani/",
  acknowledgement = ack-nhfb,
  keywords =     "human factors; measurement; performance",
  subject =      "{\bf H.2.8} Information Systems, DATABASE MANAGEMENT,
                 Database Applications. {\bf G.3} Mathematics of
                 Computing, PROBABILITY AND STATISTICS. {\bf J.4}
                 Computer Applications, SOCIAL AND BEHAVIORAL SCIENCES.
                 {\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
                 Logical Design. {\bf K.4.1} Computing Milieux,
                 COMPUTERS AND SOCIETY, Public Policy Issues, Privacy.",
}

@InProceedings{Bayardo:1997:IAB,
  author =       "R. J. Bayardo and W. Bohrer and R. Brice and A.
                 Cichocki and J. Fowler and A. Helal and V. Kashyap and
                 T. Ksiezyk and G. Martin and M. Nodine and M. Rashid
                 and M. Rusinkiewicz and R. Shea and C. Unnikrishnan and
                 A. Unruh and D. Woelk",
  title =        "{InfoSleuth}: agent-based semantic integration of
                 information in open and dynamic environments",
  crossref =     "Peckman:1997:PAS",
  pages =        "195--206",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p195-bayardo/p195-bayardo.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p195-bayardo/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Alonso:1997:CPC,
  author =       "Gustavo Alonso and Stephen Blott and Armin Fessler and
                 Hans-J{\"o}rg Schek",
  title =        "Correctness and parallelism in composite systems",
  crossref =     "ACM:1997:PPS",
  pages =        "197--208",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/263661/p197-alonso/p197-alonso.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/263661/p197-alonso/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/263661/p197-alonso/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance; reliability",
  subject =      "{\bf F.1.2} Theory of Computation, COMPUTATION BY
                 ABSTRACT DEVICES, Modes of Computation, Parallelism and
                 concurrency. {\bf H.2.0} Information Systems, DATABASE
                 MANAGEMENT, General. {\bf I.6.3} Computing
                 Methodologies, SIMULATION AND MODELING, Applications.
                 {\bf I.6.4} Computing Methodologies, SIMULATION AND
                 MODELING, Model Validation and Analysis. {\bf I.1.2}
                 Computing Methodologies, SYMBOLIC AND ALGEBRAIC
                 MANIPULATION, Algorithms, Analysis of algorithms. {\bf
                 D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent
                 Programming.",
}

@InProceedings{Gravano:1997:SSP,
  author =       "Luis Gravano and Chen-Chuan K. Chang and H{\'e}ctor
                 Garc{\'\i}a-Molina and Andreas Paepcke",
  title =        "{STARTS}: {Stanford} proposal for {Internet}
                 meta-searching",
  crossref =     "Peckman:1997:PAS",
  pages =        "207--218",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p207-gravano/p207-gravano.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p207-gravano/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gunopulos:1997:DMH,
  author =       "Dimitrios Gunopulos and Heikki Mannila and Roni
                 Khardon and Hannu Toivonen",
  title =        "Data mining, hypergraph transversals, and machine
                 learning (extended abstract)",
  crossref =     "ACM:1997:PPS",
  pages =        "209--216",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/263661/p209-gunopulos/p209-gunopulos.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/263661/p209-gunopulos/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/263661/p209-gunopulos/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance; verification",
  subject =      "{\bf H.2.0} Information Systems, DATABASE MANAGEMENT,
                 General. {\bf G.4} Mathematics of Computing,
                 MATHEMATICAL SOFTWARE, Algorithm design and analysis.
                 {\bf G.2.0} Mathematics of Computing, DISCRETE
                 MATHEMATICS, General. {\bf I.2.1} Computing
                 Methodologies, ARTIFICIAL INTELLIGENCE, Applications
                 and Expert Systems. {\bf I.2.6} Computing
                 Methodologies, ARTIFICIAL INTELLIGENCE, Learning.",
}

@InProceedings{Ludascher:1997:RAL,
  author =       "Bertram Lud{\"a}scher and Wolfgang May and Georg
                 Lausen",
  title =        "Referential actions as logical rules",
  crossref =     "ACM:1997:PPS",
  pages =        "217--227",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/263661/p217-ludascher/p217-ludascher.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/263661/p217-ludascher/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/263661/p217-ludascher/",
  acknowledgement = ack-nhfb,
  keywords =     "languages; measurement; performance; verification",
  subject =      "{\bf H.2.0} Information Systems, DATABASE MANAGEMENT,
                 General. {\bf H.2.1} Information Systems, DATABASE
                 MANAGEMENT, Logical Design. {\bf F.3.2} Theory of
                 Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics
                 of Programming Languages. {\bf H.2.4} Information
                 Systems, DATABASE MANAGEMENT, Systems.",
}

@InProceedings{Carey:1997:SEA,
  author =       "Michael J. Carey and Donald Kossmann",
  title =        "On saying {``Enough already!''} in {SQL}",
  crossref =     "Peckman:1997:PAS",
  pages =        "219--230",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p219-carey/p219-carey.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p219-carey/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ho:1997:PSQ,
  author =       "Ching-Tien Ho and Jehoshua Bruck and Rakesh Agrawal",
  title =        "Partial-sum queries in {OLAP} data cubes using
                 covering codes",
  crossref =     "ACM:1997:PPS",
  pages =        "228--237",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/263661/p228-ho/p228-ho.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/263661/p228-ho/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/263661/p228-ho/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; measurement; performance; reliability;
                 verification",
  subject =      "{\bf G.2.0} Mathematics of Computing, DISCRETE
                 MATHEMATICS, General. {\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, Query
                 formulation. {\bf G.4} Mathematics of Computing,
                 MATHEMATICAL SOFTWARE, Algorithm design and analysis.",
}

@InProceedings{Griffin:1997:FIH,
  author =       "Timothy Griffin and Richard Hull",
  title =        "A framework for implementing hypothetical queries",
  crossref =     "Peckman:1997:PAS",
  pages =        "231--242",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p231-griffin/p231-griffin.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p231-griffin/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Scheufele:1997:CGO,
  author =       "Wolfgang Scheufele and Guido Moerkotte",
  title =        "On the complexity of generating optimal plans with
                 cross products (extended abstract)",
  crossref =     "ACM:1997:PPS",
  pages =        "238--248",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/263661/p238-scheufele/p238-scheufele.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/263661/p238-scheufele/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/263661/p238-scheufele/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; measurement; performance; verification",
  subject =      "{\bf H.2.0} Information Systems, DATABASE MANAGEMENT,
                 General. {\bf G.1.6} Mathematics of Computing,
                 NUMERICAL ANALYSIS, Optimization. {\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, Query formulation. {\bf D.1.5} Software,
                 PROGRAMMING TECHNIQUES, Object-oriented Programming.
                 {\bf G.4} Mathematics of Computing, MATHEMATICAL
                 SOFTWARE, Algorithm design and analysis. {\bf G.2.0}
                 Mathematics of Computing, DISCRETE MATHEMATICS,
                 General.",
}

@InProceedings{Arpaci-Dusseau:1997:HPS,
  author =       "Andrea C. Arpaci-Dusseau and Remzi H. Arpaci-Dusseau
                 and David E. Culler and Joseph M. Hellerstein and David
                 A. Patterson",
  title =        "High-performance sorting on networks of workstations",
  crossref =     "Peckman:1997:PAS",
  pages =        "243--254",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p243-arpaci-dusseau/p243-arpaci-dusseau.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p243-arpaci-dusseau/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hellerstein:1997:AIS,
  author =       "Joseph M. Hellerstein and Elias Koutsoupias and
                 Christos H. Papadimitriou",
  title =        "On the analysis of indexing schemes",
  crossref =     "ACM:1997:PPS",
  pages =        "249--256",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/263661/p249-hellerstein/p249-hellerstein.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/263661/p249-hellerstein/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/263661/p249-hellerstein/",
  acknowledgement = ack-nhfb,
  keywords =     "measurement; performance; verification",
  subject =      "{\bf H.2.0} Information Systems, DATABASE MANAGEMENT,
                 General. {\bf H.3.1} Information Systems, INFORMATION
                 STORAGE AND RETRIEVAL, Content Analysis and Indexing,
                 Indexing methods. {\bf H.2.1} Information Systems,
                 DATABASE MANAGEMENT, Logical Design, Data models.",
}

@InProceedings{Brin:1997:DIC,
  author =       "Sergey Brin and Rajeev Motwani and Jeffrey D. Ullman
                 and Shalom Tsur",
  title =        "Dynamic itemset counting and implication rules for
                 market basket data",
  crossref =     "Peckman:1997:PAS",
  pages =        "255--264",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p255-brin/p255-brin.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p255-brin/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Goldstein:1997:PQL,
  author =       "Jonathan Goldstein and Raghu Ramakrishnan and Uri
                 Shaft and Jie-Bing Yu",
  title =        "Processing queries by linear constraints",
  crossref =     "ACM:1997:PPS",
  pages =        "257--267",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/263661/p257-goldstein/p257-goldstein.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/263661/p257-goldstein/;
                 http://www.acm.org:80/pubs/citations/proceedings/pods/263661/p257-goldstein/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; experimentation; measurement;
                 performance",
  subject =      "{\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, Query formulation. {\bf H.2.3}
                 Information Systems, DATABASE MANAGEMENT, Languages,
                 SQL. {\bf G.4} Mathematics of Computing, MATHEMATICAL
                 SOFTWARE, Algorithm design and analysis.",
}

@InProceedings{Brin:1997:BMB,
  author =       "Sergey Brin and Rajeev Motwani and Craig Silverstein",
  title =        "Beyond market baskets: generalizing association rules
                 to correlations",
  crossref =     "Peckman:1997:PAS",
  pages =        "265--276",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p265-brin/p265-brin.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p265-brin/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Han:1997:SPD,
  author =       "Eui-Hong Han and George Karypis and Vipin Kumar",
  title =        "Scalable parallel data mining for association rules",
  crossref =     "Peckman:1997:PAS",
  pages =        "277--288",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p277-han/p277-han.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p277-han/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Korn:1997:ESA,
  author =       "Flip Korn and H. V. Jagadish and Christos Faloutsos",
  title =        "Efficiently supporting ad hoc queries in large
                 datasets of time sequences",
  crossref =     "Peckman:1997:PAS",
  pages =        "289--300",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p289-korn/p289-korn.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p289-korn/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Livny:1997:DIQ,
  author =       "M. Livny and R. Ramakrishnan and K. Beyer and G. Chen
                 and D. Donjerkovic and S. Lawande and J. Myllymaki and
                 K. Wenger",
  title =        "{DEVise}: integrated querying and visual exploration
                 of large datasets",
  crossref =     "Peckman:1997:PAS",
  pages =        "301--312",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p301-livny/p301-livny.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p301-livny/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Maheshwari:1997:PGC,
  author =       "Umesh Maheshwari and Barbara Liskov",
  title =        "Partitioned garbage collection of a large object
                 store",
  crossref =     "Peckman:1997:PAS",
  pages =        "313--323",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p313-maheshwari/p313-maheshwari.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p313-maheshwari/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Koudas:1997:SSS,
  author =       "Nick Koudas and Kenneth C. Sevcik",
  title =        "Size separation spatial join",
  crossref =     "Peckman:1997:PAS",
  pages =        "324--335",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p324-koudas/p324-koudas.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p324-koudas/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Patel:1997:BSG,
  author =       "Jignesh Patel and JieBing Yu and Navin Kabra and
                 Kristin Tufte and Biswadeep Nag and Josef Burger and
                 Nancy Hall and Karthikeyan Ramasamy and Roger Lueder
                 and Curt Ellmann and Jim Kupsch and Shelly Guo and
                 Johan Larson and David De Witt and Jeffrey Naughton",
  title =        "Building a scaleable geo-spatial {DBMS}: technology,
                 implementation, and evaluation",
  crossref =     "Peckman:1997:PAS",
  pages =        "336--347",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p336-patel/p336-patel.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p336-patel/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gebhardt:1997:TNS,
  author =       "Michael Gebhardt and Matthias Jarke and Stephan
                 Jacobs",
  title =        "A toolkit for negotiation support interfaces to
                 multi-dimensional data",
  crossref =     "Peckman:1997:PAS",
  pages =        "348--356",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p348-gebhardt/p348-gebhardt.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p348-gebhardt/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bozkaya:1997:DBI,
  author =       "Tolga Bozkaya and Meral Ozsoyoglu",
  title =        "Distance-based indexing for high-dimensional metric
                 spaces",
  crossref =     "Peckman:1997:PAS",
  pages =        "357--368",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p357-bozkaya/p357-bozkaya.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p357-bozkaya/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Katayama:1997:STI,
  author =       "Norio Katayama and Shin'ichi Satoh",
  title =        "The {SR-tree}: an index structure for high-dimensional
                 nearest neighbor queries",
  crossref =     "Peckman:1997:PAS",
  pages =        "369--380",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p369-katayama/p369-katayama.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p369-katayama/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Shivakumar:1997:WII,
  author =       "Narayanan Shivakumar and H{\'e}ctor
                 Garc{\'\i}a-Molina",
  title =        "Wave-indices: indexing evolving databases",
  crossref =     "Peckman:1997:PAS",
  pages =        "381--392",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p381-shivakumar/p381-shivakumar.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p381-shivakumar/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Quass:1997:LWV,
  author =       "Dallan Quass and Jennifer Widom",
  title =        "On-line warehouse view maintenance",
  crossref =     "Peckman:1997:PAS",
  pages =        "393--404",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p393-quass/p393-quass.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p393-quass/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Colby:1997:SMV,
  author =       "Latha S. Colby and Akira Kawaguchi and Daniel F.
                 Lieuwen and Inderpal Singh Mumick and Kenneth A. Ross",
  title =        "Supporting multiple view maintenance policies",
  crossref =     "Peckman:1997:PAS",
  pages =        "405--416",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p405-colby/p405-colby.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p405-colby/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Agrawal:1997:EVM,
  author =       "D. Agrawal and A. {El Abbadi} and A. Singh and T.
                 Yurek",
  title =        "Efficient view maintenance at data warehouses",
  crossref =     "Peckman:1997:PAS",
  pages =        "417--427",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p417-agrawal/p417-agrawal.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p417-agrawal/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Llirbat:1997:ECR,
  author =       "Fran{\c{c}}ois Llirbat and Fran{\c{c}}oise Fabret and
                 Eric Simon",
  title =        "Eliminating costly redundant computations from {SQL}
                 trigger executions",
  crossref =     "Peckman:1997:PAS",
  pages =        "428--439",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p428-llirbat/p428-llirbat.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p428-llirbat/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Motakis:1997:TAA,
  author =       "Iakovos Motakis and Carlo Zaniolo",
  title =        "Temporal aggregation in active database rules",
  crossref =     "Peckman:1997:PAS",
  pages =        "440--451",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p440-motakis/p440-motakis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p440-motakis/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Miller:1997:ARI,
  author =       "R. J. Miller and Y. Yang",
  title =        "Association rules over interval data",
  crossref =     "Peckman:1997:PAS",
  pages =        "452--461",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p452-miller/p452-miller.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p452-miller/",
  acknowledgement = ack-nhfb,
}

@InProceedings{George:1997:STP,
  author =       "Binto George and Jayant Haritsa",
  title =        "Secure transaction processing in firm real-time
                 database systems",
  crossref =     "Peckman:1997:PAS",
  pages =        "462--473",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p462-george/p462-george.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p462-george/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Jajodia:1997:UFE,
  author =       "Sushil Jajodia and Pierangela Samarati and V. S.
                 Subrahmanian and Eliza Bertino",
  title =        "A unified framework for enforcing multiple access
                 control policies",
  crossref =     "Peckman:1997:PAS",
  pages =        "474--485",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p474-jajodia/p474-jajodia.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p474-jajodia/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gupta:1997:RCP,
  author =       "Ramesh Gupta and Jayant Haritsa and Krithi
                 Ramamritham",
  title =        "Revisiting commit processing in distributed database
                 systems",
  crossref =     "Peckman:1997:PAS",
  pages =        "486--497",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p486-gupta/p486-gupta.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p486-gupta/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Shasha:1997:LWS,
  author =       "Dennis Shasha",
  title =        "Lessons from {Wall Street}: case studies in
                 configuration, tuning, and distribution",
  crossref =     "Peckman:1997:PAS",
  pages =        "498--501",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p498-shasha/p498-shasha.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p498-shasha/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Carey:1997:ORD,
  author =       "Michael J. Carey and Nelson M. Mattos and Anil K.
                 Nori",
  title =        "Object-relational database systems (tutorial):
                 principles, products and challenges",
  crossref =     "Peckman:1997:PAS",
  pages =        "502--502",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p502-carey/p502-carey.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p502-carey/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kramer:1997:DWT,
  author =       "Ralf Kramer",
  title =        "Databases on the {Web}: technologies for federation
                 architectures and case studies",
  crossref =     "Peckman:1997:PAS",
  pages =        "503--506",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p503-kramer/p503-kramer.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p503-kramer/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chaudhuri:1997:DWO,
  author =       "Surajit Chaudhuri and Umeshwar Dayal",
  title =        "Data warehousing and {OLAP} for decision support",
  crossref =     "Peckman:1997:PAS",
  pages =        "507--508",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p507-chaudhuri/p507-chaudhuri.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p507-chaudhuri/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chaudhuri:1997:QOC,
  author =       "Surajit Chaudhuri",
  title =        "Query optimization at the crossroads",
  crossref =     "Peckman:1997:PAS",
  pages =        "509--509",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p509-chaudhuri/p509-chaudhuri.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p509-chaudhuri/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cruz:1997:DDV,
  author =       "Isabel F. Cruz and M. Averbuch and Wendy T. Lucas and
                 Melissa Radzyminski and Kirby Zhang",
  title =        "Delaunay: a database visualization system",
  crossref =     "Peckman:1997:PAS",
  pages =        "510--513",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p510-cruz/p510-cruz.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p510-cruz/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Goyal:1997:PPP,
  author =       "Nita Goyal and Charles Hoch and Ravi Krishnamurthy and
                 Brian Meckler and Michael Suchow and Moshe Zloof",
  title =        "Picture programming project",
  crossref =     "Peckman:1997:PAS",
  pages =        "514--516",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p514-goyal/p514-goyal.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p514-goyal/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Livny:1997:DDA,
  author =       "M. Livny and R. Ramakrishnan and K. Beyer and G. Chen
                 and D. Donjerkovic and S. Lawande and J. Myllymaki and
                 K. Wenger",
  title =        "{DEVise} (demo abstract): integrated querying and
                 visual exploration of large datasets",
  crossref =     "Peckman:1997:PAS",
  pages =        "517--520",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p517-livny/p517-livny.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p517-livny/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Li:1997:SOB,
  author =       "Wen-Syan Li and K. Sel{\c{c}}uk Candan and Kyoji
                 Hirata and Yoshinori Hara",
  title =        "{SEMCOG}: an object-based image retrieval system and
                 its visual query interface",
  crossref =     "Peckman:1997:PAS",
  pages =        "521--524",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p521-li/p521-li.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p521-li/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bressan:1997:CIM,
  author =       "S. Bressan and C. H. Goh and K. Fynn and M. Jakobisiak
                 and K. Hussein and H. Kon and T. Lee and S. Madnick and
                 T. Pena and J. Qu and A. Shum and M. Siegel",
  title =        "The {Context Interchange} mediator prototype",
  crossref =     "Peckman:1997:PAS",
  pages =        "525--527",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p525-bressan/p525-bressan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p525-bressan/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Atzeni:1997:MMD,
  author =       "Paolo Atzeni and Riccardo Torlone",
  title =        "{MDM}: a multiple-data model tool for the management
                 of heterogeneous database schemes",
  crossref =     "Peckman:1997:PAS",
  pages =        "528--531",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p528-atzeni/p528-atzeni.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p528-atzeni/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hammer:1997:TBW,
  author =       "Joachim Hammer and H{\'e}ctor Garc{\'\i}a-Molina and
                 Svetlozar Nestorov and Ramana Yerneni and Marcus
                 Breunig and Vasilis Vassalos",
  title =        "Template-based wrappers in the {TSIMMIS} system",
  crossref =     "Peckman:1997:PAS",
  pages =        "532--535",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p532-hammer/p532-hammer.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p532-hammer/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gingras:1997:LMD,
  author =       "Fr{\'e}d{\'e}ric Gingras and Laks V. S. Lakshmanan and
                 Iyer N. Subramanian and Despina Papoulis and
                 Nematollaah Shiri",
  title =        "Languages for multi-database interoperability",
  crossref =     "Peckman:1997:PAS",
  pages =        "536--538",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p536-gingras/p536-gingras.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p536-gingras/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Genesereth:1997:III,
  author =       "Michael R. Genesereth and Arthur M. Keller and Oliver
                 M. Duschka",
  title =        "Infomaster: an information integration system",
  crossref =     "Peckman:1997:PAS",
  pages =        "539--542",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p539-genesereth/p539-genesereth.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p539-genesereth/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bayardo:1997:IP,
  author =       "R. J. Bayardo and W. Bohrer and R. Brice and A.
                 Cichocki and J. Fowler and A. Halal and V. Kashyap and
                 T. Ksiezyk and G. Martin and M. Nodine and M. Rashid
                 and M. Rusinkiewicz and R. Shea and C. Unnikrishnan and
                 A. Unruh and D. Woelk",
  title =        "The {InfoSleuth Project}",
  crossref =     "Peckman:1997:PAS",
  pages =        "543--545",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p543-bayardo/p543-bayardo.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p543-bayardo/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Tomasic:1997:DIS,
  author =       "Anthony Tomasic and R{\'e}my Amouroux and Philippe
                 Bonnet and Olga Kapitskaia and Hubert Naacke and Louiqa
                 Raschid",
  title =        "The distributed information search component {(Disco)}
                 and the {World Wide Web}",
  crossref =     "Peckman:1997:PAS",
  pages =        "546--548",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p546-tomasic/p546-tomasic.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p546-tomasic/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Fernandez:1997:SWS,
  author =       "Mary Fernandez and Daniela Florescu and Jaewoo Kang
                 and Alon Levy and Dan Suciu",
  title =        "{STRUDEL}: a {Web} site management system",
  crossref =     "Peckman:1997:PAS",
  pages =        "549--552",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p549-fernandez/p549-fernandez.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p549-fernandez/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Han:1997:GSP,
  author =       "Jaiwei Han and Krzysztof Koperski and Nebojsa
                 Stefanovic",
  title =        "{GeoMiner}: a system prototype for spatial data
                 mining",
  crossref =     "Peckman:1997:PAS",
  pages =        "553--556",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p553-han/p553-han.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p553-han/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Labio:1997:WPD,
  author =       "Wilburt J. Labio and Yue Zhuge and Janet L. Wiener and
                 Himanshu Gupta and H{\'e}ctor Garc{\'\i}a-Molina and
                 Jennifer Widom",
  title =        "The {WHIPS} prototype for data warehouse creation and
                 maintenance",
  crossref =     "Peckman:1997:PAS",
  pages =        "557--559",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p557-labio/p557-labio.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p557-labio/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Wang:1997:SMD,
  author =       "Jason Tsong-Li Wang and Dennis Shasha and George J. S.
                 Chang and Liam Relihan and Kaizhong Zhang and Girish
                 Patel",
  title =        "Structural matching and discovery in document
                 databases",
  crossref =     "Peckman:1997:PAS",
  pages =        "560--563",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p560-wang/p560-wang.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p560-wang/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Berchtold:1997:SSS,
  author =       "Stefan Berchtold and Hans-Peter Kriegel",
  title =        "{S3}: similarity search in {CAD} database systems",
  crossref =     "Peckman:1997:PAS",
  pages =        "564--567",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p564-berchtold/p564-berchtold.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p564-berchtold/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Seshadri:1997:PDE,
  author =       "Praveen Seshadri and Mark Paskin",
  title =        "{PREDATOR}: an {OR-DBMS} with enhanced data types",
  crossref =     "Peckman:1997:PAS",
  pages =        "568--571",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p568-seshadri/p568-seshadri.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p568-seshadri/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chakravarthy:1997:SOO,
  author =       "S. Chakravarthy",
  title =        "Sentinel: an object-oriented {DBMS} with event-based
                 rules",
  crossref =     "Peckman:1997:PAS",
  pages =        "572--575",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p572-chakravarthy/p572-chakravarthy.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p572-chakravarthy/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Wodtke:1997:MWE,
  author =       "Dirk Wodtke and Jeanine Weissenfels and Gerhard Weikum
                 and Angelika Kotz Dittrich and Peter Muth",
  title =        "The {MENTOR} workbench for enterprise-wide workflow
                 management",
  crossref =     "Peckman:1997:PAS",
  pages =        "576--579",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p576-wodtke/p576-wodtke.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p576-wodtke/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ioannidis:1997:ZDE,
  author =       "Yannis E. Ioannidis and Miron Livny and Anastassia
                 Ailamaki and Anand Narayanan and Andrew Therber",
  title =        "Zoo: a desktop experiment management environment",
  crossref =     "Peckman:1997:PAS",
  pages =        "580--583",
  year =         "1997",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/253260/p580-ioannidis/p580-ioannidis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/253260/p580-ioannidis/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Fagin:1998:FQM,
  author =       "Ronald Fagin",
  title =        "Fuzzy Queries in Multimedia Database Systems",
  crossref =     "ACM:1998:PPA",
  pages =        "1--10",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/275487/p1-fagin/p1-fagin.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/275487/p1-fagin/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Tsur:1998:QFG,
  author =       "Dick Tsur and Jeffrey D. Ullman and Serge Abiteboul
                 and Chris Clifton and Rajeev Motwani and Svetlozar
                 Nestorov and Arnon Rosenthal",
  title =        "Query flocks: a generalization of association-rule
                 mining",
  crossref =     "Haas:1998:PAS",
  pages =        "1--12",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p1-tsur/p1-tsur.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p1-tsur/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Neven:1998:ESD,
  author =       "Frank Neven and Jan {Van den Bussche}",
  title =        "Expressiveness of Structured Document Query Languages
                 Based on Attribute Grammars",
  crossref =     "ACM:1998:PPA",
  pages =        "11--17",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/275487/p11-neven/p11-neven.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/275487/p11-neven/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ng:1998:EMP,
  author =       "Raymond T. Ng and Laks V. S. Lakshmanan and Jiawei Han
                 and Alex Pang",
  title =        "Exploratory mining and pruning optimizations of
                 constrained associations rules",
  crossref =     "Haas:1998:PAS",
  pages =        "13--24",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p13-ng/p13-ng.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p13-ng/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Aggarwal:1998:NFI,
  author =       "Charu C. Aggarwal and Philip S. Yu",
  title =        "A New Framework for Itemset Generation",
  crossref =     "ACM:1998:PPA",
  pages =        "18--24",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/275487/p18-aggarwal/p18-aggarwal.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/275487/p18-aggarwal/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Davulcu:1998:LBM,
  author =       "Hasan Davulcu and Michael Kifer and C. R. Ramakrishnan
                 and I. V. Ramakrishnan",
  title =        "Logic Based Modeling and Analysis of Workflows",
  crossref =     "ACM:1998:PPA",
  pages =        "25--33",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/275487/p25-davulcu/p25-davulcu.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/275487/p25-davulcu/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Shintani:1998:PMA,
  author =       "Takahiko Shintani and Masaru Kitsuregawa",
  title =        "Parallel mining algorithms for generalized association
                 rules with classification hierarchy",
  crossref =     "Haas:1998:PAS",
  pages =        "25--36",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p25-shintani/p25-shintani.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p25-shintani/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chaudhuri:1998:OQO,
  author =       "Surajit Chaudhuri",
  title =        "An Overview of Query Optimization in Relational
                 Systems",
  crossref =     "ACM:1998:PPA",
  pages =        "34--43",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/275487/p34-chaudhuri/p34-chaudhuri.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/275487/p34-chaudhuri/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Rao:1998:RIN,
  author =       "Jun Rao and Kenneth A. Ross",
  title =        "Reusing invariants: a new strategy for correlated
                 queries",
  crossref =     "Haas:1998:PAS",
  pages =        "37--48",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p37-rao/p37-rao.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p37-rao/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Samoladas:1998:LBT,
  author =       "Vasilis Samoladas and Daniel P. Miranker",
  title =        "A Lower Bound Theorem for Indexing Schemes and its
                 Application to Multidimensional Range Queries",
  crossref =     "ACM:1998:PPA",
  pages =        "44--51",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/275487/p44-samoladas/p44-samoladas.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/275487/p44-samoladas/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Fegaras:1998:QUO,
  author =       "Leonidas Fegaras",
  title =        "Query unnesting in object-oriented databases",
  crossref =     "Haas:1998:PAS",
  pages =        "49--60",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p49-fegaras/p49-fegaras.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p49-fegaras/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Koutsoupias:1998:TBD,
  author =       "Elias Koutsoupias and D. Scot Taylor",
  title =        "Tight bounds for $2$-dimensional indexing schemes",
  crossref =     "ACM:1998:PPA",
  pages =        "52--58",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/275487/p52-koutsoupias/p52-koutsoupias.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/275487/p52-koutsoupias/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ciaccia:1998:CMS,
  author =       "Paolo Ciaccia and Marco Patella and Pavel Zezula",
  title =        "A Cost Model for Similarity Queries in Metric Spaces",
  crossref =     "ACM:1998:PPA",
  pages =        "59--68",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/275487/p59-ciaccia/p59-ciaccia.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/275487/p59-ciaccia/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cherniack:1998:CRT,
  author =       "Mitch Cherniack and Stan Zdonik",
  title =        "Changing the rules: transformations for rule-based
                 optimizers",
  crossref =     "Haas:1998:PAS",
  pages =        "61--72",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p61-cherniack/p61-cherniack.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p61-cherniack/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Christodoulakis:1998:DBD,
  author =       "Stavros Christodoulakis and Fenia A. Zioga",
  title =        "Data Base Design Principles for Striping and Placement
                 of Delay-Sensitive Data on Disks",
  crossref =     "ACM:1998:PPA",
  pages =        "69--78",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/275487/p69-christodoulakis/p69-christodoulakis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/275487/p69-christodoulakis/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Guha:1998:CEC,
  author =       "Sudipto Guha and Rajeev Rastogi and Kyuseok Shim",
  title =        "{CURE}: an efficient clustering algorithm for large
                 databases",
  crossref =     "Haas:1998:PAS",
  pages =        "73--84",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p73-guha/p73-guha.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p73-guha/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Garofalakis:1998:TCA,
  author =       "Minos N. Garofalakis and Yannis E. Ioannidis and Banu
                 {\"O}zden and Avi Silberschatz",
  title =        "Throughput-Competitive Admission Control for
                 Continuous Media Databases",
  crossref =     "ACM:1998:PPA",
  pages =        "79--88",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/275487/p79-garofalakis/p79-garofalakis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/275487/p79-garofalakis/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bayardo:1998:EML,
  author =       "Roberto J. Bayardo",
  title =        "Efficiently mining long patterns from databases",
  crossref =     "Haas:1998:PAS",
  pages =        "85--93",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p85-bayardo/p85-bayardo.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p85-bayardo/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Segoufin:1998:QSD,
  author =       "Luc Segoufin and Victor Vianu",
  title =        "Querying Spatial Databases via Topological
                 Invariants",
  crossref =     "ACM:1998:PPA",
  pages =        "89--98",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/275487/p89-segoufin/p89-segoufin.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/275487/p89-segoufin/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Agrawal:1998:ASC,
  author =       "Rakesh Agrawal and Johannes Gehrke and Dimitrios
                 Gunopulos and Prabhakar Raghavan",
  title =        "Automatic subspace clustering of high dimensional data
                 for data mining applications",
  crossref =     "Haas:1998:PAS",
  pages =        "94--105",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p94-agrawal/p94-agrawal.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p94-agrawal/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Benedikt:1998:SCQ,
  author =       "Michael Benedikt and Leonid Libkin",
  title =        "Safe Constraint Queries",
  crossref =     "ACM:1998:PPA",
  pages =        "99--108",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/275487/p99-benedikt/p99-benedikt.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/275487/p99-benedikt/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kabra:1998:EMQ,
  author =       "Navin Kabra and David J. DeWitt",
  title =        "Efficient mid-query re-optimization of sub-optimal
                 query execution plans",
  crossref =     "Haas:1998:PAS",
  pages =        "106--117",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p106-kabra/p106-kabra.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p106-kabra/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Vandeurzen:1998:ELL,
  author =       "Luc Vandeurzen and Marc Gyssens and Dirk {Van Gucht}",
  title =        "An Expressive Language for Linear Spatial Database
                 Queries",
  crossref =     "ACM:1998:PPA",
  pages =        "109--118",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/275487/p109-vandeurzen/p109-vandeurzen.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/275487/p109-vandeurzen/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Jonsson:1998:IQE,
  author =       "Bj{\"o}rn T. J{\'o}nsson and Michael J. Franklin and
                 Divesh Srivastava",
  title =        "Interaction of query evaluation and buffer management
                 for information retrieval",
  crossref =     "Haas:1998:PAS",
  pages =        "118--129",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p118-jonsson/p118-jonsson.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p118-jonsson/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Vitter:1998:EMA,
  author =       "Jeffrey Scott Vitter",
  title =        "External Memory Algorithms",
  crossref =     "ACM:1998:PPA",
  pages =        "119--128",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/275487/p119-vitter/p119-vitter.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/275487/p119-vitter/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Buneman:1998:PCS,
  author =       "Peter Buneman and Wenfei Fan and Scott Weinstein",
  title =        "Path Constraints on Semistructured and Structured
                 Data",
  crossref =     "ACM:1998:PPA",
  pages =        "129--138",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/275487/p129-buneman/p129-buneman.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/275487/p129-buneman/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Urhan:1998:CBQ,
  author =       "Tolga Urhan and Michael J. Franklin and Laurent
                 Amsaleg",
  title =        "Cost-based query scrambling for initial delays",
  crossref =     "Haas:1998:PAS",
  pages =        "130--141",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p130-urhan/p130-urhan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p130-urhan/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Florescu:1998:QCC,
  author =       "Daniela Florescu and Alon Levy and Dan Suciu",
  title =        "Query Containment for Conjunctive Queries with Regular
                 Expressions",
  crossref =     "ACM:1998:PPA",
  pages =        "139--148",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/275487/p139-florescu/p139-florescu.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/275487/p139-florescu/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Berchtold:1998:PTT,
  author =       "Stefan Berchtold and Christian B{\"o}hm and Hans-Peter
                 Kriegal",
  title =        "The pyramid-technique: towards breaking the curse of
                 dimensionality",
  crossref =     "Haas:1998:PAS",
  pages =        "142--153",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p142-berchtold/p142-berchtold.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p142-berchtold/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Calvanese:1998:DQC,
  author =       "Diego Calvanese and Giuseppe {De Giacomo} and Maurizio
                 Lenzerini",
  title =        "On the Decidability of Query Containment under
                 Constraints",
  crossref =     "ACM:1998:PPA",
  pages =        "149--158",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/275487/p149-calvanese/p149-calvanese.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/275487/p149-calvanese/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Seidl:1998:OMS,
  author =       "Thomas Seidl and Hans-Peter Kriegel",
  title =        "Optimal multi-step $k$-nearest neighbor search",
  crossref =     "Haas:1998:PAS",
  pages =        "154--165",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p154-seidl/p154-seidl.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p154-seidl/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Papadimitriou:1998:LSI,
  author =       "Christos H. Papadimitriou and Hisao Tamaki and
                 Prabhakar Raghavan and Santosh Vempala",
  title =        "Latent Semantic Indexing: a Probabilistic Analysis",
  crossref =     "ACM:1998:PPA",
  pages =        "159--168",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/275487/p159-papadimitriou/p159-papadimitriou.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/275487/p159-papadimitriou/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kanth:1998:DRS,
  author =       "K. V. Ravi Kanth and Divyakant Agrawal and Ambuj
                 Singh",
  title =        "Dimensionality reduction for similarity searching in
                 dynamic databases",
  crossref =     "Haas:1998:PAS",
  pages =        "166--176",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p166-ravi_kanth/p166-ravi_kanth.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p166-ravi_kanth/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Agarwal:1998:ESL,
  author =       "Pankaj K. Agarwal and Lars Arge and Jeff Erickson and
                 Paolo G. Franciosa and Jeffry Scott Vitter",
  title =        "Efficient Searching with Linear Constraints",
  crossref =     "ACM:1998:PPA",
  pages =        "169--178",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/275487/p169-agarwal/p169-agarwal.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/275487/p169-agarwal/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cluet:1998:YMN,
  author =       "Sophie Cluet and Claude Delobel and J{\'e}r{\^o}me
                 Sim{\'e}on and Katarzyna Smaga",
  title =        "Your mediators need data conversion!",
  crossref =     "Haas:1998:PAS",
  pages =        "177--188",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p177-cluet/p177-cluet.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p177-cluet/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Abiteboul:1998:RTE,
  author =       "Serge Abiteboul and Victor Vianu and Brad Fordham and
                 Yelena Yesha",
  title =        "Relational Transducers for Electronic Commerce",
  crossref =     "ACM:1998:PPA",
  pages =        "179--187",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/275487/p179-abiteboul/p179-abiteboul.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/275487/p179-abiteboul/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Samarati:1998:GDP,
  author =       "Pierangela Samarati and Latanya Sweeney",
  title =        "Generalizing data to provide anonymity when disclosing
                 information (abstract)",
  crossref =     "ACM:1998:PPA",
  pages =        "188--188",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/275487/p188-samarati/p188-samarati.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/275487/p188-samarati/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Neven:1998:TQL,
  author =       "Frank Neven and Dirk {Van Gucht} and Jan {Van den
                 Bussche} and Gottfried Vossen",
  title =        "Typed Query Languages for Databases Containing
                 Queries",
  crossref =     "ACM:1998:PPA",
  pages =        "189--196",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/275487/p189-neven/p189-neven.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/275487/p189-neven/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Miller:1998:USH,
  author =       "Re{\'e}e J. Miller",
  title =        "Using schematically heterogeneous structures",
  crossref =     "Haas:1998:PAS",
  pages =        "189--200",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p189-miller/p189-miller.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p189-miller/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kolaitis:1998:CCP,
  author =       "Phokion G. Kolaitis and David L. Martin and Madhukar
                 N. Thakur",
  title =        "On the Complexity of the Containment Problem for
                 Conjunctive Queries with Built-in Predicates",
  crossref =     "ACM:1998:PPA",
  pages =        "197--204",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/275487/p197-kolaitis/p197-kolaitis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/275487/p197-kolaitis/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cohen:1998:IHD,
  author =       "William W. Cohen",
  title =        "Integration of heterogeneous databases without common
                 domains using queries based on textual similarity",
  crossref =     "Haas:1998:PAS",
  pages =        "201--212",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p201-cohen/p201-cohen.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p201-cohen/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kolaitis:1998:CQC,
  author =       "Phokion G. Kolaitis and Moshe Y. Vardi",
  title =        "Conjunctive-Query Containment and Constraint
                 Satisfaction",
  crossref =     "ACM:1998:PPA",
  pages =        "205--213",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/275487/p205-kolaitis/p205-kolaitis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/275487/p205-kolaitis/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Grumbach:1998:DSC,
  author =       "St{\'e}phane Grumbach and Philippe Rigaux and Luc
                 Segoufin",
  title =        "The {DEDALE} system for complex spatial queries",
  crossref =     "Haas:1998:PAS",
  pages =        "213--224",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p213-grumbach/p213-grumbach.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p213-grumbach/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Nutt:1998:DEA,
  author =       "Werner Nutt and Yehoshus Sagiv and Sara Shurin",
  title =        "Deciding Equivalences among Aggregate Queries",
  crossref =     "ACM:1998:PPA",
  pages =        "214--223",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/275487/p214-nutt/p214-nutt.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/275487/p214-nutt/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Klavans:1998:DBD,
  author =       "Judith Klavans",
  title =        "Data Bases in Digital Libraries: Where Computer
                 Science and Information Management Meet",
  crossref =     "ACM:1998:PPA",
  pages =        "224--226",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/275487/p224-klavans/p224-klavans.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/275487/p224-klavans/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Papadopoulos:1998:SQP,
  author =       "Apostolos N. Papadopoulos and Yannis Manolopoulos",
  title =        "Similarity query processing using disk arrays",
  crossref =     "Haas:1998:PAS",
  pages =        "225--236",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p225-papadopoulos/p225-papadopoulos.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p225-papadopoulos/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gradel:1998:CQR,
  author =       "Erich Gr{\"a}del and Yuri Gurevich and Colin Hirsch",
  title =        "The complexity of query reliability",
  crossref =     "ACM:1998:PPA",
  pages =        "227--234",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/275487/p227-gradel/p227-gradel.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/275487/p227-gradel/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Graedel:1998:CQR,
  author =       "E. Graedel and Y. Gurevich and C. Hirsch",
  title =        "The Complexity of Query Reliability",
  crossref =     "ACM:1998:PPA",
  pages =        "227--234",
  year =         "1998",
  bibdate =      "Sat Jan 2 15:15:39 MST 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Etessami:1998:DTI,
  author =       "Kousha Etessami",
  title =        "Dynamic Tree Isomorphism via First-order Updates to a
                 Relational Database",
  crossref =     "ACM:1998:PPA",
  pages =        "235--243",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/275487/p235-etessami/p235-etessami.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/275487/p235-etessami/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hjaltason:1998:IDJ,
  author =       "G{\'\i}sli R. Hjaltason and Hanan Samet",
  title =        "Incremental distance join algorithms for spatial
                 databases",
  crossref =     "Haas:1998:PAS",
  pages =        "237--248",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p237-hjaltason/p237-hjaltason.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p237-hjaltason/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Vorobyov:1998:CNL,
  author =       "Sergei Vorobyov and Andrie Voronkov",
  title =        "Complexity of Nonrecursive Logic Programs with Complex
                 Values",
  crossref =     "ACM:1998:PPA",
  pages =        "244--253",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/275487/p244-vorobyov/p244-vorobyov.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/275487/p244-vorobyov/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kotidis:1998:ASO,
  author =       "Yannis Kotidis and Nick Roussopoulos",
  title =        "An alternative storage organization for {ROLAP}
                 aggregate views based on cubetrees",
  crossref =     "Haas:1998:PAS",
  pages =        "249--258",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p249-kotidis/p249-kotidis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p249-kotidis/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Abiteboul:1998:CAQ,
  author =       "Serge Abiteboul and Oliver M. Duschka",
  title =        "Complexity of Answering Queries Using Materialized
                 Views",
  crossref =     "ACM:1998:PPA",
  pages =        "254--263",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/275487/p254-abiteboul/p254-abiteboul.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/275487/p254-abiteboul/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Deshpande:1998:CMQ,
  author =       "Prasad M. Deshpande and Karthikeyan Ramasamy and Amit
                 Shukla and Jeffrey F. Naughton",
  title =        "Caching multidimensional queries using chunks",
  crossref =     "Haas:1998:PAS",
  pages =        "259--270",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p259-deshpande/p259-deshpande.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p259-deshpande/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bailey:1998:DUR,
  author =       "James Bailey and Guozhu Dong and Kotagiri
                 Ramamohanarao",
  title =        "Decidability and Undecidability Results for the
                 Termination Problem of Active Database Rules",
  crossref =     "ACM:1998:PPA",
  pages =        "264--273",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/275487/p264-bailey/p264-bailey.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/275487/p264-bailey/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Zhao:1998:SOE,
  author =       "Yihong Zhao and Prasad M. Deshpande and Jeffrey F.
                 Naughton and Amit Shukla",
  title =        "Simultaneous optimization and evaluation of multiple
                 dimensional queries",
  crossref =     "Haas:1998:PAS",
  pages =        "271--282",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p271-zhao/p271-zhao.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p271-zhao/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Smith:1998:DAV,
  author =       "John R. Smith and Vittorio Castelli and Anant Jhingran
                 and Chung-Sheng Li",
  title =        "Dynamic Assembly of Views in Data Cubes",
  crossref =     "ACM:1998:PPA",
  pages =        "274--283",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/275487/p274-smith/p274-smith.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/275487/p274-smith/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Adelberg:1998:NTS,
  author =       "Brad Adelberg",
  title =        "{NoDoSE--a} tool for semi-automatically extracting
                 structured and semistructured data from text
                 documents",
  crossref =     "Haas:1998:PAS",
  pages =        "283--294",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p283-adelberg/p283-adelberg.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p283-adelberg/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Nestorov:1998:ESS,
  author =       "Svetlozar Nestorov and Serge Abiteboul and Rajeev
                 Motwani",
  title =        "Extracting schema from semistructured data",
  crossref =     "Haas:1998:PAS",
  pages =        "295--306",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p295-nestorov/p295-nestorov.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p295-nestorov/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chakrabarti:1998:EHC,
  author =       "Soumen Chakrabarti and Byron Dom and Piotr Indyk",
  title =        "Enhanced hypertext categorization using hyperlinks",
  crossref =     "Haas:1998:PAS",
  pages =        "307--318",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p307-chakrabarti/p307-chakrabarti.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p307-chakrabarti/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Subramanian:1998:CBO,
  author =       "Subbu N. Subramanian and Shivakumar Venkataraman",
  title =        "Cost-based optimization of decision support queries
                 using transient-views",
  crossref =     "Haas:1998:PAS",
  pages =        "319--330",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p319-subramanian/p319-subramanian.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p319-subramanian/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gibbons:1998:NSB,
  author =       "Phillip B. Gibbons and Yossi Matias",
  title =        "New sampling-based summary statistics for improving
                 approximate query answers",
  crossref =     "Haas:1998:PAS",
  pages =        "331--342",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p331-gibbons/p331-gibbons.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p331-gibbons/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Sarawagi:1998:IAR,
  author =       "Sunita Sarawagi and Shiby Thomas and Rakesh Agrawal",
  title =        "Integrating association rule mining with relational
                 database systems: alternatives and implications",
  crossref =     "Haas:1998:PAS",
  pages =        "343--354",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p343-sarawagi/p343-sarawagi.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p343-sarawagi/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chan:1998:BID,
  author =       "Chee-Yong Chan and Yannis E. Ioannidis",
  title =        "Bitmap index design and evaluation",
  crossref =     "Haas:1998:PAS",
  pages =        "355--366",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p355-chan/p355-chan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p355-chan/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chaudhuri:1998:AWI,
  author =       "Surajit Chaudhuri and Vivek Narasayya",
  title =        "{AutoAdmin} ``what-if'' index analysis utility",
  crossref =     "Haas:1998:PAS",
  pages =        "367--378",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p367-chaudhuri/p367-chaudhuri.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p367-chaudhuri/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Jaedicke:1998:PPA,
  author =       "Michael Jaedicke and Bernhard Mitschang",
  title =        "On parallel processing of aggregate and scalar
                 functions in object-relational {DBMS}",
  crossref =     "Haas:1998:PAS",
  pages =        "379--389",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p379-jaedicke/p379-jaedicke.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p379-jaedicke/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Godfrey:1998:SPD,
  author =       "Michael Godfrey and Tobias Mayr and Praveen Seshadri
                 and Thorsten von Eicken",
  title =        "Secure and portable database extensibility",
  crossref =     "Haas:1998:PAS",
  pages =        "390--401",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p390-godfrey/p390-godfrey.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p390-godfrey/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Adali:1998:MSA,
  author =       "S. Adali and P. Bonatti and M. L. Sapino and V. S.
                 Subrahmanian",
  title =        "A multi-similarity algebra",
  crossref =     "Haas:1998:PAS",
  pages =        "402--413",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p402-adali/p402-adali.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p402-adali/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Fernandez:1998:CBS,
  author =       "Mary Fern{\'a}ndez and Daniela Florescu and Jaewoo
                 Kang and Alon Levy and Dan Suciu",
  title =        "Catching the boat with {Strudel}: experiences with a
                 {Web-site} management system",
  crossref =     "Haas:1998:PAS",
  pages =        "414--425",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p414-fernandez/p414-fernandez.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p414-fernandez/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Manku:1998:AMO,
  author =       "Gurmeet Singh Manku and Sridhar Rajagopalan and Bruce
                 G. Lindsay",
  title =        "Approximate medians and other quantiles in one pass
                 and with limited memory",
  crossref =     "Haas:1998:PAS",
  pages =        "426--435",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p426-manku/p426-manku.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p426-manku/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chaudhuri:1998:RSH,
  author =       "Surajit Chaudhuri and Rajeev Motwani and Vivek
                 Narasayya",
  title =        "Random sampling for histogram construction: how much
                 is enough?",
  crossref =     "Haas:1998:PAS",
  pages =        "436--447",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p436-chaudhuri/p436-chaudhuri.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p436-chaudhuri/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Matias:1998:WBH,
  author =       "Yossi Matias and Jeffrey Scott Vitter and Min Wang",
  title =        "Wavelet-based histograms for selectivity estimation",
  crossref =     "Haas:1998:PAS",
  pages =        "448--459",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p448-matias/p448-matias.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p448-matias/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Lomet:1998:ETA,
  author =       "David Lomet and Gerhard Weikum",
  title =        "Efficient transparent application recovery in
                 client-server information systems",
  crossref =     "Haas:1998:PAS",
  pages =        "460--471",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p460-lomet/p460-lomet.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p460-lomet/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Larson:1998:MMD,
  author =       "Per-{\AA}ke Larson and Goetz Graefe",
  title =        "Memory management during run generation in external
                 sorting",
  crossref =     "Haas:1998:PAS",
  pages =        "472--483",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p472-larson/p472-larson.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p472-larson/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Anderson:1998:RCP,
  author =       "Todd Anderson and Yuri Breitbart and Henry F. Korth
                 and Avishai Wool",
  title =        "Replication, consistency, and practicality: are these
                 mutually exclusive?",
  crossref =     "Haas:1998:PAS",
  pages =        "484--495",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p484-anderson/p484-anderson.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p484-anderson/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Stonebraker:1998:WWR,
  author =       "Michael Stonebraker",
  title =        "Are we working on the right problems? (panel)",
  crossref =     "Haas:1998:PAS",
  pages =        "496--496",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p496-stonebraker/p496-stonebraker.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p496-stonebraker/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Mylopoulos:1998:NGD,
  author =       "John Mylopoulos",
  title =        "Next generation database systems won't work without
                 semantics! (panel)",
  crossref =     "Haas:1998:PAS",
  pages =        "497--497",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p497-mylopoulos/p497-mylopoulos.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p497-mylopoulos/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Adam:1998:ECT,
  author =       "Nabil R. Adam and Yelena Yesha",
  title =        "Electronic commerce: tutorial",
  crossref =     "Haas:1998:PAS",
  pages =        "498--498",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p498-adam/p498-adam.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p498-adam/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kemper:1998:SRT,
  author =       "Alfons Kemper and Donald Kossmann and Florian
                 Matthes",
  title =        "{SAP R/3} (tutorial): a database application system",
  crossref =     "Haas:1998:PAS",
  pages =        "499--499",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p499-kemper/p499-kemper.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p499-kemper/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Clossman:1998:JRD,
  author =       "Gray Clossman and Phil Shaw and Mark Hapner and
                 Johannes Klein and Richard Pledereder and Brian
                 Becker",
  title =        "{Java} and relational databases (tutorial): {SQLJ}",
  crossref =     "Haas:1998:PAS",
  pages =        "500--500",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p500-clossman/p500-clossman.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p500-clossman/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Berchtold:1998:HDI,
  author =       "Stefan Berchtold and Daniel A. Keim",
  title =        "High-dimensional index structures database support for
                 next decade's applications (tutorial)",
  crossref =     "Haas:1998:PAS",
  pages =        "501--501",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p501-berchtold/p501-berchtold.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p501-berchtold/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Blakeley:1998:MUD,
  author =       "Jos{\'e} A. Blakeley and Michael J. Pizzo",
  title =        "{Microsoft} universal data access platform",
  crossref =     "Haas:1998:PAS",
  pages =        "502--503",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p502-blakeley/p502-blakeley.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p502-blakeley/",
  acknowledgement = ack-nhfb,
}

@InProceedings{White:1998:EJP,
  author =       "Seth White and Rick Cattell and Shel Finkelstein",
  title =        "Enterprise {Java} platform data access",
  crossref =     "Haas:1998:PAS",
  pages =        "504--505",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p504-white/p504-white.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p504-white/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Reinwald:1998:SOH,
  author =       "Berthold Reinwald and Hamid Pirahesh",
  title =        "{SQL} open heterogeneous data access",
  crossref =     "Haas:1998:PAS",
  pages =        "506--507",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p506-reinwald/p506-reinwald.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p506-reinwald/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Eaton:1998:MLS,
  author =       "Chris Eaton",
  title =        "Managing large systems with {DB2 UDB}",
  crossref =     "Haas:1998:PAS",
  pages =        "508--509",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p508-eaton/p508-eaton.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p508-eaton/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Doherty:1998:DSM,
  author =       "C. Gregory Doherty",
  title =        "Database systems management and {Oracle8}",
  crossref =     "Haas:1998:PAS",
  pages =        "510--511",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p510-doherty/p510-doherty.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p510-doherty/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Spiro:1998:UST,
  author =       "Peter Spiro",
  title =        "Ubiquitous, self-tuning, scalable servers",
  crossref =     "Haas:1998:PAS",
  pages =        "512--515",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p512-spiro/p512-spiro.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p512-spiro/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Franklin:1998:DYF,
  author =       "Michael Franklin and Stan Zdonik",
  title =        "``Data in your face'': push technology in
                 perspective",
  crossref =     "Haas:1998:PAS",
  pages =        "516--519",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p516-franklin/p516-franklin.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p516-franklin/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ramakrishnan:1998:PNA,
  author =       "Satish Ramakrishnan and Vibha Dayal",
  title =        "The {PointCast} network (abstract)",
  crossref =     "Haas:1998:PAS",
  pages =        "520--520",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p520-ramakrishnan/p520-ramakrishnan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p520-ramakrishnan/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chan:1998:TPS,
  author =       "Arvola Chan",
  title =        "Transactional publish/subscribe: the proactive
                 multicast of database changes (abstract)",
  crossref =     "Haas:1998:PAS",
  pages =        "521--521",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p521-chan/p521-chan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p521-chan/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ng:1998:DMA,
  author =       "KianSing Ng and Huan Liu and HweeBong Kwah",
  title =        "A data mining application: customer retention at the
                 {Port of Singapore Authority (PSA)}",
  crossref =     "Haas:1998:PAS",
  pages =        "522--525",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p522-ng/p522-ng.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p522-ng/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Anderson:1998:ORR,
  author =       "Richard Anderson and Gopalan Arun and Richard Frank",
  title =        "{Oracle Rdb}'s record caching model",
  crossref =     "Haas:1998:PAS",
  pages =        "526--527",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p526-anderson/p526-anderson.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p526-anderson/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Lahiri:1998:UOU,
  author =       "Tirthankar Lahiri and Ashok Joshi and Amit Jasuja and
                 Sumanta Chatterjee",
  title =        "50,000 users on an {Oracle8} universal server
                 database",
  crossref =     "Haas:1998:PAS",
  pages =        "528--530",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p528-lahiri/p528-lahiri.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p528-lahiri/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Aulakh:1998:AQD,
  author =       "Kamar Aulakh",
  title =        "About {Quark Digital Media System}",
  crossref =     "Haas:1998:PAS",
  pages =        "531--532",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p531-aulakh/p531-aulakh.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p531-aulakh/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Whelan:1998:FID,
  author =       "Daniel S. Whelan",
  title =        "{FileNet} integrated document management database
                 usage and issues",
  crossref =     "Haas:1998:PAS",
  pages =        "533--533",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p533-whelan/p533-whelan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p533-whelan/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Nauman:1998:DHT,
  author =       "John Nauman and Ray Suorsa",
  title =        "Developing a high traffic, read-only {Web} site",
  crossref =     "Haas:1998:PAS",
  pages =        "534--535",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p534-nauman/p534-nauman.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p534-nauman/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chong:1998:RBP,
  author =       "James Chong",
  title =        "Real business processing meets the {Web}",
  crossref =     "Haas:1998:PAS",
  pages =        "536--536",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p536-chong/p536-chong.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p536-chong/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Lassettre:1998:ORD,
  author =       "Edwin R. Lassettre",
  title =        "{Olympic} records for data at the 1998 {Nagano}
                 games",
  crossref =     "Haas:1998:PAS",
  pages =        "537--537",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p537-lassettre/p537-lassettre.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p537-lassettre/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Brewer:1998:DHA,
  author =       "Eric A. Brewer",
  title =        "Delivering high availability for {Inktomi} search
                 engines",
  crossref =     "Haas:1998:PAS",
  pages =        "538--538",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p538-brewer/p538-brewer.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p538-brewer/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kennamer:1998:MCH,
  author =       "Sherri Kennamer",
  title =        "{Microsoft.com}: a high-scale data management and
                 transaction processing solution",
  crossref =     "Haas:1998:PAS",
  pages =        "539--540",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p539-kennamer/p539-kennamer.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p539-kennamer/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Li:1998:FPD,
  author =       "Bin Li and Dennis Shasha",
  title =        "Free parallel data mining",
  crossref =     "Haas:1998:PAS",
  pages =        "541--543",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p541-li/p541-li.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p541-li/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Mecca:1998:AWB,
  author =       "G. Mecca and P. Atzeni and A. Masci and G. Sindoni and
                 P. Merialdo",
  title =        "The {Araneus} {Web}-based management system",
  crossref =     "Haas:1998:PAS",
  pages =        "544--546",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p544-mecca/p544-mecca.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p544-mecca/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Liu:1998:CPU,
  author =       "Ling Liu and Calton Pu and Wei Tang and David Buttler
                 and John Biggs and Tong Zhou and Paul Benninghoff and
                 Wei Han and Fenghua Yu",
  title =        "{CQ}: a personalized update monitoring toolkit",
  crossref =     "Haas:1998:PAS",
  pages =        "547--549",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p547-liu/p547-liu.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p547-liu/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Olston:1998:D,
  author =       "Chris Olston and Allison Woodruff and Alexander Aiken
                 and Michael Chu and Vuk Ercegovac and Mark Lin and
                 Mybrid Spalding and Michael Stonebraker",
  title =        "{DataSplash}",
  crossref =     "Haas:1998:PAS",
  pages =        "550--552",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p550-olston/p550-olston.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p550-olston/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chaudhuri:1998:MIT,
  author =       "Surajit Chaudhuri and Vivek Narasayya",
  title =        "{Microsoft} index turning wizard for {SQL Server
                 7.0}",
  crossref =     "Haas:1998:PAS",
  pages =        "553--554",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p553-chaudhuri/p553-chaudhuri.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p553-chaudhuri/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kiepuszewski:1998:FPB,
  author =       "Bartek Kiepuszewski and Ralf Muhlberger and Maria E.
                 Orlowska",
  title =        "{FlowBack}: providing backward recovery for workflow
                 management systems",
  crossref =     "Haas:1998:PAS",
  pages =        "555--557",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p555-kiepuszewski/p555-kiepuszewski.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p555-kiepuszewski/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cohen:1998:PDL,
  author =       "William W. Cohen",
  title =        "Providing database-like access to the {Web} using
                 queries based on textual similarity",
  crossref =     "Haas:1998:PAS",
  pages =        "558--560",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p558-cohen/p558-cohen.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p558-cohen/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ambite:1998:ASC,
  author =       "Jos{\'e} Luis Ambite and Naveen Ashish and Greg Barish
                 and Craig A. Knoblock and Steven Minton and Pragnesh J.
                 Modi and Ion Muslea and Andrew Philpot and Sheila
                 Tejada",
  title =        "Ariadne: a system for constructing mediators for
                 {Internet} sources",
  crossref =     "Haas:1998:PAS",
  pages =        "561--563",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p561-ambite/p561-ambite.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p561-ambite/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Li:1998:CBM,
  author =       "Chen Li and Ramana Yerneni and Vasilis Vassalos and
                 Hector Garcia-Molina and Yannis Papakonstantinou and
                 Jeffrey Ullman and Murty Valiveti",
  title =        "Capability based mediation in {TSIMMIS}",
  crossref =     "Haas:1998:PAS",
  pages =        "564--566",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p564-li/p564-li.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p564-li/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Avnur:1998:CCO,
  author =       "Ron Avnur and Joseph M. Hellerstein and Bruce Lo and
                 Chris Olston and Bhaskaran Raman and Vijayshankar Raman
                 and Tali Roth and Kirk Wylie",
  title =        "{CONTROL}: continuous output and navigation technology
                 with refinement on-line",
  crossref =     "Haas:1998:PAS",
  pages =        "567--569",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p567-avnur/p567-avnur.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p567-avnur/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kornacker:1998:AAM,
  author =       "Marcel Kornacker and Mehul Shah and Joseph M.
                 Hellerstein",
  title =        "{AMDB}: an access method debugging tool",
  crossref =     "Haas:1998:PAS",
  pages =        "570--571",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p570-kornacker/p570-kornacker.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p570-kornacker/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Lacroix:1998:UOS,
  author =       "Zo{\'e} Lacroix and Arnaud Sahuguet and Raman
                 Chandrasekar",
  title =        "User-oriented smart-cache for the {Web}: what you seek
                 is what you get!",
  crossref =     "Haas:1998:PAS",
  pages =        "572--574",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p572-lacroix/p572-lacroix.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p572-lacroix/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Baumann:1998:MDS,
  author =       "P. Baumann and A. Dehmel and P. Furtado and R. Ritsch
                 and N. Widmann",
  title =        "The multidimensional database system {RasDaMan}",
  crossref =     "Haas:1998:PAS",
  pages =        "575--577",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p575-baumann/p575-baumann.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p575-baumann/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Park:1998:XEM,
  author =       "Jang Ho Park and Yong Sik Kwon and Ki Hong Kim and
                 Sang Ho Lee and Byoung Dae Park and Sang Kyun Cha",
  title =        "Xmas: an extensible main-memory storage system for
                 high-performance applications",
  crossref =     "Haas:1998:PAS",
  pages =        "578--580",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p578-park/p578-park.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p578-park/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Zaiane:1998:MSP,
  author =       "Osmar R. Za{\"\i}ane and Jiawei Han and Ze-Nian Li and
                 Sonny H. Chee and Jenny Y. Chiang",
  title =        "{MultiMediaMiner}: a system prototype for multimedia
                 data mining",
  crossref =     "Haas:1998:PAS",
  pages =        "581--583",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p581-zaiane/p581-zaiane.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p581-zaiane/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Toyama:1998:SES,
  author =       "Motomichi Toyama",
  title =        "{SuperSQL}: an extended {SQL} for database publishing
                 and presentation",
  crossref =     "Haas:1998:PAS",
  pages =        "584--586",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p584-toyama/p584-toyama.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p584-toyama/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ceri:1998:IWL,
  author =       "Stefano Ceri and Piero Fraternali and Stefano
                 Paraboschi",
  title =        "The {IDEA Web} lab",
  crossref =     "Haas:1998:PAS",
  pages =        "587--589",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p587-ceri/p587-ceri.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p587-ceri/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Dar:1998:DDD,
  author =       "Shaul Dar and Gadi Entin and Shai Geva and Eran
                 Palmon",
  title =        "{DTL}'s {DataSpot}: database exploration as easy as
                 browsing the {Web} \ldots{}",
  crossref =     "Haas:1998:PAS",
  pages =        "590--592",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p590-dar/p590-dar.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p590-dar/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chen:1998:PPQ,
  author =       "Jing Chen and Limsoon Wong and Louxin Zhang",
  title =        "A protein patent query system powered by {Kleisli}",
  crossref =     "Haas:1998:PAS",
  pages =        "593--595",
  year =         "1998",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/276304/p593-chen/p593-chen.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/276304/p593-chen/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Abiteboul:1999:VX,
  author =       "Serge Abiteboul",
  title =        "On Views and {XML}",
  crossref =     "ACM:1999:PEA",
  pages =        "1--9",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib; OCLC
                 Proceedings database",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/303976/p1-abiteboul/p1-abiteboul.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/303976/p1-abiteboul/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Mamoulis:1999:ISJ,
  author =       "Nikos Mamoulis and Dimitris Papadias",
  title =        "Integration of spatial join algorithms for processing
                 multiple inputs",
  crossref =     "Delis:1999:PAS",
  pages =        "1--12",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p1-mamoulis/p1-mamoulis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p1-mamoulis/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Alon:1999:TJS,
  author =       "Noga Alon and Phillip B. Gibbons and Yossi Matias and
                 Mario Szegedy",
  title =        "Tracking Join and Self-Join Sizes in Limited Storage",
  crossref =     "ACM:1999:PEA",
  pages =        "10--20",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib; OCLC
                 Proceedings database",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/303976/p10-alon/p10-alon.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/303976/p10-alon/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Acharya:1999:SES,
  author =       "Swarup Acharya and Viswanath Poosala and Sridhar
                 Ramaswamy",
  title =        "Selectivity estimation in spatial databases",
  crossref =     "Delis:1999:PAS",
  pages =        "13--24",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p13-acharya/p13-acharya.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p13-acharya/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gottlob:1999:HDT,
  author =       "Georg Gottlob and Nicola Leone and Francesco
                 Scarcello",
  title =        "Hypertree Decompositions and Tractable Queries",
  crossref =     "ACM:1999:PEA",
  pages =        "21--32",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib; OCLC
                 Proceedings database",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/303976/p21-gottlob/p21-gottlob.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/303976/p21-gottlob/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chakrabarti:1999:ECC,
  author =       "Kaushik Chakrabarti and Sharad Mehrotra",
  title =        "Efficient concurrency control in multidimensional
                 access methods",
  crossref =     "Delis:1999:PAS",
  pages =        "25--36",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p25-chakrabarti/p25-chakrabarti.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p25-chakrabarti/",
  acknowledgement = ack-nhfb,
}

@InProceedings{More:1999:EST,
  author =       "Sachin More and S. Muthukrishnan and Elizabeth
                 Shriver",
  title =        "Efficiently sequencing tape-resident jobs",
  crossref =     "ACM:1999:PEA",
  pages =        "33--43",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib; OCLC
                 Proceedings database",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/303976/p33-more/p33-more.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/303976/p33-more/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Jagadish:1999:SSO,
  author =       "H. V. Jagadish and Laks V. S. Lakshmanan and Divesh
                 Srivastava",
  title =        "Snakes and sandwiches: optimal clustering strategies
                 for a data warehouse",
  crossref =     "Delis:1999:PAS",
  pages =        "37--48",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p37-jagadish/p37-jagadish.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p37-jagadish/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Papadias:1999:POM,
  author =       "Dimitris Papadias and Nikos Mamoulis and Yannis
                 Theodoridis",
  title =        "Processing and Optimization of Multiway Spatial Joins
                 Using {R}-trees",
  crossref =     "ACM:1999:PEA",
  pages =        "44--55",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib; OCLC
                 Proceedings database",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/303976/p44-papadias/p44-papadias.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/303976/p44-papadias/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ankerst:1999:OOP,
  author =       "Mihael Ankerst and Markus M. Breunig and Hans-Peter
                 Kriegel and J{\"o}rg Sander",
  title =        "{OPTICS}: ordering points to identify the clustering
                 structure",
  crossref =     "Delis:1999:PAS",
  pages =        "49--60",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p49-ankerst/p49-ankerst.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p49-ankerst/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Buneman:1999:IBP,
  author =       "Peter Buneman and Wenfie Fan and Scott Weinstein",
  title =        "Interaction between Path and Type Constraints",
  crossref =     "ACM:1999:PEA",
  pages =        "56--67",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib; OCLC
                 Proceedings database",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/303976/p56-buneman/p56-buneman.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/303976/p56-buneman/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Aggarwal:1999:FAP,
  author =       "Charu C. Aggarwal and Joel L. Wolf and Philip S. Yu
                 and Cecilia Procopiuc and Jong Soo Park",
  title =        "Fast algorithms for projected clustering",
  crossref =     "Delis:1999:PAS",
  pages =        "61--72",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p61-aggarwal/p61-aggarwal.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p61-aggarwal/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Arenas:1999:CQA,
  author =       "Marcelo Arenas and Leopoldo Bertossi and Jan
                 Chomicki",
  title =        "Consistent Query Answers in Inconsistent Databases",
  crossref =     "ACM:1999:PEA",
  pages =        "68--79",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib; OCLC
                 Proceedings database",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/303976/p68-arenas/p68-arenas.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/303976/p68-arenas/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Lomet:1999:LLE,
  author =       "David Lomet and Mark Tuttle",
  title =        "Logical logging to extend recovery to new domains",
  crossref =     "Delis:1999:PAS",
  pages =        "73--84",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p73-lomet/p73-lomet.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p73-lomet/",
  acknowledgement = ack-nhfb,
}

@InProceedings{VandenBussche:1999:TIP,
  author =       "Jan {Van den Bussche} and Emmanuel Waller",
  title =        "Type inference in the polymorphic relational algebra",
  crossref =     "ACM:1999:PEA",
  pages =        "80--90",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/303976/p80-van_den_bussche/p80-van_den_bussche.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/303976/p80-van_den_bussche/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Shanmugasundaram:1999:ECC,
  author =       "Jayavel Shanmugasundaram and Arvind Nithrakashyap and
                 Rajendran Sivasankaran and Krithi Ramamritham",
  title =        "Efficient concurrency control for broadcast
                 environments",
  crossref =     "Delis:1999:PAS",
  pages =        "85--96",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p85-shanmugasundaram/p85-shanmugasundaram.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p85-shanmugasundaram/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hara:1999:RAN,
  author =       "Carmem S. Hara and Susan B. Davidson",
  title =        "Reasoning about Nested Functional Dependencies",
  crossref =     "ACM:1999:PEA",
  pages =        "91--100",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib; OCLC
                 Proceedings database",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/303976/p91-hara/p91-hara.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/303976/p91-hara/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Breitbart:1999:UPP,
  author =       "Yuri Breitbart and Raghavan Komondoor and Rajeev
                 Rastogi and S. Seshadri and Avi Silberschatz",
  title =        "Update propagation protocols for replicated
                 databases",
  crossref =     "Delis:1999:PAS",
  pages =        "97--108",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p97-breitbart/p97-breitbart.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p97-breitbart/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Tygar:1999:OPE,
  author =       "J. D. Tygar",
  title =        "Open Problems in Electronic Commerce",
  crossref =     "ACM:1999:PEA",
  pages =        "101--101",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib; OCLC
                 Proceedings database",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/303976/p101-tygar/p101-tygar.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/303976/p101-tygar/",
  acknowledgement = ack-nhfb,
  xxauthor =     "D. Tygar",
}

@InProceedings{Benedikt:1999:EAA,
  author =       "Michael Benedikt and Leonid Libkin",
  title =        "Exact and Approximate Aggregation in Constraint Query
                 Languages",
  crossref =     "ACM:1999:PEA",
  pages =        "102--113",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib; OCLC
                 Proceedings database",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/303976/p102-benedikt/p102-benedikt.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/303976/p102-benedikt/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Jamil:1999:BRM,
  author =       "Hasan M. Jamil",
  title =        "Belief reasoning in {MLS} deductive databases",
  crossref =     "Delis:1999:PAS",
  pages =        "109--120",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p109-jamil/p109-jamil.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p109-jamil/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Dawson:1999:MDU,
  author =       "Steven Dawson and Sabrina {De Capitani di Vimercati}
                 and Patrick Lincoln and Pierangela Samarati",
  title =        "Minimal Data Upgrading to Prevent Inference and
                 Association Attacks",
  crossref =     "ACM:1999:PEA",
  pages =        "114--125",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib; OCLC
                 Proceedings database",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/303976/p114-dawson/p114-dawson.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/303976/p114-dawson/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Adali:1999:MPA,
  author =       "S. Adali and M. L. Sapino and V. S. Subrahmanian",
  title =        "A multimedia presentation algebra",
  crossref =     "Delis:1999:PAS",
  pages =        "121--132",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p121-adali/p121-adali.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p121-adali/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ganti:1999:FMC,
  author =       "Venkatesh Ganti and Johannes Gehrke and Raghu
                 Ramakrishnan",
  title =        "A Framework for Measuring Changes in Data
                 Characteristics",
  crossref =     "ACM:1999:PEA",
  pages =        "126--137",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib; OCLC
                 Proceedings database",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/303976/p126-ganti/p126-ganti.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/303976/p126-ganti/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Jagadish:1999:QND,
  author =       "H. V. Jagadish and Laks V. S. Lakshmanan and Tova Milo
                 and Divesh Srivastava and Dimitra Vista",
  title =        "Querying network directories",
  crossref =     "Delis:1999:PAS",
  pages =        "133--144",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p133-jagadish/p133-jagadish.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p133-jagadish/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chu:1999:LEC,
  author =       "Francis Chu and Joseph Y. Halpern and Praveen
                 Seshadri",
  title =        "Least Expected Cost Query Optimization: An Exercise in
                 Utility",
  crossref =     "ACM:1999:PEA",
  pages =        "138--147",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib; OCLC
                 Proceedings database",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/303976/p138-chu/p138-chu.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/303976/p138-chu/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hidber:1999:OAR,
  author =       "Christian Hidber",
  title =        "Online association rule mining",
  crossref =     "Delis:1999:PAS",
  pages =        "145--156",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p145-hidber/p145-hidber.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p145-hidber/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cosmadakis:1999:ICR,
  author =       "Stavros Cosmadakis",
  title =        "Inherent Complexity of Recursive Queries",
  crossref =     "ACM:1999:PEA",
  pages =        "148--154",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib; OCLC
                 Proceedings database",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/303976/p148-cosmadakis/p148-cosmadakis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/303976/p148-cosmadakis/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cohen:1999:RAQ,
  author =       "Sara Cohen and Werner Nutt and Alexander Serebrenik",
  title =        "Rewriting Aggregate Queries Using Views",
  crossref =     "ACM:1999:PEA",
  pages =        "155--166",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib; OCLC
                 Proceedings database",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/303976/p155-cohen/p155-cohen.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/303976/p155-cohen/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Lakshmanan:1999:OCF,
  author =       "Laks V. S. Lakshmanan and Raymond Ng and Jiawei Han
                 and Alex Pang",
  title =        "Optimization of constrained frequent set queries with
                 $2$-variable constraints",
  crossref =     "Delis:1999:PAS",
  pages =        "157--168",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p157-lakshmanan/p157-lakshmanan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p157-lakshmanan/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Karloff:1999:CVS,
  author =       "Howard Karloff and Milena Mihail",
  title =        "On the Complexity of the View-Selection Problem",
  crossref =     "ACM:1999:PEA",
  pages =        "167--173",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib; OCLC
                 Proceedings database",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/303976/p167-karloff/p167-karloff.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/303976/p167-karloff/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gehrke:1999:BOD,
  author =       "Johannes Gehrke and Venkatesh Ganti and Raghu
                 Ramakrishnan and Wei-Yin Loh",
  title =        "{BOAT} --- optimistic decision tree construction",
  crossref =     "Delis:1999:PAS",
  pages =        "169--180",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p169-gehrke/p169-gehrke.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p169-gehrke/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Grumbach:1999:QAD,
  author =       "St{\'e}phane Grumbach and Maurizio Rafanelli and
                 Leonardo Tininini",
  title =        "Querying Aggregate Data",
  crossref =     "ACM:1999:PEA",
  pages =        "174--184",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib; OCLC
                 Proceedings database",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/303976/p174-grumbach/p174-grumbach.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/303976/p174-grumbach/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Aboulnaga:1999:STH,
  author =       "Ashraf Aboulnaga and Surajit Chaudhuri",
  title =        "Self-tuning histograms: building histograms without
                 looking at data",
  crossref =     "Delis:1999:PAS",
  pages =        "181--192",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p181-aboulnaga/p181-aboulnaga.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p181-aboulnaga/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kleinberg:1999:ALA,
  author =       "Jon Kleinberg and Andrew Tomkins",
  title =        "Applications of linear algebra in information
                 retrieval and hypertext analysis",
  crossref =     "ACM:1999:PEA",
  pages =        "185--193",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib; OCLC
                 Proceedings database",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/303976/p185-kleinberg/p185-kleinberg.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/303976/p185-kleinberg/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Vitter:1999:ACM,
  author =       "Jeffrey Scott Vitter and Min Wang",
  title =        "Approximate computation of multidimensional aggregates
                 of sparse data using wavelets",
  crossref =     "Delis:1999:PAS",
  pages =        "193--204",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p193-vitter/p193-vitter.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p193-vitter/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Calvanese:1999:RRE,
  author =       "Diego Calvanese and Giuseppe {De Giacomo} and Maurizio
                 Lenzerini and Moshe Y. Vardi",
  title =        "Rewriting of Regular Expressions and Regular Path
                 Queries",
  crossref =     "ACM:1999:PEA",
  pages =        "194--204",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib; OCLC
                 Proceedings database",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/303976/p194-calvanese/p194-calvanese.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/303976/p194-calvanese/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Lee:1999:MDS,
  author =       "Ju-Hong Lee and Deok-Hwan Kim and Chin-Wan Chung",
  title =        "Multi-dimensional selectivity estimation using
                 compressed histogram information",
  crossref =     "Delis:1999:PAS",
  pages =        "205--214",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p205-lee/p205-lee.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p205-lee/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Neven:1999:QA,
  author =       "Frank Neven and Thomas Schwentick",
  title =        "Query Automata",
  crossref =     "ACM:1999:PEA",
  pages =        "205--214",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib; OCLC
                 Proceedings database",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/303976/p205-neven/p205-neven.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/303976/p205-neven/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chan:1999:EBE,
  author =       "Chee-Yong Chan and Yannis E. Ioannidis",
  title =        "An efficient bitmap encoding scheme for selection
                 queries",
  crossref =     "Delis:1999:PAS",
  pages =        "215--226",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p215-chan/p215-chan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p215-chan/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Milo:1999:TIQ,
  author =       "Tova Milo and Dan Suciu",
  title =        "Type Inference for Queries on Semistructured Data",
  crossref =     "ACM:1999:PEA",
  pages =        "215--226",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib; OCLC
                 Proceedings database",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/303976/p215-milo/p215-milo.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/303976/p215-milo/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kanza:1999:QIA,
  author =       "Yaron Kanza and Werner Nutt and Yehoshua Sagiv",
  title =        "Queries with Incomplete Answers over Semistructured
                 Data",
  crossref =     "ACM:1999:PEA",
  pages =        "227--236",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib; OCLC
                 Proceedings database",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/303976/p227-kanza/p227-kanza.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/303976/p227-kanza/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Wu:1999:QOS,
  author =       "Ming-Chuan Wu",
  title =        "Query optimization for selections using bitmaps",
  crossref =     "Delis:1999:PAS",
  pages =        "227--238",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p227-wu/p227-wu.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p227-wu/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chu:1999:FTS,
  author =       "Kelvin Kam Wing Chu and Man Hon Wong",
  title =        "Fast Time-Series Searching with Scaling and Shifting",
  crossref =     "ACM:1999:PEA",
  pages =        "237--248",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib; OCLC
                 Proceedings database",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/303976/p237-chu/p237-chu.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/303976/p237-chu/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Blohsfeld:1999:CSE,
  author =       "Bj{\"o}rn Blohsfeld and Dieter Korus and Bernhard
                 Seeger",
  title =        "A comparison of selectivity estimators for range
                 queries on metric attributes",
  crossref =     "Delis:1999:PAS",
  pages =        "239--250",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p239-blohsfeld/p239-blohsfeld.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p239-blohsfeld/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Jagadish:1999:SSE,
  author =       "H. V. Jagadish and Raymond T. Ng and Divesh
                 Srivastava",
  title =        "Substring Selectivity Estimation",
  crossref =     "ACM:1999:PEA",
  pages =        "249--260",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib; OCLC
                 Proceedings database",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/303976/p249-jagadish/p249-jagadish.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/303976/p249-jagadish/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Manku:1999:RST,
  author =       "Gurmeet Singh Manku and Sridhar Rajagopalan and Bruce
                 G. Lindsay",
  title =        "Random sampling techniques for space efficient online
                 computation of order statistics of large datasets",
  crossref =     "Delis:1999:PAS",
  pages =        "251--262",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p251-manku/p251-manku.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p251-manku/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kollios:1999:IMO,
  author =       "George Kollios and Dimitrios Gunopulos and Vassilis J.
                 Tsotras",
  title =        "On Indexing Mobile Objects",
  crossref =     "ACM:1999:PEA",
  pages =        "261--272",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib; OCLC
                 Proceedings database",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/303976/p261-kollios/p261-kollios.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/303976/p261-kollios/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chaudhuri:1999:RSJ,
  author =       "Surajit Chaudhuri and Rajeev Motwani and Vivek
                 Narasayya",
  title =        "On randsom sampling over joins",
  crossref =     "Delis:1999:PAS",
  pages =        "263--274",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p263-chaudhuri/p263-chaudhuri.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p263-chaudhuri/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cluet:1999:ULD,
  author =       "Sophie Cluet and Olga Kapitskaia and Divesh
                 Srivastava",
  title =        "Using {LDAP} Directory Caches",
  crossref =     "ACM:1999:PEA",
  pages =        "273--284",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib; OCLC
                 Proceedings database",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/303976/p273-cluet/p273-cluet.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/303976/p273-cluet/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Acharya:1999:JSA,
  author =       "Swarup Acharya and Phillip B. Gibbons and Viswanath
                 Poosala and Sridhar Ramaswamy",
  title =        "Join synopses for approximate query answering",
  crossref =     "Delis:1999:PAS",
  pages =        "275--286",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p275-acharya/p275-acharya.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p275-acharya/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Alonso:1999:CGC,
  author =       "Gustavo Alonso and Armin Fe{\ss}ler and Guy Pardon and
                 Hans-J{\"o}rg Schek",
  title =        "Correctness in General Configurations of Transactional
                 Components",
  crossref =     "ACM:1999:PEA",
  pages =        "285--293",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib; OCLC
                 Proceedings database",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/303976/p285-alonso/p285-alonso.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/303976/p285-alonso/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Haas:1999:RJO,
  author =       "Peter J. Haas and Joseph M. Hellerstein",
  title =        "Ripple joins for online aggregation",
  crossref =     "Delis:1999:PAS",
  pages =        "287--298",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p287-haas/p287-haas.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p287-haas/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bonner:1999:WTD,
  author =       "Anthony J. Bonner",
  title =        "Workflow, Transactions, and Datalog",
  crossref =     "ACM:1999:PEA",
  pages =        "294--305",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib; OCLC
                 Proceedings database",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/303976/p294-bonner/p294-bonner.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/303976/p294-bonner/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ives:1999:AQE,
  author =       "Zachary G. Ives and Daniela Florescu and Marc Friedman
                 and Alon Levy and Daniel S. Weld",
  title =        "An adaptive query execution system for data
                 integration",
  crossref =     "Delis:1999:PAS",
  pages =        "299--310",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p299-ives/p299-ives.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p299-ives/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Al-Houmaily:1999:AIP,
  author =       "Yousef J. Al-Houmaily and Panos K. Chrysanthis",
  title =        "Atomicity with Incompatible Presumptions",
  crossref =     "ACM:1999:PEA",
  pages =        "306--315",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib; OCLC
                 Proceedings database",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/303976/p306-al-houmaily/p306-al-houmaily.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/303976/p306-al-houmaily/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Florescu:1999:QOP,
  author =       "Daniela Florescu and Alon Levy and Ioana Manolescu and
                 Dan Suciu",
  title =        "Query optimization in the presence of limited access
                 patterns",
  crossref =     "Delis:1999:PAS",
  pages =        "311--322",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p311-florescu/p311-florescu.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p311-florescu/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Schuldt:1999:CCR,
  author =       "Heiko Schuldt and Gustavo Alonso and Hans-J{\"o}rg
                 Schek",
  title =        "Concurrency Control and Recovery in Transactional
                 Process Management",
  crossref =     "ACM:1999:PEA",
  pages =        "316--326",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib; OCLC
                 Proceedings database",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/303976/p316-schuldt/p316-schuldt.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/303976/p316-schuldt/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Marathe:1999:QPT,
  author =       "Arunprasad P. Marathe and Kenneth Salem",
  title =        "Query processing techniques for arrays",
  crossref =     "Delis:1999:PAS",
  pages =        "323--334",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p323-marathe/p323-marathe.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p323-marathe/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Boasson:1999:WAS,
  author =       "Luc Boasson and Patrick Cegielski and Ir{\`e}ne
                 Guessarian and Yuri Matiyasevich",
  title =        "Window-Accumulated Subsequence Matching Problem is
                 Linear",
  crossref =     "ACM:1999:PEA",
  pages =        "327--336",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib; OCLC
                 Proceedings database",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/303976/p327-boasson/p327-boasson.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/303976/p327-boasson/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chang:1999:MYV,
  author =       "Chen-Chuan K. Chang and H{\'e}ctor
                 Garc{\'\i}a-Molina",
  title =        "Mind your vocabulary: query mapping across
                 heterogeneous information sources",
  crossref =     "Delis:1999:PAS",
  pages =        "335--346",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p335-chang/p335-chang.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p335-chang/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Raman:1999:LPD,
  author =       "Vijayshankar Raman",
  title =        "Locality-preserving dictionaries: theory and
                 application to clustering in databases",
  crossref =     "ACM:1999:PEA",
  pages =        "337--345",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib; OCLC
                 Proceedings database",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/303976/p337-raman/p337-raman.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/303976/p337-raman/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Arge:1999:TDI,
  author =       "Lars Arge and Vasilis Samoladas and Jeffrey Scott
                 Vitter",
  title =        "On Two-Dimensional Indexability and Optimal Range
                 Search Indexing",
  crossref =     "ACM:1999:PEA",
  pages =        "346--357",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib; OCLC
                 Proceedings database",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/303976/p346-arge/p346-arge.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/303976/p346-arge/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Mayr:1999:CSQ,
  author =       "Tobias Mayr and Praveen Seshadri",
  title =        "Client-site query extensions",
  crossref =     "Delis:1999:PAS",
  pages =        "347--358",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p347-mayr/p347-mayr.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p347-mayr/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Malmi:1999:GUR,
  author =       "Lauri Malmi and Eljas Soisalon-Soininen",
  title =        "Group Updates for Relaxed Height-Balanced Trees",
  crossref =     "ACM:1999:PEA",
  pages =        "358--367",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib; OCLC
                 Proceedings database",
  URL =          "http://www.acm.org/pubs/articles/proceedings/pods/303976/p358-malmi/p358-malmi.pdf;
                 http://www.acm.org/pubs/citations/proceedings/pods/303976/p358-malmi/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Beyer:1999:BCS,
  author =       "Kevin Beyer and Raghu Ramakrishnan",
  title =        "Bottom-up computation of sparse and {Iceberg CUBE}",
  crossref =     "Delis:1999:PAS",
  pages =        "359--370",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p359-beyer/p359-beyer.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p359-beyer/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kotidis:1999:DDV,
  author =       "Yannis Kotidis and Nick Roussopoulos",
  title =        "{DynaMat}: a dynamic view management system for data
                 warehouses",
  crossref =     "Delis:1999:PAS",
  pages =        "371--382",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p371-kotidis/p371-kotidis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p371-kotidis/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Labio:1999:SWU,
  author =       "Wilburt Juan Labio and Ramana Yerneni and Hector
                 Garcia-Molina",
  title =        "Shrinking the warehouse update {Window}",
  crossref =     "Delis:1999:PAS",
  pages =        "383--394",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p383-labio/p383-labio.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p383-labio/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Natsev:1999:WSR,
  author =       "Apostol Natsev and Rajeev Rastogi and Kyuseok Shim",
  title =        "{WALRUS}: a similarity retrieval algorithm for image
                 databases",
  crossref =     "Delis:1999:PAS",
  pages =        "395--406",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p395-natsev/p395-natsev.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p395-natsev/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Aggarwal:1999:NMS,
  author =       "Charu C. Aggarwal and Joel L. Wolf and Philip S. Yu",
  title =        "A new method for similarity indexing of market basket
                 data",
  crossref =     "Delis:1999:PAS",
  pages =        "407--418",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p407-aggarwal/p407-aggarwal.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p407-aggarwal/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Keim:1999:EGB,
  author =       "Daniel A. Keim",
  title =        "Efficient geometry-based similarity search of {$3$D}
                 spatial databases",
  crossref =     "Delis:1999:PAS",
  pages =        "419--430",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p419-keim/p419-keim.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p419-keim/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Deutsch:1999:SSD,
  author =       "Alin Deutsch and Mary Fernandez and Dan Suciu",
  title =        "Storing semistructured data with {STORED}",
  crossref =     "Delis:1999:PAS",
  pages =        "431--442",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p431-deutsch/p431-deutsch.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p431-deutsch/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Yerneni:1999:CCM,
  author =       "Ramana Yerneni and Chen Li and Hector Garcia-Molina
                 and Jeffrey Ullman",
  title =        "Computing capabilities of mediators",
  crossref =     "Delis:1999:PAS",
  pages =        "443--454",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p443-yerneni/p443-yerneni.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p443-yerneni/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Papakonstantinou:1999:QRS,
  author =       "Yannis Papakonstantinou and Vasilis Vassalos",
  title =        "Query rewriting for semistructured data",
  crossref =     "Delis:1999:PAS",
  pages =        "455--466",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p455-papakonstantinou/p455-papakonstantinou.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p455-papakonstantinou/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Embley:1999:RBD,
  author =       "D. W. Embley and Y. Jiang and Y.-K. Ng",
  title =        "Record-boundary discovery in {Web} documents",
  crossref =     "Delis:1999:PAS",
  pages =        "467--478",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p467-embley/p467-embley.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p467-embley/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Callan:1999:ADL,
  author =       "Jamie Callan and Margaret Connell and Aiqun Du",
  title =        "Automatic discovery of language models for text
                 databases",
  crossref =     "Delis:1999:PAS",
  pages =        "479--490",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p479-callan/p479-callan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p479-callan/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Davulcu:1999:LAQ,
  author =       "Hasan Davulcu and Juliana Freire and Michael Kifer and
                 I. V. Ramakrishnan",
  title =        "A layered architecture for querying dynamic {Web}
                 content",
  crossref =     "Delis:1999:PAS",
  pages =        "491--502",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p491-davulcu/p491-davulcu.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p491-davulcu/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Seshadri:1999:HSD,
  author =       "Praveen Seshadri",
  title =        "{``Honey, I shrunk the database''}: footprint,
                 mobility, and beyond",
  crossref =     "Delis:1999:PAS",
  pages =        "503--503",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p503-seshadri/p503-seshadri.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p503-seshadri/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Garofalakis:1999:CPM,
  author =       "Minos N. Garofalakis and Sridhar Ramaswamy and Rajeev
                 Rastogi and Kyuseok Shim",
  title =        "Of crawlers, portals, mice, and men: is there more to
                 mining the {Web?}",
  crossref =     "Delis:1999:PAS",
  pages =        "504--504",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p504-garofalakis/p504-garofalakis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p504-garofalakis/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ozsu:1999:DMI,
  author =       "M. Tamer {\"O}zsu",
  title =        "Data management issues in electronic commerce",
  crossref =     "Delis:1999:PAS",
  pages =        "505--505",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p505-ozsu/p505-ozsu.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p505-ozsu/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Dullmann:1999:PD,
  author =       "Dirk D{\"u}llmann",
  title =        "Petabyte databases",
  crossref =     "Delis:1999:PAS",
  pages =        "506--506",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p506-dullmann/p506-dullmann.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p506-dullmann/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Mohan:1999:DPL,
  author =       "C. Mohan",
  title =        "A database perspective on {Lotus Domino\slash Notes}",
  crossref =     "Delis:1999:PAS",
  pages =        "507--507",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p507-mohan/p507-mohan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p507-mohan/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chakrabarti:1999:HDD,
  author =       "Soumen Chakrabarti",
  title =        "Hypertext databases and data mining",
  crossref =     "Delis:1999:PAS",
  pages =        "508--508",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p508-chakrabarti/p508-chakrabarti.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p508-chakrabarti/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hinneburg:1999:CML,
  author =       "Alexander Hinneburg and Daniel A. Keim",
  title =        "Clustering methods for large databases: from the past
                 to the future",
  crossref =     "Delis:1999:PAS",
  pages =        "509--509",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p509-hinneburg/p509-hinneburg.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p509-hinneburg/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Suciu:1999:MWD,
  author =       "Dan Suciu",
  title =        "Managing {Web} data",
  crossref =     "Delis:1999:PAS",
  pages =        "510--510",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p510-suciu/p510-suciu.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p510-suciu/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Carey:1999:WHD,
  author =       "M. Carey and D. Chamberlin and D. Doole and S. Rielau
                 and N. Mattos and S. Narayanan and B. Vance and R.
                 Swagerman",
  title =        "{O-O}, what's happening to {DB2?}",
  crossref =     "Delis:1999:PAS",
  pages =        "511--512",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p511-carey/p511-carey.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p511-carey/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Krishnamurthy:1999:BOR,
  author =       "Vishu Krishnamurthy and Sandeepan Banerjee and Anil
                 Nori",
  title =        "Bringing object-relational technology to the
                 mainstream",
  crossref =     "Delis:1999:PAS",
  pages =        "513--514",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p513-krishnamurthy/p513-krishnamurthy.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p513-krishnamurthy/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Brown:1999:ISS,
  author =       "Paul Brown",
  title =        "Implementing the spirit of {SQL-99}",
  crossref =     "Delis:1999:PAS",
  pages =        "515--518",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p515-brown/p515-brown.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p515-brown/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Baulier:1999:DSM,
  author =       "J. Baulier and P. Bohannon and S. Gogate and C. Gupta
                 and S. Haldar",
  title =        "{DataBlitz} storage manager: main-memory database
                 performance for critical applications",
  crossref =     "Delis:1999:PAS",
  pages =        "519--520",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p519-baulier/p519-baulier.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p519-baulier/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kanth:1999:IMD,
  author =       "K. V. Ravi Kanth and Siva Ravada and Jayant Sharma and
                 Jay Banerjee",
  title =        "Indexing medium-dimensionality data in {Oracle}",
  crossref =     "Delis:1999:PAS",
  pages =        "521--522",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p521-ravi_kanth/p521-ravi_kanth.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p521-ravi_kanth/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kohler:1999:EIS,
  author =       "Walt Kohler",
  title =        "{EMC} information sharing: direct access to {MVS} data
                 from {UNIX} and {NT}",
  crossref =     "Delis:1999:PAS",
  pages =        "523--524",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p523-kohler/p523-kohler.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p523-kohler/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Greer:1999:DFG,
  author =       "Rick Greer",
  title =        "{Daytona} and the foruth-generation language cymbal",
  crossref =     "Delis:1999:PAS",
  pages =        "525--526",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p525-greer/p525-greer.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p525-greer/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hammond:1999:MRM,
  author =       "Brad Hammond",
  title =        "Merge replication in {Microsoft}'s {SQL} server 7.0",
  crossref =     "Delis:1999:PAS",
  pages =        "527--527",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p527-hammond/p527-hammond.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p527-hammond/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Team:1999:MDM,
  author =       "{TimesTen Team}",
  title =        "In-memory data management for consumer transactions:
                 the {TimesTen} approach",
  crossref =     "Delis:1999:PAS",
  pages =        "528--529",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p528-timesten_team/p528-timesten_team.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p528-timesten_team/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ojjeh:1999:MSS,
  author =       "Bassel Ojjeh",
  title =        "{Microsoft} site server (commerce ed.): {Talk-slides}
                 available at the conference",
  crossref =     "Delis:1999:PAS",
  pages =        "530--530",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p530-ojjeh/p530-ojjeh.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p530-ojjeh/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Rajaraman:1999:CDI,
  author =       "Anand Rajaraman",
  title =        "{E}-commerce database issues and experience:
                 (talk-slides available at the conference)",
  crossref =     "Delis:1999:PAS",
  pages =        "531--531",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p531-rajaraman/p531-rajaraman.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p531-rajaraman/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bergstraesser:1999:VWM,
  author =       "Thomas Bergstraesser and Philip A. Bernstein and
                 Shankar Pal and David Shutt",
  title =        "Versions and workspaces in {Microsoft} repository",
  crossref =     "Delis:1999:PAS",
  pages =        "532--533",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p532-bergstraesser/p532-bergstraesser.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p532-bergstraesser/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Do:1999:NDA,
  author =       "Lyman Do and Prabhu Ram and Pamela Drew",
  title =        "The need for distributed asynchronous transactions",
  crossref =     "Delis:1999:PAS",
  pages =        "534--535",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p534-do/p534-do.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p534-do/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Jarke:1999:IOD,
  author =       "Matthias Jarke and Christoph Quix and Guido Blees and
                 Dirk Lehmann and Gunter Michalk and Stefan Stierl",
  title =        "Improving {OLTP} data quality using data warehouse
                 mechanisms",
  crossref =     "Delis:1999:PAS",
  pages =        "536--537",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p536-jarke/p536-jarke.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p536-jarke/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Trisolini:1999:DIW,
  author =       "Stefano M. Trisolini and Maurizio Lenzerini and
                 Daniele Nardi",
  title =        "Data integration and warehousing in {Telecom Italia}",
  crossref =     "Delis:1999:PAS",
  pages =        "538--539",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p538-trisolini/p538-trisolini.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p538-trisolini/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Liu:1999:XBW,
  author =       "Ling Liu and Wei Han and David Buttler and Calton Pu
                 and Wei Tang",
  title =        "An {XJML-based} wrapper generator for {Web}
                 information extraction",
  crossref =     "Delis:1999:PAS",
  pages =        "540--543",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p540-liu/p540-liu.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p540-liu/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Altinel:1999:DTA,
  author =       "Mehmet Altinel and Demet Aksoy and Thomas Baby and
                 Michael Franklin and William Shapiro and Stan Zdonik",
  title =        "{DBIS}-toolkit: adaptable middleware for large scale
                 data delivery",
  crossref =     "Delis:1999:PAS",
  pages =        "544--546",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p544-altinel/p544-altinel.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p544-altinel/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Wolfson:1999:DDM,
  author =       "Ouri Wolfson and Prasad Sistla and Bo Xu and Jutai
                 Zhou and Sam Chamberlain",
  title =        "{DOMINO}: {Databases fOr MovINg Objects} tracking",
  crossref =     "Delis:1999:PAS",
  pages =        "547--549",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p547-wolfson/p547-wolfson.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p547-wolfson/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Braumandl:1999:DPI,
  author =       "Reinhard Braumandl and Alfons Kemper and Donald
                 Kossmann",
  title =        "Database patchwork on the {Internet}",
  crossref =     "Delis:1999:PAS",
  pages =        "550--552",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p550-braumandl/p550-braumandl.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p550-braumandl/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Rundensteiner:1999:EVE,
  author =       "E. A. Rundensteiner and A. Koeller and X. Zhang and A.
                 J. Lee and A. Nica and A. {Van Wyk} and Y. Lee",
  title =        "Evolvable view environment {(EVE)}: non-equivalent
                 view maintenance under schema changes",
  crossref =     "Delis:1999:PAS",
  pages =        "553--555",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p553-rundensteiner/p553-rundensteiner.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p553-rundensteiner/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ng:1999:EMC,
  author =       "Raymond Ng and Laks V. S. Lakshmanan and Jiawei Han
                 and Teresa Mah",
  title =        "Exploratory mining via constrained frequent set
                 queries",
  crossref =     "Delis:1999:PAS",
  pages =        "556--558",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p556-ng/p556-ng.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p556-ng/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Adelberg:1999:NV,
  author =       "Brad Adelberg and Matthew Denny",
  title =        "{Nodose} version 2.0",
  crossref =     "Delis:1999:PAS",
  pages =        "559--561",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p559-adelberg/p559-adelberg.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p559-adelberg/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Barga:1999:PMA,
  author =       "Roger Barga and David B. Lomet",
  title =        "Phoenix: making applications robust",
  crossref =     "Delis:1999:PAS",
  pages =        "562--564",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p562-barga/p562-barga.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p562-barga/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Li:1999:PSP,
  author =       "Wen-Syan Li and Quoc Vu and Edward Chang and Divyakant
                 Agrawal and Kyoji Hirata and Sougata Mukherjea and
                 Yi-Leh Wu and Corey Bufi and Chen-Chuan Kevin Chang and
                 Yoshinori Hara and Reiko Ito and Yutaka Kimura and
                 Kezuyuki Shimazu and Yukiyoshi Saito",
  title =        "{PowerBookmarks}: a system for personalizable {Web}
                 information organization, sharing, and management",
  crossref =     "Delis:1999:PAS",
  pages =        "565--567",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p565-li/p565-li.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p565-li/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Rundensteiner:1999:SOB,
  author =       "E. A. Rundensteiner and K. Claypool and M. Li and L.
                 Chen and Z. Zhang and C. Natarajan and J. Jin and S. De
                 Lima and S. Weiner",
  title =        "{SERF}: {ODMG-based} generic re-structuring facility",
  crossref =     "Delis:1999:PAS",
  pages =        "568--570",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p568-rundensteiner/p568-rundensteiner.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p568-rundensteiner/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Zhou:1999:TSD,
  author =       "Tong Zhou and Ling Liu and Calton Pu",
  title =        "{TAM}: a system for dynamic transactional activity
                 management",
  crossref =     "Delis:1999:PAS",
  pages =        "571--573",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p571-zhou/p571-zhou.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p571-zhou/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Acharya:1999:AAQ,
  author =       "Swarup Acharya and Phillip B. Gibbons and Viswanath
                 Poosala and Sridhar Ramaswamy",
  title =        "The {Aqua} approximate query answering system",
  crossref =     "Delis:1999:PAS",
  pages =        "574--576",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p574-acharya/p574-acharya.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p574-acharya/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Brodsky:1999:CCO,
  author =       "Alexander Brodsky and Victor E. Segal and Jia Chen and
                 Paval A. Exarkhopoulo",
  title =        "The {CCUBE} constraint object-oriented database
                 system",
  crossref =     "Delis:1999:PAS",
  pages =        "577--579",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p577-brodsky/p577-brodsky.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p577-brodsky/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bonnet:1999:CJP,
  author =       "Phillippe Bonnet and Kyle Buza and Zhiyuan Chan and
                 Victor Cheng and Randolph Chung and Takako Hickey and
                 Ryan Kennedy and Daniel Mahashin and Tobias Mayr and
                 Ivan Oprencak and Praveen Seshadri and Hubert Siu",
  title =        "The {Cornell Jaguar} project: adding mobility to
                 {PREDATOR}",
  crossref =     "Delis:1999:PAS",
  pages =        "580--581",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p580-bonnet/p580-bonnet.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p580-bonnet/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Roussopoulos:1999:AMC,
  author =       "Nick Roussopoulos and Yannis Kotidis and Yannis
                 Sismanis",
  title =        "The active {MultiSync} controller of the cubetree
                 storage organization",
  crossref =     "Delis:1999:PAS",
  pages =        "582--583",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p582-roussopoulos/p582-roussopoulos.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p582-roussopoulos/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bohlen:1999:JDS,
  author =       "Michael B{\"o}hlen and Linas Bukauskas and Curtis
                 Dyreson",
  title =        "The {Jungle} database search engine",
  crossref =     "Delis:1999:PAS",
  pages =        "584--586",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p584-bohlen/p584-bohlen.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p584-bohlen/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Vossen:1999:WOO,
  author =       "Gottfried Vossen and Mathias Weske",
  title =        "The {WASA2} object-oriented workflow management
                 system",
  crossref =     "Delis:1999:PAS",
  pages =        "587--589",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p587-vossen/p587-vossen.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p587-vossen/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cruz:1999:UCI,
  author =       "Isabel F. Cruz and Kimberly M. James",
  title =        "A user-centered interface for querying distributed
                 multimedia databases",
  crossref =     "Delis:1999:PAS",
  pages =        "590--592",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p590-cruz/p590-cruz.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p590-cruz/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bouguettaya:1999:WWD,
  author =       "Athman Bouguettaya and Boualem Benatallah and Lily
                 Hendra and James Beard and Kevin Smith and Mourad
                 Quzzani",
  title =        "{World Wide Database} --- integrating the {Web},
                 {CORBA} and databases",
  crossref =     "Delis:1999:PAS",
  pages =        "594--596",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p594-bouguettaya/p594-bouguettaya.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p594-bouguettaya/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Baru:1999:XBI,
  author =       "Chaitan Baru and Amarnath Gupta and Bertram
                 Lud{\"a}scher and Richard Marciano and Yannis
                 Papakonstantinou and Pavel Velikhov and Vincent Chu",
  title =        "{XML}-based information mediation with {MIX}",
  crossref =     "Delis:1999:PAS",
  pages =        "597--599",
  year =         "1999",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/304182/p597-baru/p597-baru.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/304182/p597-baru/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Han:2000:MFP,
  author =       "Jiawei Han and Jian Pei and Yiwen Yin",
  title =        "Mining frequent patterns without candidate
                 generation0",
  crossref =     "Chen:2000:PAS",
  pages =        "1--12",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p1-han/p1-han.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p1-han/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Riedel:2000:DMO,
  author =       "Erik Riedel and Christos Faloutsos and Gregory R.
                 Ganger and David F. Nagle",
  title =        "Data mining on an {OLTP} system (nearly) for free",
  crossref =     "Chen:2000:PAS",
  pages =        "13--21",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p13-riedel/p13-riedel.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p13-riedel/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Shenoy:2000:TCV,
  author =       "Pradeep Shenoy and Jayant R. Haritsa and S. Sundarshan
                 and Gaurav Bhalotia and Mayank Bawa and Devavrat Shah",
  title =        "Turbo-charging vertical mining of large databases",
  crossref =     "Chen:2000:PAS",
  pages =        "22--33",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p22-shenoy/p22-shenoy.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p22-shenoy/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Lomet:2000:HSL,
  author =       "David B. Lomet",
  title =        "High speed on-line backup when using logical log
                 operations",
  crossref =     "Chen:2000:PAS",
  pages =        "34--45",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p34-lomet/p34-lomet.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p34-lomet/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Labio:2000:ERI,
  author =       "Wilburt Juan Labio and Janet L. Wiener and Hector
                 Garcia-Molina and Vlad Gorelik",
  title =        "Efficient resumption of interrupted warehouse loads",
  crossref =     "Chen:2000:PAS",
  pages =        "46--57",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p46-labio/p46-labio.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p46-labio/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Lakhamraju:2000:LRO,
  author =       "Mohana K. Lakhamraju and Rajeev Rastogi and S.
                 Seshadri and S. Sudarshan",
  title =        "On-line reorganization in object databases",
  crossref =     "Chen:2000:PAS",
  pages =        "58--69",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p58-lakhamraju/p58-lakhamraju.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p58-lakhamraju/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Aggarwal:2000:FGP,
  author =       "Charu C. Aggarwal and Philip S. Yu",
  title =        "Finding generalized projected clusters in high
                 dimensional spaces",
  crossref =     "Chen:2000:PAS",
  pages =        "70--81",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p70-aggarwal/p70-aggarwal.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p70-aggarwal/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Palmer:2000:DBS,
  author =       "Christopher R. Palmer and Christos Faloutsos",
  title =        "Density biased sampling: an improved method for data
                 mining and clustering",
  crossref =     "Chen:2000:PAS",
  pages =        "82--92",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p82-palmer/p82-palmer.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p82-palmer/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Breunig:2000:LID,
  author =       "Markus M. Breunig and Hans-Peter Kriegel and Raymond
                 T. Ng and J{\"o}rg Sander",
  title =        "{LOF}: identifying density-based local outliers",
  crossref =     "Chen:2000:PAS",
  pages =        "93--104",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p93-breunig/p93-breunig.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p93-breunig/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Zaharioudakis:2000:ACS,
  author =       "Markos Zaharioudakis and Roberta Cochrane and George
                 Lapis and Hamid Pirahesh and Monica Urata",
  title =        "Answering complex {SQL} queries using automatic
                 summary tables",
  crossref =     "Chen:2000:PAS",
  pages =        "105--116",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p105-zaharioudakis/p105-zaharioudakis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p105-zaharioudakis/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cho:2000:SDI,
  author =       "Junghoo Cho and Hector Garcia-Molina",
  title =        "Synchronizing a database to improve freshness",
  crossref =     "Chen:2000:PAS",
  pages =        "117--128",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p117-cho/p117-cho.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p117-cho/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Salem:2000:HRJ,
  author =       "Kenneth Salem and Kevin Beyer and Bruce Lindsay and
                 Roberta Cochrane",
  title =        "How to roll a join: asynchronous incremental view
                 maintenance",
  crossref =     "Chen:2000:PAS",
  pages =        "129--140",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p129-salem/p129-salem.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p129-salem/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Christophides:2000:WQL,
  author =       "Vassilis Christophides and Sophie Cluet and
                 J{\'e}r{\^o}me Sim{\`e}on",
  title =        "On wrapping query languages and efficient {XML}
                 integration",
  crossref =     "Chen:2000:PAS",
  pages =        "141--152",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p141-christophides/p141-christophides.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p141-christophides/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Liefke:2000:XEC,
  author =       "Hartmut Liefke and Dan Suciu",
  title =        "{XMill}: an efficient compressor for {XML} data",
  crossref =     "Chen:2000:PAS",
  pages =        "153--164",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p153-liefke/p153-liefke.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p153-liefke/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Garofalakis:2000:XSE,
  author =       "Minos Garofalakis and Aristides Gionis and Rajeev
                 Rastogi and S. Seshadri and Kyuseok Shim",
  title =        "{XTRACT}: a system for extracting document type
                 descriptors from {XML} documents",
  crossref =     "Chen:2000:PAS",
  pages =        "165--176",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p165-garofalakis/p165-garofalakis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p165-garofalakis/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Faloutsos:2000:SJS,
  author =       "Christos Faloutsos and Bernhard Seeger and Agma Traina
                 and Caetano Traina",
  title =        "Spatial join selectivity using power laws",
  crossref =     "Chen:2000:PAS",
  pages =        "177--188",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p177-faloutsos/p177-faloutsos.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p177-faloutsos/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Corral:2000:CPQ,
  author =       "Antonio Corral and Yannis Manolopoulos and Yannis
                 Theodoridis and Michael Vassilakopoulos",
  title =        "Closest pair queries in spatial databases",
  crossref =     "Chen:2000:PAS",
  pages =        "189--200",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p189-corral/p189-corral.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p189-corral/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Korn:2000:ISB,
  author =       "Flip Korn and S. Muthukrishnan",
  title =        "Influence sets based on reverse nearest neighbor
                 queries",
  crossref =     "Chen:2000:PAS",
  pages =        "201--212",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p201-korn/p201-korn.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p201-korn/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Rodriguez-Martinez:2000:MSE,
  author =       "Manuel Rodr{\'\i}guez-Mart{\'\i}nez and Nick
                 Roussopoulos",
  title =        "{MOCHA}: a self-extensible database middleware system
                 for distributed data sources",
  crossref =     "Chen:2000:PAS",
  pages =        "213--224",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p213-rodriguez-martinez/p213-rodriguez-martinez.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p213-rodriguez-martinez/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Lee:2000:TST,
  author =       "Mong Li Lee and Masaru Kitsuregawa and Beng Chin Ooi
                 and Kian-Lee Tan and Anirban Mondal",
  title =        "Towards self-tuning data placement in parallel
                 database systems",
  crossref =     "Chen:2000:PAS",
  pages =        "225--236",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p225-lee/p225-lee.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p225-lee/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Litwin:2000:LHA,
  author =       "Witold Litwin and Thomas Schwarz",
  title =        "{LH}$^*_{RS}$: a high-availability scalable
                 distributed data structure using {Reed Solomon Codes}",
  crossref =     "Chen:2000:PAS",
  pages =        "237--248",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p237-litwin/p237-litwin.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p237-litwin/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Roy:2000:EEA,
  author =       "Prasan Roy and S. Seshadri and S. Sudarshan and
                 Siddhesh Bhobe",
  title =        "Efficient and extensible algorithms for multi query
                 optimization",
  crossref =     "Chen:2000:PAS",
  pages =        "249--260",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p249-roy/p249-roy.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p249-roy/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Avnur:2000:ECA,
  author =       "Ron Avnur and Joseph M. Hellerstein",
  title =        "Eddies: continuously adaptive query processing",
  crossref =     "Chen:2000:PAS",
  pages =        "261--272",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p261-avnur/p261-avnur.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p261-avnur/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Popa:2000:CTF,
  author =       "Lucian Popa and Alin Deutsch and Arnaud Sahuguet and
                 Val Tannen",
  title =        "A chase too far?",
  crossref =     "Chen:2000:PAS",
  pages =        "273--284",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p273-popa/p273-popa.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p273-popa/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Goldman:2000:WDP,
  author =       "Roy Goldman and Jennifer Widom",
  title =        "{WSQ\slash DSQ}: a practical approach for combined
                 querying of databases and the {Web}",
  crossref =     "Chen:2000:PAS",
  pages =        "285--296",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p285-goldman/p285-goldman.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p285-goldman/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Agrawal:2000:FEC,
  author =       "Rakesh Agrawal and Edward L. Wimmers",
  title =        "A framework for expressing and combining preferences",
  crossref =     "Chen:2000:PAS",
  pages =        "297--306",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p297-agrawal/p297-agrawal.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p297-agrawal/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Barclay:2000:MTS,
  author =       "Tom Barclay and Jim Gray and Don Slutz",
  title =        "{Microsoft TerraServer}: a spatial data warehouse",
  crossref =     "Chen:2000:PAS",
  pages =        "307--318",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p307-barclay/p307-barclay.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p307-barclay/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Forlizzi:2000:DMD,
  author =       "Luca Forlizzi and Ralf Hartmut G{\"u}ting and Enrico
                 Nardelli and Markus Schneider",
  title =        "A data model and data structures for moving objects
                 databases",
  crossref =     "Chen:2000:PAS",
  pages =        "319--330",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p319-forlizzi/p319-forlizzi.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p319-forlizzi/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Saltenis:2000:IPC,
  author =       "Simonas {\v{S}}altenis and Christian S. Jensen and
                 Scott T. Leutenegger and Mario A. Lopez",
  title =        "Indexing the positions of continuously moving
                 objects",
  crossref =     "Chen:2000:PAS",
  pages =        "331--342",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p331-saltenis/p331-saltenis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p331-saltenis/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Shin:2000:AMS,
  author =       "Hyoseop Shin and Bongki Moon and Sukho Lee",
  title =        "Adaptive multi-stage distance join processing",
  crossref =     "Chen:2000:PAS",
  pages =        "343--354",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p343-shin/p343-shin.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p343-shin/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cho:2000:FRW,
  author =       "Junghoo Cho and Narayanan Shivakumar and Hector
                 Garcia-Molina",
  title =        "Finding replicated {Web} collections",
  crossref =     "Chen:2000:PAS",
  pages =        "355--366",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p355-cho/p355-cho.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p355-cho/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Labrinidis:2000:WM,
  author =       "Alexandros Labrinidis and Nick Roussopoulos",
  title =        "{WebView} materialization",
  crossref =     "Chen:2000:PAS",
  pages =        "367--378",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p367-labrinidis/p367-labrinidis.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p367-labrinidis/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chen:2000:NSC,
  author =       "Jianjun Chen and David J. DeWitt and Feng Tian and
                 Yuan Wang",
  title =        "{NiagaraCQ}: a scalable continuous query system for
                 {Internet} databases",
  crossref =     "Chen:2000:PAS",
  pages =        "379--390",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p379-chen/p379-chen.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p379-chen/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chang:2000:OTI,
  author =       "Yuan-Chi Chang and Lawrence Bergman and Vittorio
                 Castelli and Chung-Sheng Li and Ming-Ling Lo and John
                 R. Smith",
  title =        "The onion technique: indexing for linear optimization
                 queries",
  crossref =     "Chen:2000:PAS",
  pages =        "391--402",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p391-chang/p391-chang.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p391-chang/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Jagadish:2000:EMD,
  author =       "H. V. Jagadish and Nick Koudas and Divesh Srivastava",
  title =        "On effective multi-dimensional indexing for strings",
  crossref =     "Chen:2000:PAS",
  pages =        "403--414",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p403-jagadish/p403-jagadish.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p403-jagadish/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Oh:2000:ECE,
  author =       "JungHwan Oh and Kien A. Hua",
  title =        "Efficient and cost-effective techniques for browsing
                 and indexing large video databases",
  crossref =     "Chen:2000:PAS",
  pages =        "415--426",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p415-oh/p415-oh.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p415-oh/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ramaswamy:2000:EAM,
  author =       "Sridhar Ramaswamy and Rajeev Rastogi and Kyuseok
                 Shim",
  title =        "Efficient algorithms for mining outliers from large
                 data sets",
  crossref =     "Chen:2000:PAS",
  pages =        "427--438",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p427-ramaswamy/p427-ramaswamy.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p427-ramaswamy/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Agrawal:2000:PPD,
  author =       "Rakesh Agrawal and Ramakrishnan Srikant",
  title =        "Privacy-preserving data mining",
  crossref =     "Chen:2000:PAS",
  pages =        "439--450",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p439-agrawal/p439-agrawal.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p439-agrawal/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Szalay:2000:DMM,
  author =       "Alexander S. Szalay and Peter Z. Kunszt and Ani Thakar
                 and Jim Gray and Don Slutz and Robert J. Brunner",
  title =        "Designing and mining multi-terabyte astronomy
                 archives: the {Sloan Digital Sky Survey}",
  crossref =     "Chen:2000:PAS",
  pages =        "451--462",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p451-szalay/p451-szalay.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p451-szalay/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gunopulos:2000:AMD,
  author =       "Dimitrios Gunopulos and George Kollios and Vassilis J.
                 Tsotras and Carlotta Domeniconi",
  title =        "Approximating multi-dimensional aggregate range
                 queries over real attributes",
  crossref =     "Chen:2000:PAS",
  pages =        "463--474",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p463-gunopulos/p463-gunopulos.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p463-gunopulos/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Rao:2000:MBT,
  author =       "Jun Rao and Kenneth A. Ross",
  title =        "Making {B$^+$}-trees cache conscious in main memory",
  crossref =     "Chen:2000:PAS",
  pages =        "475--486",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p475-rao/p475-rao.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p475-rao/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Acharya:2000:CSA,
  author =       "Swarup Acharya and Phillip B. Gibbons and Viswanath
                 Poosala",
  title =        "{Congressional} samples for approximate answering of
                 group-by queries",
  crossref =     "Chen:2000:PAS",
  pages =        "487--498",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/citations/proceedings/mod/342009/p487-acharya/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Waas:2000:CES,
  author =       "Florian Waas and C{\'e}sar Galindo-Legaria",
  title =        "Counting, enumerating, and sampling of execution plans
                 in a cost-based query optimizer",
  crossref =     "Chen:2000:PAS",
  pages =        "499--509",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p499-waas/p499-waas.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p499-waas/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Wattez:2000:BQT,
  author =       "Fanny Wattez and Sophie Cluet and V{\'e}ronique
                 Benzaken and Guy Ferran and Christian Fiegel",
  title =        "Benchmarking queries over trees: learning the hard
                 truth the hard way",
  crossref =     "Chen:2000:PAS",
  pages =        "510--511",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/citations/proceedings/mod/342009/p510-wattez/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Lehner:2000:MCA,
  author =       "Wolfgang Lehner and Richard Sidle and Hamid Pirahesh
                 and Roberta Wolfgang Cochrane",
  title =        "Maintenance of cube automatic summary tables",
  crossref =     "Chen:2000:PAS",
  pages =        "512--513",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p512-lehner/p512-lehner.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p512-lehner/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Huber:2000:CAD,
  author =       "Val Huber",
  title =        "Challenges in automating declarative business rules to
                 enable rapid business response",
  crossref =     "Chen:2000:PAS",
  pages =        "514--514",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p514-huber/p514-huber.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p514-huber/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ross:2000:EBR,
  author =       "Ronald G. Ross",
  title =        "Expressing business rules",
  crossref =     "Chen:2000:PAS",
  pages =        "515--516",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p515-ross/p515-ross.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p515-ross/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kintzer:2000:GBP,
  author =       "Eric Kintzer",
  title =        "Going beyond personalization: rule engines at work",
  crossref =     "Chen:2000:PAS",
  pages =        "517--517",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p517-kintzer/p517-kintzer.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p517-kintzer/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hsiao:2000:DTR,
  author =       "Hui-I. Hsiao and Inderpal Narang",
  title =        "{DLFM}: a transactional resource manager",
  crossref =     "Chen:2000:PAS",
  pages =        "518--528",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p518-hsiao/p518-hsiao.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p518-hsiao/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ponnekanti:2000:OIR,
  author =       "Nagavamsi Ponnekanti and Hanuma Kodavalla",
  title =        "Online index rebuild",
  crossref =     "Chen:2000:PAS",
  pages =        "529--538",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p529-ponnekanti/p529-ponnekanti.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p529-ponnekanti/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Annamalai:2000:IIO,
  author =       "Melliyal Annamalai and Rajiv Chopra and Samuel DeFazio
                 and Susan Mavris",
  title =        "Indexing images in {Oracle8i}",
  crossref =     "Chen:2000:PAS",
  pages =        "539--547",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p539-annamalai/p539-annamalai.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p539-annamalai/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Weininger:2000:HVL,
  author =       "Andreas Weininger",
  title =        "Handling very large databases with {Informix} extended
                 parallel server",
  crossref =     "Chen:2000:PAS",
  pages =        "548--549",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p548-weininger/p548-weininger.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p548-weininger/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chen:2000:ITW,
  author =       "Chung-Min Chen and Munir Cochinwala and Claudio
                 Petrone and Marc Pucci and Sunil Samtani and Patrizia
                 Santa",
  title =        "{Internet} traffic warehouse",
  crossref =     "Chen:2000:PAS",
  pages =        "550--558",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p550-chen/p550-chen.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p550-chen/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ordonez:2000:SFC,
  author =       "Carlos Ordonez and Paul Cereghini",
  title =        "{SQLEM}: fast clustering in {SQL} using the {EM}
                 algorithm",
  crossref =     "Chen:2000:PAS",
  pages =        "559--570",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p559-ordonez/p559-ordonez.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p559-ordonez/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Jhingran:2000:ARC,
  author =       "Anant Jhingran",
  title =        "Anatomy of a real {E-commerce} system",
  crossref =     "Chen:2000:PAS",
  pages =        "571--572",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/citations/proceedings/mod/342009/p571-jhingran/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ramakrishnan:2000:BID,
  author =       "Raghu Ramakrishnan",
  title =        "From browsing to interacting: {DBMS} support for
                 responsive websites",
  crossref =     "Chen:2000:PAS",
  pages =        "573--573",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p573-ramakrishnan/p573-ramakrishnan.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p573-ramakrishnan/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hellerstein:2000:IRP,
  author =       "Joseph M. Hellerstein",
  title =        "Index research (panel session): forest or trees?",
  crossref =     "Chen:2000:PAS",
  pages =        "574--574",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p574-hellerstein/p574-hellerstein.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p574-hellerstein/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Nori:2000:AAP,
  author =       "Anil K. Nori",
  title =        "Application architecture (panel session): {2Tier} or
                 {3Tier}? {What} is {DBMS}'s role?",
  crossref =     "Chen:2000:PAS",
  pages =        "575--575",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p575-nori/p575-nori.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p575-nori/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Carey:2000:XDP,
  author =       "Michael J. Carey and Jennifer Widom and Adam Bosworth
                 and Bruce Lindsay and Michael Stonebraker and Dan
                 Suciu",
  title =        "Of {XML} and databases (panel session): where's the
                 beef?",
  crossref =     "Chen:2000:PAS",
  pages =        "576--576",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p576-carey/p576-carey.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p576-carey/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bratsberg:2000:DUH,
  author =       "Svein Erik Bratsberg and {\O}ystein Torbj{\o}rnsen",
  title =        "Designing an ultra highly available {DBMS} (tutorial
                 session)",
  crossref =     "Chen:2000:PAS",
  pages =        "577--577",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p577-bratsberg/p577-bratsberg.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p577-bratsberg/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gal:2000:DME,
  author =       "Avigdor Gal",
  title =        "Data management in {eCommerce} (tutorial session): the
                 good, the bad, and the ugly",
  crossref =     "Chen:2000:PAS",
  pages =        "578--578",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p578-gal/p578-gal.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p578-gal/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Blakeley:2000:DAT,
  author =       "Jos{\'e} A. Blakeley and Anand Deshpande",
  title =        "Data access (tutorial session)",
  crossref =     "Chen:2000:PAS",
  pages =        "579--579",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p579-blakeley/p579-blakeley.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p579-blakeley/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Shukla:2000:LDS,
  author =       "Shridhar Shukla and Anand Deshpande",
  title =        "{LDAP} directory services- just another database
                 application? (tutorial session)",
  crossref =     "Chen:2000:PAS",
  pages =        "580--580",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p580-shukla/p580-shukla.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p580-shukla/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Wolfson:2000:RIM,
  author =       "Ouri Wolfson",
  title =        "Research issues in moving objects databases (tutorial
                 session)",
  crossref =     "Chen:2000:PAS",
  pages =        "581--581",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p581-wolfson/p581-wolfson.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p581-wolfson/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ives:2000:SOD,
  author =       "Zachary Ives and Alon Levy and Jayant Madhavan and
                 Rachel Pottinger and Stefan Saroiu and Igor Tatarinov
                 and Shiori Betzler and Qiong Chen and Ewa Jaslikowska
                 and Jing Su and Wai Tak Theodora Yeung",
  title =        "Self-organizing data sharing communities with
                 {SAGRES}",
  crossref =     "Chen:2000:PAS",
  pages =        "582--582",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p582-ives/p582-ives.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p582-ives/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Fegaras:2000:DOB,
  author =       "Leonidas Fegaras and Chandrasekhar Srinivasan and
                 Arvind Rajendran and David Maier",
  title =        "-{DB}: an {ODMG-based} object-oriented {DBMS}",
  crossref =     "Chen:2000:PAS",
  pages =        "583--583",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p583-fegaras/p583-fegaras.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p583-fegaras/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Wang:2000:ASE,
  author =       "Jason T. L. Wang and Xiong Wang and Dennis Shasha and
                 Bruce A. Shapiro and Kaizhong Zhang and Qicheng Ma and
                 Zasha Weinberg",
  title =        "An approximate search engine for structural
                 databases",
  crossref =     "Chen:2000:PAS",
  pages =        "584--584",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p584-wang/p584-wang.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p584-wang/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Rundensteiner:2000:SWW,
  author =       "Elke A. Rundensteiner and Kajal T. Claypool and Li
                 Chen and Hong Su and Keiji Oenoki",
  title =        "{SERFing} the {Web}: {Web} site management made easy",
  crossref =     "Chen:2000:PAS",
  pages =        "585--585",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p585-rundensteiner/p585-rundensteiner.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p585-rundensteiner/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Merialdo:2000:HMB,
  author =       "Paolo Merialdo and Paolo Atzeni and Marco Magnante and
                 Giansalvatore Mecca and Marco Pecorone",
  title =        "{HOMER}: a model-based {CASE} tool for data-intensive
                 {Web} sites",
  crossref =     "Chen:2000:PAS",
  pages =        "586--586",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/citations/proceedings/mod/342009/p586-merialdo/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chen:2000:FLB,
  author =       "Songting Chen and Yanlei Diao and Hongjun Lu and
                 Zengping Tian",
  title =        "{FACT}: a learning based {Web} query processing
                 system",
  crossref =     "Chen:2000:PAS",
  pages =        "587--587",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p587-chen/p587-chen.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p587-chen/",
  acknowledgement = ack-nhfb,
}

@InProceedings{vandenBercken:2000:JXP,
  author =       "Jochen van den Bercken and Jens-Peter Dittrich and
                 Bernhard Seeger",
  title =        "javax.{XXL}: a prototype for a library of query
                 processing algorithms",
  crossref =     "Chen:2000:PAS",
  pages =        "588--588",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/citations/proceedings/mod/342009/p588-van_den_bercken/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Sarawagi:2000:III,
  author =       "Sunita Sarawagi and Gayatri Sathe",
  title =        "i$^3$: intelligent, interactive investigation of
                 {OLAP} data cubes",
  crossref =     "Chen:2000:PAS",
  pages =        "589--589",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p589-sarawagi/p589-sarawagi.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p589-sarawagi/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Galhardas:2000:AED,
  author =       "Helena Galhardas and Daniela Florescu and Dennis
                 Shasha and Eric Simon",
  title =        "{AJAX}: an extensible data cleaning tool",
  crossref =     "Chen:2000:PAS",
  pages =        "590--590",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p590-galhardas/p590-galhardas.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p590-galhardas/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Jarke:2000:CBD,
  author =       "M. Jarke and C. Quix and D. Calvanese and M. Lenzerini
                 and E. Franconi and S. Ligoudistianos and P.
                 Vassiliadis and Y. Vassiliou",
  title =        "Concept based design of data warehouses: the {DWQ}
                 demonstrators",
  crossref =     "Chen:2000:PAS",
  pages =        "591--591",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p591-jarke/p591-jarke.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p591-jarke/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Pei:2000:TDM,
  author =       "Jian Pei and Runying Mao and Kan Hu and Hua Zhu",
  title =        "Towards data mining benchmarking: a test bed for
                 performance study of frequent pattern mining",
  crossref =     "Chen:2000:PAS",
  pages =        "592--592",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p592-pei/p592-pei.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p592-pei/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hsu:2000:IMI,
  author =       "Wynne Hsu and Mong Li Lee and Kheng Guan Goh",
  title =        "Image mining in {IRIS}: integrated retinal information
                 system",
  crossref =     "Chen:2000:PAS",
  pages =        "593--593",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p593-hsu/p593-hsu.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p593-hsu/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Rodriguez-Martinez:2000:MDM,
  author =       "Manuel Rodr{\'\i}guez-Mart{\'\i}nez and Nick
                 Roussopoulos and John M. McGann and Stephen Kelley and
                 Vadim Katz and Zhexuan Song and Joseph J{\'a}J{\'a}",
  title =        "{MOCHA}: a database middleware system featuring
                 automatic deployment of application-specific
                 functionality",
  crossref =     "Chen:2000:PAS",
  pages =        "594--594",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/citations/proceedings/mod/342009/p594-rodriguez-martinez/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gillmann:2000:GDA,
  author =       "Michael Gillmann and Jeanine Weissenfels and German
                 Shegalov and Wolfgang Wonner and Gerhard Weikum",
  title =        "A goal-driven auto-configuration tool for the
                 distributed workflow management system mentorlite",
  crossref =     "Chen:2000:PAS",
  pages =        "595--595",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p595-gillmann/p595-gillmann.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p595-gillmann/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Yang:2000:TTE,
  author =       "Jun Yang and Huacheng C. Ying and Jennifer Widom",
  title =        "{TIP}: a temporal extension to {Informix}",
  crossref =     "Chen:2000:PAS",
  pages =        "596--596",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p596-yang/p596-yang.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p596-yang/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Liu:2000:ATA,
  author =       "Ling Liu and Calton Pu and David Buttler and Wei Han
                 and Henrique Paques and Wei Tang",
  title =        "{AQR}-toolkit: an adaptive query routing middleware
                 for distributed data intensive systems",
  crossref =     "Chen:2000:PAS",
  pages =        "597--597",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p597-liu/p597-liu.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p597-liu/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Li:2000:SPC,
  author =       "Chung-Sheng Li and Lawrence D. Bergman and Yuan-Chi
                 Chang and Vittorio Castelli and John R. Smith",
  title =        "{SPIRE}: a progressive content-based spatial image
                 retrieval engine",
  crossref =     "Chen:2000:PAS",
  pages =        "598--598",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p598-li/p598-li.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p598-li/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Goh:2000:IRP,
  author =       "Chong Leng Goh and Beng Chin Ooi and Stephane Bressan
                 and Kian-Lee Tan",
  title =        "Integrating replacement policies in {StorM}: an
                 extensible approach",
  crossref =     "Chen:2000:PAS",
  pages =        "599--599",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/citations/proceedings/mod/342009/p599-goh/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Oria:2000:DDI,
  author =       "Vincent Oria and M. Tamer {\"O}zsu and Paul J.
                 Iglinski and Shu Lin and Bin Yao",
  title =        "{DISIMA}: a distributed and interoperable image
                 database system",
  crossref =     "Chen:2000:PAS",
  pages =        "600--600",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p600-oria/p600-oria.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p600-oria/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Revesz:2000:MGC,
  author =       "Peter Revesz and Rui Chen and Pradip Kanjamala and
                 Yiming Li and Yuguo Liu and Yonghui Wang",
  title =        "The {MLPQ\slash GIS} constraint database system",
  crossref =     "Chen:2000:PAS",
  pages =        "601--601",
  year =         "2000",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.acm.org/pubs/articles/proceedings/mod/342009/p601-revesz/p601-revesz.pdf;
                 http://www.acm.org/pubs/citations/proceedings/mod/342009/p601-revesz/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Han:2001:ECI,
  author =       "Jiawei Han and Jian Pei and Guozhu Dong and Ke Wang",
  title =        "Efficient computation of {Iceberg} cubes with complex
                 measures",
  crossref =     "Sellis:2001:PAS",
  pages =        "1--12",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Vianu:2001:WOC,
  author =       "Victor Vianu",
  title =        "A {Web} Odyssey: from {Codd} to {XML}",
  crossref =     "ACM:2001:PTA",
  pages =        "1--15",
  year =         "2001",
  bibdate =      "Wed Feb 20 08:06:06 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gehrke:2001:CCA,
  author =       "Johannes Gehrke and Flip Korn and Divesh Srivastava",
  title =        "On computing correlated aggregates over continual data
                 streams",
  crossref =     "Sellis:2001:PAS",
  pages =        "13--24",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Rajaraman:2001:QWU,
  author =       "Anand Rajaraman and Jeffrey D. Ullmann",
  title =        "Querying {Websites} using compact skeletons",
  crossref =     "ACM:2001:PTA",
  pages =        "16--27",
  year =         "2001",
  bibdate =      "Wed Feb 20 08:06:06 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ng:2001:ICC,
  author =       "Raymond T. Ng and Alan Wagner and Yu Yin",
  title =        "{Iceberg}-cube computation with {PC} clusters",
  crossref =     "Sellis:2001:PAS",
  pages =        "25--36",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Jim:2001:DDQ,
  author =       "Trevor Jim and Dan Suciu",
  title =        "Dynamically distributed query evaluation",
  crossref =     "ACM:2001:PTA",
  pages =        "28--39",
  year =         "2001",
  bibdate =      "Wed Feb 20 08:06:06 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Aggarwal:2001:ODH,
  author =       "Charu C. Aggarwal and Philip S. Yu",
  title =        "Outlier detection for high dimensional data",
  crossref =     "Sellis:2001:PAS",
  pages =        "37--46",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kanza:2001:FQS,
  author =       "Yaron Kanza and Yehoshua Sagiv",
  title =        "Flexible queries over semistructured data",
  crossref =     "ACM:2001:PTA",
  pages =        "40--51",
  year =         "2001",
  bibdate =      "Wed Feb 20 08:06:06 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Rinfret:2001:BSI,
  author =       "Denis Rinfret and Patrick O'Neil and Elizabeth
                 O'Neil",
  title =        "Bit-sliced index arithmetic",
  crossref =     "Sellis:2001:PAS",
  pages =        "47--57",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Papadimitriou:2001:MQO,
  author =       "Christos H. Papadimitriou and Mihalis Yannakakis",
  title =        "Multiobjective query optimization",
  crossref =     "ACM:2001:PTA",
  pages =        "52--59",
  year =         "2001",
  bibdate =      "Wed Feb 20 08:06:06 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Greenwald:2001:SEO,
  author =       "Michael Greenwald and Sanjeev Khanna",
  title =        "Space-efficient online computation of quantile
                 summaries",
  crossref =     "Sellis:2001:PAS",
  pages =        "58--66",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Dalvi:2001:PMQ,
  author =       "Nilesh N. Dalvi and Sumit K. Sanghai and Prasan Roy
                 and S. Sudarshan",
  title =        "Pipelining in multi-query optimization",
  crossref =     "ACM:2001:PTA",
  pages =        "59--70",
  year =         "2001",
  bibdate =      "Wed Feb 20 08:06:06 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ipeirotis:2001:PCC,
  author =       "Panagiotis G. Ipeirotis and Luis Gravano and Mehran
                 Sahami",
  title =        "Probe, count, and classify: categorizing hidden web
                 databases",
  crossref =     "Sellis:2001:PAS",
  pages =        "67--78",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Sadri:2001:OSQ,
  author =       "Reza Sadri and Carlo Zaniolo and Amir Zarkesh and
                 Jafar Adibi",
  title =        "Optimization of sequence queries in database systems",
  crossref =     "ACM:2001:PTA",
  pages =        "71--81",
  year =         "2001",
  bibdate =      "Wed Feb 20 08:06:06 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Breunig:2001:DBQ,
  author =       "Markus M. Breunig and Hans-Peter Kriegel and Peer
                 Kr{\"o}ger and J{\"o}rg Sander",
  title =        "Data bubbles: quality preserving performance boosting
                 for hierarchical clustering",
  crossref =     "Sellis:2001:PAS",
  pages =        "79--90",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Grohe:2001:PCD,
  author =       "Martin Grohe",
  title =        "The parameterized complexity of database queries",
  crossref =     "ACM:2001:PTA",
  pages =        "82--92",
  year =         "2001",
  bibdate =      "Wed Feb 20 08:06:06 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Joshi:2001:MNH,
  author =       "Mahesh V. Joshi and Ramesh C. Agarwal and Vipin
                 Kumar",
  title =        "Mining needle in a haystack: classifying rare classes
                 via two-phase rule induction",
  crossref =     "Sellis:2001:PAS",
  pages =        "91--102",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Larsen:2001:RMW,
  author =       "Kim S. Larsen",
  title =        "Relaxed multi-way trees with group updates",
  crossref =     "ACM:2001:PTA",
  pages =        "93--101",
  year =         "2001",
  bibdate =      "Wed Feb 20 08:06:06 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Fagin:2001:OAA,
  author =       "Ronald Fagin and Amnon Lotem and Moni Naor",
  title =        "Optimal aggregation algorithms for middleware",
  crossref =     "ACM:2001:PTA",
  pages =        "102--113",
  year =         "2001",
  bibdate =      "Wed Feb 20 08:06:06 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Fernandez:2001:EEX,
  author =       "Mary Fernandez and Atsuyuki Morishima and Dan Suciu",
  title =        "Efficient evaluation of {XML} middle-ware queries",
  crossref =     "Sellis:2001:PAS",
  pages =        "103--114",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Fan:2001:XIC,
  author =       "Wenfei Fan and Leonid Libkin",
  title =        "On {XML} integrity constraints in the presence of
                 {DTDs}",
  crossref =     "ACM:2001:PTA",
  pages =        "114--125",
  year =         "2001",
  bibdate =      "Wed Feb 20 08:06:06 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Fabret:2001:FAI,
  author =       "Fran{\c{c}}oise Fabret and H. Arno Jacobsen and
                 Fran{\c{c}}ois Llirbat and Jo{\~a}o Pereira and Kenneth
                 A. Ross and Dennis Shasha",
  title =        "Filtering algorithms and implementation for very fast
                 publish\slash subscribe systems",
  crossref =     "Sellis:2001:PAS",
  pages =        "115--126",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Murata:2001:EPE,
  author =       "Makoto Murata",
  title =        "Extended path expressions of {XML}",
  crossref =     "ACM:2001:PTA",
  pages =        "126--137",
  year =         "2001",
  bibdate =      "Wed Feb 20 08:06:06 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Slivinskas:2001:AQO,
  author =       "Giedrius Slivinskas and Christian S. Jensen and
                 Richard T. Snodgrass",
  title =        "Adaptable query optimization and evaluation in
                 temporal middleware",
  crossref =     "Sellis:2001:PAS",
  pages =        "127--138",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Alon:2001:XDV,
  author =       "Noga Alon and Tova Milo and Frank Neven and Dan Suciu
                 and Victor Vianu",
  title =        "{XML} with data values: typechecking revisited",
  crossref =     "ACM:2001:PTA",
  pages =        "138--149",
  year =         "2001",
  bibdate =      "Wed Feb 20 08:06:06 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kim:2001:OMI,
  author =       "Kihong Kim and Sang K. Cha and Keunjoo Kwon",
  title =        "Optimizing multidimensional index trees for main
                 memory access",
  crossref =     "Sellis:2001:PAS",
  pages =        "139--150",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Abiteboul:2001:RQX,
  author =       "Serge Abiteboul and Luc Segoufin and Victor Vianu",
  title =        "Representing and querying {XML} with incomplete
                 information",
  crossref =     "ACM:2001:PTA",
  pages =        "150--161",
  year =         "2001",
  bibdate =      "Wed Feb 20 08:06:06 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Keogh:2001:LAD,
  author =       "Eamonn Keogh and Kaushik Chakrabarti and Michael
                 Pazzani and Sharad Mehrotra",
  title =        "Locally adaptive dimensionality reduction for indexing
                 large time series databases",
  crossref =     "Sellis:2001:PAS",
  pages =        "151--162",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Mendelzon:2001:QPS,
  author =       "Alberto O. Mendelzon and George A. Mihaila",
  title =        "Querying partially sound and complete data sources",
  crossref =     "ACM:2001:PTA",
  pages =        "162--170",
  year =         "2001",
  bibdate =      "Wed Feb 20 08:06:06 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bohannon:2001:MMI,
  author =       "Philip Bohannon and Peter Mcllroy and Rajeev Rastogi",
  title =        "Main-memory index structures with fixed-size partial
                 keys",
  crossref =     "Sellis:2001:PAS",
  pages =        "163--174",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Khanna:2001:CFU,
  author =       "Sanjeev Khanna and Wang-Chiew Tan",
  title =        "On computing functions with uncertainty",
  crossref =     "ACM:2001:PTA",
  pages =        "171--182",
  year =         "2001",
  bibdate =      "Wed Feb 20 08:06:06 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Borkar:2001:AST,
  author =       "Vinayak Borkar and Kaustubh Deshmukh and Sunita
                 Sarawagi",
  title =        "Automatic segmentation of text into structured
                 records",
  crossref =     "Sellis:2001:PAS",
  pages =        "175--186",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Benedikt:2001:SOQ,
  author =       "Michael Benedikt and Leonid Libkin and Thomas
                 Schwentick and Luc Segoufin",
  title =        "String operations in query languages",
  crossref =     "ACM:2001:PTA",
  pages =        "183--194",
  year =         "2001",
  bibdate =      "Wed Feb 20 08:06:06 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Yu:2001:EEM,
  author =       "Clement Yu and Weiyi Meng and Wensheng Wu and King-Lup
                 Liu",
  title =        "Efficient and effective metasearch for text databases
                 incorporating linkages among documents",
  crossref =     "Sellis:2001:PAS",
  pages =        "187--198",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gottlob:2001:RMG,
  author =       "Georg Gottlob and Nicola Leone and Francesco
                 Scarcello",
  title =        "Robbers, marshals, and guards: game theoretic and
                 logical characterizations of hypertree width",
  crossref =     "ACM:2001:PTA",
  pages =        "195--206",
  year =         "2001",
  bibdate =      "Wed Feb 20 08:06:06 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Deshpande:2001:IGD,
  author =       "Amol Deshpande and Minos Garofalakis and Rajeev
                 Rastogi",
  title =        "Independence is good: dependency-based histogram
                 synopses for high-dimensional data",
  crossref =     "Sellis:2001:PAS",
  pages =        "199--210",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cai:2001:CJP,
  author =       "Jin-Yi Cai and Venkatesan T. Chakaravarthy and Raghav
                 Kaushik and Jeffrey F. Naughton",
  title =        "On the complexity of join predicates",
  crossref =     "ACM:2001:PTA",
  pages =        "207--214",
  year =         "2001",
  bibdate =      "Wed Feb 20 08:06:06 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bruno:2001:SMW,
  author =       "Nicolas Bruno and Surajit Chaudhuri and Luis Gravano",
  title =        "{STHoles}: a multidimensional workload-aware
                 histogram",
  crossref =     "Sellis:2001:PAS",
  pages =        "211--222",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cohen:2001:EAA,
  author =       "Sara Cohen and Werner Nutt and Yehoshua Sagiv",
  title =        "Equivalences among aggregate queries with negation",
  crossref =     "ACM:2001:PTA",
  pages =        "215--226",
  year =         "2001",
  bibdate =      "Wed Feb 20 08:06:06 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Jagadish:2001:GOH,
  author =       "H. V. Jagadish and Hui Jin and Beng Chin Ooi and
                 Kian-Lee Tan",
  title =        "Global optimization of histograms",
  crossref =     "Sellis:2001:PAS",
  pages =        "223--234",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gilbert:2001:OAC,
  author =       "Anna C. Gilbert and Yannis Kotidis and S.
                 Muthukrishnan and Marin J. Strauss",
  title =        "Optimal and approximate computation of summary
                 statistics for range aggregates",
  crossref =     "ACM:2001:PTA",
  pages =        "227--236",
  year =         "2001",
  bibdate =      "Wed Feb 20 08:06:06 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chen:2001:IIP,
  author =       "Shimin Chen and Phillip B. Gibbons and Todd C. Mowry",
  title =        "Improving index performance through prefetching",
  crossref =     "Sellis:2001:PAS",
  pages =        "235--246",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Zhang:2001:ECT,
  author =       "Donhui Zhang and Alexander Markowetz and Vassilis
                 Tsotras and Dimitrios Gunopulos and Bernhard Seeger",
  title =        "Efficient computation of temporal aggregates with
                 range predicates",
  crossref =     "ACM:2001:PTA",
  pages =        "237--245",
  year =         "2001",
  bibdate =      "Wed Feb 20 08:06:06 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Leighton:2001:CDC,
  author =       "Tom Leighton",
  title =        "The challenges of delivering content on the
                 {Internet}",
  crossref =     "ACM:2001:PTA",
  pages =        "246--246",
  year =         "2001",
  bibdate =      "Wed Feb 20 08:06:06 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Agrawal:2001:DQP,
  author =       "Dakshi Agrawal and Charu C. Aggarwal",
  title =        "On the design and quantification of privacy preserving
                 data mining algorithms",
  crossref =     "ACM:2001:PTA",
  pages =        "247--255",
  year =         "2001",
  bibdate =      "Wed Feb 20 08:06:06 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gionis:2001:ETS,
  author =       "Aristides Gionis and Dimitrios Gunopulos and Nick
                 Koudas",
  title =        "Efficient and tumble similar set retrieval",
  crossref =     "Sellis:2001:PAS",
  pages =        "247--258",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Aggarwal:2001:EDR,
  author =       "Charu C. Aggarwal",
  title =        "On the effects of dimensionality reduction on high
                 dimensional similarity search",
  crossref =     "ACM:2001:PTA",
  pages =        "256--266",
  year =         "2001",
  bibdate =      "Wed Feb 20 08:06:06 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hristidis:2001:PSE,
  author =       "Vagelis Hristidis and Nick Koudas and Yannis
                 Papakonstantinou",
  title =        "{PREFER}: a system for the efficient execution of
                 multi-parametric ranked queries",
  crossref =     "Sellis:2001:PAS",
  pages =        "259--270",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bykowski:2001:CRF,
  author =       "Artur Bykowski and Christophe Rigotti",
  title =        "A condensed representation to find frequent patterns",
  crossref =     "ACM:2001:PTA",
  pages =        "267--273",
  year =         "2001",
  bibdate =      "Wed Feb 20 08:06:06 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chen:2001:QOC,
  author =       "Zhiyuan Chen and Johannes Gehrke and Flip Korn",
  title =        "Query optimization in compressed database systems",
  crossref =     "Sellis:2001:PAS",
  pages =        "271--282",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Achlioptas:2001:DFR,
  author =       "Dimitris Achlioptas",
  title =        "Database-friendly random projections",
  crossref =     "ACM:2001:PTA",
  pages =        "274--281",
  year =         "2001",
  bibdate =      "Wed Feb 20 08:06:06 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ferragina:2001:TDS,
  author =       "Paolo Ferragina and Nick Koudas and Divesh Srivastava
                 and S. Muthukrishnan",
  title =        "Two-dimensional substring indexing",
  crossref =     "ACM:2001:PTA",
  pages =        "282--288",
  year =         "2001",
  bibdate =      "Wed Feb 20 08:06:06 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Babu:2001:SMB,
  author =       "Shivnath Babu and Minos Garofalakis and Rajeev
                 Rastogi",
  title =        "{SPARTAN}: a model-based semantic compression system
                 for massive data tables",
  crossref =     "Sellis:2001:PAS",
  pages =        "283--294",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Schuldt:2001:PLP,
  author =       "Heiko Schuldt",
  title =        "Process locking: a protocol based on ordered shared
                 locks for the execution of transactional processes",
  crossref =     "ACM:2001:PTA",
  pages =        "289--300",
  year =         "2001",
  bibdate =      "Wed Feb 20 08:06:06 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chaudhuri:2001:ROB,
  author =       "Surajit Chaudhuri and Gautam Das and Vivek Narasayya",
  title =        "A robust, optimization-based approach for approximate
                 answering of aggregate queries",
  crossref =     "Sellis:2001:PAS",
  pages =        "295--306",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Mistry:2001:MVS,
  author =       "Hoshi Mistry and Prasan Roy and S. Sudarshan and
                 Krithi Ramamritham",
  title =        "Materialized view selection and maintenance using
                 multi-query optimization",
  crossref =     "Sellis:2001:PAS",
  pages =        "307--318",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Afrati:2001:GEP,
  author =       "Foto N. Afrati and Chen Li and Jeffrey D. Ullman",
  title =        "Generating efficient plans for queries using views",
  crossref =     "Sellis:2001:PAS",
  pages =        "319--330",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Goldstein:2001:OQU,
  author =       "Jonathan Goldstein and Per-{\AA}ke Larson",
  title =        "Optimizing queries using materialized views: a
                 practical, scalable solution",
  crossref =     "Sellis:2001:PAS",
  pages =        "331--342",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Lee:2001:DBA,
  author =       "Sang-Ho Lee and Kyu-Young Whang and Yang-Sae Moon and
                 Il-Yeol Song",
  title =        "Dynamic buffer allocation in video-on-demand systems",
  crossref =     "Sellis:2001:PAS",
  pages =        "343--354",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Olston:2001:APS,
  author =       "Chris Olston and Boon Thau Loo and Jennifer Widom",
  title =        "Adaptive precision setting for cached approximate
                 values",
  crossref =     "Sellis:2001:PAS",
  pages =        "355--366",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kalnis:2001:PSA,
  author =       "Panos Kalnis and Dimitris Papadias",
  title =        "Proxy-server architectures for {OLAP}",
  crossref =     "Sellis:2001:PAS",
  pages =        "367--378",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bohm:2001:EGO,
  author =       "Christian B{\"o}hm and Bernhard Braunm{\"u}ller and
                 Florian Krebs and Hans-Peter Kriegel",
  title =        "Epsilon grid order: an algorithm for the similarity
                 join on massive high-dimensional data",
  crossref =     "Sellis:2001:PAS",
  pages =        "379--388",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Lang:2001:MHD,
  author =       "Christian A. Lang and Ambuj K. Singh",
  title =        "Modeling high-dimensional index structures using
                 sampling",
  crossref =     "Sellis:2001:PAS",
  pages =        "389--400",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Lazaridis:2001:PAA,
  author =       "Iosif Lazaridis and Sharad Mehrotra",
  title =        "Progressive approximate aggregate queries with a
                 multi-resolution tree structure",
  crossref =     "Sellis:2001:PAS",
  pages =        "401--412",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Tatarinov:2001:UX,
  author =       "Igor Tatarinov and Zachary G. Ives and Alon Y. Halevy
                 and Daniel S. Weld",
  title =        "Updating {XML}",
  crossref =     "Sellis:2001:PAS",
  pages =        "413--424",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Zhang:2001:SCQ,
  author =       "Chun Zhang and Jeffrey Naughton and David DeWitt and
                 Qiong Luo and Guy Lohman",
  title =        "On supporting containment queries in relational
                 database management systems",
  crossref =     "Sellis:2001:PAS",
  pages =        "425--436",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Nguyen:2001:MXD,
  author =       "Benjamin Nguyen and Serge Abiteboul and Gr{\'e}gory
                 Cobena and Miha{\'\i} Preda",
  title =        "Monitoring {XML} data on the {Web}",
  crossref =     "Sellis:2001:PAS",
  pages =        "437--448",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Wu:2001:AGR,
  author =       "Yi-Leh Wu and Divyakant Agrawal and Amr {El Abbadi}",
  title =        "Applying the golden rule of sampling for query
                 estimation",
  crossref =     "Sellis:2001:PAS",
  pages =        "449--460",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Getoor:2001:SEU,
  author =       "Lise Getoor and Benjamin Taskar and Daphne Koller",
  title =        "Selectivity estimation using probabilistic models",
  crossref =     "Sellis:2001:PAS",
  pages =        "461--472",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Schuster:2001:CED,
  author =       "Assaf Schuster and Ran Wolff",
  title =        "Communication-efficient distributed mining of
                 association rules",
  crossref =     "Sellis:2001:PAS",
  pages =        "473--484",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Yan:2001:DDU,
  author =       "Ling Ling Yan and Ren{\'e}e J. Miller and Laura M.
                 Haas and Ronald Fagin",
  title =        "Data-driven understanding and refinement of schema
                 mappings",
  crossref =     "Sellis:2001:PAS",
  pages =        "485--496",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Amer-Yahia:2001:MTP,
  author =       "Sihem Amer-Yahia and SungRan Cho and Laks V. S.
                 Lakshmanan and Divesh Srivastava",
  title =        "Minimization of tree pattern queries",
  crossref =     "Sellis:2001:PAS",
  pages =        "497--508",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Doan:2001:RSD,
  author =       "AnHai Doan and Pedro Domingos and Alon Y. Halevy",
  title =        "Reconciling schemas of disparate data sources: a
                 machine-learning approach",
  crossref =     "Sellis:2001:PAS",
  pages =        "509--520",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Carino:2001:SMN,
  author =       "Felipe {Cari{\~n}o, Jr.} and Pekka Kostamaa and Art
                 Kaufmann and John Burgess",
  title =        "{StorHouse} metanoia --- new applications for
                 database, storage {\&} data warehousing",
  crossref =     "Sellis:2001:PAS",
  pages =        "521--531",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Candan:2001:EDC,
  author =       "K. Sel{\c{c}}uk Candan and Wen-Syan Li and Qiong Luo
                 and Wang-Pin Hsiung and Divyakant Agrawal",
  title =        "Enabling dynamic content caching for database-driven
                 web sites",
  crossref =     "Sellis:2001:PAS",
  pages =        "532--543",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Navas:2001:NDD,
  author =       "Julio C. Navas and Michael Wynblatt",
  title =        "The network is the database: data management for
                 highly distributed systems",
  crossref =     "Sellis:2001:PAS",
  pages =        "544--551",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Stonebraker:2001:CIB,
  author =       "Michael Stonebraker and Joseph M. Hellerstein",
  title =        "Content integration for e-business",
  crossref =     "Sellis:2001:PAS",
  pages =        "552--560",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Maguire:2001:CMW,
  author =       "Thomas Maguire",
  title =        "Catalog management in websphere commerce suite",
  crossref =     "Sellis:2001:PAS",
  pages =        "561--561",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Nazeri:2001:EMA,
  author =       "Zohreh Nazeri and Eric Bloedorn and Paul Ostwald",
  title =        "Experiences in mining aviation safety data",
  crossref =     "Sellis:2001:PAS",
  pages =        "562--566",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Draper:2001:NIE,
  author =       "Denise Draper and Alon Y. Halevy and Daniel S. Weld",
  title =        "The nimble integration engine",
  crossref =     "Sellis:2001:PAS",
  pages =        "567--568",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Meseck:2001:DML,
  author =       "Reed M. Meseck",
  title =        "Data management: lasting impact on wild, wild, web",
  crossref =     "Sellis:2001:PAS",
  pages =        "569--570",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Galindo-Legaria:2001:OOS,
  author =       "C{\'e}sar Galindo-Legaria and Milind Joshi",
  title =        "Orthogonal optimization of subqueries and
                 aggregation",
  crossref =     "Sellis:2001:PAS",
  pages =        "571--581",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Godfrey:2001:ECL,
  author =       "Parke Godfrey and Jarek Gryz and Calisto Zuzarte",
  title =        "Exploiting constraint-like data characterizations in
                 query optimization",
  crossref =     "Sellis:2001:PAS",
  pages =        "582--592",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Lahiri:2001:FSQ,
  author =       "Tirthankar Lahiri and Amit Ganesh and Ron Weiss and
                 Ashok Joshi",
  title =        "Fast-Start: quick fault recovery in oracle",
  crossref =     "Sellis:2001:PAS",
  pages =        "593--598",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Deolasee:2001:DDD,
  author =       "Pavan Deolasee and Amol Katkar and Ankur Panchbudhe
                 and Krithi Ramamritham and Prashant Shenoy",
  title =        "Dissemination of dynamic data",
  crossref =     "Sellis:2001:PAS",
  pages =        "599--599",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kiessling:2001:CYS,
  author =       "Werner Kie{\ss}ling and Stefan Holland and Stefan
                 Fischer and Thorsten Ehm",
  title =        "{COSIMA}---your smart, speaking {E}-salesperson",
  crossref =     "Sellis:2001:PAS",
  pages =        "600--600",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Shou:2001:RRT,
  author =       "L. Shou and C. H. Chionh and Z. Huang and Y. Ruan and
                 Kian-Lee Tan",
  title =        "{REVIEW}: a real-time virtual walkthrough system",
  crossref =     "Sellis:2001:PAS",
  pages =        "601--601",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Sahuguet:2001:KMT,
  author =       "Arnaud Sahuguet",
  title =        "Kweelt: more than just {``}yet another framework to
                 query {XML}!{''}",
  crossref =     "Sellis:2001:PAS",
  pages =        "602--602",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chawathe:2001:VES,
  author =       "Sudarshan S. Chawathe and Thomas Baby and Jihwang
                 Yoo",
  title =        "{VQBD}: exploring semistructured data",
  crossref =     "Sellis:2001:PAS",
  pages =        "603--603",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Buttler:2001:OMS,
  author =       "David Buttler and Ling Liu and Calton Pu and Henrique
                 Paques and Wei Han and Wei Tang",
  title =        "{OminiSearch}: a method for searching dynamic content
                 on the {Web}",
  crossref =     "Sellis:2001:PAS",
  pages =        "604--604",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bertino:2001:SXD,
  author =       "Elisa Bertino and Silvana Castano and Elena Ferrari",
  title =        "Securing {XML} documents: the author-{X} project
                 demonstration",
  crossref =     "Sellis:2001:PAS",
  pages =        "605--605",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Claypool:2001:SSS,
  author =       "Kajal T. Claypool and Elke A. Rundensteiner and Xin
                 Zhang and Su Hong and Harumi Kuno and Wang-chien Lee
                 and Gail Mitchell",
  title =        "{Sangam} --- a solution to support multiple data
                 models, their mappings and maintenance",
  crossref =     "Sellis:2001:PAS",
  pages =        "606--606",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hernandez:2001:CSA,
  author =       "Mauricio A. Hern{\'a}ndez and Ren{\'e}e J. Miller and
                 Laura M. Haas",
  title =        "Clio: a semi-automatic tool for schema mapping",
  crossref =     "Sellis:2001:PAS",
  pages =        "607--607",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Agrawal:2001:MVI,
  author =       "Sanjay Agrawal and Surajit Chaudhuri and Vivek
                 Narasayya",
  title =        "Materialized view and index selection tool for
                 {Microsoft SQL Server 2000}",
  crossref =     "Sellis:2001:PAS",
  pages =        "608--608",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Catarci:2001:PDS,
  author =       "Tiziana Catarci and Giuseppe Santucci",
  title =        "The prototype of the {DARE} system",
  crossref =     "Sellis:2001:PAS",
  pages =        "609--609",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Adii:2001:MBP,
  author =       "Asaf Adii and David Botzer and Opher Etzion and Tali
                 Yatzkar-Haham",
  title =        "Monitoring business processes through event
                 correlation based on dependency model",
  crossref =     "Sellis:2001:PAS",
  pages =        "610--610",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Shah:2001:FTL,
  author =       "Mehul A. Shah and Sirish Chandrasekaran",
  title =        "Fault-tolerant, load-balancing queries in telegraph",
  crossref =     "Sellis:2001:PAS",
  pages =        "611--611",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Agichtein:2001:SPS,
  author =       "Eugene Agichtein and Luis Gravano and Jeff Pavel and
                 Viktoriya Sokolova and Aleksandr Voskoboynik",
  title =        "Snowball: a prototype system for extracting relations
                 from large text collections",
  crossref =     "Sellis:2001:PAS",
  pages =        "612--612",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chang:2001:PPB,
  author =       "Edward Chang and Kwang-Ting Cheng and Lihyuarn L.
                 Chang",
  title =        "{PBIR} --- perception-based image retrieval",
  crossref =     "Sellis:2001:PAS",
  pages =        "613--613",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kriegel:2001:SDM,
  author =       "Hans-Peter Kriegel and Andreas M{\"u}ller and Marco
                 P{\"o}tke and Thomas Seidl",
  title =        "Spatial data management for computer aided design",
  crossref =     "Sellis:2001:PAS",
  pages =        "614--614",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Lam:2001:RRT,
  author =       "Kam-Yiu Lam and Edward Chan and Tei-Wei Kuo and S. W.
                 Ng and Dick Hung",
  title =        "{RETINA}: a real-time traffic navigation system",
  crossref =     "Sellis:2001:PAS",
  pages =        "615--615",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Datta:2001:DCA,
  author =       "Anindya Datta and Kaushik Dutta and Krithi Ramamritham
                 and Helen Thomas and Debra VanderMeer",
  title =        "Dynamic content acceleration: a caching solution to
                 enable scalable dynamic {Web} page generation",
  crossref =     "Sellis:2001:PAS",
  pages =        "616--616",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Whitney:2001:LOR,
  author =       "Arthur Whitney and Dennis Shasha",
  title =        "{Lots o'Ticks}: real time high performance time series
                 queries on billions of trades and quotes",
  crossref =     "Sellis:2001:PAS",
  pages =        "617--617",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Han:2001:DMS,
  author =       "Jiawei Han and Hasan Jamil and Ying Lu and Liangyou
                 Chen and Yaqin Liao and Jian Pei",
  title =        "{DNA}-miner: a system prototype for mining {DNA}
                 sequences",
  crossref =     "Sellis:2001:PAS",
  pages =        "618--618",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chen:2001:DDW,
  author =       "Jun Chen and Xin Zhang and Songting Chen and Andreas
                 Koeller and Elke A. Rundensteiner",
  title =        "DyDa: data warehouse maintenance in fully concurrent
                 environments",
  crossref =     "Sellis:2001:PAS",
  pages =        "619--619",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Larson:2001:XDM,
  author =       "Per-{\AA}ke Larson and Dana Florescu and Goetz Graefe
                 and Guido Moerkotte and Hamid Pirahesh and Harald
                 Sch{\"o}ning",
  title =        "{XML} data management (panel session): go native or
                 spruce up relational systems?",
  crossref =     "Sellis:2001:PAS",
  pages =        "620--620",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Rosenthal:2001:WDR,
  author =       "Arnon Rosenthal and Klaus Dittrich and Jim Donahue and
                 Bill Maimone",
  title =        "Will database researchers have any role in data
                 security? (panel session)",
  crossref =     "Sellis:2001:PAS",
  pages =        "621--621",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Mohan:2001:ASP,
  author =       "C. Mohan and Larry Cable and Matthieu Devin and Scott
                 Dietzen and Pat Helland and Dan Wolfson",
  title =        "Application servers (panel session): born-again {TP}
                 monitors for the {Web}",
  crossref =     "Sellis:2001:PAS",
  pages =        "622--622",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Haas:2001:OQP,
  author =       "Peter J. Haas and Joseph M. Hellerstein",
  title =        "Online query processing: a tutorial",
  crossref =     "Sellis:2001:PAS",
  pages =        "623--623",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gunopulos:2001:TSS,
  author =       "Dimitrios Gunopulos and Gautam Das",
  title =        "Time series similarity measures and time series
                 indexing",
  crossref =     "Sellis:2001:PAS",
  pages =        "624--624",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bussler:2001:SBI,
  author =       "Christoph Bussler",
  title =        "Semantic {B2B} integration",
  crossref =     "Sellis:2001:PAS",
  pages =        "625--625",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Casati:2001:MLD,
  author =       "Fabio Casati and Ming-Chien Shan",
  title =        "Models and languages for describing and discovering
                 {E}-services",
  crossref =     "Sellis:2001:PAS",
  pages =        "626--626",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Smith:2001:SMD,
  author =       "John R. Smith",
  title =        "Standard for multimedia databases",
  crossref =     "Sellis:2001:PAS",
  pages =        "627--627",
  year =         "2001",
  bibdate =      "Fri Oct 31 08:03:35 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Buneman:2002:ASD,
  author =       "Peter Buneman and Sanjeev Khanna and Keishi Tajima and
                 Wang-Chiew Tan",
  title =        "Archiving scientific data",
  crossref =     "Franklin:2002:PAS",
  pages =        "1--12",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Babcock:2002:MID,
  author =       "Brian Babcock and Shivnath Babu and Mayur Datar and
                 Rajeev Motwani and Jennifer Widom",
  title =        "Models and issues in data stream systems",
  crossref =     "ACM:2002:PTF",
  pages =        "1--16",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:02:24 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Riedewald:2002:EIA,
  author =       "Mirek Riedewald and Divyakant Agrawal and Amr {El
                 Abbadi}",
  title =        "Efficient integration and aggregation of historical
                 information",
  crossref =     "Franklin:2002:PAS",
  pages =        "13--24",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gottlob:2002:MDE,
  author =       "Georg Gottlob and Christoph Koch",
  title =        "Monadic datalog and the expressive power of languages
                 for web information extraction",
  crossref =     "ACM:2002:PTF",
  pages =        "17--28",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:02:24 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kalnis:2002:APP,
  author =       "Panos Kalnis and Wee Siong Ng and Beng Chin Ooi and
                 Dimitris Papadias and Kian-Lee Tan",
  title =        "An adaptive peer-to-peer network for distributed
                 caching of {OLAP} results",
  crossref =     "Franklin:2002:PAS",
  pages =        "25--36",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chen:2002:DDN,
  author =       "Chung-Min Chen and Christine T. Cheng",
  title =        "From discrepancy to declustering: near-optimal
                 multidimensional declustering strategies for range
                 queries",
  crossref =     "ACM:2002:PTF",
  pages =        "29--38",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:02:24 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Viglas:2002:RBQ,
  author =       "Stratis D. Viglas and Jeffrey F. Naughton",
  title =        "Rate-based query optimization for streaming
                 information sources",
  crossref =     "Franklin:2002:PAS",
  pages =        "37--48",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Shasha:2002:AAT,
  author =       "Dennis Shasha and Jason T. L. Wang and Rosalba
                 Giugno",
  title =        "Algorithmics and applications of tree and graph
                 searching",
  crossref =     "ACM:2002:PTF",
  pages =        "39--52",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:02:24 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Madden:2002:CAC,
  author =       "Samuel Madden and Mehul Shah and Joseph M. Hellerstein
                 and Vijayshankar Raman",
  title =        "Continuously adaptive continuous queries over
                 streams",
  crossref =     "Franklin:2002:PAS",
  pages =        "49--60",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Segoufin:2002:VSX,
  author =       "Luc Segoufin and Victor Vianu",
  title =        "Validating streaming {XML} documents",
  crossref =     "ACM:2002:PTF",
  pages =        "53--64",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:02:24 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Dobra:2002:PCA,
  author =       "Alin Dobra and Minos Garofalakis and Johannes Gehrke
                 and Rajeev Rastogi",
  title =        "Processing complex aggregate queries over data
                 streams",
  crossref =     "Franklin:2002:PAS",
  pages =        "61--72",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Miklau:2002:CEX,
  author =       "Gerome Miklau and Dan Suciu",
  title =        "Containment and equivalence for an {XPath} fragment",
  crossref =     "ACM:2002:PTF",
  pages =        "65--76",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:02:24 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Olston:2002:BEC,
  author =       "Chris Olston and Jennifer Widom",
  title =        "Best-effort cache synchronization with source
                 cooperation",
  crossref =     "Franklin:2002:PAS",
  pages =        "73--84",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Neven:2002:PWQ,
  author =       "Frank Neven",
  title =        "On the power of walking for querying tree-structured
                 data",
  crossref =     "ACM:2002:PTF",
  pages =        "77--84",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:02:24 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Arenas:2002:NFX,
  author =       "Marcelo Arenas and Leonid Libkin",
  title =        "A normal form for {XML} documents",
  crossref =     "ACM:2002:PTF",
  pages =        "85--96",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:02:24 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Zadorozhny:2002:EEQ,
  author =       "Vladimir Zadorozhny and Louiqa Raschid and Maria
                 Esther Vidal and Tolga Urhan and Laura Bright",
  title =        "Efficient evaluation of queries in a mediator for
                 {WebSources}",
  crossref =     "Franklin:2002:PAS",
  pages =        "85--96",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Datta:2002:PBA,
  author =       "Anindya Datta and Kaushik Dutta and Helen Thomas and
                 Debra VanderMeer and Suresha and Krithi Ramamritham",
  title =        "Proxy-based acceleration of dynamically generated
                 content on the world wide web: an approach and
                 implementation",
  crossref =     "Franklin:2002:PAS",
  pages =        "97--108",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Spielmann:2002:DCW,
  author =       "Marc Spielmann and Jerzy Tyszkiewicz and Jan {Van den
                 Bussche}",
  title =        "Distributed computation of web queries using
                 automata",
  crossref =     "ACM:2002:PTF",
  pages =        "97--108",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:02:24 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Grust:2002:AXL,
  author =       "Torsten Grust",
  title =        "Accelerating {XPath} location steps",
  crossref =     "Franklin:2002:PAS",
  pages =        "109--120",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ross:2002:CSC,
  author =       "Kenneth A. Ross",
  title =        "Conjunctive selection conditions in main memory",
  crossref =     "ACM:2002:PTF",
  pages =        "109--120",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:02:24 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chung:2002:AAP,
  author =       "Chin-Wan Chung and Jun-Ki Min and Kyuseok Shim",
  title =        "{APEX}: an adaptive path index for {XML} data",
  crossref =     "Franklin:2002:PAS",
  pages =        "121--132",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Zhang:2002:EAO,
  author =       "Donghui Zhang and Vassilis J. Tsotras and Dimitrios
                 Gunopulos",
  title =        "Efficient aggregation over objects with extent",
  crossref =     "ACM:2002:PTF",
  pages =        "121--132",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:02:24 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Schmidt:2002:HEM,
  author =       "Rolfe R. Schmidt and Cyrus Shahabi",
  title =        "How to evaluate multiple range-sum queries
                 progressively",
  crossref =     "ACM:2002:PTF",
  pages =        "133--141",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:02:24 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kaushik:2002:CIB,
  author =       "Raghav Kaushik and Philip Bohannon and Jeffrey F.
                 Naughton and Henry F. Korth",
  title =        "Covering indexes for branching path queries",
  crossref =     "Franklin:2002:PAS",
  pages =        "133--144",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Lechtenborger:2002:CRV,
  author =       "Jens Lechtenb{\"o}rger and Gottfried Vossen",
  title =        "On the computation of relational view complements",
  crossref =     "ACM:2002:PTF",
  pages =        "142--149",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:02:24 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Zhou:2002:IDO,
  author =       "Jingren Zhou and Kenneth A. Ross",
  title =        "Implementing database operations using {SIMD}
                 instructions",
  crossref =     "Franklin:2002:PAS",
  pages =        "145--156",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Buneman:2002:PDA,
  author =       "Peter Buneman and Sanjeev Khanna and Wang-Chiew Tan",
  title =        "On propagation of deletions and annotations through
                 views",
  crossref =     "ACM:2002:PTF",
  pages =        "150--158",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:02:24 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chen:2002:FPB,
  author =       "Shimin Chen and Phillip B. Gibbons and Todd C. Mowry
                 and Gary Valentin",
  title =        "Fractal prefetching {B}$^+$-Trees: optimizing both
                 cache and disk performance",
  crossref =     "Franklin:2002:PAS",
  pages =        "157--168",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chirkova:2002:VSP,
  author =       "Rada Chirkova",
  title =        "The view-selection problem has an exponential-time
                 lower bound for conjunctive queries and views",
  crossref =     "ACM:2002:PTF",
  pages =        "159--168",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:02:24 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hurtado:2002:ODC,
  author =       "Carlos A. Hurtado and Alberto O. Mendelzon",
  title =        "{OLAP} dimension constraints",
  crossref =     "ACM:2002:PTF",
  pages =        "169--179",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:02:24 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Li:2002:SHT,
  author =       "Wei Li and Dengfeng Gao and Richard T. Snodgrass",
  title =        "Skew handling techniques in sort-merge join",
  crossref =     "Franklin:2002:PAS",
  pages =        "169--180",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Guha:2002:FAH,
  author =       "Sudipto Guha and Nick Koudas and Divesh Srivastava",
  title =        "Fast algorithms for hierarchical range histogram
                 construction",
  crossref =     "ACM:2002:PTF",
  pages =        "180--187",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:02:24 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Freire:2002:SMX,
  author =       "Juliana Freire and Jayant R. Haritsa and Maya Ramanath
                 and Prasan Roy and J{\'e}r{\^o}me Sim{\'e}on",
  title =        "{StatiX}: making {XML} count",
  crossref =     "Franklin:2002:PAS",
  pages =        "181--191",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Mokhtar:2002:MOQ,
  author =       "Hoda Mokhtar and Jianwen Su and Oscar Ibarra",
  title =        "On moving object queries: (extended abstract)",
  crossref =     "ACM:2002:PTF",
  pages =        "188--198",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:02:24 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Papakonstantinou:2002:QQR,
  author =       "Yannis Papakonstantinou and Michalis Petropoulos and
                 Vasilis Vassalos",
  title =        "{QURSED}: querying and reporting semistructured data",
  crossref =     "Franklin:2002:PAS",
  pages =        "192--203",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cadoli:2002:KCQ,
  author =       "Marco Cadoli and Toni Mancini",
  title =        "Knowledge compilation = query rewriting + view
                 synthesis",
  crossref =     "ACM:2002:PTF",
  pages =        "199--208",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:02:24 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Tatarinov:2002:SQO,
  author =       "Igor Tatarinov and Stratis D. Viglas and Kevin Beyer
                 and Jayavel Shanmugasundaram and Eugene Shekita and
                 Chun Zhang",
  title =        "Storing and querying ordered {XML} using a relational
                 database system",
  crossref =     "Franklin:2002:PAS",
  pages =        "204--215",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Afrati:2002:AQU,
  author =       "Foto Afrati and Chen Li and Prasenjit Mitra",
  title =        "Answering queries using views with arithmetic
                 comparisons",
  crossref =     "ACM:2002:PTF",
  pages =        "209--220",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:02:24 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hacigumus:2002:ESE,
  author =       "Hakan Hacig{\"u}m{\"u}{\c{s}} and Bala Iyer and Chen
                 Li and Sharad Mehrotra",
  title =        "Executing {SQL} over encrypted data in the
                 database-service-provider model",
  crossref =     "Franklin:2002:PAS",
  pages =        "216--227",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Arasu:2002:CMR,
  author =       "Arvind Arasu and Brian Babcock and Shivnath Babu and
                 Jon McAlister and Jennifer Widom",
  title =        "Characterizing memory requirements for queries over
                 continuous data streams",
  crossref =     "ACM:2002:PTF",
  pages =        "221--232",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:02:24 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gillmann:2002:WMS,
  author =       "Michael Gillmann and Gerhard Weikum and Wolfgang
                 Wonner",
  title =        "Workflow management with service quality guarantees",
  crossref =     "Franklin:2002:PAS",
  pages =        "228--239",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Lenzerini:2002:DIT,
  author =       "Maurizio Lenzerini",
  title =        "Data integration: a theoretical perspective",
  crossref =     "ACM:2002:PTF",
  pages =        "233--246",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:02:24 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Dasu:2002:MDS,
  author =       "Tamraparni Dasu and Theodore Johnson and S.
                 Muthukrishnan and Vladislav Shkapenyuk",
  title =        "Mining database structure; or, how to build a data
                 quality browser",
  crossref =     "Franklin:2002:PAS",
  pages =        "240--251",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Calvanese:2002:LRV,
  author =       "Diego Calvanese and Giuseppe {De Giacomo} and Maurizio
                 Lenzerini and Moshe Y. Vardi",
  title =        "Lossless regular views",
  crossref =     "ACM:2002:PTF",
  pages =        "247--258",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:02:24 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Luo:2002:SHR,
  author =       "Gang Luo and Curt J. Ellmann and Peter J. Haas and
                 Jeffrey F. Naughton",
  title =        "A scalable hash ripple join algorithm",
  crossref =     "Franklin:2002:PAS",
  pages =        "252--262",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Arenas:2002:VCX,
  author =       "Marcelo Arenas and Wenfei Fan and Leonid Libkin",
  title =        "On verifying consistency of {XML} specifications",
  crossref =     "ACM:2002:PTF",
  pages =        "259--270",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:02:24 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bruno:2002:ESQ,
  author =       "Nicolas Bruno and Surajit Chaudhuri",
  title =        "Exploiting statistics on query expressions for
                 optimization",
  crossref =     "Franklin:2002:PAS",
  pages =        "263--274",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cohen:2002:LDX,
  author =       "Edith Cohen and Haim Kaplan and Tova Milo",
  title =        "Labeling dynamic {XML} trees",
  crossref =     "ACM:2002:PTF",
  pages =        "271--281",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:02:24 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Raman:2002:PRO,
  author =       "Vijayshankar Raman and Joseph M. Hellerstein",
  title =        "Partial results for online query processing",
  crossref =     "Franklin:2002:PAS",
  pages =        "275--286",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chatterji:2002:CAQ,
  author =       "S. Chatterji and S. S. K. Evani and S. Ganguly and M.
                 D. Yemmanuru",
  title =        "On the complexity of approximate query optimization",
  crossref =     "ACM:2002:PTF",
  pages =        "282--292",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:02:24 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Guha:2002:AXJ,
  author =       "Sudipto Guha and H. V. Jagadish and Nick Koudas and
                 Divesh Srivastava and Ting Yu",
  title =        "Approximate {XML} joins",
  crossref =     "Franklin:2002:PAS",
  pages =        "287--298",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chu:2002:LEC,
  author =       "Francis Chu and Joseph Halpern and Johannes Gehrke",
  title =        "Least expected cost query optimization: what can we
                 expect?",
  crossref =     "ACM:2002:PTF",
  pages =        "293--302",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:02:24 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ramanan:2002:EAM,
  author =       "Prakash Ramanan",
  title =        "Efficient algorithms for minimizing tree pattern
                 queries",
  crossref =     "Franklin:2002:PAS",
  pages =        "299--309",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bruno:2002:HTJ,
  author =       "Nicolas Bruno and Nick Koudas and Divesh Srivastava",
  title =        "Holistic twig joins: optimal {XML} pattern matching",
  crossref =     "Franklin:2002:PAS",
  pages =        "310--321",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{deVries:2002:ENS,
  author =       "Arjen P. de Vries and Nikos Mamoulis and Niels Nes and
                 Martin Kersten",
  title =        "Efficient $k$-{NN} search on vertically decomposed
                 data",
  crossref =     "Franklin:2002:PAS",
  pages =        "322--333",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Tao:2002:TPQ,
  author =       "Yufei Tao and Dimitris Papadias",
  title =        "Time-parameterized queries in spatio-temporal
                 databases",
  crossref =     "Franklin:2002:PAS",
  pages =        "334--345",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chang:2002:MPS,
  author =       "Kevin Chen-Chuan Chang and Seung-won Hwang",
  title =        "Minimal probing: supporting expensive predicates for
                 top-k queries",
  crossref =     "Franklin:2002:PAS",
  pages =        "346--357",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Polyzotis:2002:SSG,
  author =       "Neoklis Polyzotis and Minos Garofalakis",
  title =        "Statistical synopses for graph-structured {XML}
                 databases",
  crossref =     "Franklin:2002:PAS",
  pages =        "358--369",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gao:2002:CES,
  author =       "Like Gao and X. Sean Wang",
  title =        "Continually evaluating similarity-based pattern
                 queries on a streaming time series",
  crossref =     "Franklin:2002:PAS",
  pages =        "370--381",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Moon:2002:GMS,
  author =       "Yang-Sae Moon and Kyu-Young Whang and Wook-Shin Han",
  title =        "General match: a subsequence matching method in
                 time-series databases based on generalized windows",
  crossref =     "Franklin:2002:PAS",
  pages =        "382--393",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Wang:2002:CPS,
  author =       "Haixun Wang and Wei Wang and Jiong Yang and Philip S.
                 Yu",
  title =        "Clustering by pattern similarity in large data sets",
  crossref =     "Franklin:2002:PAS",
  pages =        "394--405",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Yang:2002:MLS,
  author =       "Jiong Yang and Wei Wang and Philip S. Yu and Jiawei
                 Han",
  title =        "Mining long sequential patterns in a noisy
                 environment",
  crossref =     "Franklin:2002:PAS",
  pages =        "406--417",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Procopiuc:2002:MCA,
  author =       "Cecilia M. Procopiuc and Michael Jones and Pankaj K.
                 Agarwal and T. M. Murali",
  title =        "A {Monte Carlo} algorithm for fast projective
                 clustering",
  crossref =     "Franklin:2002:PAS",
  pages =        "418--427",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Thaper:2002:DMH,
  author =       "Nitin Thaper and Sudipto Guha and Piotr Indyk and Nick
                 Koudas",
  title =        "Dynamic multidimensional histograms",
  crossref =     "Franklin:2002:PAS",
  pages =        "428--439",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Choi:2002:SES,
  author =       "Yong-Jin Choi and Chin-Wan Chung",
  title =        "Selectivity estimation for spatio-temporal queries to
                 moving objects",
  crossref =     "Franklin:2002:PAS",
  pages =        "440--451",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Aggarwal:2002:HSS,
  author =       "Charu C. Aggarwal",
  title =        "Hierarchical subspace sampling: a unified framework
                 for high dimensional data reduction, selectivity
                 estimation and nearest neighbor search",
  crossref =     "Franklin:2002:PAS",
  pages =        "452--463",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Sismanis:2002:DSP,
  author =       "Yannis Sismanis and Antonios Deligiannakis and Nick
                 Roussopoulos and Yannis Kotidis",
  title =        "{Dwarf}: shrinking the {PetaCube}",
  crossref =     "Franklin:2002:PAS",
  pages =        "464--475",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Garofalakis:2002:WSE,
  author =       "Minos Garofalakis and Phillip B. Gibbons",
  title =        "Wavelet synopses with error guarantees",
  crossref =     "Franklin:2002:PAS",
  pages =        "476--487",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chaudhuri:2002:CSW,
  author =       "Surajit Chaudhuri and Ashish Kumar Gupta and Vivek
                 Narasayya",
  title =        "Compressing {SQL} workloads",
  crossref =     "Franklin:2002:PAS",
  pages =        "488--499",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bhattacharya:2002:CBR,
  author =       "Suparna Bhattacharya and C. Mohan and Karen W. Brannon
                 and Inderpal Narang and Hui-I Hsiao and Mahadevan
                 Subramanian",
  title =        "Coordinating backup\slash recovery and data
                 consistency between database and file systems",
  crossref =     "Franklin:2002:PAS",
  pages =        "500--511",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Dogac:2002:EII,
  author =       "Asuman Dogac and Yusuf Tambag and Pinar Pembecioglu
                 and Sait Pektas and Gokce Laleci and Gokhan Kurt and
                 Serkan Toprak and Yildiray Kabak",
  title =        "An {ebXML} infrastructure implementation through
                 {UDDI} registries and {RosettaNet PIPs}",
  crossref =     "Franklin:2002:PAS",
  pages =        "512--523",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Josifovski:2002:GNF,
  author =       "Vanja Josifovski and Peter Schwarz and Laura Haas and
                 Eileen Lin",
  title =        "{Garlic}: a new flavor of federated query processing
                 for {DB2}",
  crossref =     "Franklin:2002:PAS",
  pages =        "524--532",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bumbulis:2002:CBT,
  author =       "Peter Bumbulis and Ivan T. Bowman",
  title =        "A compact {B}-tree",
  crossref =     "Franklin:2002:PAS",
  pages =        "533--541",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Weininger:2002:EEJ,
  author =       "Andreas Weininger",
  title =        "Efficient execution of joins in a star schema",
  crossref =     "Franklin:2002:PAS",
  pages =        "542--545",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kothuri:2002:QRT,
  author =       "Ravi Kanth V. Kothuri and Siva Ravada and Daniel
                 Abugov",
  title =        "Quadtree and {R}-tree indexes in {Oracle Spatial}: a
                 comparison using {GIS} data",
  crossref =     "Franklin:2002:PAS",
  pages =        "546--557",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Rao:2002:APD,
  author =       "Jun Rao and Chun Zhang and Nimrod Megiddo and Guy
                 Lohman",
  title =        "Automating physical database design in a parallel
                 database",
  crossref =     "Franklin:2002:PAS",
  pages =        "558--569",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Szalay:2002:SSP,
  author =       "Alexander S. Szalay and Jim Gray and Ani R. Thakar and
                 Peter Z. Kunszt and Tanu Malik and Jordan Raddick and
                 Christopher Stoughton and Jan vandenBerg",
  title =        "The {SDSS Skyserver}: public access to the {Sloan
                 Digital Sky Server} data",
  crossref =     "Franklin:2002:PAS",
  pages =        "570--581",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Poess:2002:TDT,
  author =       "Meikel Poess and Bryan Smith and Lubor Kollar and Paul
                 Larson",
  title =        "{TPC-DS}, taking decision support benchmarking to the
                 next level",
  crossref =     "Franklin:2002:PAS",
  pages =        "582--587",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Team:2002:MTC,
  author =       "The TimesTen Team",
  title =        "Mid-tier caching: the {TimesTen} approach",
  crossref =     "Franklin:2002:PAS",
  pages =        "588--593",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Anton:2002:WCD,
  author =       "Jesse Anton and Lawrence Jacobs and Xiang Liu and
                 Jordan Parker and Zheng Zeng and Tie Zhong",
  title =        "{Web} caching for database applications with {Oracle
                 Web Cache}",
  crossref =     "Franklin:2002:PAS",
  pages =        "594--599",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Luo:2002:MTD,
  author =       "Qiong Luo and Sailesh Krishnamurthy and C. Mohan and
                 Hamid Pirahesh and Honguk Woo and Bruce G. Lindsay and
                 Jeffrey F. Naughton",
  title =        "Middle-tier database caching for e-business",
  crossref =     "Franklin:2002:PAS",
  pages =        "600--611",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Altinel:2002:DDC,
  author =       "Mehmet Altinel and Qiong Luo and Sailesh Krishnamurthy
                 and C. Mohan and Hamid Pirahesh and Bruce G. Lindsay
                 and Honguk Woo and Larry Brown",
  title =        "{DBCache}: database caching for web application
                 servers",
  crossref =     "Franklin:2002:PAS",
  pages =        "612--612",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Markl:2002:LTA,
  author =       "Volker Markl and Guy Lohman",
  title =        "Learning table access cardinalities with {LEO}",
  crossref =     "Franklin:2002:PAS",
  pages =        "613--613",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Zhang:2002:RMD,
  author =       "Xin Zhang and Mukesh Mulchandani and Steffen Christ
                 and Brian Murphy and Elke A. Rundensteiner",
  title =        "{Rainbow}: mapping-driven {XQuery} processing system",
  crossref =     "Franklin:2002:PAS",
  pages =        "614--614",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Theobald:2002:XSE,
  author =       "Anja Theobald and Gerhard Weikum",
  title =        "The {XXL} search engine: ranked retrieval of {XML}
                 data using indexes and ontologies",
  crossref =     "Franklin:2002:PAS",
  pages =        "615--615",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Barbosa:2002:TTB,
  author =       "Denilson Barbosa and Alberto Mendelzon and John
                 Keenleyside and Kelly Lyons",
  title =        "ToXgene: a template-based data generator for {XML}",
  crossref =     "Franklin:2002:PAS",
  pages =        "616--616",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Abadi:2002:VCD,
  author =       "Daniel J. Abadi and Mitch Cherniack",
  title =        "Visual {COKO}: a debugger for query optimizer
                 development",
  crossref =     "Franklin:2002:PAS",
  pages =        "617--617",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chen:2002:XSC,
  author =       "Li Chen and Elke A. Rundensteiner and Song Wang",
  title =        "{XCache}: a semantic caching system for {XML}
                 queries",
  crossref =     "Franklin:2002:PAS",
  pages =        "618--618",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Karbhari:2002:ACD,
  author =       "Pradnya Karbhari and Michael Rabinovich and Zhen Xiao
                 and Fred Douglis",
  title =        "{ACDN}: a content delivery network for applications",
  crossref =     "Franklin:2002:PAS",
  pages =        "619--619",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Wang:2002:CTE,
  author =       "Tengjiao Wang and Shiwei Tang and Dongqing Yang and
                 Jun Gao and Yuqing Wu and Jian Pei",
  title =        "{COMMIX}: towards effective web information
                 extraction, integration and query answering",
  crossref =     "Franklin:2002:PAS",
  pages =        "620--620",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Fung:2002:CND,
  author =       "Wai Fu Fung and David Sun and Johannes Gehrke",
  title =        "{COUGAR}: the network is the database",
  crossref =     "Franklin:2002:PAS",
  pages =        "621--621",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Madden:2002:DQL,
  author =       "Samuel Madden and Joseph M. Hellerstein",
  title =        "Distributing queries over low-power wireless sensor
                 networks",
  crossref =     "Franklin:2002:PAS",
  pages =        "622--622",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cranor:2002:GHP,
  author =       "Chuck Cranor and Yuan Gao and Theodore Johnson and
                 Vlaidslav Shkapenyuk and Oliver Spatscheck",
  title =        "Gigascope: high performance network monitoring with an
                 {SQL} interface",
  crossref =     "Franklin:2002:PAS",
  pages =        "623--623",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Crescenzi:2002:RAD,
  author =       "Valter Crescenzi and Giansalvatore Mecca and Paolo
                 Merialdo",
  title =        "RoadRunner: automatic data extraction from
                 data-intensive web sites",
  crossref =     "Franklin:2002:PAS",
  pages =        "624--624",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Florescu:2002:XPW,
  author =       "Daniela Florescu and Andreas Gr{\"u}nhagen and Donald
                 Kossmann and Steffen Rost",
  title =        "{XL}: a platform for web services",
  crossref =     "Franklin:2002:PAS",
  pages =        "625--625",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Han:2002:COE,
  author =       "Jiawei Han and Jianyong Wang and Guozhu Dong and Jian
                 Pei and Ke Wang",
  title =        "{CubeExplorer}: online exploration of data cubes",
  crossref =     "Franklin:2002:PAS",
  pages =        "626--626",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Agrawal:2002:DEK,
  author =       "Sanjay Agrawal and Surajit Chaudhuri and Gautam Das",
  title =        "{DBXplorer}: enabling keyword search over relational
                 databases",
  crossref =     "Franklin:2002:PAS",
  pages =        "627--627",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Phan:2002:GTG,
  author =       "Jessica M. Phan and Raymond Ng",
  title =        "{GEA}: a toolkit for gene expression analysis",
  crossref =     "Franklin:2002:PAS",
  pages =        "628--628",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hinneburg:2002:HEV,
  author =       "Alexander Hinneburg and Daniel A. Keim and Markus
                 Wawryniuk",
  title =        "{HD-Eye}: visual clustering of high dimensional data",
  crossref =     "Franklin:2002:PAS",
  pages =        "629--629",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Lu:2002:XMY,
  author =       "Hongjun Lu and Guoren Wang and Ge Yu and Yubin Bao and
                 Jianhua Lv and Yaxin Yu",
  title =        "{XBase}: making your gigabyte disk queriable",
  crossref =     "Franklin:2002:PAS",
  pages =        "630--630",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Rundensteiner:2002:XVI,
  author =       "Elke A. Rundensteiner and Matthew O. Ward and Jing
                 Yang and Punit R. Doshi",
  title =        "XmdvTool: visual interactive data exploration and
                 trend discovery of high-dimensional data sets",
  crossref =     "Franklin:2002:PAS",
  pages =        "631--631",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hellerstein:2002:DSF,
  author =       "Joseph M. Hellerstein and Jennifer Widom",
  title =        "Data streams: fresh current or stagnant backwater?
                 (panel)",
  crossref =     "Franklin:2002:PAS",
  pages =        "632--632",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bonnet:2002:GPO,
  author =       "Philippe Bonnet",
  title =        "Going public: open-source databases and database
                 research",
  crossref =     "Franklin:2002:PAS",
  pages =        "633--633",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cotton:2002:IX,
  author =       "Paul Cotton",
  title =        "Implementing {XQuery}",
  crossref =     "Franklin:2002:PAS",
  pages =        "634--634",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Garofalakis:2002:QMD,
  author =       "Minos Garofalakis and Johannes Gehrke and Rajeev
                 Rastogi",
  title =        "Querying and mining data streams: you only get one
                 look a tutorial",
  crossref =     "Franklin:2002:PAS",
  pages =        "635--635",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Mohan:2002:TAS,
  author =       "C. Mohan",
  title =        "Tutorial: application servers and associated
                 technologies",
  crossref =     "Franklin:2002:PAS",
  pages =        "636--636",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Shasha:2002:DTP,
  author =       "Dennis Shasha and Philippe Bonnet",
  title =        "Database tuning: principles, experiments, and
                 troubleshooting techniques (part {I})",
  crossref =     "Franklin:2002:PAS",
  pages =        "637--637",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  xxtitle =      "Database tuning: principles, experiments, and
                 troubleshooting techniques (part {II})",
}

@InProceedings{Bussler:2002:SSA,
  author =       "Christoph Bussler",
  title =        "Software as a service: {ASP} and {ASP} aggregation",
  crossref =     "Franklin:2002:PAS",
  pages =        "638--638",
  year =         "2002",
  bibdate =      "Fri Oct 31 08:03:02 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ullman:2003:IED,
  author =       "Jeffrey D. Ullman",
  title =        "Improving the efficiency of database-system teaching",
  crossref =     "ACM:2003:PAS",
  pages =        "1--3",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hull:2003:SLB,
  author =       "Richard Hull and Michael Benedikt and Vassilis
                 Christophides and Jianwen Su",
  title =        "{E}-services: a look behind the curtain",
  crossref =     "ACM:2003:PTS",
  pages =        "1--14",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:02:47 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Al-Khalifa:2003:QST,
  author =       "Shurug Al-Khalifa and Cong Yu and H. V. Jagadish",
  title =        "Querying structured text in an {XML} database",
  crossref =     "ACM:2003:PAS",
  pages =        "4--15",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Arenas:2003:ITA,
  author =       "Marcelo Arenas and Leonid Libkin",
  title =        "An information-theoretic approach to normal forms for
                 relational and {XML} data",
  crossref =     "ACM:2003:PTS",
  pages =        "15--26",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:02:47 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Guo:2003:XRK,
  author =       "Lin Guo and Feng Shao and Chavdar Botev and Jayavel
                 Shanmugasundaram",
  title =        "{XRANK}: ranked keyword search over {XML} documents",
  crossref =     "ACM:2003:PAS",
  pages =        "16--27",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Khuller:2003:ADM,
  author =       "Samir Khuller and Yoo-Ah Kim and Yung-Chun (Justin)
                 Wan",
  title =        "Algorithms for data migration with cloning",
  crossref =     "ACM:2003:PTS",
  pages =        "27--36",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:02:47 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Babcock:2003:DTK,
  author =       "Brian Babcock and Chris Olston",
  title =        "Distributed top-k monitoring",
  crossref =     "ACM:2003:PAS",
  pages =        "28--39",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Agrawal:2003:PDS,
  author =       "Rakesh Agrawal",
  title =        "Privacy in data systems",
  crossref =     "ACM:2003:PTS",
  pages =        "37--37",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:02:47 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chirkova:2003:MVM,
  author =       "Rada Chirkova and Chen Li",
  title =        "Materializing views with minimal size to answer
                 queries",
  crossref =     "ACM:2003:PTS",
  pages =        "38--48",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:02:47 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Das:2003:AJP,
  author =       "Abhinandan Das and Johannes Gehrke and Mirek
                 Riedewald",
  title =        "Approximate join processing over data streams",
  crossref =     "ACM:2003:PAS",
  pages =        "40--51",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Lechtenborger:2003:ICC,
  author =       "Jens Lechtenb{\"o}rger",
  title =        "The impact of the constant complement approach towards
                 view updating",
  crossref =     "ACM:2003:PTS",
  pages =        "49--55",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:02:47 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Witkowski:2003:SRO,
  author =       "Andrew Witkowski and Srikanth Bellamkonda and Tolga
                 Bozkaya and Gregory Dorman and Nathan Folkert and
                 Abhinav Gupta and Lei Shen and Sankar Subramanian",
  title =        "Spreadsheets in {RDBMS} for {OLAP}",
  crossref =     "ACM:2003:PAS",
  pages =        "52--63",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Calvanese:2003:VBQ,
  author =       "Diego Calvanese and Giuseppe {De Giacomo} and Maurizio
                 Lenzerini and Moshe Y. Vardi",
  title =        "View-based query containment",
  crossref =     "ACM:2003:PTS",
  pages =        "56--67",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:02:47 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Lakshmanan:2003:QTE,
  author =       "Laks V. S. Lakshmanan and Jian Pei and Yan Zhao",
  title =        "{QC}-trees: an efficient summary structure for
                 semantic {OLAP}",
  crossref =     "ACM:2003:PAS",
  pages =        "64--75",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gupta:2003:VSP,
  author =       "Ashish Kumar Gupta and Dan Suciu and Alon Y. Halevy",
  title =        "The view selection problem for {XML} content based
                 routing",
  crossref =     "ACM:2003:PTS",
  pages =        "68--77",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:02:47 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Schleimer:2003:WLA,
  author =       "Saul Schleimer and Daniel S. Wilkerson and Alex
                 Aiken",
  title =        "Winnowing: local algorithms for document
                 fingerprinting",
  crossref =     "ACM:2003:PAS",
  pages =        "76--85",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kanza:2003:CFD,
  author =       "Yaron Kanza and Yehoshua Sagiv",
  title =        "Computing full disjunctions",
  crossref =     "ACM:2003:PTS",
  pages =        "78--89",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:02:47 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Agrawal:2003:ISA,
  author =       "Rakesh Agrawal and Alexandre Evfimievski and
                 Ramakrishnan Srikant",
  title =        "Information sharing across private databases",
  crossref =     "ACM:2003:PAS",
  pages =        "86--97",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Fagin:2003:DEG,
  author =       "Ronald Fagin and Phokion G. Kolaitis and Lucian Popa",
  title =        "Data exchange: getting to the core",
  crossref =     "ACM:2003:PTS",
  pages =        "90--101",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:02:47 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Sion:2003:RPR,
  author =       "Radu Sion and Mikhail Atallah and Sunil Prabhakar",
  title =        "Rights protection for relational data",
  crossref =     "ACM:2003:PAS",
  pages =        "98--109",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Behrend:2003:SSM,
  author =       "Andreas Behrend",
  title =        "Soft stratification for magic set based query
                 evaluation in deductive databases",
  crossref =     "ACM:2003:PTS",
  pages =        "102--110",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:02:47 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Wang:2003:VDI,
  author =       "Haixun Wang and Sanghyun Park and Wei Fan and Philip
                 S. Yu",
  title =        "{ViST}: a dynamic index method for querying {XML} data
                 by tree structures",
  crossref =     "ACM:2003:PAS",
  pages =        "110--121",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Grahne:2003:QCR,
  author =       "G{\"o}sta Grahne and Alex Thomo",
  title =        "Query containment and rewriting using views for
                 regular path queries under constraints",
  crossref =     "ACM:2003:PTS",
  pages =        "111--122",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:02:47 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Min:2003:XQC,
  author =       "Jun-Ki Min and Myung-Jae Park and Chin-Wan Chung",
  title =        "{XPRESS}: a queriable compression for {XML} data",
  crossref =     "ACM:2003:PAS",
  pages =        "122--133",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Mendelzon:2003:CDS,
  author =       "Alberto O. Mendelzon and Ken Q. Pu",
  title =        "Concise descriptions of subsets of structured sets",
  crossref =     "ACM:2003:PTS",
  pages =        "123--133",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:02:47 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Dittrich:2003:PJR,
  author =       "Jens-Peter Dittrich and Bernhard Seeger and David Scot
                 Taylor and Peter Widmayer",
  title =        "On producing join results early",
  crossref =     "ACM:2003:PTS",
  pages =        "134--142",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:02:47 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chen:2003:DKI,
  author =       "Qun Chen and Andrew Lim and Kian Win Ong",
  title =        "{D}(k)-index: an adaptive structural summary for
                 graph-structured data",
  crossref =     "ACM:2003:PAS",
  pages =        "134--144",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Garofalakis:2003:CXD,
  author =       "Minos Garofalakis and Amit Kumar",
  title =        "Correlating {XML} data streams using tree-edit
                 distance embeddings",
  crossref =     "ACM:2003:PTS",
  pages =        "143--154",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:02:47 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Wang:2003:CJS,
  author =       "Wei Wang and Haifeng Jiang and Hongjun Lu and Jeffrey
                 Xu Yu",
  title =        "Containment join size estimation: models and methods",
  crossref =     "ACM:2003:PAS",
  pages =        "145--156",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Seidl:2003:NDQ,
  author =       "Helmut Seidl and Thomas Schwentick and Anca Muscholl",
  title =        "Numerical document queries",
  crossref =     "ACM:2003:PTS",
  pages =        "155--166",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:02:47 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Mamoulis:2003:EPJ,
  author =       "Nikos Mamoulis",
  title =        "Efficient processing of joins on set-valued
                 attributes",
  crossref =     "ACM:2003:PAS",
  pages =        "157--168",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Segoufin:2003:TQX,
  author =       "Luc Segoufin",
  title =        "Typing and querying {XML} documents: some complexity
                 bounds",
  crossref =     "ACM:2003:PTS",
  pages =        "167--178",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:02:47 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Dyreson:2003:TCN,
  author =       "Curtis E. Dyreson",
  title =        "Temporal coalescing with {\em now\/} granularity, and
                 incomplete information",
  crossref =     "ACM:2003:PAS",
  pages =        "169--180",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gottlob:2003:CXQ,
  author =       "Georg Gottlob and Christoph Koch and Reinhard
                 Pichler",
  title =        "The complexity of {XPath} query evaluation",
  crossref =     "ACM:2003:PTS",
  pages =        "179--190",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:02:47 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Zhu:2003:WIE,
  author =       "Yunyue Zhu and Dennis Shasha",
  title =        "Warping indexes with envelope transforms for query by
                 humming",
  crossref =     "ACM:2003:PAS",
  pages =        "181--192",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gross-Amblard:2003:QPW,
  author =       "David Gross-Amblard",
  title =        "Query-preserving watermarking of relational databases
                 and {XML} documents",
  crossref =     "ACM:2003:PTS",
  pages =        "191--201",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:02:47 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Melnik:2003:RPP,
  author =       "Sergey Melnik and Erhard Rahm and Philip A.
                 Bernstein",
  title =        "Rondo: a programming platform for generic model
                 management",
  crossref =     "ACM:2003:PAS",
  pages =        "193--204",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Dinur:2003:RIW,
  author =       "Irit Dinur and Kobbi Nissim",
  title =        "Revealing information while preserving privacy",
  crossref =     "ACM:2003:PTS",
  pages =        "202--210",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:02:47 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kang:2003:SMO,
  author =       "Jaewoo Kang and Jeffrey F. Naughton",
  title =        "On schema matching with opaque column names and data
                 values",
  crossref =     "ACM:2003:PAS",
  pages =        "205--216",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Evfimievski:2003:LPB,
  author =       "Alexandre Evfimievski and Johannes Gehrke and
                 Ramakrishnan Srikant",
  title =        "Limiting privacy breaches in privacy preserving data
                 mining",
  crossref =     "ACM:2003:PTS",
  pages =        "211--222",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:02:47 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{He:2003:SSM,
  author =       "Bin He and Kevin Chen-Chuan Chang",
  title =        "Statistical schema matching across web query
                 interfaces",
  crossref =     "ACM:2003:PAS",
  pages =        "217--228",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cohen:2003:MTD,
  author =       "Edith Cohen and Martin Strauss",
  title =        "Maintaining time-decaying stream aggregates",
  crossref =     "ACM:2003:PTS",
  pages =        "223--233",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:02:47 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Deligiannakis:2003:EWM,
  author =       "Antonios Deligiannakis and Nick Roussopoulos",
  title =        "Extended wavelets for multiple measures",
  crossref =     "ACM:2003:PAS",
  pages =        "229--240",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Babcock:2003:MVM,
  author =       "Brain Babcock and Mayur Datar and Rajeev Motwani and
                 Liadan O'Callaghan",
  title =        "Maintaining variance and $k$-medians over data stream
                 windows",
  crossref =     "ACM:2003:PTS",
  pages =        "234--243",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:02:47 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cohen:2003:SBF,
  author =       "Saar Cohen and Yossi Matias",
  title =        "Spectral bloom filters",
  crossref =     "ACM:2003:PAS",
  pages =        "241--252",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Heeren:2003:OIU,
  author =       "C. Heeren and H. V. Jagadish and L. Pitt",
  title =        "Optimal indexing using near-minimal space",
  crossref =     "ACM:2003:PTS",
  pages =        "244--251",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:02:47 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Aggarwal:2003:NNI,
  author =       "Charu C. Aggarwal and Dakshi Agrawal",
  title =        "On nearest neighbor indexing of nonlinear
                 trajectories",
  crossref =     "ACM:2003:PTS",
  pages =        "252--259",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:02:47 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Babcock:2003:COS,
  author =       "Brian Babcock and Shivnath Babu and Rajeev Motwani and
                 Mayur Datar",
  title =        "Chain: operator scheduling for memory minimization in
                 data stream systems",
  crossref =     "ACM:2003:PAS",
  pages =        "253--264",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cali:2003:DCQ,
  author =       "Andrea Cal{\`\i} and Domenico Lembo and Riccardo
                 Rosati",
  title =        "On the decidability and complexity of query answering
                 over inconsistent and incomplete databases",
  crossref =     "ACM:2003:PTS",
  pages =        "260--271",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:02:47 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ganguly:2003:PSE,
  author =       "Sumit Ganguly and Minos Garofalakis and Rajeev
                 Rastogi",
  title =        "Processing set expressions over continuous update
                 streams",
  crossref =     "ACM:2003:PAS",
  pages =        "265--276",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kifer:2003:HQF,
  author =       "Daniel Kifer and Johannes Gehrke and Cristian Bucila
                 and Walker White",
  title =        "How to quickly find a witness",
  crossref =     "ACM:2003:PTS",
  pages =        "272--283",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:02:47 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Benedikt:2003:CBT,
  author =       "Michael Benedikt and Chee-Yong Chan and Wenfei Fan and
                 Juliana Freire and Rajeev Rastogi",
  title =        "Capturing both types and constraints in data
                 integration",
  crossref =     "ACM:2003:PAS",
  pages =        "277--288",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ramesh:2003:FID,
  author =       "Ganesh Ramesh and William A. Maniatty and Mohammed J.
                 Zaki",
  title =        "Feasible itemset distributions in data mining: theory
                 and application",
  crossref =     "ACM:2003:PTS",
  pages =        "284--295",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:02:47 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Milo:2003:EIX,
  author =       "Tova Milo and Serge Abiteboul and Bernd Amann and Omar
                 Benjelloun and Fred Dang Ngoc",
  title =        "Exchanging intensional {XML} data",
  crossref =     "ACM:2003:PAS",
  pages =        "289--300",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cormode:2003:WHW,
  author =       "Graham Cormode and S. Muthukrishnan",
  title =        "What's hot and what's not: tracking most frequent
                 items dynamically",
  crossref =     "ACM:2003:PTS",
  pages =        "296--306",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:02:47 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Fagin:2003:ESS,
  author =       "Ronald Fagin and Ravi Kumar and D. Sivakumar",
  title =        "Efficient similarity search and classification via
                 rank aggregation",
  crossref =     "ACM:2003:PAS",
  pages =        "301--312",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chaudhuri:2003:REF,
  author =       "Surajit Chaudhuri and Kris Ganjam and Venkatesh Ganti
                 and Rajeev Motwani",
  title =        "Robust and efficient fuzzy match for online data
                 cleaning",
  crossref =     "ACM:2003:PAS",
  pages =        "313--324",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kementsietsidis:2003:MDP,
  author =       "Anastasios Kementsietsidis and Marcelo Arenas and
                 Ren{\'e}e J. Miller",
  title =        "Mapping data in peer-to-peer systems: semantics and
                 algorithmic issues",
  crossref =     "ACM:2003:PAS",
  pages =        "325--336",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Arasu:2003:ESD,
  author =       "Arvind Arasu and Hector Garcia-Molina and Stanford
                 University",
  title =        "Extracting structured data from {Web} pages",
  crossref =     "ACM:2003:PAS",
  pages =        "337--348",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Stolte:2003:SDR,
  author =       "Etzard Stolte and Christoph von Praun and Gustavo
                 Alonso and Thomas Gross",
  title =        "Scientific data repositories: designing for a moving
                 target",
  crossref =     "ACM:2003:PAS",
  pages =        "349--360",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chaudhuri:2003:FCP,
  author =       "Surajit Chaudhuri and Prasanna Ganesan and Sunita
                 Sarawagi",
  title =        "Factorizing complex predicates in queries to exploit
                 indexes",
  crossref =     "ACM:2003:PAS",
  pages =        "361--372",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ilyas:2003:ECT,
  author =       "Ihab F. Ilyas and Jun Rao and Guy Lohman and Dengfeng
                 Gao and Eileen Lin",
  title =        "Estimating compilation time of a query optimizer",
  crossref =     "ACM:2003:PAS",
  pages =        "373--384",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Reiss:2003:CSQ,
  author =       "Frederick R. Reiss and Tapas Kanungo",
  title =        "A characterization of the sensitivity of query
                 optimization to storage access cost parameters",
  crossref =     "ACM:2003:PAS",
  pages =        "385--396",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Lomet:2003:TRR,
  author =       "David Lomet and Mark Tuttle",
  title =        "A theory of redo recovery",
  crossref =     "ACM:2003:PAS",
  pages =        "397--406",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bierman:2003:FSA,
  author =       "G. M. Bierman",
  title =        "Formal semantics and analysis of object queries",
  crossref =     "ACM:2003:PAS",
  pages =        "407--418",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gupta:2003:SPX,
  author =       "Ashish Kumar Gupta and Dan Suciu",
  title =        "Stream processing of {XPath} queries with predicates",
  crossref =     "ACM:2003:PAS",
  pages =        "419--430",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Peng:2003:XQS,
  author =       "Feng Peng and Sudarshan S. Chawathe",
  title =        "{XPath} queries on streaming data",
  crossref =     "ACM:2003:PAS",
  pages =        "431--442",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Zhang:2003:LBS,
  author =       "Jun Zhang and Manli Zhu and Dimitris Papadias and
                 Yufei Tao and Dik Lun Lee",
  title =        "Location-based spatial queries",
  crossref =     "ACM:2003:PAS",
  pages =        "443--454",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Sun:2003:HAS,
  author =       "Chengyu Sun and Divyakant Agrawal and Amr {El
                 Abbadi}",
  title =        "Hardware acceleration for spatial selections and
                 joins",
  crossref =     "ACM:2003:PAS",
  pages =        "455--466",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Papadias:2003:OPA,
  author =       "Dimitris Papadias and Yufei Tao and Greg Fu and
                 Bernhard Seeger",
  title =        "An optimal and progressive algorithm for skyline
                 queries",
  crossref =     "ACM:2003:PAS",
  pages =        "467--478",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cui:2003:CHD,
  author =       "Bin Cui and Beng Chin Ooi and Jianwen Su and Kian-Lee
                 Tan",
  title =        "Contorting high dimensional data for efficient main
                 memory {KNN} processing",
  crossref =     "ACM:2003:PAS",
  pages =        "479--490",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Madden:2003:DAQ,
  author =       "Samuel Madden and Michael J. Franklin and Joseph M.
                 Hellerstein and Wei Hong",
  title =        "The design of an acquisitional query processor for
                 sensor networks",
  crossref =     "ACM:2003:PAS",
  pages =        "491--502",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Deshpande:2003:CQW,
  author =       "Amol Deshpande and Suman Nath and Phillip B. Gibbons
                 and Srinivasan Seshan",
  title =        "Cache-and-query for wide area sensor databases",
  crossref =     "ACM:2003:PAS",
  pages =        "503--514",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Li:2003:CXT,
  author =       "Chengkai Li and Philip Bohannon and P. P. S. Narayan",
  title =        "Composing {XSL} transformations with {XML} publishing
                 views",
  crossref =     "ACM:2003:PAS",
  pages =        "515--526",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Abiteboul:2003:DXD,
  author =       "Serge Abiteboul and Angela Bonifati and Gr{\'e}gory
                 Cob{\'e}na and Ioana Manolescu and Tova Milo",
  title =        "Dynamic {XML} documents with distribution and
                 replication",
  crossref =     "ACM:2003:PAS",
  pages =        "527--538",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Babcock:2003:DSS,
  author =       "Brian Babcock and Surajit Chaudhuri and Gautam Das",
  title =        "Dynamic sample selection for approximate query
                 processing",
  crossref =     "ACM:2003:PAS",
  pages =        "539--550",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cheng:2003:EPQ,
  author =       "Reynold Cheng and Dmitri V. Kalashnikov and Sunil
                 Prabhakar",
  title =        "Evaluating probabilistic queries over imprecise data",
  crossref =     "ACM:2003:PAS",
  pages =        "551--562",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Olston:2003:AFC,
  author =       "Chris Olston and Jing Jiang and Jennifer Widom",
  title =        "Adaptive filters for continuous queries over
                 distributed data streams",
  crossref =     "ACM:2003:PAS",
  pages =        "563--574",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Aggarwal:2003:FDC,
  author =       "Charu C. Aggarwal",
  title =        "A framework for diagnosing changes in evolving data
                 streams",
  crossref =     "ACM:2003:PAS",
  pages =        "575--586",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kriegel:2003:USF,
  author =       "Hans-Peter Kriegel and Stefan Brecheisen and Peer
                 Kr{\"o}ger and Martin Pfeifle and Matthias Schubert",
  title =        "Using sets of feature vectors for similarity search on
                 voxelized {CAD} objects",
  crossref =     "ACM:2003:PAS",
  pages =        "587--598",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kim:2003:QRF,
  author =       "Deok-Hwan Kim and Chin-Wan Chung",
  title =        "{QCluster}: relevance feedback using adaptive
                 clustering for content-based image retrieval",
  crossref =     "ACM:2003:PAS",
  pages =        "599--610",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chaudhuri:2003:RSX,
  author =       "Surajit Chaudhuri and Raghav Kaushik and Jeffrey F.
                 Naughton",
  title =        "On relational support for {XML} publishing: beyond
                 sorting and tagging",
  crossref =     "ACM:2003:PAS",
  pages =        "611--622",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{DeHaan:2003:CXS,
  author =       "David DeHaan and David Toman and Mariano P. Consens
                 and M. Tamer {\"O}zsu",
  title =        "A comprehensive {XQuery} to {SQL} translation using
                 dynamic interval encoding",
  crossref =     "ACM:2003:PAS",
  pages =        "623--634",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ives:2003:AII,
  author =       "Zachary Ives",
  title =        "Abstracts of invited industrial track presentations",
  crossref =     "ACM:2003:PAS",
  pages =        "635--635",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Padmanabhan:2003:MDC,
  author =       "Sriram Padmanabhan and Bishwaranjan Bhattacharjee and
                 Tim Malkemus and Leslie Cranston and Matthew Huras",
  title =        "Multi-dimensional clustering: a new data layout scheme
                 in {DB2}",
  crossref =     "ACM:2003:PAS",
  pages =        "637--641",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Goto:2003:IET,
  author =       "Koichi Goto and Yahiko Kambayashi",
  title =        "Integration of electronic tickets and personal guide
                 system for public transport using mobile terminals",
  crossref =     "ACM:2003:PAS",
  pages =        "642--646",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cranor:2003:GSD,
  author =       "Chuck Cranor and Theodore Johnson and Oliver
                 Spataschek and Vladislav Shkapenyuk",
  title =        "Gigascope: a stream database for network
                 applications",
  crossref =     "ACM:2003:PAS",
  pages =        "647--651",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Zuzarte:2003:WSE,
  author =       "Calisto Zuzarte and Hamid Pirahesh and Wenbin Ma and
                 Qi Cheng and Linqi Liu and Kwai Wong",
  title =        "{WinMagic}: subquery elimination using window
                 aggregation",
  crossref =     "ACM:2003:PAS",
  pages =        "652--656",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Shen:2003:CND,
  author =       "Jialie Shen and Anne H. H. Ngu and John Shepherd and
                 Du Q. Huynh and Quan Z. Sheng",
  title =        "{CMVF}: a novel dimension reduction scheme for
                 efficient indexing in a large image database",
  crossref =     "ACM:2003:PAS",
  pages =        "657--657",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Lakshmanan:2003:SSO,
  author =       "Laks V. S. Lakshmanan and Jian Pei and Yan Zhao",
  title =        "{SOCQET}: semantic {OLAP} with compressed cube and
                 summarization",
  crossref =     "ACM:2003:PAS",
  pages =        "658--658",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ooi:2003:PPP,
  author =       "Beng Chin Ooi and Kian-Lee Tan and Aoying Zhou and
                 Chin Hong Goh and Yingguang Li and Chu Yee Liau and Bo
                 Ling and Wee Siong Ng and Yanfeng Shu and Xiaoyu Wang
                 and Ming Zhang",
  title =        "{PeerDB}: peering into personal databases",
  crossref =     "ACM:2003:PAS",
  pages =        "659--659",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Liu:2003:GRI,
  author =       "David T. Liu and Michael J. Franklin and Devesh
                 Parekh",
  title =        "{GridDB}: a relational interface for the grid",
  crossref =     "ACM:2003:PAS",
  pages =        "660--660",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Larson:2003:TMT,
  author =       "Per-{\AA}ke Larson and Jonathan Goldstein and Jingren
                 Zhou",
  title =        "Transparent mid-tier database caching in {SQL}
                 server",
  crossref =     "ACM:2003:PAS",
  pages =        "661--661",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bornhovd:2003:DMT,
  author =       "Christof Bornh{\"o}vd and Mehmet Altinel and Sailesh
                 Krishnamurthy and C. Mohan and Hamid Pirahesh and
                 Berthold Reinwald",
  title =        "{DBCache}: middle-tier database caching for highly
                 scalable e-business architectures",
  crossref =     "ACM:2003:PAS",
  pages =        "662--662",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Agichtein:2003:QBB,
  author =       "Eugene Agichtein and Luis Gravano",
  title =        "{QXtract}: a building block for efficient information
                 extraction from text databases",
  crossref =     "ACM:2003:PAS",
  pages =        "663--663",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Amer-Yahia:2003:PEA,
  author =       "Sihem Amer-Yahia and Mary Fern{\'a}ndez and Divesh
                 Srivastava and Yu Xu",
  title =        "{PIX}: exact and approximate phrase matching in
                 {XML}",
  crossref =     "ACM:2003:PAS",
  pages =        "664--664",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Arasu:2003:SSS,
  author =       "Arvind Arasu and Brian Babcock and Shivnath Babu and
                 Mayur Datar and Keith Ito and Itaru Nishizawa and
                 Justin Rosenstein and Jennifer Widom",
  title =        "{STREAM}: the {Stanford Stream Data Manager}
                 (demonstration description)",
  crossref =     "ACM:2003:PAS",
  pages =        "665--665",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Abadi:2003:ADS,
  author =       "D. Abadi and D. Carney and U. {\c{C}}etintemel and M.
                 Cherniack and C. Convey and C. Erwin and E. Galvez and
                 M. Hatoun and A. Maskey and A. Rasin and A. Singer and
                 M. Stonebraker and N. Tatbul and Y. Xing and R. Yan and
                 S. Zdonik",
  title =        "Aurora: a data stream management system",
  crossref =     "ACM:2003:PAS",
  pages =        "666--666",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Deshpande:2003:IIS,
  author =       "Amol Deshpande and Suman Nath and Phillip B. Gibbons
                 and Srinivasan Seshan",
  title =        "{IrisNet}: {Internet}-scale resource-intensive sensor
                 services",
  crossref =     "ACM:2003:PAS",
  pages =        "667--667",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chandrasekaran:2003:TCD,
  author =       "Sirish Chandrasekaran and Owen Cooper and Amol
                 Deshpande and Michael J. Franklin and Joseph M.
                 Hellerstein and Wei Hong and Sailesh Krishnamurthy and
                 Samuel R. Madden and Fred Reiss and Mehul A. Shah",
  title =        "{TelegraphCQ}: continuous dataflow processing",
  crossref =     "ACM:2003:PAS",
  pages =        "668--668",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cho:2003:LSE,
  author =       "SungRan Cho and Sihem Amer-Yahia and Laks V. S.
                 Lakshmanan and Divesh Srivastava",
  title =        "{LockX}: a system for efficiently querying secure
                 {XML}",
  crossref =     "ACM:2003:PAS",
  pages =        "669--669",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Zhou:2003:TDC,
  author =       "Aoying Zhou and Qing Wang and Zhimao Guo and Xueqing
                 Gong and Shihui Zheng and Hongwei Wu and Jianchang Xiao
                 and Kun Yue and Wenfei Fan",
  title =        "{TREX}: {DTD}-conforming {XML} to {XML}
                 transformations",
  crossref =     "ACM:2003:PAS",
  pages =        "670--670",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Zhang:2003:RMX,
  author =       "Xin Zhang and Katica Dimitrova and Ling Wang and Maged
                 El Sayed and Brian Murphy and Bradford Pielech and
                 Mukesh Mulchandani and Luping Ding and Elke A.
                 Rundensteiner",
  title =        "Rainbow: multi-{XQuery} optimization using
                 materialized {XML} views",
  crossref =     "ACM:2003:PAS",
  pages =        "671--671",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Paparizos:2003:TNS,
  author =       "Stelios Paparizos and Shurug Al-Khalifa and Adriane
                 Chapman and H. V. Jagadish and Laks V. S. Lakshmanan
                 and Andrew Nierman and Jignesh M. Patel and Divesh
                 Srivastava and Nuwee Wiwatwattana and Yuqing Wu and
                 Cong Yu",
  title =        "{TIMBER}: a native system for querying {XML}",
  crossref =     "ACM:2003:PAS",
  pages =        "672--672",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bohannon:2003:RRL,
  author =       "Philip Bohannon and Xin (Luna) Dong and Sumit Ganguly
                 and Henry F. Korth and Chengkai Li and P. P. S. Narayan
                 and Pradeep Shenoy",
  title =        "{ROLEX}: relational on-line exchange with {XML}",
  crossref =     "ACM:2003:PAS",
  pages =        "673--673",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Agrawal:2003:SWR,
  author =       "Rakesh Agrawal and Peter J. Haas and Jerry Kiernan",
  title =        "A system for watermarking relational databases",
  crossref =     "ACM:2003:PAS",
  pages =        "674--674",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Zhu:2003:QHA,
  author =       "Yunyue Zhu and Dennis Shasha and Xiaojian Zhao",
  title =        "Query by humming: in action with its technology
                 revealed",
  crossref =     "ACM:2003:PAS",
  pages =        "675--675",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Sengar:2003:PRQ,
  author =       "Vibhuti S. Sengar and Jayant R. Haritsa",
  title =        "{PLASTIC}: reducing query optimization overheads
                 through plan recycling",
  crossref =     "ACM:2003:PAS",
  pages =        "676--676",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Korn:2003:IVC,
  author =       "Flip Korn and S. Muthukrishnan and Yunyue Zhu",
  title =        "{IPSOFACTO}: a visual correlation tool for aggregate
                 network traffic data",
  crossref =     "ACM:2003:PAS",
  pages =        "677--677",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gupta:2003:BMS,
  author =       "Amarnath Gupta and Bertram Lud{\"a}scher and Maryann
                 E. Martone",
  title =        "{BIRN-M}: a semantic mediator for solving real-world
                 neuroscience problems",
  crossref =     "ACM:2003:PAS",
  pages =        "678--678",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Koudas:2003:PQN,
  author =       "Nick Koudas and Divesh Srivastava",
  title =        "Panel: querying networked databases",
  crossref =     "ACM:2003:PAS",
  pages =        "679--679",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gray:2003:LR,
  author =       "Jim Gray and Hans Schek and Michael Stonebraker and
                 Jeff Ullman",
  title =        "The {Lowell Report}",
  crossref =     "ACM:2003:PAS",
  pages =        "680--680",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Johnson:2003:DQD,
  author =       "Theodore Johnson and Tamraparni Dasu",
  title =        "Data quality and data cleaning: an overview",
  crossref =     "ACM:2003:PAS",
  pages =        "681--681",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chamberlin:2003:XQL,
  author =       "Don Chamberlin",
  title =        "{XQuery}: a query language for {XML}",
  crossref =     "ACM:2003:PAS",
  pages =        "682--682",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Jagatheesan:2003:DGM,
  author =       "Arun Jagatheesan and Arcot Rajasekar",
  title =        "Data grid management systems",
  crossref =     "ACM:2003:PAS",
  pages =        "683--683",
  year =         "2003",
  bibdate =      "Fri Oct 31 08:03:18 MST 2003",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gray:2004:NDR,
  author =       "Jim Gray",
  title =        "The next database revolution",
  crossref =     "ACM:2004:PAS",
  pages =        "1--4",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Maurer:2004:RCD,
  author =       "Ueli Maurer",
  title =        "The role of cryptography in database security",
  crossref =     "ACM:2004:PAS",
  pages =        "5--10",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Jain:2004:ASR,
  author =       "Ankur Jain and Edward Y. Chang and Yuan-Fang Wang",
  title =        "Adaptive stream resource management using {Kalman
                 Filters}",
  crossref =     "ACM:2004:PAS",
  pages =        "11--22",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Wu:2004:OED,
  author =       "Huanmei Wu and Betty Salzberg and Donghui Zhang",
  title =        "Online event-driven subsequence matching over
                 financial data streams",
  crossref =     "ACM:2004:PAS",
  pages =        "23--34",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cormode:2004:HUS,
  author =       "Graham Cormode and Theodore Johnson and Flip Korn and
                 S. Muthukrishnan and Oliver Spatscheck and Divesh
                 Srivastava",
  title =        "Holistic {UDAFs} at streaming speeds",
  crossref =     "ACM:2004:PAS",
  pages =        "35--46",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chen:2004:BEX,
  author =       "Yi Chen and Susan B. Davidson and Yifeng Zheng",
  title =        "{BLAS}: an efficient {XPath} processing system",
  crossref =     "ACM:2004:PAS",
  pages =        "47--58",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Jiang:2004:EPX,
  author =       "Haifeng Jiang and Hongjun Lu and Wei Wang",
  title =        "Efficient processing of {XML} twig queries with
                 {OR}-predicates",
  crossref =     "ACM:2004:PAS",
  pages =        "59--70",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Paparizos:2004:TLC,
  author =       "Stelios Paparizos and Yuqing Wu and Laks V. S.
                 Lakshmanan and H. V. Jagadish",
  title =        "Tree logical classes for efficient evaluation of
                 {XQuery}",
  crossref =     "ACM:2004:PAS",
  pages =        "71--82",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Amer-Yahia:2004:FFS,
  author =       "Sihem Amer-Yahia and Laks V. S. Lakshmanan and
                 Shashank Pandit",
  title =        "{FleXPath}: flexible structure and full-text querying
                 for {XML}",
  crossref =     "ACM:2004:PAS",
  pages =        "83--94",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Wu:2004:ICB,
  author =       "Wensheng Wu and Clement Yu and AnHai Doan and Weiyi
                 Meng",
  title =        "An interactive clustering-based approach to
                 integrating source query interfaces on the deep {Web}",
  crossref =     "ACM:2004:PAS",
  pages =        "95--106",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Zhang:2004:UWQ,
  author =       "Zhen Zhang and Bin He and Kevin Chen-Chuan Chang",
  title =        "Understanding {Web} query interfaces: best-effort
                 parsing with hidden syntax",
  crossref =     "ACM:2004:PAS",
  pages =        "107--118",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Lerman:2004:USW,
  author =       "Kristina Lerman and Lise Getoor and Steven Minton and
                 Craig Knoblock",
  title =        "Using the structure of {Web} sites for automatic
                 segmentation of tables",
  crossref =     "ACM:2004:PAS",
  pages =        "119--130",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Vlachos:2004:ISP,
  author =       "Michail Vlachos and Chris Meek and Zografoula Vagena
                 and Dimitrios Gunopulos",
  title =        "Identifying similarities, periodicities and bursts for
                 online search queries",
  crossref =     "ACM:2004:PAS",
  pages =        "131--142",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cong:2004:FFI,
  author =       "Gao Cong and Anthony K. H. Tung and Xin Xu and Feng
                 Pan and Jiong Yang",
  title =        "{FARMER}: finding interesting rule groups in
                 microarray datasets",
  crossref =     "ACM:2004:PAS",
  pages =        "143--154",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cormode:2004:DRF,
  author =       "Graham Cormode and Flip Korn and S. Muthukrishnan and
                 Divesh Srivastava",
  title =        "Diamond in the rough: finding {Hierarchical Heavy
                 Hitters} in multi-dimensional data",
  crossref =     "ACM:2004:PAS",
  pages =        "155--166",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chen:2004:CBL,
  author =       "Lei Chen and Zheng Huang and Raghu Ramakrishnan",
  title =        "Cost-based labeling of groups of mass spectra",
  crossref =     "ACM:2004:PAS",
  pages =        "167--178",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bowman:2004:OQS,
  author =       "Ivan T. Bowman and Kenneth Salem",
  title =        "Optimization of query streams using semantic
                 prefetching",
  crossref =     "ACM:2004:PAS",
  pages =        "179--190",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Zhou:2004:BDO,
  author =       "Jingren Zhou and Kenneth A. Ross",
  title =        "Buffering database operations for enhanced instruction
                 cache performance",
  crossref =     "ACM:2004:PAS",
  pages =        "191--202",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ilyas:2004:RAQ,
  author =       "Ihab F. Ilyas and Rahul Shah and Walid G. Aref and
                 Jeffrey Scott Vitter and Ahmed K. Elmagarmid",
  title =        "Rank-aware query optimization",
  crossref =     "ACM:2004:PAS",
  pages =        "203--214",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Govindaraju:2004:FCD,
  author =       "Naga K. Govindaraju and Brandon Lloyd and Wei Wang and
                 Ming Lin and Dinesh Manocha",
  title =        "Fast computation of database operations using graphics
                 processors",
  crossref =     "ACM:2004:PAS",
  pages =        "215--226",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Abiteboul:2004:LQE,
  author =       "Serge Abiteboul and Omar Benjelloun and Bogdan Cautis
                 and Ioana Manolescu and Tova Milo and Nicoleta Preda",
  title =        "Lazy query evaluation for {Active XML}",
  crossref =     "ACM:2004:PAS",
  pages =        "227--238",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bose:2004:DSM,
  author =       "Sujoe Bose and Leonidas Fegaras",
  title =        "Data stream management for historical {XML} data",
  crossref =     "ACM:2004:PAS",
  pages =        "239--250",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Jagadish:2004:CXO,
  author =       "H. V. Jagadish and Laks V. S. Lakshmanan and Monica
                 Scannapieco and Divesh Srivastava and Nuwee
                 Wiwatwattana",
  title =        "Colorful {XML}: one hierarchy isn't enough",
  crossref =     "ACM:2004:PAS",
  pages =        "251--262",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Polyzotis:2004:AXQ,
  author =       "Neoklis Polyzotis and Minos Garofalakis and Yannis
                 Ioannidis",
  title =        "Approximate {XML} query answers",
  crossref =     "ACM:2004:PAS",
  pages =        "263--274",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Haas:2004:BLB,
  author =       "Peter J. Haas and Christian K{\"o}nig",
  title =        "A bi-level {Bernoulli} scheme for database sampling",
  crossref =     "ACM:2004:PAS",
  pages =        "275--286",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chaudhuri:2004:EUB,
  author =       "Surajit Chaudhuri and Gautam Das and Utkarsh
                 Srivastava",
  title =        "Effective use of block-level sampling in statistics
                 estimation",
  crossref =     "ACM:2004:PAS",
  pages =        "287--298",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Jermaine:2004:OMV,
  author =       "Christopher Jermaine and Abhijit Pol and Subramanian
                 Arumugam",
  title =        "Online maintenance of very large random samples",
  crossref =     "ACM:2004:PAS",
  pages =        "299--310",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bruno:2004:CSS,
  author =       "Nicolas Bruno and Surajit Chaudhuri",
  title =        "Conditional selectivity for statistics on query
                 expressions",
  crossref =     "ACM:2004:PAS",
  pages =        "311--322",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Graefe:2004:TSI,
  author =       "Goetz Graefe and Michael Zwilling",
  title =        "Transaction support for indexed summary views",
  crossref =     "ACM:2004:PAS",
  pages =        "323--334",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Yan:2004:GIF,
  author =       "Xifeng Yan and Philip S. Yu and Jiawei Han",
  title =        "Graph indexing: a frequent structure-based approach",
  crossref =     "ACM:2004:PAS",
  pages =        "335--346",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Arge:2004:PRT,
  author =       "Lars Arge and Mark de Berg and Herman J. Haverkort and
                 Ke Yi",
  title =        "The {Priority R-tree}: a practically efficient and
                 worst-case optimal {R}-tree",
  crossref =     "ACM:2004:PAS",
  pages =        "347--358",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Agrawal:2004:IVH,
  author =       "Sanjay Agrawal and Vivek Narasayya and Beverly Yang",
  title =        "Integrating vertical and horizontal partitioning into
                 automated physical database design",
  crossref =     "ACM:2004:PAS",
  pages =        "359--370",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Yu:2004:CBX,
  author =       "Cong Yu and Lucian Popa",
  title =        "Constraint-based {XML} query rewriting for data
                 integration",
  crossref =     "ACM:2004:PAS",
  pages =        "371--382",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Dhamankar:2004:IDC,
  author =       "Robin Dhamankar and Yoonkyong Lee and AnHai Doan and
                 Alon Halevy and Pedro Domingos",
  title =        "{iMAP}: discovering complex semantic matches between
                 database schemas",
  crossref =     "ACM:2004:PAS",
  pages =        "383--394",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ives:2004:ASP,
  author =       "Zachary G. Ives and Alon Y. Halevy and Daniel S.
                 Weld",
  title =        "Adapting to source properties in processing data
                 integration queries",
  crossref =     "ACM:2004:PAS",
  pages =        "395--406",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Babu:2004:AOP,
  author =       "Shivnath Babu and Rajeev Motwani and Kamesh Munagala
                 and Itaru Nishizawa and Jennifer Widom",
  title =        "Adaptive ordering of pipelined stream filters",
  crossref =     "ACM:2004:PAS",
  pages =        "407--418",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ayad:2004:SOC,
  author =       "Ahmed M. Ayad and Jeffrey F. Naughton",
  title =        "Static optimization of conjunctive queries with
                 sliding windows over infinite streams",
  crossref =     "ACM:2004:PAS",
  pages =        "419--430",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Zhu:2004:DPM,
  author =       "Yali Zhu and Elke A. Rundensteiner and George T.
                 Heineman",
  title =        "Dynamic plan migration for continuous queries over
                 data streams",
  crossref =     "ACM:2004:PAS",
  pages =        "431--442",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Yiu:2004:COS,
  author =       "Man Lung Yiu and Nikos Mamoulis",
  title =        "Clustering objects on a spatial network",
  crossref =     "ACM:2004:PAS",
  pages =        "443--454",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bohm:2004:CCC,
  author =       "Christian B{\"o}hm and Karin Kailing and Peer
                 Kr{\"o}ger and Arthur Zimek",
  title =        "Computing Clusters of Correlation Connected objects",
  crossref =     "ACM:2004:PAS",
  pages =        "455--466",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Nassar:2004:IED,
  author =       "Samer Nassar and J{\"o}rg Sander and Corrine Cheng",
  title =        "Incremental and effective data summarization for
                 dynamic hierarchical clustering",
  crossref =     "ACM:2004:PAS",
  pages =        "467--478",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Tian:2004:ISX,
  author =       "Feng Tian and Berthold Reinwald and Hamid Pirahesh and
                 Tobias Mayr and Jussi Myllymaki",
  title =        "Implementing a scalable {XML} publish\slash subscribe
                 system using relational database systems",
  crossref =     "ACM:2004:PAS",
  pages =        "479--490",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Yi:2004:IMX,
  author =       "Ke Yi and Hao He and Ioana Stanoi and Jun Yang",
  title =        "Incremental maintenance of {XML} structural indexes",
  crossref =     "ACM:2004:PAS",
  pages =        "491--502",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bohannon:2004:IES,
  author =       "Philip Bohannon and Byron Choi and Wenfei Fan",
  title =        "Incremental evaluation of schema-directed {XML}
                 publishing",
  crossref =     "ACM:2004:PAS",
  pages =        "503--514",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bawa:2004:PVD,
  author =       "Mayank Bawa and Aristides Gionis and Hector
                 Garcia-Molina and Rajeev Motwani",
  title =        "The price of validity in dynamic networks",
  crossref =     "ACM:2004:PAS",
  pages =        "515--526",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Deligiannakis:2004:CHI,
  author =       "Antonios Deligiannakis and Yannis Kotidis and Nick
                 Roussopoulos",
  title =        "Compressing historical information in sensor
                 networks",
  crossref =     "ACM:2004:PAS",
  pages =        "527--538",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Tatarinov:2004:EQR,
  author =       "Igor Tatarinov and Alon Halevy",
  title =        "Efficient query reformulation in peer data management
                 systems",
  crossref =     "ACM:2004:PAS",
  pages =        "539--550",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Rizvi:2004:EQR,
  author =       "Shariq Rizvi and Alberto Mendelzon and S. Sudarshan
                 and Prasan Roy",
  title =        "Extending query rewriting techniques for fine-grained
                 access control",
  crossref =     "ACM:2004:PAS",
  pages =        "551--562",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Agrawal:2004:OPE,
  author =       "Rakesh Agrawal and Jerry Kiernan and Ramakrishnan
                 Srikant and Yirong Xu",
  title =        "Order preserving encryption for numeric data",
  crossref =     "ACM:2004:PAS",
  pages =        "563--574",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Miklau:2004:FAI,
  author =       "Gerome Miklau and Dan Suciu",
  title =        "A formal analysis of information disclosure in data
                 exchange",
  crossref =     "ACM:2004:PAS",
  pages =        "575--586",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Fan:2004:SXQ,
  author =       "Wenfei Fan and Chee-Yong Chan and Minos Garofalakis",
  title =        "Secure {XML} querying with security views",
  crossref =     "ACM:2004:PAS",
  pages =        "587--598",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cai:2004:IST,
  author =       "Yuhan Cai and Raymond Ng",
  title =        "Indexing spatio-temporal trajectories with {Chebyshev}
                 polynomials",
  crossref =     "ACM:2004:PAS",
  pages =        "599--610",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Tao:2004:PIM,
  author =       "Yufei Tao and Christos Faloutsos and Dimitris Papadias
                 and Bin Liu",
  title =        "Prediction and indexing of moving objects with unknown
                 motion patterns",
  crossref =     "ACM:2004:PAS",
  pages =        "611--622",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Mokbel:2004:SSI,
  author =       "Mohamed F. Mokbel and Xiaopeing Xiong and Walid G.
                 Aref",
  title =        "{SINA}: scalable incremental processing of continuous
                 queries in spatio-temporal databases",
  crossref =     "ACM:2004:PAS",
  pages =        "623--634",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Patel:2004:SEI,
  author =       "Jignesh M. Patel and Yun Chen and V. Prasad Chakka",
  title =        "{STRIPES}: an efficient index for predicted
                 trajectories",
  crossref =     "ACM:2004:PAS",
  pages =        "635--646",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ilyas:2004:CAD,
  author =       "Ihab F. Ilyas and Volker Markl and Peter Haas and Paul
                 Brown and Ashraf Aboulnaga",
  title =        "{CORDS}: automatic discovery of correlations and soft
                 functional dependencies",
  crossref =     "ACM:2004:PAS",
  pages =        "647--658",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Markl:2004:RQP,
  author =       "Volker Markl and Vijayshankar Raman and David Simmen
                 and Guy Lohman and Hamid Pirahesh and Miso Cilimdzic",
  title =        "Robust query processing through progressive
                 optimization",
  crossref =     "ACM:2004:PAS",
  pages =        "659--670",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Rao:2004:CAO,
  author =       "Jun Rao and Hamid Pirahesh and Calisto Zuzarte",
  title =        "Canonical abstraction for outerjoin optimization",
  crossref =     "ACM:2004:PAS",
  pages =        "671--682",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Enderle:2004:JID,
  author =       "Jost Enderle and Matthias Hampel and Thomas Seidl",
  title =        "Joining interval data in relational databases",
  crossref =     "ACM:2004:PAS",
  pages =        "683--694",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Das:2004:ATS,
  author =       "Abhinandan Das and Johannes Gehrke and Mirek
                 Riedewald",
  title =        "Approximation techniques for spatial data",
  crossref =     "ACM:2004:PAS",
  pages =        "695--706",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cohen:2004:SDA,
  author =       "Edith Cohen and Haim Kaplan",
  title =        "Spatially-decaying aggregation over a network: model
                 and algorithms",
  crossref =     "ACM:2004:PAS",
  pages =        "707--718",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hung:2004:TET,
  author =       "Edward Hung and Yu Deng and V. S. Subrahmanian",
  title =        "{TOSS}: an extension of {TAX} with ontologies and
                 similarity queries",
  crossref =     "ACM:2004:PAS",
  pages =        "719--730",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Andritsos:2004:ITT,
  author =       "Periklis Andritsos and Ren{\'e}e J. Miller and
                 Panayiotis Tsaparas",
  title =        "Information-theoretic tools for mining database
                 structure from large data sets",
  crossref =     "ACM:2004:PAS",
  pages =        "731--742",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Sarawagi:2004:ESJ,
  author =       "Sunita Sarawagi and Alok Kirpal",
  title =        "Efficient set joins on similarity predicates",
  crossref =     "ACM:2004:PAS",
  pages =        "743--754",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chakrabarti:2004:ACQ,
  author =       "Kaushik Chakrabarti and Surajit Chaudhuri and
                 Seung-won Hwang",
  title =        "Automatic categorization of query results",
  crossref =     "ACM:2004:PAS",
  pages =        "755--766",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ipeirotis:2004:WOS,
  author =       "Panagiotis G. Ipeirotis and Luis Gravano",
  title =        "When one sample is not enough: improving text database
                 selection using shrinkage",
  crossref =     "ACM:2004:PAS",
  pages =        "767--778",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kaushik:2004:ISI,
  author =       "Raghav Kaushik and Rajasekar Krishnamurthy and Jeffrey
                 F. Naughton and Raghu Ramakrishnan",
  title =        "On the integration of structure indexes and inverted
                 lists",
  crossref =     "ACM:2004:PAS",
  pages =        "779--790",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Luo:2004:TPI,
  author =       "Gang Luo and Jeffrey F. Naughton and Curt J. Ellmann
                 and Michael W. Watzke",
  title =        "Toward a progress indicator for database queries",
  crossref =     "ACM:2004:PAS",
  pages =        "791--802",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chaudhuri:2004:EPE,
  author =       "Surajit Chaudhuri and Vivek Narasayya and Ravishankar
                 Ramamurthy",
  title =        "Estimating progress of execution for {SQL} queries",
  crossref =     "ACM:2004:PAS",
  pages =        "803--814",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Guo:2004:RCC,
  author =       "Hongfei Guo and Per-{\AA}ke Larson and Raghu
                 Ramakrishnan and Jonathan Goldstein",
  title =        "Relaxed currency and consistency: how to say ``good
                 enough'' in {SQL}",
  crossref =     "ACM:2004:PAS",
  pages =        "815--826",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Shah:2004:HAF,
  author =       "Mehul A. Shah and Joseph M. Hellerstein and Eric
                 Brewer",
  title =        "Highly available, fault-tolerant, parallel dataflows",
  crossref =     "ACM:2004:PAS",
  pages =        "827--838",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gryz:2004:QSD,
  author =       "Jarek Gryz and Junjie Guo and Linqi Liu and Calisto
                 Zuzarte",
  title =        "Query sampling in {DB2 Universal Database}",
  crossref =     "ACM:2004:PAS",
  pages =        "839--843",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Galindo-Legaria:2004:QPS,
  author =       "C{\'e}sar A. Galindo-Legaria and Stefano Stefani and
                 Florian Waas",
  title =        "Query processing for {SQL} updates",
  crossref =     "ACM:2004:PAS",
  pages =        "844--849",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cruanes:2004:PSE,
  author =       "Thierry Cruanes and Benoit Dageville and Bhaskar
                 Ghosh",
  title =        "Parallel {SQL} execution in {Oracle 10g}",
  crossref =     "ACM:2004:PAS",
  pages =        "850--854",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gupta:2004:DDR,
  author =       "Abhinav Gupta and Sankar Subramanian and Srikanth
                 Bellamkonda and Tolga Bozkaya and Nathan Folkert and
                 Lei Sheng and Andrew Witkowski",
  title =        "Data densification in a relational database system",
  crossref =     "ACM:2004:PAS",
  pages =        "855--859",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Acheson:2004:HNR,
  author =       "Alazel Acheson and Mason Bendixen and Jos{\'e} A.
                 Blakeley and Peter Carlin and Ebru Ersan and Jun Fang
                 and Xiaowei Jiang and Christian Kleinerman and Balaji
                 Rathakrishnan and Gideon Schaller and Beysim Sezgin and
                 Ramachandran Venkatesh and Honggang Zhang",
  title =        "Hosting the {.NET} Runtime in {Microsoft SQL} server",
  crossref =     "ACM:2004:PAS",
  pages =        "860--865",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ordonez:2004:VHP,
  author =       "Carlos Ordonez",
  title =        "Vertical and horizontal percentage aggregations",
  crossref =     "ACM:2004:PAS",
  pages =        "866--871",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Little:2004:MWS,
  author =       "Mark Little",
  title =        "Models for {Web Services} Transactions",
  crossref =     "ACM:2004:PAS",
  pages =        "872--872",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Agrawal:2004:ESI,
  author =       "Rakesh Agrawal and Dmitri Asonov and Ramakrishnan
                 Srikant",
  title =        "Enabling sovereign information sharing using {Web
                 Services}",
  crossref =     "ACM:2004:PAS",
  pages =        "873--877",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Mihic:2004:BDA,
  author =       "Matthew Mihic",
  title =        "Building dynamic application networks with {Web
                 Services}",
  crossref =     "ACM:2004:PAS",
  pages =        "878--878",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gudgin:2004:SRT,
  author =       "Martin Gudgin",
  title =        "Secure, reliable, transacted: innovation in {Web
                 Services} architecture",
  crossref =     "ACM:2004:PAS",
  pages =        "879--880",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kosugi:2004:SPQ,
  author =       "Naoko Kosugi and Yasushi Sakurai and Masashi
                 Morimoto",
  title =        "{SoundCompass}: a practical query-by-humming system;
                 normalization of scalable and shiftable time-series
                 data and effective subsequence generation",
  crossref =     "ACM:2004:PAS",
  pages =        "881--886",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bendsen:2004:MDB,
  author =       "Per Bendsen",
  title =        "Model-driven business {UI} based on maps",
  crossref =     "ACM:2004:PAS",
  pages =        "887--891",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Dar:2004:DTD,
  author =       "Shaul Dar and Gil Hecht and Eden Shochat",
  title =        "{dbSwitch}{\TM}: towards a database utility",
  crossref =     "ACM:2004:PAS",
  pages =        "892--896",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hall:2004:RPC,
  author =       "Dean E. Hall",
  title =        "Requirements and policy challenges in highly secure
                 environments",
  crossref =     "ACM:2004:PAS",
  pages =        "897--898",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Multari:2004:IAT,
  author =       "Nicholas J. Multari",
  title =        "Information assurance technical challenges",
  crossref =     "ACM:2004:PAS",
  pages =        "899--899",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Dill:2004:SOB,
  author =       "Marcus Dill and Achim Kraiss and Stefan Sigg and
                 Thomas Zurek",
  title =        "Service-oriented {BI}: towards tight integration of
                 business intelligence into operational applications",
  crossref =     "ACM:2004:PAS",
  pages =        "900--900",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Carey:2004:XMX,
  author =       "Michael J. Carey",
  title =        "{XML} in the middle: {XQuery} in the {WebLogic
                 Platform}",
  crossref =     "ACM:2004:PAS",
  pages =        "901--902",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{ONeil:2004:OIF,
  author =       "Patrick O'Neil and Elizabeth O'Neil and Shankar Pal
                 and Istvan Cseri and Gideon Schaller and Nigel
                 Westbury",
  title =        "{ORDPATHs}: insert-friendly {XML} node labels",
  crossref =     "ACM:2004:PAS",
  pages =        "903--908",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Brambilla:2004:DSW,
  author =       "Marco Brambilla and Stefano Ceri and Sara Comai and
                 Marco Dario and Piero Fraternali and Ioana Manolescu",
  title =        "Declarative specification of {Web} applications
                 exploiting {Web services} and workflows",
  crossref =     "ACM:2004:PAS",
  pages =        "909--910",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Fernandez:2004:YHB,
  author =       "Mary Fern{\'a}ndez and Nicola Onose and J{\'e}r{\^o}me
                 Sim{\'e}on",
  title =        "{Yoo-Hoo}!: building a presence service with {XQuery}
                 and {WSDL}",
  crossref =     "ACM:2004:PAS",
  pages =        "911--912",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{He:2004:KDD,
  author =       "Bin He and Zhen Zhang and Kevin Chen-Chuan Chang",
  title =        "Knocking the door to the deep {Web}: integrating {Web}
                 query interfaces",
  crossref =     "ACM:2004:PAS",
  pages =        "913--914",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Carreira:2004:EDD,
  author =       "Paulo Carreira and Helena Galhardas",
  title =        "Efficient development of data migration
                 transformations",
  crossref =     "ACM:2004:PAS",
  pages =        "915--916",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Borkar:2004:LDW,
  author =       "Vinayak Borkar",
  title =        "Liquid data for {WebLogic}: integrating enterprise
                 data and services",
  crossref =     "ACM:2004:PAS",
  pages =        "917--918",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cai:2004:MMA,
  author =       "Y. Dora Cai and David Clutter and Greg Pape and Jiawei
                 Han and Michael Welge and Loretta Auvil",
  title =        "{MAIDS}: mining alarming incidents from data streams",
  crossref =     "ACM:2004:PAS",
  pages =        "919--920",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Qian:2004:FFE,
  author =       "Yu Qian and Gang Zhang and Kang Zhang",
  title =        "{FA\c{C}ADE}: a fast and effective approach to the
                 discovery of dense clusters in noisy spatial data",
  crossref =     "ACM:2004:PAS",
  pages =        "921--922",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Serazi:2004:D,
  author =       "Masum Serazi and Vasily Malakhov and Dongmei Ren and
                 Amal Perera and Imad Rahal and Weihua Wu and Qiang Ding
                 and Fei Pan and William Perrizo",
  title =        "{DataMIME}{\TM}",
  crossref =     "ACM:2004:PAS",
  pages =        "923--924",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kramer:2004:PPI,
  author =       "J{\"u}rgen Kr{\"a}mer and Bernhard Seeger",
  title =        "{PIPES}: a public infrastructure for processing and
                 exploring streams",
  crossref =     "ACM:2004:PAS",
  pages =        "925--926",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Garg:2004:WCM,
  author =       "Shaveen Garg and Krithi Ramamritham and Soumen
                 Chakrabarti",
  title =        "{Web-CAM}: monitoring the dynamic {Web} to respond to
                 continual queries",
  crossref =     "ACM:2004:PAS",
  pages =        "927--928",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Balazinska:2004:LMH,
  author =       "Magdalena Balazinska and Hari Balakrishnan and Michael
                 Stonebraker",
  title =        "Load management and high availability in the {Medusa}
                 distributed stream processing system",
  crossref =     "ACM:2004:PAS",
  pages =        "929--930",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Babu:2004:SAE,
  author =       "Shivnath Babu and Jennifer Widom",
  title =        "{StreaMon}: an adaptive engine for stream query
                 processing",
  crossref =     "ACM:2004:PAS",
  pages =        "931--932",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Idreos:2004:PDE,
  author =       "Stratos Idreos and Manolis Koubarakis and Christos
                 Tryfonopoulos",
  title =        "{P2P-DIET}: an extensible {P2P} service that unifies
                 ad-hoc and continuous querying in super-peer networks",
  crossref =     "ACM:2004:PAS",
  pages =        "933--934",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chun:2004:QIS,
  author =       "Brent Chun and Joseph M. Hellerstein and Ryan Huebsch
                 and Shawn R. Jeffery and Boon Thau Loo and Sam
                 Mardanbeigi and Timothy Roscoe and Sean Rhea and Scott
                 Shenker and Ion Stoica",
  title =        "Querying at {Internet} scale",
  crossref =     "ACM:2004:PAS",
  pages =        "935--936",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Guo:2004:SRC,
  author =       "Hongfei Guo and Per-{\AA}ke Larson and Raghu
                 Ramakrishnan and Jonathan Goldstein",
  title =        "Support for relaxed currency and consistency
                 constraints in {MTCache}",
  crossref =     "ACM:2004:PAS",
  pages =        "937--938",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Crainiceanu:2004:IFP,
  author =       "Adina Crainiceanu and Prakash Linga and Ashwin
                 Machanavajjhala and Johannes Gehrke and Jayavel
                 Shanmugasundaram",
  title =        "An indexing framework for peer-to-peer systems",
  crossref =     "ACM:2004:PAS",
  pages =        "939--940",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Meng:2004:XII,
  author =       "Xiaofeng Meng and Yu Jiang and Yan Chen and Haixun
                 Wang",
  title =        "{XSeq}: an indexing infrastructure for tree pattern
                 queries",
  crossref =     "ACM:2004:PAS",
  pages =        "941--942",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Botev:2004:TBX,
  author =       "Chavdar Botev and Sihem Amer-Yahia and Jayavel
                 Shanmugasundaram",
  title =        "A {TeXQuery}-based {XML} full-text search engine",
  crossref =     "ACM:2004:PAS",
  pages =        "943--944",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Fundulaki:2004:SYD,
  author =       "Irini Fundulaki and Arnaud Sahuguet",
  title =        "``Share your data, keep your secrets.''",
  crossref =     "ACM:2004:PAS",
  pages =        "945--946",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Agrawal:2004:MHD,
  author =       "Rakesh Agrawal and Ameet Kini and Kristen LeFevre and
                 Amy Wang and Yirong Xu and Diana Zhou",
  title =        "Managing healthcare data hippocratically",
  crossref =     "ACM:2004:PAS",
  pages =        "947--948",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kumaran:2004:LMM,
  author =       "A. Kumaran and Jayant R. Haritsa",
  title =        "{LexEQUAL}: multilexical matching operator in {SQL}",
  crossref =     "ACM:2004:PAS",
  pages =        "949--950",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Huang:2004:IIT,
  author =       "B. Huang and Z. Huang and H. Li and D. Lin and H. Lu
                 and Y. Song",
  title =        "{ITQS}: an integrated transport query system",
  crossref =     "ACM:2004:PAS",
  pages =        "951--952",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bedathur:2004:BDH,
  author =       "Srikanta J. Bedathur and Abhijit Kadlag and Jayant R.
                 Haritsa",
  title =        "{BODHI}: a database habitat for bio-diversity
                 information",
  crossref =     "ACM:2004:PAS",
  pages =        "953--954",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Mehrotra:2004:CCA,
  author =       "Sharad Mehrotra and Carter Butts and Dmitri V.
                 Kalashnikov and Nalini Venkatasubramanian and Kemal
                 Altintas and Ram Hariharan and Haimin Lee and Yiming Ma
                 and Amnon Myers and Jehan Wickramasuriya and Ron Eguchi
                 and Charles Huyck",
  title =        "{CAMAS}: a citizen awareness system for crisis
                 mitigation",
  crossref =     "ACM:2004:PAS",
  pages =        "955--956",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Franklin:2004:RCR,
  author =       "Michael J. Franklin and Jennifer Widom and Anastassia
                 Ailamaki and Philip A. Bernstein and David DeWitt and
                 Alon Halevy and Zachary Ives and Gerhard Weikum",
  title =        "Rethinking the conference reviewing process",
  crossref =     "ACM:2004:PAS",
  pages =        "957--957",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hull:2004:TDC,
  author =       "Richard Hull and Jianwen Su",
  title =        "Tools for design of composite {Web Services}",
  crossref =     "ACM:2004:PAS",
  pages =        "958--961",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Rosenthal:2004:SSD,
  author =       "Arnon Rosenthal and Marianne Winslett",
  title =        "Security of shared data in large systems: state of the
                 art and research directions",
  crossref =     "ACM:2004:PAS",
  pages =        "962--964",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Lerner:2004:FAT,
  author =       "Alberto Lerner and Dennis Shasha and Zhihua Wang and
                 Xiaojian Zhao and Yunyue Zhu",
  title =        "Fast algorithms for time series with applications to
                 finance, physics, music, biology, and other suspects",
  crossref =     "ACM:2004:PAS",
  pages =        "965--968",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Faloutsos:2004:IMS,
  author =       "Christos Faloutsos",
  title =        "Indexing and mining streams",
  crossref =     "ACM:2004:PAS",
  pages =        "969--969",
  year =         "2004",
  bibdate =      "Sun Nov 7 06:14:27 MST 2004",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Lam:2005:CSP,
  author =       "Monica S. Lam and John Whaley and V. Benjamin Livshits
                 and Michael C. Martin and Dzintars Avots and Michael
                 Carbin and Christopher Unkel",
  title =        "Context-sensitive program analysis as database
                 queries",
  crossref =     "ACM:2005:PTF",
  journal =      "",
  pages =        "1--12",
  year =         "2005",
  bibdate =      "Wed Aug 23 12:08:49 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Arenas:2005:XDE,
  author =       "Marcelo Arenas and Leonid Libkin",
  title =        "{XML} data exchange: consistency and query answering",
  crossref =     "ACM:2005:PTF",
  pages =        "13--24",
  year =         "2005",
  bibdate =      "Wed Aug 23 12:08:49 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Benedikt:2005:XSP,
  author =       "Michael Benedikt and Wenfei Fan and Floris Geerts",
  title =        "{XPath} satisfiability in the presence of {DTDs}",
  crossref =     "ACM:2005:PTF",
  pages =        "25--36",
  year =         "2005",
  bibdate =      "Wed Aug 23 12:08:49 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Vansummeren:2005:DWD,
  author =       "Stijn Vansummeren",
  title =        "Deciding well-definedness of {XQ}uery fragments",
  crossref =     "ACM:2005:PTF",
  pages =        "37--48",
  year =         "2005",
  bibdate =      "Wed Aug 23 12:08:49 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Segoufin:2005:VQD,
  author =       "Luc Segoufin and Victor Vianu",
  title =        "Views and queries: determinacy and rewriting",
  crossref =     "ACM:2005:PTF",
  pages =        "49--60",
  year =         "2005",
  bibdate =      "Wed Aug 23 12:08:49 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kolaitis:2005:SMD,
  author =       "Phokion G. Kolaitis",
  title =        "Schema mappings, data exchange, and metadata
                 management",
  crossref =     "ACM:2005:PTF",
  pages =        "61--75",
  year =         "2005",
  bibdate =      "Wed Aug 23 12:08:49 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Leinders:2005:CDS,
  author =       "Dirk Leinders and Jan {Van den Bussche}",
  title =        "On the complexity of division and set joins in the
                 relational algebra",
  crossref =     "ACM:2005:PTF",
  pages =        "76--83",
  year =         "2005",
  bibdate =      "Wed Aug 23 12:08:49 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Koch:2005:CNX,
  author =       "Christoph Koch",
  title =        "On the complexity of nonrecursive {XQ}uery and
                 functional query languages on complex values",
  crossref =     "ACM:2005:PTF",
  pages =        "84--97",
  year =         "2005",
  bibdate =      "Wed Aug 23 12:08:49 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cohen:2005:IAC,
  author =       "Sara Cohen and Yehoshua Sagiv",
  title =        "An incremental algorithm for computing ranked full
                 disjunctions",
  crossref =     "ACM:2005:PTF",
  pages =        "98--107",
  year =         "2005",
  bibdate =      "Wed Aug 23 12:08:49 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Abadi:2005:SAC,
  author =       "Mart{\'\i}n Abadi and Bogdan Warinschi",
  title =        "Security analysis of cryptographically controlled
                 access to {XML} documents",
  crossref =     "ACM:2005:PTF",
  pages =        "108--117",
  year =         "2005",
  bibdate =      "Wed Aug 23 12:08:49 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kenthapadi:2005:SA,
  author =       "Krishnaram Kenthapadi and Nina Mishra and Kobbi
                 Nissim",
  title =        "Simulatable auditing",
  crossref =     "ACM:2005:PTF",
  pages =        "118--127",
  year =         "2005",
  bibdate =      "Wed Aug 23 12:08:49 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Blum:2005:PPS,
  author =       "Avrim Blum and Cynthia Dwork and Frank McSherry and
                 Kobbi Nissim",
  title =        "Practical privacy: the {SuLQ} framework",
  crossref =     "ACM:2005:PTF",
  pages =        "128--138",
  year =         "2005",
  bibdate =      "Wed Aug 23 12:08:49 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Zhong:2005:PEA,
  author =       "Sheng Zhong and Zhiqiang Yang and Rebecca N. Wright",
  title =        "Privacy-enhancing $k$-anonymization of customer data",
  crossref =     "ACM:2005:PTF",
  pages =        "139--147",
  year =         "2005",
  bibdate =      "Wed Aug 23 12:08:49 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gottlob:2005:CCD,
  author =       "Georg Gottlob",
  title =        "Computing cores for data exchange: new algorithms and
                 practical solutions",
  crossref =     "ACM:2005:PTF",
  pages =        "148--159",
  year =         "2005",
  bibdate =      "Wed Aug 23 12:08:49 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Fuxman:2005:PDE,
  author =       "Ariel Fuxman and Phokion G. Kolaitis and Ren{\'e}e J.
                 Miller and Wang-Chiew Tan",
  title =        "Peer data exchange",
  crossref =     "ACM:2005:PTF",
  pages =        "160--171",
  year =         "2005",
  bibdate =      "Wed Aug 23 12:08:49 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Nash:2005:CMG,
  author =       "Alan Nash and Philip A. Bernstein and Sergey Melnik",
  title =        "Composition of mappings given by embedded
                 dependencies",
  crossref =     "ACM:2005:PTF",
  pages =        "172--183",
  year =         "2005",
  bibdate =      "Wed Aug 23 12:08:49 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Fagin:2005:MSD,
  author =       "Ronald Fagin and R. Guha and Ravi Kumar and Jasmine
                 Novak and D. Sivakumar and Andrew Tomkins",
  title =        "Multi-structural databases",
  crossref =     "ACM:2005:PTF",
  pages =        "184--195",
  year =         "2005",
  bibdate =      "Wed Aug 23 12:08:49 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cheng:2005:DMM,
  author =       "David Cheng and Santosh Vempala and Ravi Kannan and
                 Grant Wang",
  title =        "A divide-and-merge methodology for clustering",
  crossref =     "ACM:2005:PTF",
  pages =        "196--205",
  year =         "2005",
  bibdate =      "Wed Aug 23 12:08:49 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Fekete:2005:AIL,
  author =       "Alan Fekete",
  title =        "Allocating isolation levels to transactions",
  crossref =     "ACM:2005:PTF",
  pages =        "206--215",
  year =         "2005",
  bibdate =      "Wed Aug 23 12:08:49 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bar-Yossef:2005:BQE,
  author =       "Ziv Bar-Yossef and Marcus Fontoura and Vanja
                 Josifovski",
  title =        "Buffering in query evaluation over {XML} streams",
  crossref =     "ACM:2005:PTF",
  pages =        "216--227",
  year =         "2005",
  bibdate =      "Wed Aug 23 12:08:49 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Dobra:2005:HRW,
  author =       "Alin Dobra",
  title =        "Histograms revisited: when are histograms the best
                 approximation method for aggregates over joins?",
  crossref =     "ACM:2005:PTF",
  pages =        "228--237",
  year =         "2005",
  bibdate =      "Wed Aug 23 12:08:49 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Grohe:2005:LBS,
  author =       "Martin Grohe and Nicole Schweikardt",
  title =        "Lower bounds for sorting with few random accesses to
                 external memory",
  crossref =     "ACM:2005:PTF",
  pages =        "238--249",
  year =         "2005",
  bibdate =      "Wed Aug 23 12:08:49 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Srivastava:2005:OPN,
  author =       "Utkarsh Srivastava and Kamesh Munagala and Jennifer
                 Widom",
  title =        "Operator placement for in-network stream query
                 processing",
  crossref =     "ACM:2005:PTF",
  pages =        "250--258",
  year =         "2005",
  bibdate =      "Wed Aug 23 12:08:49 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ganguly:2005:JDA,
  author =       "Sumit Ganguly and Minos Garofalakis and Amit Kumar and
                 Rajeev Rastogi",
  title =        "Join-distinct aggregate estimation over update
                 streams",
  crossref =     "ACM:2005:PTF",
  pages =        "259--270",
  year =         "2005",
  bibdate =      "Wed Aug 23 12:08:49 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cormode:2005:SEM,
  author =       "Graham Cormode and S. Muthukrishnan",
  title =        "Space efficient mining of multigraph streams",
  crossref =     "ACM:2005:PTF",
  pages =        "271--282",
  year =         "2005",
  bibdate =      "Wed Aug 23 12:08:49 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Maneth:2005:XTC,
  author =       "S. Maneth and A. Berlea and T. Perst and H. Seidl",
  title =        "{XML} type checking with macro tree transducers",
  crossref =     "ACM:2005:PTF",
  pages =        "283--294",
  year =         "2005",
  bibdate =      "Wed Aug 23 12:08:49 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Abiteboul:2005:RRA,
  author =       "Serge Abiteboul and Tova Milo and Omar Benjelloun",
  title =        "Regular rewriting of active {XML} and unambiguity",
  crossref =     "ACM:2005:PTF",
  pages =        "295--303",
  year =         "2005",
  bibdate =      "Wed Aug 23 12:08:49 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Deutsch:2005:DSC,
  author =       "Alin Deutsch and Yannis Katsis and Yannis
                 Papakonstantinou",
  title =        "Determining source contribution in integration
                 systems",
  crossref =     "ACM:2005:PTF",
  pages =        "304--315",
  year =         "2005",
  bibdate =      "Wed Aug 23 12:08:49 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gehrke:2005:MMP,
  author =       "Johannes Gehrke",
  title =        "Models and methods for privacy-preserving data
                 publishing and analysis: invited tutorial",
  crossref =     "ACM:2005:PTF",
  pages =        "316--316",
  year =         "2005",
  bibdate =      "Wed Aug 23 12:08:49 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Alon:2005:EAS,
  author =       "Noga Alon and Nick Duffield and Carsten Lund and
                 Mikkel Thorup",
  title =        "Estimating arbitrary subset sums with few probes",
  crossref =     "ACM:2005:PTF",
  pages =        "317--325",
  year =         "2005",
  bibdate =      "Wed Aug 23 12:08:49 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Sakurai:2005:FFS,
  author =       "Yasushi Sakurai and Masatoshi Yoshikawa and Christos
                 Faloutsos",
  title =        "{FTW}: fast similarity search under the time warping
                 distance",
  crossref =     "ACM:2005:PTF",
  pages =        "326--337",
  year =         "2005",
  bibdate =      "Wed Aug 23 12:08:49 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hershberger:2005:SCH,
  author =       "John Hershberger and Nisheeth Shrivastava and Subhash
                 Suri and Csaba D. T{\'o}th",
  title =        "Space complexity of hierarchical heavy hitters in
                 multi-dimensional data streams",
  crossref =     "ACM:2005:PTF",
  pages =        "338--347",
  year =         "2005",
  bibdate =      "Wed Aug 23 12:08:49 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Sayrafi:2005:DC,
  author =       "Bassem Sayrafi and Dirk {Van Gucht}",
  title =        "Differential constraints",
  crossref =     "ACM:2005:PTF",
  pages =        "348--357",
  year =         "2005",
  bibdate =      "Wed Aug 23 12:08:49 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Abiteboul:2005:DAD,
  author =       "Serge Abiteboul and Zo{\"e} Abrams and Stefan Haar and
                 Tova Milo",
  title =        "Diagnosis of asynchronous discrete event systems:
                 datalog to the rescue!",
  crossref =     "ACM:2005:PTF",
  pages =        "358--367",
  year =         "2005",
  bibdate =      "Wed Aug 23 12:08:49 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Li:2005:RRO,
  author =       "Haiquan Li and Jinyan Li and Limsoon Wong and Mengling
                 Feng and Yap-Peng Tan",
  title =        "Relative risk and odds ratio: a data mining
                 perspective",
  crossref =     "ACM:2005:PTF",
  pages =        "368--377",
  year =         "2005",
  bibdate =      "Wed Aug 23 12:08:49 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Halevy:2006:PDS,
  author =       "Alon Halevy and Michael Franklin and David Maier",
  title =        "Principles of dataspace systems",
  crossref =     "ACM:2006:PTF",
  pages =        "1--9",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bojanczyk:2006:TVL,
  author =       "Mikolaj Boja{\'n}czyk and Claire David and Anca
                 Muscholl and Thomas Schwentick and Luc Segoufin",
  title =        "Two-variable logic on data trees and {XML} reasoning",
  crossref =     "ACM:2006:PTF",
  pages =        "10--19",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bender:2006:APM,
  author =       "Michael A. Bender and Haodong Hu",
  title =        "An adaptive packed-memory array",
  crossref =     "ACM:2006:PTF",
  pages =        "20--29",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kolaitis:2006:CDE,
  author =       "Phokion G. Kolaitis and Jonathan Panttaja and
                 Wang-Chiew Tan",
  title =        "The complexity of data exchange",
  crossref =     "ACM:2006:PTF",
  pages =        "30--39",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gottlob:2006:DEC,
  author =       "Georg Gottlob and Alan Nash",
  title =        "Data exchange: computing cores in polynomial time",
  crossref =     "ACM:2006:PTF",
  pages =        "40--49",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Fagin:2006:ISM,
  author =       "Ronald Fagin",
  title =        "Inverting schema mappings",
  crossref =     "ACM:2006:PTF",
  pages =        "50--59",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Libkin:2006:DEI,
  author =       "Leonid Libkin",
  title =        "Data exchange and incomplete information",
  crossref =     "ACM:2006:PTF",
  pages =        "60--69",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cohen:2006:EQC,
  author =       "Sara Cohen",
  title =        "Equivalence of queries combining set and bag-set
                 semantics",
  crossref =     "ACM:2006:PTF",
  pages =        "70--79",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Jayram:2006:CPR,
  author =       "T. S. Jayram and Phokion G. Kolaitis and Erik Vee",
  title =        "The containment problem for {{\em Real}} conjunctive
                 queries with inequalities",
  crossref =     "ACM:2006:PTF",
  pages =        "80--89",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Deutsch:2006:VCD,
  author =       "Alin Deutsch and Liying Sui and Victor Vianu and Dayou
                 Zhou",
  title =        "Verification of communicating data-driven {Web}
                 services",
  crossref =     "ACM:2006:PTF",
  pages =        "90--99",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Calders:2006:AWI,
  author =       "Toon Calders and Stijn Dekeyser and Jan Hidders and
                 Jan Paredaens",
  title =        "Analyzing workflows implied by instance-dependent
                 access rules",
  crossref =     "ACM:2006:PTF",
  pages =        "100--109",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Halpern:2006:SKB,
  author =       "Joseph Y. Halpern",
  title =        "From statistical knowledge bases to degrees of belief:
                 an overview",
  crossref =     "ACM:2006:PTF",
  pages =        "110--113",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kolahi:2006:RVD,
  author =       "Solmaz Kolahi and Leonid Libkin",
  title =        "On redundancy vs dependency preservation in
                 normalization: an information-theoretic study of
                 {3NF}",
  crossref =     "ACM:2006:PTF",
  pages =        "114--123",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gottlob:2006:TDD,
  author =       "Georg Gottlob and Reinhard Pichler and Fang Wei",
  title =        "Tractable database design through bounded treewidth",
  crossref =     "ACM:2006:PTF",
  pages =        "124--133",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Motwani:2006:EPP,
  author =       "Rajeev Motwani and Ying Xu",
  title =        "Evolution of page popularity under random {Web} graph
                 models",
  crossref =     "ACM:2006:PTF",
  pages =        "134--142",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Mishra:2006:PPS,
  author =       "Nina Mishra and Mark Sandler",
  title =        "Privacy via pseudorandom sketches",
  crossref =     "ACM:2006:PTF",
  pages =        "143--152",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Aggarwal:2006:AAC,
  author =       "Gagan Aggarwal and Tom{\'a}s Feder and Krishnaram
                 Kenthapadi and Samir Khuller and Rina Panigrahy and
                 Dilys Thomas and An Zhu",
  title =        "Achieving anonymity via clustering",
  crossref =     "ACM:2006:PTF",
  pages =        "153--162",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Machanavajjhala:2006:ECP,
  author =       "Ashwin Machanavajjhala and Johannes Gehrke",
  title =        "On the efficiency of checking perfect privacy",
  crossref =     "ACM:2006:PTF",
  pages =        "163--172",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kimelfeld:2006:FAT,
  author =       "Benny Kimelfeld and Yehoshua Sagiv",
  title =        "Finding and approximating top-$k$ answers in keyword
                 proximity search",
  crossref =     "ACM:2006:PTF",
  pages =        "173--182",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Yang:2006:EOS,
  author =       "Guizhen Yang and Michael Kifer and Vinay K. Chaudhri",
  title =        "Efficiently ordering subgoals with access
                 constraints",
  crossref =     "ACM:2006:PTF",
  pages =        "183--192",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Condon:2006:FAT,
  author =       "Anne Condon and Amol Deshpande and Lisa Hellerstein
                 and Ning Wu",
  title =        "Flow algorithms for two pipelined filter ordering
                 problems",
  crossref =     "ACM:2006:PTF",
  pages =        "193--202",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Goel:2006:ARQ,
  author =       "Ashish Goel and Sudipto Guha and Kamesh Munagala",
  title =        "Asking the right questions: model-driven optimization
                 using probes",
  crossref =     "ACM:2006:PTF",
  pages =        "203--212",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Koch:2006:PQT,
  author =       "Christoph Koch",
  title =        "Processing queries on tree-structured data
                 efficiently",
  crossref =     "ACM:2006:PTF",
  pages =        "213--224",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Pagh:2006:SCA,
  author =       "Anna Pagh and Rasmus Pagh",
  title =        "Scalable computation of acyclic joins",
  crossref =     "ACM:2006:PTF",
  pages =        "225--232",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bender:2006:COS,
  author =       "Michael A. Bender and Martin Farach-Colton and Bradley
                 C. Kuszmaul",
  title =        "Cache-oblivious string {B}-trees",
  crossref =     "ACM:2006:PTF",
  pages =        "233--242",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Grohe:2006:RCL,
  author =       "Martin Grohe and Andr{\'e} Hernich and Nicole
                 Schweikardt",
  title =        "Randomized computations on large data sets: tight
                 lower bounds",
  crossref =     "ACM:2006:PTF",
  pages =        "243--252",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Buriol:2006:CTD,
  author =       "Luciana S. Buriol and Gereon Frahling and Stefano
                 Leonardi and Alberto Marchetti-Spaccamela and Christian
                 Sohler",
  title =        "Counting triangles in data streams",
  crossref =     "ACM:2006:PTF",
  pages =        "253--262",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cormode:2006:STE,
  author =       "Graham Cormode and Flip Korn and S. Muthukrishnan and
                 Divesh Srivastava",
  title =        "Space- and time-efficient deterministic algorithms for
                 biased quantiles over data streams",
  crossref =     "ACM:2006:PTF",
  pages =        "263--272",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Guha:2006:AQO,
  author =       "Sudipto Guha and Andrew McGregor",
  title =        "Approximate quantiles and the order of the stream",
  crossref =     "ACM:2006:PTF",
  pages =        "273--279",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ganguly:2006:DSS,
  author =       "Sumit Ganguly and Anirban Majumder",
  title =        "Deterministic $k$-set structure",
  crossref =     "ACM:2006:PTF",
  pages =        "280--289",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Lee:2006:SME,
  author =       "L. K. Lee and H. F. Ting",
  title =        "A simpler and more efficient deterministic scheme for
                 finding frequent items over sliding windows",
  crossref =     "ACM:2006:PTF",
  pages =        "290--297",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Zhao:2006:FGI,
  author =       "Qi (George) Zhao and Mitsunori Ogihara and Haixun Wang
                 and Jun (Jim) Xu",
  title =        "Finding global icebergs over distributed data sets",
  crossref =     "ACM:2006:PTF",
  pages =        "298--307",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kashyap:2006:EGB,
  author =       "Srinivas Kashyap and Supratim Deb and K. V. M. Naidu
                 and Rajeev Rastogi and Anand Srinivasan",
  title =        "Efficient gossip-based aggregate computation",
  crossref =     "ACM:2006:PTF",
  pages =        "308--317",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gyssens:2006:SCS,
  author =       "Marc Gyssens and Jan Paredaens and Dirk {Van Gucht}
                 and George H. L. Fletcher",
  title =        "Structural characterizations of the semantics of
                 {XPath} as navigation tool on a document",
  crossref =     "ACM:2006:PTF",
  pages =        "318--327",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{tenCate:2006:EXT,
  author =       "Balder ten Cate",
  title =        "The expressivity of {XPath} with transitive closure",
  crossref =     "ACM:2006:PTF",
  pages =        "328--337",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bohannon:2006:RLL,
  author =       "Aaron Bohannon and Benjamin C. Pierce and Jeffrey A.
                 Vaughan",
  title =        "Relational lenses: a language for updatable views",
  crossref =     "ACM:2006:PTF",
  pages =        "338--347",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gollapudi:2006:PC,
  author =       "Sreenivas Gollapudi and Ravi Kumar and D. Sivakumar",
  title =        "Programmable clustering",
  crossref =     "ACM:2006:PTF",
  pages =        "348--354",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Franconi:2006:LRS,
  author =       "Enrico Franconi and Sergio Tessaris",
  title =        "The logic of {RDF} and {SPARQL}: a tutorial",
  crossref =     "ACM:2006:PTF",
  pages =        "355--355",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Rosati:2006:DFC,
  author =       "Riccardo Rosati",
  title =        "On the decidability and finite controllability of
                 query processing in databases with incomplete
                 information",
  crossref =     "ACM:2006:PTF",
  pages =        "356--365",
  year =         "2006",
  bibdate =      "Wed Aug 23 12:08:55 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Dalvi:2007:MPD,
  author =       "Nilesh Dalvi and Dan Suciu",
  title =        "Management of probabilistic data: foundations and
                 challenges",
  crossref =     "ACM:2007:PTS",
  pages =        "1--12",
  year =         "2007",
  DOI =          "https://doi.org/10.1145/1265530.1265531",
  bibdate =      "Fri Jun 20 14:06:25 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Many applications today need to manage large data sets
                 with uncertainties. In this paper we describe the
                 foundations of managing data where the uncertainties
                 are quantified as probabilities. We review the basic
                 definitions of the probabilistic data model, present
                 some fundamental theoretical result for query
                 evaluation on probabilistic databases, and discuss
                 several challenges, open problems, and research
                 directions.",
  acknowledgement = ack-nhfb,
  keywords =     "probabilistic databases; query processing",
}

@InProceedings{Gottlob:2007:GHD,
  author =       "Georg Gottlob and Zoltan Miklos and Thomas
                 Schwentick",
  title =        "Generalized hypertree decompositions: {NP}-hardness
                 and tractable variants",
  crossref =     "ACM:2007:PTS",
  pages =        "13--22",
  year =         "2007",
  DOI =          "https://doi.org/10.1145/1265530.1265533",
  bibdate =      "Fri Jun 20 14:06:25 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "The generalized hypertree width GHW($H$) of a
                 hypergraph $H$ is a measure of its cyclicity. Classes
                 of conjunctive queries or constraint satisfaction
                 problems whose associated hypergraphs have bounded GHW
                 are known to be solvable in polynomial time. However,it
                 has been an open problem for several years if for a
                 fixed constant $k$ and input hypergraph $H$ it can be
                 determined in polynomial time whether GHW($H$)",
  acknowledgement = ack-nhfb,
  keywords =     "acyclic; conjunctive query; hypergraph; hypertree
                 decomposition; NP-complete; tractable; tree projection
                 problem",
}

@InProceedings{Marx:2007:QDV,
  author =       "Maarten Marx",
  title =        "Queries determined by views: pack your views",
  crossref =     "ACM:2007:PTS",
  pages =        "23--30",
  year =         "2007",
  DOI =          "https://doi.org/10.1145/1265530.1265534",
  bibdate =      "Fri Jun 20 14:06:25 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "A query $Q$ is determined by a set of views $V$ if,
                 whenever $V(I_1) = V(I_2)$ for two database instances
                 $I_1$, $I_2$ then also $Q(I_1) = Q(I_2)$. Does this
                 imply that $Q$ can be rewritten as a query $Q_0$ that
                 only uses the views $V$?.\par

                 For first-order (FO) queries and view definitions over
                 possibly infinite databases, the answer is yes, as
                 follows from old results of Beth and Craig. We say that
                 FO is complete for FO-to-FO rewritings. However, Nash,
                 Segoufin and Vianu (2007) prove that if the query and
                 the view definitions are given by conjunctive queries,
                 then it might not be possible to formulate $Q'$ as a
                 conjunctive query. In other words, CQ is not complete
                 for CQ-to-CQ rewritings.\par

                 Here we consider queries and view definitions in the
                 packed fragment (PF) of first-order logic. This is a
                 generalization of the guarded fragment, a fragment of
                 particular interest to database theory. Gottlob et al.
                 2002 show that the guarded conjunctive queries are
                 exactly the acyclic queries. Leinders et al. 2005
                 characterize the entire guarded fragment by the
                 semijoin algebra.\par

                 We show that for both finite and unrestricted
                 databases, PF is complete for PF-to-PF rewritings. The
                 same holds for packed (unions of) conjunctive queries.
                 In both cases, we provide algorithms for testing
                 whether a query is determined by a set of views, and
                 for actually rewriting $Q$ to $Q'$. To compare: these
                 problems are undecidable for full FO, and still open
                 for conjunctive queries.",
  acknowledgement = ack-nhfb,
  keywords =     "definability; guarded fragment; query rewriting;
                 views",
}

@InProceedings{Green:2007:PS,
  author =       "Todd J. Green and Grigoris Karvounarakis and Val
                 Tannen",
  title =        "Provenance semirings",
  crossref =     "ACM:2007:PTS",
  pages =        "31--40",
  year =         "2007",
  DOI =          "https://doi.org/10.1145/1265530.1265535",
  bibdate =      "Fri Jun 20 14:06:25 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We show that relational algebra calculations for
                 incomplete databases, probabilistic databases, bag
                 semantics and why-provenance are particular cases of
                 the same general algorithms involving semirings. This
                 further suggests a comprehensive provenance
                 representation that uses semirings of polynomials. We
                 extend these considerations to datalog and semirings of
                 formal power series. We give algorithms for datalog
                 provenance calculation as well as datalog evaluation
                 for incomplete and probabilistic databases. Finally, we
                 show that for some semirings containment of conjunctive
                 queries is the same as for standard set semantics.",
  acknowledgement = ack-nhfb,
  keywords =     "data lineage; data provenance; datalog; formal power
                 series; incomplete databases; probabilistic databases;
                 semirings",
}

@InProceedings{Schweikardt:2007:MML,
  author =       "Nicole Schweikardt",
  title =        "Machine models and lower bounds for query processing",
  crossref =     "ACM:2007:PTS",
  pages =        "41--52",
  year =         "2007",
  DOI =          "https://doi.org/10.1145/1265530.1265537",
  bibdate =      "Fri Jun 20 14:06:25 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "This paper gives an overview of recent work on machine
                 models for processing massive amounts of data. The main
                 focus is on generalizations of the classical data
                 stream model where, apart from an 'internal memory' of
                 limited size, also a number of (potentially huge)
                 streams may be used as 'external memory devices'.",
  acknowledgement = ack-nhfb,
  keywords =     "complexity; data streams; external memory; lower
                 bounds; machine models; query processing; survey; XML",
}

@InProceedings{Chakaravarthy:2007:DTE,
  author =       "Venkatesan T. Chakaravarthy and Vinayaka Pandit and
                 Sambuddha Roy and Pranjal Awasthi and Mukesh Mohania",
  title =        "Decision trees for entity identification:
                 approximation algorithms and hardness results",
  crossref =     "ACM:2007:PTS",
  pages =        "53--62",
  year =         "2007",
  DOI =          "https://doi.org/10.1145/1265530.1265538",
  bibdate =      "Fri Jun 20 14:06:25 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We consider the problem of constructing decision trees
                 for entity identification from a given relational
                 table. The input is a table containing information
                 about a set of entities over a fixed set of attributes
                 and a probability distribution over the set of entities
                 that specifies the likelihood of the occurrence of each
                 entity. The goal is to construct a decision tree that
                 identifies each entity unambiguously by testing the
                 attribute values such that the average number of tests
                 is minimized. This classical problem finds such diverse
                 applications as efficient fault detection, species
                 identification in biology, and efficient diagnosis in
                 the field of medicine. Prior work mainly deals with the
                 special case where the input table is binary and the
                 probability distribution over the set of entities is
                 uniform. We study the general problem involving
                 arbitrary input tables and arbitrary probability
                 distributions over the set of entities. We consider a
                 natural greedy algorithm and prove an approximation
                 guarantee of $O(r_K \log N)$, where $N$ is the number
                 of entities and $K$ is the maximum number of distinct
                 values of an attribute. The value $r_K$ is a suitably
                 defined Ramsey number, which is at most $\log K$. We
                 show that it is NP-hard to approximate the problem
                 within a factor of $\Omega(\log N)$, even for binary
                 tables (i.e. $K = 2$). Thus, for the case of binary
                 tables, our approximation algorithm is optimal up to
                 constant factors (since $r_2 = 2$). In addition, our
                 analysis indicates a possible way of resolving a
                 Ramsey-theoretic conjecture by Erd{\H{o}}s.",
  acknowledgement = ack-nhfb,
  keywords =     "decision tree; Ramsey theory",
}

@InProceedings{Engelfriet:2007:XTT,
  author =       "Joost Engelfriet and Hendrik Jan Hoogeboom and Bart
                 Samwel",
  title =        "{XML} transformation by tree-walking transducers with
                 invisible pebbles",
  crossref =     "ACM:2007:PTS",
  pages =        "63--72",
  year =         "2007",
  DOI =          "https://doi.org/10.1145/1265530.1265540",
  bibdate =      "Fri Jun 20 14:06:25 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "The pebble tree automaton and the pebble tree
                 transducer are enhanced by additionally allowing an
                 unbounded number of 'invisible' pebbles (as opposed to
                 the usual ('visible' ones)). The resulting pebble tree
                 automata recognize the regular tree languages (i.e.,
                 can validate all generalized DTD's) and hence can find
                 all matches of MSO definable $n$-ary patterns.
                 Moreover, when viewed as a navigational device, they
                 lead to an XPath-like formalism that has a path
                 expression for every MSO definable binary pattern. The
                 resulting pebble tree transducers can apply arbitrary
                 MSO definable tests to (the observable part of) their
                 configurations, they (still) have a decidable
                 typechecking problem, and they can model the recursion
                 mechanism of XSLT. The time complexity of the
                 typechecking problem for conjunctive queries that use
                 MSO definable binary patterns can often be reduced
                 through the use of invisible pebbles.",
  acknowledgement = ack-nhfb,
  keywords =     "pebble; tree transducer; XML",
}

@InProceedings{tenCate:2007:CQC,
  author =       "Balder ten Cate and Carsten Lutz",
  title =        "The complexity of query containment in expressive
                 fragments of {XPath 2.0}",
  crossref =     "ACM:2007:PTS",
  pages =        "73--82",
  year =         "2007",
  DOI =          "https://doi.org/10.1145/1265530.1265541",
  bibdate =      "Fri Jun 20 14:06:25 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Query containment has been studied extensively for
                 fragments of XPath 1.0. For instance, the problem is
                 known to be ExpTime-complete for CoreXPath, the
                 navigational core of XPath 1.0. Much less is known
                 about query containment in (fragments of) the richer
                 language XPath 2.0. In this paper, we consider
                 extensions of CoreXPath with the following operators,
                 which are all part of XPath 2.0 (except the last): path
                 intersection, path equality, path complementation,
                 for-loops, and transitive closure. For each combination
                 of these operators, we determine the complexity of
                 query containment, both with and without DTDs. It turns
                 out to range from ExpTime (for extensions with path
                 equality) and 2-ExpTime (for extensions with path
                 intersection) to non-elementary (for extensions with
                 path complementation or for-loops). In almost all
                 cases, adding transitive closure on top has no further
                 impact on the complexity. We also investigate the
                 effect of dropping the upward and/or sibling axes, and
                 show that this sometimes leads to a reduction in
                 complexity. Since the languages we study include
                 negation and conjunction in filters, our complexity
                 results can equivalently be stated in terms of
                 satisfiability. We also analyze the above languages in
                 terms of succinctness.",
  acknowledgement = ack-nhfb,
  keywords =     "complexity; containment; satisfiability; XML; XPath",
}

@InProceedings{Fan:2007:ECX,
  author =       "Wenfei Fan and Floris Geerts and Frank Neven",
  title =        "Expressiveness and complexity of {XML} publishing
                 transducers",
  crossref =     "ACM:2007:PTS",
  pages =        "83--92",
  year =         "2007",
  DOI =          "https://doi.org/10.1145/1265530.1265542",
  bibdate =      "Fri Jun 20 14:06:25 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "A number of languages have been developed for
                 specifying XML publishing, i.e., transformations of
                 relational data into XML trees. These languages
                 generally describe the behaviors of a middleware
                 controller that builds an output tree iteratively,
                 issuing queries to a relational source and expanding
                 the tree with the query results at each step. To study
                 the complexity and expressive power of XML publishing
                 languages, this paper proposes a notion of publishing
                 transducers. Unlike automata for querying XML data, a
                 publishing transducer generates a new XML tree rather
                 than performing a query on an existing tree. We study a
                 variety of publishing transducers based on what
                 relational queries a transducer can issue, what
                 temporary stores a transducer can use during tree
                 generation, and whether or not some tree nodes are
                 allowed to be virtual, i.e., excluded from the output
                 tree. We first show how existing XML publishing
                 languages can be characterized by such transducers. We
                 then study the members ip, emptiness and equivalence
                 problems for various classes of transducers and
                 existing publishing languages. We establish lower and
                 upper bounds, all matching except one, ranging from
                 PTIME to undecidable. Finally, we investigate the
                 expressive power of these transducers and existing
                 languages. We show that when treated as relational
                 query languages, different classes of transducers
                 capture either complexity classes(e.g., PSPACE) or
                 fragments of datalog(e.g., linear datalog). For tree
                 generation, we establish connections between publishing
                 transducers and logical transductions.",
  acknowledgement = ack-nhfb,
  keywords =     "complexity; expressiveness; XML publishing",
}

@InProceedings{Gemulla:2007:MBS,
  author =       "Rainer Gemulla and Wolfgang Lehner and Peter J. Haas",
  title =        "Maintaining {Bernoulli} samples over evolving
                 multisets",
  crossref =     "ACM:2007:PTS",
  pages =        "93--102",
  year =         "2007",
  DOI =          "https://doi.org/10.1145/1265530.1265544",
  bibdate =      "Fri Jun 20 14:06:25 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Random sampling has become a crucial component of
                 modern data management systems. Although the literature
                 on database sampling is large, there has been
                 relatively little work on the problem of maintaining a
                 sample in the presence of arbitrary insertions and
                 deletions to the underlying dataset. Most existing
                 maintenance techniques apply either to the insert-only
                 case or to datasets that do not contain duplicates. In
                 this paper, we provide a scheme that maintains a
                 Bernoulli sample of an underlying multiset in the
                 presence of an arbitrary stream of updates, deletions,
                 and insertions. Importantly, the scheme never needs to
                 access the underlying multiset. Such Bernoulli samples
                 are easy to manipulate, and are well suited to parallel
                 processing environments. Our method can be viewed as an
                 enhancement of the 'counting sample' scheme developed
                 by Gibbons and Matias for estimating the frequency of
                 highly frequent items. We show how the 'tracking
                 counters' used by our maintenance scheme can be
                 exploited to estimate population frequencies, sums, and
                 averages in an unbiased manner, with lower variance
                 than the usual estimators based on a Bernoulli sample.
                 The number of distinct items in the multiset can also
                 be estimated without bias. Finally, we discuss certain
                 problems of subsampling and merging that a rise in
                 systems with limited memory resources or distributed
                 processing, respectively.",
  acknowledgement = ack-nhfb,
  keywords =     "Bernoulli multiset sampling; incremental sample
                 maintenance",
}

@InProceedings{Chierichetti:2007:FNN,
  author =       "Flavio Chierichetti and Alessandro Panconesi and
                 Prabhakar Raghavan and Mauro Sozio and Alessandro
                 Tiberi and Eli Upfal",
  title =        "Finding near neighbors through cluster pruning",
  crossref =     "ACM:2007:PTS",
  pages =        "103--112",
  year =         "2007",
  DOI =          "https://doi.org/10.1145/1265530.1265545",
  bibdate =      "Fri Jun 20 14:06:25 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Finding near(est) neighbors is a classic, difficult
                 problem in data management and retrieval, with
                 applications in text and image search,in finding
                 similar objects and matching patterns. Here we study
                 cluster pruning, an extremely simple randomized
                 technique. During preprocessing we randomly choose a
                 subset of data points to be leaders the remaining data
                 points are partitioned by which leader is the closest.
                 For query processing, we find the leader(s) closest to
                 the query point. We then seek the nearest neighbors for
                 the query point among only the points in the clusters
                 of the closest leader(s). Recursion may be used in both
                 preprocessing and in search. Such schemes seek
                 approximate nearest neighbors that are 'almost as good'
                 as the nearest neighbors. How good are these
                 approximations and how much do they save in
                 computation.\par

                 Our contributions are: (1) we quantify metrics that
                 allow us to study the tradeoff between processing and
                 the quality of the approximate nearest neighbors; (2)
                 we give rigorous theoretical analysis of our schemes,
                 under natural generative processes (generalizing
                 Gaussian mixtures) for the data points; (3) experiments
                 on both synthetic data from such generative processes,
                 as well as on from a document corpus, confirming that
                 we save orders of magnitude in query processing cost at
                 modest compromises in the quality of retrieved points.
                 In particular, we show that $p$-spheres, a
                 state-of-the-art solution, is outperformed by our
                 simple scheme whether the data points are stored in
                 main or in external memo.",
  acknowledgement = ack-nhfb,
  keywords =     "clustering; generative model; nearest neighbor",
}

@InProceedings{Hernich:2007:CSD,
  author =       "Andre Hernich and Nicole Schweikardt",
  title =        "{CWA}-solutions for data exchange settings with target
                 dependencies",
  crossref =     "ACM:2007:PTS",
  pages =        "113--122",
  year =         "2007",
  DOI =          "https://doi.org/10.1145/1265530.1265547",
  bibdate =      "Fri Jun 20 14:06:25 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Data exchange deals with the following problem: given
                 an instance over a source schema, a specification of
                 the relationship between the source and the target,and
                 dependencies on the target, construct an instance over
                 a target schema that satisfies the given relationships
                 and dependencies. Recently --- for data exchange
                 settings without target dependencies --- Libkin
                 (PODS'06) introduced a new concept of solutions based
                 on the closed world assumption (so-called
                 CWA-solutions), and showed that, in some respects, this
                 new notion behaves better than the standard notion of
                 solutions considered in previous papers on data
                 exchange. The present paper extends Libkin's notion of
                 CWA-solutions to data exchange settings with target
                 dependencies. We show that, when restricting attention
                 to data exchange settings with weakly acyclic target
                 dependencies, this new notion behaves similarly as
                 before: the core is the unique 'minimal' CWA-solution,
                 and computing CWA-solutions as well as certain answers
                 to positive queries is possible in polynomial time and
                 can be PTIME-hard. However, there may be more than one
                 'maximal' CWA-solution. And going beyond the class of
                 positive queries, we obtain that there are conjunctive
                 queries with (just) one inequality, for which
                 evaluating the certain answers is coNP-hard. Finally,
                 we consider the EXISTENCE-OF-CWA-SOLUTIONS problem:
                 while the problem is tractable for data exchange
                 settings with weakly acyclic target dependencies, it
                 turns out to be undecidable for general data exchange
                 settings. As a consequence, we obtain that also the
                 EXISTENCE-OF-UNIVERSAL-SOLUTIONS problem is undecidable
                 in genera.",
  acknowledgement = ack-nhfb,
  keywords =     "closed world assumption; core; data exchange; the
                 chase",
}

@InProceedings{Fagin:2007:QIS,
  author =       "Ronald Fagin and Phokion G. Kolaitis and Lucian Popa
                 and Wang-Chiew Tan",
  title =        "Quasi-inverses of schema mappings",
  crossref =     "ACM:2007:PTS",
  pages =        "123--132",
  year =         "2007",
  DOI =          "https://doi.org/10.1145/1265530.1265548",
  bibdate =      "Fri Jun 20 14:06:25 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Schema mappings are high-level specifications that
                 describe the relationship between two database schemas.
                 Two operators on schema mappings, namely the
                 composition operator and the inverse operator, are
                 regarded as especially important. Progress on the study
                 of the inverse operator was not made until very
                 recently, as even finding the exact semantics of this
                 operator turned out to be a fairly delicate task.
                 Furthermore, this notion is rather restrictive, since
                 it is rare that a schema mapping possesses an
                 inverse.\par

                 In this paper, we introduce and study the notion of a
                 quasi-inverse of a schema mapping. This notion is a
                 principled relaxation of the notion of an inverse of a
                 schema mapping; intuitively, it is obtained from the
                 notion of an inverse by not differentiating between
                 instances that are equivalent for data-exchange
                 purposes. For schema mappings specified by
                 source-to-target tuple-generating dependencies ($s$-$t$
                 tgds), we give a necessary and sufficient combinatorial
                 condition for the existence of a quasi-inverse, and
                 then use this condition to obtain both positive and
                 negative results about the existence of quasi-inverses.
                 In particular, we show that every LAV (local-as-view)
                 schema mapping has a quasi-inverse, but that there are
                 schema mappings specified by full $s$-$t$ tgds that
                 have no quasi-inverse. After this, we study the
                 language needed to express quasi-inverses of schema
                 mappings specified by $s$-$t$ tgds, and we obtain a
                 complete characterization. We also characterize the
                 language needed to express inverses of schema mappings,
                 and thereby solve a problem left open in the earlier
                 study of the inverse operator. Finally, we show that
                 quasi-inverses can be used in many cases to recover the
                 data that was exported by the original schema mapping
                 when performing data exchange.",
  acknowledgement = ack-nhfb,
  keywords =     "chase; data exchange; data integration; dependencies;
                 inverse; metadata model management; quasi-inverse;
                 schema mapping",
}

@InProceedings{DeGiacomo:2007:RDE,
  author =       "Giuseppe {De Giacomo} and Domenico Lembo and Maurizio
                 Lenzerini and Riccardo Rosati",
  title =        "On reconciling data exchange, data integration, and
                 peer data management",
  crossref =     "ACM:2007:PTS",
  pages =        "133--142",
  year =         "2007",
  DOI =          "https://doi.org/10.1145/1265530.1265549",
  bibdate =      "Fri Jun 20 14:06:25 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Data exchange and virtual data integration have been
                 the subject of several investigations in the recent
                 literature. At the same time, the notion of peer data
                 management has emerged as a powerful abstraction of
                 many forms of flexible and dynamic data-centered
                 distributed systems. Although research on the above
                 issues has progressed considerably in the last years, a
                 clear understanding on how to combine data exchange and
                 data integration in peer data management is still
                 missing. This is the subject of the present paper. We
                 start our investigation by first proposing a novel
                 framework for peer data exchange, showing that it is a
                 generalization of the classical data exchange setting.
                 We also present algorithms for all the relevant data
                 exchange tasks, and show that they can all be done in
                 polynomial time with respect to data complexity. Based
                 on the motivation that typical mappings and integrity
                 constraints found in data integration are not captured
                 by peer data exchange, we extend the framework to
                 incorporate these features. One of the main
                 difficulties is that the constraints of this new class
                 are not amenable to materialization. We address this
                 issue by resorting to a suitable combination of virtual
                 and materialized data exchange, showing that the
                 resulting framework is a generalization of both
                 classical data exchange and classical data integration,
                 and that the new setting incorporates the most
                 expressive types of mapping and constraints considered
                 in the two contexts. Finally, we present algorithms for
                 all the relevant data management tasks also in the new
                 setting, and show that, again, their data complexity is
                 polynomial.",
  acknowledgement = ack-nhfb,
  keywords =     "data exchange; data integration; peer data
                 management",
}

@InProceedings{VandenBussche:2007:CCD,
  author =       "Jan {Van den Bussche} and Dirk {Van Gucht} and Stijn
                 Vansummeren",
  title =        "A crash course on database queries",
  crossref =     "ACM:2007:PTS",
  pages =        "143--154",
  year =         "2007",
  DOI =          "https://doi.org/10.1145/1265530.1265551",
  bibdate =      "Fri Jun 20 14:06:25 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Complex database queries, like programs in general,
                 can 'crash', i.e., can raise runtime errors. We want to
                 avoid crashes without losing expressive power, or we
                 want to correctly predict the absence of crashes. We
                 show how concepts and techniques from programming
                 language theory, notably type systems and reflection,
                 can be adapted to this end. Of course, the specific
                 nature of database queries (as opposed to general
                 programs), also requires some new methods, and raises
                 new questions.",
  acknowledgement = ack-nhfb,
  keywords =     "nested relational calculus; reflection; relational
                 algebra; runtime error; typability; type inference;
                 type system; well-definedness; XQuery",
}

@InProceedings{Kasneci:2007:CRA,
  author =       "Gjergji Kasneci and Thomas Schwentick",
  title =        "The complexity of reasoning about pattern-based {XML}
                 schemas",
  crossref =     "ACM:2007:PTS",
  pages =        "155--164",
  year =         "2007",
  DOI =          "https://doi.org/10.1145/1265530.1265552",
  bibdate =      "Fri Jun 20 14:06:25 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "In a recent paper, Martens et al. introduced a
                 specification mechanism for XML tree languages, based
                 on rules of the form $(r,s)$, where $r$, $s$ are
                 regular expressions. Sets of such rules can be
                 interpreted in an existential or a universal fashion.
                 An XML tree is existentially valid with respect to a
                 rule set, if for each node there is a rule such that
                 the root path of the node matches $r$ and the children
                 sequence of the node matches $s$. It is universally
                 valid if each node matching $r$ also matches $s$. This
                 paper investigates the complexity of reasoning about
                 such rule sets, in particular the satisfiability and
                 the implication problem. Whereas, in general these
                 reasoning problems are complete for EXPTIME, two
                 important fragments are identified with PSPACE and
                 PTIME complexity, respectively.",
  acknowledgement = ack-nhfb,
  keywords =     "integrity constraints; XML schemas",
}

@InProceedings{Gottlob:2007:MDF,
  author =       "Georg Gottlob and Reinhard Pichler and Fang Wei",
  title =        "Monadic datalog over finite structures with bounded
                 treewidth",
  crossref =     "ACM:2007:PTS",
  pages =        "165--174",
  year =         "2007",
  DOI =          "https://doi.org/10.1145/1265530.1265554",
  bibdate =      "Fri Jun 20 14:06:25 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Bounded treewidth and Monadic Second Order (MSO) logic
                 have proved to be key concepts in establishing
                 fixed-para-meter tractability results. Indeed, by
                 Courcelle's Theorem we know: Any property of finite
                 structures, which is expressible by an MSO sentence,
                 can be decided in linear time (data complexity) if the
                 structures have bounded treewidth.\par

                 In principle, Courcelle's Theorem can be applied
                 directly to construct concrete algorithms by
                 transforming the MSO evaluation problem into a tree
                 language recognition problem. The latter can then be
                 solved via a finite tree automaton (FTA). However, this
                 approach has turned out to be problematical, since even
                 relatively simple MSO formulae may lead to a 'state
                 explosion' of the FTA.\par

                 In this work we propose monadic datalog (i.e., data log
                 where all intentional predicate symbols are unary) as
                 an alternative method to tackle this class of
                 fixed-parameter tractable problems. We show that if
                 some property of finite structures is expressible in
                 MSO then this property can also be expressed by means
                 of a monadic datalog program over the structure plus
                 the tree decomposition. Moreover, we show that the
                 resulting fragment of datalog can be evaluated in
                 linear time (both w.r.t. the program size and w.r.t.
                 the data size). This new approach is put to work by
                 devising a new algorithm for the PRIMALITY problem
                 (i.e., testing if some attribute in a relational schema
                 is part of a key). We also report on experimental
                 results with a prototype implementation.",
  acknowledgement = ack-nhfb,
  keywords =     "datalog; fixed-parameter tractability; monadic second
                 order logic; tree decomposition; treewidth",
}

@InProceedings{Machlin:2007:IBM,
  author =       "Rona Machlin",
  title =        "Index-based multidimensional array queries: safety and
                 equivalence",
  crossref =     "ACM:2007:PTS",
  pages =        "175--184",
  year =         "2007",
  DOI =          "https://doi.org/10.1145/1265530.1265555",
  bibdate =      "Fri Jun 20 14:06:25 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We propose a new multidimensional array query model
                 giving array bounds and other shape-related metadata a
                 central role. Arrays are treated as shaped maps from
                 indices to values. Schemas are augmented by shape
                 constraints. Queries also have shape preconditions.
                 Within this framework, we introduce the index-based
                 array queries expressing index reorganizations and
                 value summarizations. We define them via a declarative,
                 rule-based language with shape-membership constraints
                 in its rule bodies and subscripting and aggregation in
                 its rule heads. We explore safety (including bounds
                 analysis) and query equivalence for various subclasses
                 divided according to the aggregator type, whether we
                 allow disjunctions, and whether we allow (limited)
                 Presburger arithmetic in index and shape terms. We show
                 safety is tractable in the nonarithmetic cases, while
                 state safety remains in $P$ in the arithmetic ones. We
                 show that, for a class of monoid-based set and bag
                 aggregators, equivalence reduces to equivalence of
                 index-cores --- core queries collecting array indices
                 rather than values. Forset-aggregator queries, we give
                 complete characterizations of equivalence in terms of
                 containment maps and show the equivalence problems are
                 in $P$ in the nonarithmetic, conjunctive case and in
                 coNP in all others.",
  acknowledgement = ack-nhfb,
  keywords =     "aggregation; array query languages; integer linear
                 constraints; multidimensional data; query equivalence;
                 scientific data",
}

@InProceedings{Badia:2007:NLP,
  author =       "Antonio Badia and Stijn Vansummeren",
  title =        "Non-linear prefixes in query languages",
  crossref =     "ACM:2007:PTS",
  pages =        "185--194",
  year =         "2007",
  DOI =          "https://doi.org/10.1145/1265530.1265556",
  bibdate =      "Fri Jun 20 14:06:25 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "In first order logic there are two main extensions to
                 quantification: generalized quantifiers and non-linear
                 prefixes. While generalized quantifiers have been
                 explored from a database perspective, non-linear
                 prefixes have not-most likely because of complexity
                 concerns. In this paper we first illustrate the
                 usefulness of non-linear prefixes in query languages by
                 means of example queries. We then introduce the subject
                 formally, distinguishing between two forms of
                 non-linearity: branching and cumulation. To escape
                 complexity concerns, we focus on monadic quantifiers.
                 In this context, we show that branching does not extend
                 the expressive power of first order logic when it is
                 interpreted over finite models, while cumulation does
                 not extend the expressive power when it is interpreted
                 over bounded models. Branching and cumulation do,
                 however, allow us to formulate some queries in a
                 succinct and elegant manner. When branching and
                 cumulation are interpreted over infinite models, we
                 show that the resulting language can be embedded in an
                 infinitary logic proposed by Libkin. We also discuss
                 non-linear prefixes from an algorithmic point of
                 view.",
  acknowledgement = ack-nhfb,
  keywords =     "branching; cumulation; generalized quantifiers;
                 non-linear prefixes",
}

@InProceedings{Cautis:2007:RAX,
  author =       "Bogdan Cautis and Serge Abiteboul and Tova Milo",
  title =        "Reasoning about {XML} update constraints",
  crossref =     "ACM:2007:PTS",
  pages =        "195--204",
  year =         "2007",
  DOI =          "https://doi.org/10.1145/1265530.1265558",
  bibdate =      "Fri Jun 20 14:06:25 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We introduce in this paper a class of constraints for
                 describing how an XML document can evolve, namely XML
                 update constraints. For these constraints, we study the
                 implication problem, giving algorithms and complexity
                 results for constraints of varying expressive power.
                 Besides classical constraint implication, we also
                 consider an instance-based approach. More precisely, we
                 study implication with respect to a current tree
                 instance, resulting from a series of unknown updates.
                 The main motivation of our work is reasoning about data
                 integrity under update restrictions in contexts where
                 owners may lose control over their data, such as in
                 publishing or exchange.",
  acknowledgement = ack-nhfb,
  keywords =     "data integrity; implication; semi-structured data;
                 update constraints; XML",
}

@InProceedings{Filiot:2007:PTF,
  author =       "Emmanuel Filiot and Joachim Niehren and Jean-Marc
                 Talbot and Sophie Tison",
  title =        "Polynomial time fragments of {XPath} with variables",
  crossref =     "ACM:2007:PTS",
  pages =        "205--214",
  year =         "2007",
  DOI =          "https://doi.org/10.1145/1265530.1265559",
  bibdate =      "Fri Jun 20 14:06:25 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Variables are the distinguishing new feature of XPath
                 2.0 which permits to select $n$-tuples of nodes in
                 trees. It is known that the Core of XPath 2.0 captures
                 $n$-ary first-order (FO) queries modulo linear time
                 transformations. In this paper, we distinguish a
                 fragment of Core XPath 2.0 that remains FO-complete
                 with respect to $n$-ary queries while enjoying
                 polynomial-time query answering.",
  acknowledgement = ack-nhfb,
  keywords =     "$N$-ary queries; logic; XML; XPath",
}

@InProceedings{Munagala:2007:OCQ,
  author =       "Kamesh Munagala and Utkarsh Srivastava and Jennifer
                 Widom",
  title =        "Optimization of continuous queries with shared
                 expensive filters",
  crossref =     "ACM:2007:PTS",
  pages =        "215--224",
  year =         "2007",
  DOI =          "https://doi.org/10.1145/1265530.1265561",
  bibdate =      "Fri Jun 20 14:06:25 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We consider the problem of optimizing and executing
                 multiple continuous queries, where each query is a
                 conjunction of filters and each filter may occur in
                 multiple queries. When filters are expensive,
                 significant performance gains are achieved by sharing
                 filter evaluations across queries. A shared execution
                 strategy in our scenario can either be fixed, in which
                 filters are evaluated in the same predetermined order
                 for all input, or adaptive, in which the next filter to
                 be evaluated is chosen at runtime based on the results
                 of the filters evaluated so far. We show that as filter
                 costs increase, the best adaptive strategy is superior
                 to any fixed strategy, despite the overhead of
                 adaptivity. We show that it is NP-hard to find the
                 optimal adaptive strategy, even if we are willing to
                 approximate within any factor smaller than $m$ where
                 $m$ is the number of queries. We then present a greedy
                 adaptive execution strategy and show that it
                 approximates the best adaptive strategy to within a
                 factor $O(\log^2 m \log n)$ where $n$ is the number of
                 distinct filters. We also give a precomputation
                 technique that can reduce the execution overhead of
                 adaptive strategies.",
  acknowledgement = ack-nhfb,
  keywords =     "expensive predicates; query optimization; shared
                 execution",
}

@InProceedings{Zhang:2007:VES,
  author =       "Linfeng Zhang and Yong Guan",
  title =        "Variance estimation over sliding windows",
  crossref =     "ACM:2007:PTS",
  pages =        "225--232",
  year =         "2007",
  DOI =          "https://doi.org/10.1145/1265530.1265562",
  bibdate =      "Fri Jun 20 14:06:25 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Capturing characteristics of large data streams has
                 received considerable attention. The constraints in
                 space and time restrict the data stream processing to
                 only one pass (or a small number of passes). Processing
                 data streams over sliding windows make the problem more
                 difficult and challenging. In this paper, we address
                 the problem of maintaining $\epsilon$-approximate
                 variance of data streams over sliding windows. To our
                 knowledge, the best existing algorithm requires
                 $O(1/\epsilon 2 \log N)$ space, though the lower bound
                 for this problem is $\Omega(1/\epsilon \log N)$. We
                 propose the first $\epsilon$-approximation algorithm to
                 this problem that is optimal in both space and worst
                 case time. Our algorithm requires $O(1/\epsilon \log
                 N)$ space. Furthermore, its running time is $O(1)$ in
                 worst case.",
  acknowledgement = ack-nhfb,
  keywords =     "data mining; data streams; sliding windows; variance
                 estimation",
}

@InProceedings{Alur:2007:MWT,
  author =       "Rajeev Alur",
  title =        "Marrying words and trees",
  crossref =     "ACM:2007:PTS",
  pages =        "233--242",
  year =         "2007",
  DOI =          "https://doi.org/10.1145/1265530.1265564",
  bibdate =      "Fri Jun 20 14:06:25 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Traditionally, data that has both linear and
                 hierarchical structure, such as annotated linguistic
                 data, is modeled using ordered trees and queried using
                 tree automata. In this paper, we argue that nested
                 words and automata over nested words offer a better way
                 to capture and process the dual structure. Nested words
                 generalize both words and ordered trees, and allow both
                 word and tree operations. We study various classes of
                 automata over nested words, and show that while they
                 enjoy expressiveness and succinctness benefits over
                 word and tree automata, their analysis complexity and
                 closure properties are analogous to the corresponding
                 word and tree special cases. In particular, we show
                 that finite-state nested word automata can be
                 exponentially more succinct than tree automata, and
                 pushdown nested word automata include the two
                 incomparable classes of context-free word languages and
                 context-free tree languages.",
  acknowledgement = ack-nhfb,
  keywords =     "nested words; pushdown automata; query languages; tree
                 automata; XML",
}

@InProceedings{Jayram:2007:ESA,
  author =       "T. S. Jayram and Andrew McGregor and S. Muthukrishnan
                 and Erik Vee",
  title =        "Estimating statistical aggregates on probabilistic
                 data streams",
  crossref =     "ACM:2007:PTS",
  pages =        "243--252",
  year =         "2007",
  DOI =          "https://doi.org/10.1145/1265530.1265565",
  bibdate =      "Fri Jun 20 14:06:25 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "The probabilistic-stream model was introduced by
                 Jayram et al. [20].It is a generalization of the data
                 stream model that is suited to handling 'probabilistic'
                 data, where each item of the stream represents a
                 probability distribution over a set of possible events.
                 Therefore, a probabilistic stream determines a
                 distribution over a potentially exponential number of
                 classical 'deterministic' streams where each item is
                 deterministically one of the domain
                 values.\par

                 Designing efficient aggregation algorithms for
                 probabilistic data is crucial for handling uncertainty
                 in data-centric applications such as OLAP. Such
                 algorithms are also useful in a variety of other
                 setting including analyzing search engine traffic and
                 aggregation in sensor networks.\par

                 We present algorithms for computing commonly used
                 aggregates on a probabilistic stream. We present the
                 first one pass streaming algorithms for estimating the
                 expected mean of a probabilistic stream, improving upon
                 results in [20]. Next, we consider the problem of
                 estimating frequency moments for probabilistic data. We
                 propose a general approach to obtain unbiased
                 estimators working over probabilistic data by utilizing
                 unbiased estimators designed for standard streams.
                 Applying this approach, we extend a classical data
                 stream algorithm to obtain a one-pass algorithm for
                 estimating F2, the second frequency moment. We present
                 the first known streaming algorithms for estimating F0,
                 the number of distinct items on probabilistic streams.
                 Our work also gives an efficient one-pass algorithm for
                 estimating the median of a probabilistic stream.",
  acknowledgement = ack-nhfb,
  keywords =     "frequency moments; mean; median; OLAP; probabilistic
                 streams",
}

@InProceedings{Cohen:2007:SUD,
  author =       "Edith Cohen and Nick Duffield and Haim Kaplan and
                 Carsten Lund and Mikkel Thorup",
  title =        "Sketching unaggregated data streams for
                 subpopulation-size queries",
  crossref =     "ACM:2007:PTS",
  pages =        "253--262",
  year =         "2007",
  DOI =          "https://doi.org/10.1145/1265530.1265566",
  bibdate =      "Fri Jun 20 14:06:25 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "IP packet streams consist of multiple interleaving IP
                 flows. Statistical summaries of these streams,
                 collected for different measurement periods, are used
                 for characterization of traffic, billing, anomaly
                 detection, inferring traffic demands, configuring
                 packet filters and routing protocols, and more. While
                 queries are posed over the set of flows, the
                 summarization algorithm is applied to the stream of
                 packets. Aggregation of traffic into flows before
                 summarization requires storage of per-flow counters,
                 which is often infeasible. Therefore, the summary has
                 to be produced over the unaggregated stream.\par

                 An important aggregate performed over a summary is to
                 approximate the size of a subpopulation of flows that
                 is specified a posteriori. For example, flows belonging
                 to an application such as Web or DNS or flows that
                 originate from a certain Autonomous System. We design
                 efficient streaming algorithms that summarize
                 unaggregated streams and provide corresponding unbiased
                 estimators for subpopulation sizes. Our summaries
                 outperform, in terms of estimates accuracy, those
                 produced by packet sampling deployed by Cisco's sampled
                 NetFlow, the most widely deployed such system.
                 Performance of our best method, step sample-and-hold is
                 close to that of summaries that can be obtained from
                 pre-aggregated traffic.",
  acknowledgement = ack-nhfb,
  keywords =     "data streams; IP flows; sketches; subpopulation size",
}

@InProceedings{White:2007:WNE,
  author =       "Walker White and Mirek Riedewald and Johannes Gehrke
                 and Alan Demers",
  title =        "What is `next' in event processing?",
  crossref =     "ACM:2007:PTS",
  pages =        "263--272",
  year =         "2007",
  DOI =          "https://doi.org/10.1145/1265530.1265567",
  bibdate =      "Fri Jun 20 14:06:25 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Event processing systems have wide applications
                 ranging from managing events from RFID readers to
                 monitoring RSS feeds. Consequently, there exists much
                 work on them in the literature. The prevalent use of
                 these systems is on-line recognition of patterns that
                 are sequences of correlated events in event streams.
                 Query semantics and implementation efficiency are
                 inherently determined by the underlying temporal model:
                 how events are sequenced (what is the 'next' event),
                 and how the time stamp of an event is represented. Many
                 competing temporal models for event systems have been
                 proposed, with no consensus on which approach is
                 best.\par

                 We take a foundational approach to this problem. We
                 create a formal framework and present event system
                 design choices as axioms. The axioms are grouped into
                 standard axioms and desirable axioms. Standard axioms
                 are common to the design of all event systems.
                 Desirable axioms are not always satisfied, but are
                 useful for achieving high performance. Given these
                 axioms, we prove several important results. First, we
                 show that there is a unique model up to isomorphism
                 that satisfies the standard axioms and supports
                 associativity, so our axioms are a sound and complete
                 axiomatization of associative time stamps in event
                 systems. This model requires time stamps with unbounded
                 representations. We present a slightly weakened version
                 of associativity that permits a temporal model with
                 bounded representations. We show that adding the
                 boundedness condition also results in a unique model,
                 so again our axiomatization is sound and complete. We
                 believe this model is ideally suited to be the standard
                 temporal model for complex event processing.",
  acknowledgement = ack-nhfb,
  keywords =     "axiomatization; events; temporal models",
}

@InProceedings{Barak:2007:PAC,
  author =       "Boaz Barak and Kamalika Chaudhuri and Cynthia Dwork
                 and Satyen Kale and Frank McSherry and Kunal Talwar",
  title =        "Privacy, accuracy, and consistency too: a holistic
                 solution to contingency table release",
  crossref =     "ACM:2007:PTS",
  pages =        "273--282",
  year =         "2007",
  DOI =          "https://doi.org/10.1145/1265530.1265569",
  bibdate =      "Fri Jun 20 14:06:25 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "The contingency table is a work horse of official
                 statistics, the format of reported data for the US
                 Census, Bureau of Labor Statistics, and the Internal
                 Revenue Service. In many settings such as these privacy
                 is not only ethically mandated, but frequently legally
                 as well. Consequently there is an extensive and diverse
                 literature dedicated to the problems of statistical
                 disclosure control in contingency table release.
                 However, all current techniques for reporting
                 contingency tables fall short on at least one of
                 privacy, accuracy, and consistency (among multiple
                 released tables). We propose a solution that provides
                 strong guarantees for all three desiderata
                 simultaneously.\par

                 Our approach can be viewed as a special case of a more
                 general approach for producing synthetic data: Any
                 privacy-preserving mechanism for contingency table
                 release begins with raw data and produces a (possibly
                 inconsistent) privacy-preserving set of marginals. From
                 these tables alone-and hence without weakening
                 privacy--we will find and output the 'nearest'
                 consistent set of marginals. Interestingly, this set is
                 no farther than the tables of the raw data, and
                 consequently the additional error introduced by the
                 imposition of consistency is no more than the error
                 introduced by the privacy mechanism itself.\par

                 The privacy mechanism of [20] gives the strongest known
                 privacy guarantees, with very little error. Combined
                 with the techniques of the current paper, we therefore
                 obtain excellent privacy, accuracy, and consistency
                 among the tables. Moreover, our techniques are
                 surprisingly efficient. Our techniques apply equally
                 well to the logical cousin of the contingency table,
                 the OLAP cube.",
  acknowledgement = ack-nhfb,
  keywords =     "contingency table; OLAP; privacy",
}

@InProceedings{Senellart:2007:CMP,
  author =       "Pierre Senellart and Serge Abiteboul",
  title =        "On the complexity of managing probabilistic {XML}
                 data",
  crossref =     "ACM:2007:PTS",
  pages =        "283--292",
  year =         "2007",
  DOI =          "https://doi.org/10.1145/1265530.1265570",
  bibdate =      "Fri Jun 20 14:06:25 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "In [3], we introduced a framework for querying and
                 updating probabilistic information over unordered
                 labeled trees, the probabilistic tree model. The data
                 model is based on trees where nodes are annotated with
                 conjunctions of probabilistic event variables. We
                 briefly described an implementation and scenarios of
                 usage. We develop here a mathematical foundation for
                 this model. In particular, we present complexity
                 results. We identify a very large class of queries for
                 which simple variations of querying and updating
                 algorithms from [3] compute the correct answer. A main
                 contribution is a full complexity analysis of queries
                 and updates. We also exhibit a decision procedure for
                 the equivalence of probabilistic trees and prove it is
                 in co-RP. Furthermore, we study the issue of removing
                 less probable possible worlds, and that of validating a
                 probabilistic tree against a DTD. We show that these
                 two problems are intractable in the most general
                 case.",
  acknowledgement = ack-nhfb,
  keywords =     "complexity; probabilistic databases; semi-structured
                 databases; XML",
}

@InProceedings{Dalvi:2007:DCQ,
  author =       "Nilesh Dalvi and Dan Suciu",
  title =        "The dichotomy of conjunctive queries on probabilistic
                 structures",
  crossref =     "ACM:2007:PTS",
  pages =        "293--302",
  year =         "2007",
  DOI =          "https://doi.org/10.1145/1265530.1265571",
  bibdate =      "Fri Jun 20 14:06:25 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We show that for every conjunctive query, the
                 complexity of evaluating it on a probabilistic database
                 is either PTIME or P-complete, and we give an algorithm
                 for deciding whether a given conjunctive query is PTIME
                 or P-complete. The dichotomy property is a fundamental
                 result on query evaluation on probabilistic databases
                 and it gives a complete classification of the
                 complexity of conjunctive queries.",
  acknowledgement = ack-nhfb,
  keywords =     "conjunctive queries; dichotomy; probabilistic
                 databases",
}

@InProceedings{Kimelfeld:2007:MJP,
  author =       "Benny Kimelfeld and Yehoshua Sagiv",
  title =        "Maximally joining probabilistic data",
  crossref =     "ACM:2007:PTS",
  pages =        "303--312",
  year =         "2007",
  DOI =          "https://doi.org/10.1145/1265530.1265572",
  bibdate =      "Fri Jun 20 14:06:25 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Conceptually, the common approach to manipulating
                 probabilistic data is to evaluate relational queries
                 and then calculate the probability of each tuple in the
                 result. This approach ignores the possibility that the
                 probabilities of complete answers are too low and,
                 hence, partial answers (with sufficiently high
                 probabilities) become important. Therefore, we consider
                 the semantics in which answers are maximal (i.e., have
                 the smallest degree of incompleteness), subject to the
                 constraint that the probability is still above a given
                 threshold.\par

                 We investigate the complexity of joining relations
                 under the above semantics. In contrast to the
                 deterministic case, this approach gives rise to two
                 different enumeration problems. The first is finding
                 all maximal sets of tuples that are join consistent,
                 connected and have a joint probability above the
                 threshold. The second is computing all maximal tuples
                 that are answers of partial joins and have a
                 probability above the threshold. Both problems are
                 tractable under data complexity. We also consider
                 query-and-data complexity, which rules out as efficient
                 the following naive algorithm: compute all partial
                 answers and then choose the maximal ones among those
                 with probabilities above the threshold. We give
                 efficient algorithms for several, important special
                 cases. We also show that, in general, the first problem
                 is NP-hard whereas the second is \#P-hard.",
  acknowledgement = ack-nhfb,
  keywords =     "maximal answers; natural join; probabilistic
                 databases; query-and-data complexity",
}

@InProceedings{Buneman:2008:CD,
  author =       "Peter Buneman and James Cheney and Wang-Chiew Tan and
                 Stijn Vansummeren",
  title =        "Curated databases",
  crossref =     "Lenzerini:2008:PTS",
  pages =        "1--12",
  year =         "2008",
  DOI =          "https://doi.org/10.1145/1376916.1376918",
  bibdate =      "Fri Jun 20 14:17:29 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Curated databases are databases that are populated and
                 updated with a great deal of human effort. Most
                 reference works that one traditionally found on the
                 reference shelves of libraries --- dictionaries,
                 encyclopedias, gazetteers etc. --- are now curated
                 databases. Since it is now easy to publish databases on
                 the web, there has been an explosion in the number of
                 new curated databases used in scientific research. The
                 value of curated databases lies in the organization and
                 the quality of the data they contain. Like the paper
                 reference works they have replaced, they usually
                 represent the efforts of a dedicated group of people to
                 produce a definitive description of some subject
                 area.\par

                 Curated databases present a number of challenges for
                 database research. The topics of annotation,
                 provenance, and citation are central, because curated
                 databases are heavily cross-referenced with, and
                 include data from, other databases, and much of the
                 work of a curator is annotating existing data.
                 Evolution of structure is important because these
                 databases often evolve from semistructured
                 representations, and because they have to accommodate
                 new scientific discoveries. Much of the work in these
                 areas is in its infancy, but it is beginning to provide
                 suggest new research for both theory and practice. We
                 discuss some of this research and emphasize the need to
                 find appropriate models of the processes associated
                 with curated databases.",
  acknowledgement = ack-nhfb,
  keywords =     "annotation; archiving; curation; provenance",
}

@InProceedings{Arenas:2008:RSM,
  author =       "Marcelo Arenas and Jorge P{\'e}rez and Cristian
                 Riveros",
  title =        "The recovery of a schema mapping: bringing exchanged
                 data back",
  crossref =     "Lenzerini:2008:PTS",
  pages =        "13--22",
  year =         "2008",
  DOI =          "https://doi.org/10.1145/1376916.1376920",
  bibdate =      "Fri Jun 20 14:17:29 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "A schema mapping is a specification that describes how
                 data from a source schema is to be mapped to a target
                 schema. Once the data has been transferred from the
                 source to the target, a natural question is whether one
                 can undo the process and recover the initial data, or
                 at least part of it. In fact, it would be desirable to
                 find a reverse schema mapping from target to source
                 that specifies how to bring the exchanged data
                 back.\par

                 In this paper, we introduce the notion of a recovery of
                 a schema mapping: it is a reverse mapping $M'$ for a
                 mapping $M$ that recovers sound data with respect to
                 $M$. We further introduce an order relation on
                 recoveries. This allows us to choose mappings that
                 recover the maximum amount of sound information. We
                 call such mappings maximum recoveries. We study maximum
                 recoveries in detail, providing a necessary and
                 sufficient condition for their existence. In
                 particular, we prove that maximum recoveries exist for
                 the class of mappings specified by FO-to-CQ
                 source-to-target dependencies. This class subsumes the
                 class of source-to-target tuple-generating dependencies
                 used in previous work on data exchange. For the class
                 of mappings specified by FO-to-CQ dependencies, we
                 provide an exponential-time algorithm for computing
                 maximum recoveries, and a simplified version for full
                 dependencies that works in quadratic time. We also
                 characterize the language needed to express maximum
                 recoveries, and we include a detailed comparison with
                 the notion of inverse (and quasi-inverse) mapping
                 previously proposed in the data exchange literature. In
                 particular, we show that maximum recoveries strictly
                 generalize inverses. We study the complexity of some
                 decision problems related to the notions of recovery
                 and maximum recovery. Finally, we report our initial
                 results about a relaxed\par

                 notion of maximal recovery, showing that it strictly
                 generalizes the notion of maximum recovery.",
  acknowledgement = ack-nhfb,
  keywords =     "data exchange; data integration; inverse; maximum
                 recovery; metadata management; recovery; schema
                 mapping",
}

@InProceedings{Senellart:2008:CDS,
  author =       "Pierre Senellart and Georg Gottlob",
  title =        "On the complexity of deriving schema mappings from
                 database instances",
  crossref =     "Lenzerini:2008:PTS",
  pages =        "23--32",
  year =         "2008",
  DOI =          "https://doi.org/10.1145/1376916.1376921",
  bibdate =      "Fri Jun 20 14:17:29 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We introduce a theoretical framework for discovering
                 relationships between two database instances over
                 distinct and unknown schemata. This framework is
                 grounded in the context of data exchange. We formalize
                 the problem of understanding the relationship between
                 two instances as that of obtaining a schema mapping so
                 that a minimum repair of this mapping provides a
                 perfect description of the target instance given the
                 source instance. We show that this definition yields
                 'intuitive' results when applied on database instances
                 derived from each other by basic operations. We study
                 the complexity of decision problems related to this
                 optimality notion in the context of different logical
                 languages and show that, even in very restricted cases,
                 the problem is of high complexity.",
  acknowledgement = ack-nhfb,
  keywords =     "complexity; data exchange; instance; match; schema
                 mapping",
}

@InProceedings{Fagin:2008:TTS,
  author =       "Ronald Fagin and Phokion G. Kolaitis and Alan Nash and
                 Lucian Popa",
  title =        "Towards a theory of schema-mapping optimization",
  crossref =     "Lenzerini:2008:PTS",
  pages =        "33--42",
  year =         "2008",
  DOI =          "https://doi.org/10.1145/1376916.1376922",
  bibdate =      "Fri Jun 20 14:17:29 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "A schema mapping is a high-level specification that
                 describes the relationship between two database
                 schemas. As schema mappings constitute the essential
                 building blocks of data exchange and data integration,
                 an extensive investigation of the foundations of schema
                 mappings has been carried out in recent years. Even
                 though several different aspects of schema mappings
                 have been explored in considerable depth, the study of
                 schema-mapping optimization remains largely uncharted
                 territory to date.\par

                 In this paper, we lay the foundation for the
                 development of a theory of schema-mapping optimization.
                 Since schema mappings are constructs that live at the
                 logical level of information integration systems, the
                 first step is to introduce concepts and to develop
                 techniques for transforming schema mappings to
                 'equivalent' ones that are more manageable from the
                 standpoint of data exchange or of some other data
                 interoperability task. In turn, this has to start by
                 introducing and studying suitable notions of
                 'equivalence' between schema mappings. To this effect,
                 we introduce the concept of data-exchange equivalence
                 and the concept of conjunctive-query equivalence. These
                 two concepts of equivalence are natural relaxations of
                 the classical notion of logical equivalence; the first
                 captures indistinguishability for data-exchange
                 purposes, while the second captures
                 indistinguishability for conjunctive-query-answering
                 purposes. Moreover, they coincide with logical
                 equivalence on schema mappings specified by
                 source-to-target tuple-generating dependencies ($s$-$t$
                 tgds), but differ on richer classes of dependencies,
                 such as second-order tuple-generating dependencies (SO
                 tgds) and sets of $s$-$t$ tgds and target
                 tuple-generating dependencies (target tgds).\par

                 After exploring the basic properties of these three
                 notions of equivalence between schema mappings, we
                 focus on the following question: under what conditions
                 is a schema mapping conjunctive-query equivalent to a
                 schema mapping specified by a finite set of $s$-$t$
                 tgds? We answer this question by obtaining complete
                 characterizations for schema mappings that are
                 specified by an SO tgd and for schema mappings that are
                 specified by a finite set of $s$-$t$ tgds and target
                 tgds, and have terminating chase. These
                 characterizations involve boundedness properties of the
                 cores of universal solutions.",
  acknowledgement = ack-nhfb,
  keywords =     "conjunctive-query equivalence; data exchange; data
                 integration; data-exchange equivalence; schema
                 mapping",
}

@InProceedings{Schnaitter:2008:ERJ,
  author =       "Karl Schnaitter and Neoklis Polyzotis",
  title =        "Evaluating rank joins with optimal cost",
  crossref =     "Lenzerini:2008:PTS",
  pages =        "43--52",
  year =         "2008",
  DOI =          "https://doi.org/10.1145/1376916.1376924",
  bibdate =      "Fri Jun 20 14:17:29 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "In the rank join problem, we are given a set of
                 relations and a scoring function, and the goal is to
                 return the join results with the top $K$ scores. It is
                 often the case in practice that the inputs may be
                 accessed in ranked order and the scoring function is
                 monotonic. These conditions allow for efficient
                 algorithms that solve the rank join problem without
                 reading all of the input. In this paper, we present a
                 thorough analysis of such rank join algorithms. A
                 strong point of our analysis is that it is based on a
                 more general problem statement than previous work,
                 making it more relevant to the execution model that is
                 employed by database systems. One of our results
                 indicates that the well known HRJN algorithm has
                 shortcomings, because it does not stop reading its
                 input as soon as possible. We find that it is NP-hard
                 to overcome this weakness in the general case, but
                 cases of limited query complexity are tractable. We
                 prove the latter with an algorithm that infers provably
                 tight bounds on the potential benefit of reading more
                 input in order to stop as soon as possible. As a
                 result, the algorithm achieves a cost that is within a
                 constant factor of optimal.",
  acknowledgement = ack-nhfb,
  keywords =     "feasible-region bound; pbrj; rank join; ranking query
                 optimization; tight bound",
}

@InProceedings{Bojannzyk:2008:ECT,
  author =       "Mikolaj Bojan{\'n}zyk",
  title =        "Effective characterizations of tree logics",
  crossref =     "Lenzerini:2008:PTS",
  pages =        "53--66",
  year =         "2008",
  DOI =          "https://doi.org/10.1145/1376916.1376925",
  bibdate =      "Fri Jun 20 14:17:29 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "A survey of effective characterizations of tree
                 logics. If $L$ is a logic, then an effective
                 characterization for $L$ is an algorithm, which inputs
                 a tree automaton and replies if the recognized language
                 can be defined by a formula in $L$. The logics $L$
                 considered include path testable languages, frontier
                 testable languages, fragments of Core XPath, and
                 fragments of monadic second-order logic.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Sarma:2008:EPG,
  author =       "Atish Das Sarma and Sreenivas Gollapudi and Rina
                 Panigrahy",
  title =        "Estimating {PageRank} on graph streams",
  crossref =     "Lenzerini:2008:PTS",
  pages =        "69--78",
  year =         "2008",
  DOI =          "https://doi.org/10.1145/1376916.1376928",
  bibdate =      "Fri Jun 20 14:17:29 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "This study focuses on computations on large graphs
                 (e.g., the web-graph) where the edges of the graph are
                 presented as a stream. The objective in the streaming
                 model is to use small amount of memory (preferably
                 sub-linear in the number of nodes $n$) and a few
                 passes.\par In the streaming model, we show how to
                 perform several graph computations including estimating
                 the probability distribution after a random walk of
                 length $l$, mixing time, and the conductance. We
                 estimate the mixing time $M$ of a random walk in
                 $\tilde{O}(n \alpha + M \alpha \sqrt{n} +\sqrt{M n /
                 \alpha})$ space and $\tilde{O}(\sqrt{M} \alpha)$
                 passes. Furthermore, the relation between mixing time
                 and conductance gives us an estimate for the
                 conductance of the graph. By applying our algorithm for
                 computing probability distribution on the Web-graph, we
                 can estimate the PageRank $p$ of any node up to an
                 additive error of $\sqrt{\epsilon} p$ in
                 $\tilde{O}(\sqrt{M}/\alpha)$ passes and
                 $\tilde{O}(\min(n \alpha + 1 / \epsilon \sqrt{M} /
                 \alpha + 1/\epsilon M \alpha, \alpha n \sqrt{M} \alpha
                 + 1/\epsilon \sqrt{M}/\alpha))$ space, for any $\alpha
                 \in (0, 1]$. In particular, for $\epsilon = M / n$, by
                 setting $\alpha = M^{-1/2}$, we can compute the
                 approximate PageRank values in $\tilde{O}(n M^{-1/4})$
                 space and $\tilde{O}(M^{3/4})$ passes. In comparison, a
                 standard implementation of the PageRank algorithm will
                 take $O(n)$ space and $O(M)$ passes.",
  acknowledgement = ack-nhfb,
  keywords =     "graph conductance; mixing time; PageRank; random walk;
                 streaming algorithms",
}

@InProceedings{Liu:2008:GFA,
  author =       "Zhen Liu and Srinivasan Parthasarathy and Anand
                 Ranganathan and Hao Yang",
  title =        "A generic flow algorithm for shared filter ordering
                 problems",
  crossref =     "Lenzerini:2008:PTS",
  pages =        "79--88",
  year =         "2008",
  DOI =          "https://doi.org/10.1145/1376916.1376929",
  bibdate =      "Fri Jun 20 14:17:29 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We consider a fundamental flow maximization problem
                 that arises during the evaluation of multiple
                 overlapping queries defined on a data stream, in a
                 heterogeneous parallel environment. Each query is a
                 conjunction of boolean filters, and each filter could
                 be shared across multiple queries. We are required to
                 design an evaluation plan that evaluates filters
                 against stream items in order to determine the set of
                 queries satisfied by each item. The evaluation plan
                 specifies for each item: (i) the subset of filters
                 evaluated for this item and the order of their
                 evaluations, and (ii) the processor on which each
                 filter evaluation occurs. Our goal is to design an
                 evaluation plan which maximizes the total throughput
                 (flow) of the stream handled by the plan, without
                 violating the processor capacities.\par

                 Filter ordering has received extensive attention in
                 single-processor settings, with the objective of
                 minimizing the total cost of filter evaluations: in
                 particular, efficient (approximation) algorithms are
                 known for various important versions of min-cost filter
                 ordering. Min-cost filter ordering problem for a single
                 processor is a special case of our flow maximization
                 for parallel processors. Our main contribution in this
                 work is a generic flow-maximization algorithm, which
                 assumes the availability of a min-cost filter ordering
                 algorithm for a single processor, and uses this to
                 iteratively construct a solution to the
                 flow-maximization problem for heterogeneous parallel
                 processors. We show that the approximation ratio of our
                 flow-maximization strategy is essentially the same as
                 that of the underlying min-cost filter ordering
                 algorithm. Our result, along with existing results on
                 min-cost filter ordering, enables the optimization of
                 several important versions of filter ordering in
                 parallel environments.",
  acknowledgement = ack-nhfb,
  keywords =     "flow maximization; parallel; query optimization;
                 shared filter ordering",
}

@InProceedings{Cormode:2008:TDA,
  author =       "Graham Cormode and Flip Korn and Srikanta Tirthapura",
  title =        "Time-decaying aggregates in out-of-order streams",
  crossref =     "Lenzerini:2008:PTS",
  pages =        "89--98",
  year =         "2008",
  DOI =          "https://doi.org/10.1145/1376916.1376930",
  bibdate =      "Fri Jun 20 14:17:29 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Processing large data streams is now a major topic in
                 data management. The data involved can be truly
                 massive, and the required analyses complex. In a stream
                 of sequential events such as stock feeds, sensor
                 readings, or IP traffic measurements, data tuples
                 pertaining to recent events are typically more
                 important than older ones. This can be formalized via
                 time-decay functions, which assign weights to data
                 based on the age of data. Decay functions such as
                 sliding windows and exponential decay have been studied
                 under the assumption of well-ordered arrivals, i.e.,
                 data arrives in non-decreasing order of time stamps.
                 However, data quality issues are prevalent in massive
                 streams (due to network asynchrony and delays etc.),
                 and correct arrival order is not guaranteed.\par

                 We focus on the computation of decayed aggregates such
                 as range queries, quantiles, and heavy hitters on
                 out-of-order streams, where elements do not necessarily
                 arrive in increasing order of timestamps. Existing
                 techniques such as Exponential Histograms and Waves are
                 unable to handle out-of-order streams. We give the
                 first deterministic algorithms for approximating these
                 aggregates under popular decay functions such as
                 sliding window and polynomial decay. We study the
                 overhead of allowing out-of-order arrivals when
                 compared to well-ordered arrivals, both analytically
                 and experimentally. Our experiments confirm that these
                 algorithms can be applied in practice, and compare the
                 relative performance of different approaches for
                 handling out-of-order arrivals.",
  acknowledgement = ack-nhfb,
  keywords =     "asynchronous data streams; out-of-order arrivals",
}

@InProceedings{Koch:2008:APE,
  author =       "Christoph Koch",
  title =        "Approximating predicates and expressive queries on
                 probabilistic databases",
  crossref =     "Lenzerini:2008:PTS",
  pages =        "99--108",
  year =         "2008",
  DOI =          "https://doi.org/10.1145/1376916.1376932",
  bibdate =      "Fri Jun 20 14:17:29 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We study complexity and approximation of queries in an
                 expressive query language for probabilistic databases.
                 The language studied supports the compositional use of
                 confidence computation. It allows for a wide range of
                 new use cases, such as the computation of conditional
                 probabilities and of selections based on predicates
                 that involve marginal and conditional probabilities.
                 These features have important applications in areas
                 such as data cleaning and the processing of sensor
                 data. We establish techniques for efficiently computing
                 approximate query results and for estimating the error
                 incurred by queries. The central difficulty is due to
                 selection predicates based on approximated values,
                 which may lead to the unreliable selection of tuples. A
                 database may contain certain singularities at which
                 approximation of predicates cannot be achieved;
                 however, the paper presents an algorithm that provides
                 efficient approximation otherwise.",
  acknowledgement = ack-nhfb,
  keywords =     "approximation; complexity; probabilistic databases;
                 uncertain data",
}

@InProceedings{Cohen:2008:ICP,
  author =       "Sara Cohen and Benny Kimelfeld and Yehoshua Sagiv",
  title =        "Incorporating constraints in probabilistic {XML}",
  crossref =     "Lenzerini:2008:PTS",
  pages =        "109--118",
  year =         "2008",
  DOI =          "https://doi.org/10.1145/1376916.1376933",
  bibdate =      "Fri Jun 20 14:17:29 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Constraints are important not just for maintaining
                 data integrity, but also because they capture natural
                 probabilistic dependencies among data items. A
                 probabilistic XML database (PXDB) is the probability
                 sub-space comprising the instances of a $p$-document
                 that satisfy a set of constraints. In contrast to
                 existing models that can express probabilistic
                 dependencies, it is shown that query evaluation is
                 tractable in PXDBs. The problems of sampling and
                 determining well-definedness (i.e., whether the above
                 subspace is nonempty) are also tractable. Furthermore,
                 queries and constraints can include the aggregate
                 functions count, max, min and ratio. Finally, this
                 approach can be easily extended to allow a
                 probabilistic interpretation of constraints.",
  acknowledgement = ack-nhfb,
  keywords =     "constraints; probabilistic databases; probabilistic
                 XML; sampling probabilistic data",
}

@InProceedings{Jha:2008:QES,
  author =       "Abhay Jha and Vibhor Rastogi and Dan Suciu",
  title =        "Query evaluation with soft-key constraints",
  crossref =     "Lenzerini:2008:PTS",
  pages =        "119--128",
  year =         "2008",
  DOI =          "https://doi.org/10.1145/1376916.1376934",
  bibdate =      "Fri Jun 20 14:17:29 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Key Violations often occur in real-life datasets,
                 especially in those integrated from different sources.
                 Enforcing constraints strictly on these datasets is not
                 feasible. In this paper we formalize the notion of
                 soft-key constraints on probabilistic databases, which
                 allow for violation of key constraint by penalizing
                 every violating world by a quantity proportional to the
                 violation. To represent our probabilistic database with
                 constraints, we define a class of Markov networks,
                 where we can do query evaluation in PTIME. We also
                 study the evaluation of conjunctive queries on
                 relations with soft keys and present a dichotomy that
                 separates this set into those in PTIME and the rest
                 which are \#P-Hard.",
  acknowledgement = ack-nhfb,
  keywords =     "probabilistic databases; query processing",
}

@InProceedings{Afrati:2008:AAQ,
  author =       "Foto Afrati and Phokion G. Kolaitis",
  title =        "Answering aggregate queries in data exchange",
  crossref =     "Lenzerini:2008:PTS",
  pages =        "129--138",
  year =         "2008",
  DOI =          "https://doi.org/10.1145/1376916.1376936",
  bibdate =      "Fri Jun 20 14:17:29 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Data exchange, also known as data translation, has
                 been extensively investigated in recent years. One main
                 direction of research has focused on the semantics and
                 the complexity of answering first-order queries in the
                 context of data exchange between relational schemas. In
                 this paper, we initiate a systematic investigation of
                 the semantics and the complexity of aggregate queries
                 in data exchange, and make a number of conceptual and
                 technical contributions. Data exchange is a context in
                 which incomplete information arises, hence one has to
                 cope with a set of possible worlds, instead of a single
                 database. Three different sets of possible worlds have
                 been explored in the study of the certain answers of
                 first-order queries in data exchange: the set of
                 possible worlds of all solutions, the set of possible
                 worlds of all universal solutions, and a set of
                 possible worlds derived from the CWA-solutions. We
                 examine each of these sets and point out that none of
                 them is suitable for aggregation in data exchange, as
                 each gives rise to rather trivial semantics. Our
                 analysis also reveals that, to have meaningful
                 semantics for aggregation in data exchange, a strict
                 closed world assumption has to be adopted in selecting
                 the set of possible worlds. For this, we introduce and
                 study the set of the endomorphic images of the
                 canonical universal solution as a set of possible
                 worlds for aggregation in data exchange. Our main
                 technical result is that for schema mappings specified
                 by source-to-target tgds, there are polynomial-time
                 algorithms for computing the range semantics of every
                 scalar aggregation query, where the range semantics of
                 an aggregate query is the greatest lower bound and the
                 least upper bound of the values that the query takes
                 over the set of possible worlds. Among these
                 algorithms, the more sophisticated one is the algorithm
                 for the average operator, which makes use of concepts
                 originally introduced in the study of the core of the
                 universal solutions in data exchange. We also show that
                 if, instead of range semantics, we consider possible
                 answer semantics, then it is an NP-complete problem to
                 tell if a number is a possible answer of a given scalar
                 aggregation query with the average operator.",
  acknowledgement = ack-nhfb,
  keywords =     "aggregate queries; data exchange; data integration",
}

@InProceedings{Libkin:2008:DES,
  author =       "Leonid Libkin and Cristina Sirangelo",
  title =        "Data exchange and schema mappings in open and closed
                 worlds",
  crossref =     "Lenzerini:2008:PTS",
  pages =        "139--148",
  year =         "2008",
  DOI =          "https://doi.org/10.1145/1376916.1376937",
  bibdate =      "Fri Jun 20 14:17:29 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "In the study of data exchange one usually assumes an
                 open-world semantics, making it possible to extend
                 instances of target schemas. An alternative
                 closed-world semantics only moves 'as much data as
                 needed' from the source to the target to satisfy
                 constraints of a schema mapping. It avoids some of the
                 problems exhibited by the open-world semantics, but
                 limits the expressivity of schema mappings. Here we
                 propose a mixed approach: one can designate different
                 attributes of target schemas as open or closed, to
                 combine the additional expressivity of the open-world
                 semantics with the better behavior of query answering
                 in closed worlds.\par

                 We define such schema mappings, and show that they
                 cover a large space of data exchange solutions with two
                 extremes being the known open and closed-world
                 semantics. We investigate the problems of query
                 answering and schema mapping composition, and prove two
                 trichotomy theorems, classifying their complexity based
                 on the number of open attributes. We find conditions
                 under which schema mappings compose, extending known
                 results to a wide range of closed-world mappings. We
                 also provide results for restricted classes of queries
                 and mappings guaranteeing lower complexity.",
  acknowledgement = ack-nhfb,
  keywords =     "closed world assumption; data exchange; incomplete
                 information; open world assumption; schema mappings",
}

@InProceedings{Deutsch:2008:CR,
  author =       "Alin Deutsch and Alan Nash and Jeff Remmel",
  title =        "The chase revisited",
  crossref =     "Lenzerini:2008:PTS",
  pages =        "149--158",
  year =         "2008",
  DOI =          "https://doi.org/10.1145/1376916.1376938",
  bibdate =      "Fri Jun 20 14:17:29 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We revisit the standard chase procedure, studying its
                 properties and applicability to classical database
                 problems. We settle (in the negative) the open problem
                 of decidability of termination of the standard chase,
                 and we provide sufficient termination conditions which
                 are strictly less over-conservative than the best
                 previously known. We investigate the adequacy of the
                 standard chase for checking query containment under
                 constraints, constraint implication and computing
                 certain answers in data exchange, gaining a deeper
                 understanding by separating the algorithm from its
                 result. We identify the properties of the chase result
                 that are essential to the above applications, and we
                 introduce the more general notion of $F$-universal
                 model set, which supports query and constraint
                 languages that are closed under a class $F$ of
                 mappings. By choosing $F$ appropriately, we extend
                 prior results to existential first-order queries and
                 $\forall \exists$-first-order constraints. We show that
                 the standard chase is incomplete for finding universal
                 model sets, and we introduce the extended core chase
                 which is complete, i.e. finds an $F$-universal model
                 set when it exists. A key advantage of the new chase is
                 that the same algorithm can be applied for all mapping
                 classes $F$ of interest, simply by modifying the set of
                 constraints given as input. Even when restricted to the
                 typical input in prior work, the new chase supports
                 certain answer computation and containment\slash
                 implication tests in strictly more cases than the
                 incomplete standard chase.",
  acknowledgement = ack-nhfb,
  keywords =     "chase",
}

@InProceedings{Fan:2008:DRI,
  author =       "Wenfei Fan",
  title =        "Dependencies revisited for improving data quality",
  crossref =     "Lenzerini:2008:PTS",
  pages =        "159--170",
  year =         "2008",
  DOI =          "https://doi.org/10.1145/1376916.1376940",
  bibdate =      "Fri Jun 20 14:17:29 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Dependency theory is almost as old as relational
                 databases themselves, and has traditionally been used
                 to improve the quality of schema, among other things.
                 Recently there has been renewed interest in
                 dependencies for improving the quality of data. The
                 increasing demand for data quality technology has also
                 motivated revisions of classical dependencies, to
                 capture more inconsistencies in real-life data, and to
                 match, repair and query the inconsistent data. This
                 paper aims to provide an overview of recent advances in
                 revising classical dependencies for improving data
                 quality.",
  acknowledgement = ack-nhfb,
  keywords =     "data quality; dependency",
}

@InProceedings{Evfimievski:2008:EP,
  author =       "Alexandre Evfimievski and Ronald Fagin and David P.
                 Woodruff",
  title =        "Epistemic privacy",
  crossref =     "Lenzerini:2008:PTS",
  pages =        "171--180",
  year =         "2008",
  DOI =          "https://doi.org/10.1145/1376916.1376941",
  bibdate =      "Fri Jun 20 14:17:29 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We present a novel definition of privacy in the
                 framework of offline (retroactive) database query
                 auditing. Given information about the database, a
                 description of sensitive data, and assumptions about
                 users' prior knowledge, our goal is to determine if
                 answering a past user's query could have led to a
                 privacy breach. According to our definition, an audited
                 property $A$ is private, given the disclosure of
                 property $B$, if no user can gain confidence in $A$ by
                 learning $B$, subject to prior knowledge constraints.
                 Privacy is not violated if the disclosure of $B$ causes
                 a loss of confidence in $A$. The new notion of privacy
                 is formalized using the well-known semantics for
                 reasoning about knowledge, where logical properties
                 correspond to sets of possible worlds (databases) that
                 satisfy these properties. Database users are modelled
                 as either possibilistic agents whose knowledge is a set
                 of possible worlds, or as probabilistic agents whose
                 knowledge is a probability distribution on possible
                 worlds.\par

                 We analyze the new privacy notion, show its
                 relationship with the conventional approach, and derive
                 criteria that allow the auditor to test privacy
                 efficiently in some important cases. In particular, we
                 prove characterization theorems for the possibilistic
                 case, and study in depth the probabilistic case under
                 the assumption that all database records are considered
                 a-priori independent by the user, as well as under more
                 relaxed (or absent) prior-knowledge assumptions. In the
                 probabilistic case we show that for certain families of
                 distributions there is no efficient algorithm to test
                 whether an audited property $A$ is private given the
                 disclosure of a property $B$, assuming P $\neq$ NP.
                 Nevertheless, for many interesting families, such as
                 the family of product distributions, we obtain
                 algorithms that are efficient both in theory and in
                 practice.",
  acknowledgement = ack-nhfb,
  keywords =     "auditing; disclosure; positivstellensatz; privacy;
                 query logs; reasoning about knowledge;
                 supermodularity",
}

@InProceedings{Ferragina:2008:SCS,
  author =       "Paolo Ferragina and Roberto Grossi and Ankur Gupta and
                 Rahul Shah and Jeffrey Scott Vitter",
  title =        "On searching compressed string collections
                 cache-obliviously",
  crossref =     "Lenzerini:2008:PTS",
  pages =        "181--190",
  year =         "2008",
  DOI =          "https://doi.org/10.1145/1376916.1376943",
  bibdate =      "Fri Jun 20 14:17:29 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Current data structures for searching large string
                 collections either fail to achieve minimum space or
                 cause too many cache misses. In this paper we discuss
                 some edge linearizations of the classic trie data
                 structure that are simultaneously cache-friendly and
                 compressed. We provide new insights on front coding
                 [24], introduce other novel linearizations, and study
                 how close their space occupancy is to the
                 information-theoretic minimum. The moral is that they
                 are not just heuristics. Our second contribution is a
                 novel dictionary encoding scheme that builds upon such
                 linearizations and achieves nearly optimal space,
                 offers competitive I/O-search time, and is also
                 conscious of the query distribution. Finally, we
                 combine those data structures with cache-oblivious
                 tries [2, 5] and obtain a succinct variant whose space
                 is close to the information-theoretic minimum.",
  acknowledgement = ack-nhfb,
  keywords =     "B-tree; cache efficiency; data compression; front
                 coding; string searching",
}

@InProceedings{Cormode:2008:AAC,
  author =       "Graham Cormode and Andrew McGregor",
  title =        "Approximation algorithms for clustering uncertain
                 data",
  crossref =     "Lenzerini:2008:PTS",
  pages =        "191--200",
  year =         "2008",
  DOI =          "https://doi.org/10.1145/1376916.1376944",
  bibdate =      "Fri Jun 20 14:17:29 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "There is an increasing quantity of data with
                 uncertainty arising from applications such as sensor
                 network measurements, record linkage, and as output of
                 mining algorithms. This uncertainty is typically
                 formalized as probability density functions over tuple
                 values. Beyond storing and processing such data in a
                 DBMS, it is necessary to perform other data analysis
                 tasks such as data mining. We study the core mining
                 problem of clustering on uncertain data, and define
                 appropriate natural generalizations of standard
                 clustering optimization criteria. Two variations arise,
                 depending on whether a point is automatically
                 associated with its optimal center, or whether it must
                 be assigned to a fixed cluster no matter where it is
                 actually located.\par

                 For uncertain versions of $k$-means and $k$-median, we
                 show reductions to their corresponding weighted
                 versions on data with no uncertainties. These are
                 simple in the unassigned case, but require some care
                 for the assigned version. Our most interesting results
                 are for uncertain $k$-center, which generalizes both
                 traditional $k$-center and $k$-median objectives. We
                 show a variety of bicriteria approximation algorithms.
                 One picks $O(k \epsilon^{-1} \log^2 n)$ centers and
                 achieves a $(1 + \epsilon)$ approximation to the best
                 uncertain $k$-centers. Another picks $2k$ centers and
                 achieves a constant factor approximation. Collectively,
                 these results are the first known guaranteed
                 approximation algorithms for the problems of clustering
                 uncertain data.",
  acknowledgement = ack-nhfb,
  keywords =     "clustering; probabilistic data",
}

@InProceedings{Anagnostopoulos:2008:AAC,
  author =       "Aris Anagnostopoulos and Anirban Dasgupta and Ravi
                 Kumar",
  title =        "Approximation algorithms for co-clustering",
  crossref =     "Lenzerini:2008:PTS",
  pages =        "201--210",
  year =         "2008",
  DOI =          "https://doi.org/10.1145/1376916.1376945",
  bibdate =      "Fri Jun 20 14:17:29 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Co-clustering is the simultaneous partitioning of the
                 rows and columns of a matrix such that the blocks
                 induced by the row/column partitions are good clusters.
                 Motivated by several applications in text mining,
                 market-basket analysis, and bioinformatics, this
                 problem has attracted severe attention in the past few
                 years. Unfortunately, to date, most of the algorithmic
                 work on this problem has been heuristic in
                 nature.\par

                 In this work we obtain the first approximation
                 algorithms for the co-clustering problem. Our
                 algorithms are simple and obtain constant-factor
                 approximation solutions to the optimum. We also show
                 that co-clustering is NP-hard, thereby complementing
                 our algorithmic result.",
  acknowledgement = ack-nhfb,
  keywords =     "approximation; biclustering; clustering;
                 co-clustering",
}

@InProceedings{Gollapudi:2008:PTM,
  author =       "Sreenivas Gollapudi and Rina Panigrahy",
  title =        "The power of two min-hashes for similarity search
                 among hierarchical data objects",
  crossref =     "Lenzerini:2008:PTS",
  pages =        "211--220",
  year =         "2008",
  DOI =          "https://doi.org/10.1145/1376916.1376946",
  bibdate =      "Fri Jun 20 14:17:29 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "In this study we propose sketching algorithms for
                 computing similarities between hierarchical data.
                 Specifically, we look at data objects that are
                 represented using leaf-labeled trees denoting a set of
                 elements at the leaves organized in a hierarchy. Such
                 representations are richer alternatives to a set. For
                 example, a document can be represented as a hierarchy
                 of sets wherein chapters, sections, and paragraphs
                 represent different levels in the hierarchy. Such a
                 representation is richer than viewing the document
                 simply as a set of words. We measure distance between
                 trees using the best possible super-imposition that
                 minimizes the number of mismatched leaf labels. Our
                 distance measure is equivalent to an Earth Mover's
                 Distance measure since the leaf-labeled trees of height
                 one can be viewed as sets and can be recursively
                 extended to trees of larger height by viewing them as
                 set of sets. We compute sketches of arbitrary weighted
                 trees and analyze them in the context of
                 locality-sensitive hashing (LSH) where the probability
                 of two sketches matching is high when two trees are
                 similar and low when the two trees are far under the
                 given distance measure. Specifically, we compute
                 sketches of such trees by propagating min-hash
                 computations up the tree. Furthermore, we show that
                 propagating one min-hash results in poor sketch
                 properties while propagating two min-hashes results in
                 good sketches.",
  acknowledgement = ack-nhfb,
  keywords =     "earth movers distance; locality sensitive hashing;
                 similarity",
}

@InProceedings{Abiteboul:2008:SAA,
  author =       "Serge Abiteboul and Luc Segoufin and Victor Vianu",
  title =        "Static analysis of active {XML} systems",
  crossref =     "Lenzerini:2008:PTS",
  pages =        "221--230",
  year =         "2008",
  DOI =          "https://doi.org/10.1145/1376916.1376948",
  bibdate =      "Fri Jun 20 14:17:29 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Active XML is a high-level specification language
                 tailored to data-intensive, distributed, dynamic Web
                 services. Active XML is based on XML documents with
                 embedded function calls. The state of a document
                 evolves depending on the result of internal function
                 calls (local computations) or external ones
                 (interactions with users or other services). Function
                 calls return documents that may be active, so may
                 activate new subtasks. The focus of the paper is on the
                 verification of temporal properties of runs of Active
                 XML systems, specified in a tree-pattern based temporal
                 logic, Tree-LTL, that allows expressing a rich class of
                 semantic properties of the application. The main
                 results establish the boundary of decidability and the
                 complexity of automatic verification of Tree-LTL
                 properties.",
  acknowledgement = ack-nhfb,
  keywords =     "Active XML; automatic verification; temporal
                 properties",
}

@InProceedings{Fan:2008:CCS,
  author =       "Wenfei Fan and Floris Geerts and Wouter Gelade and
                 Frank Neven and Antonella Poggi",
  title =        "Complexity and composition of synthesized web
                 services",
  crossref =     "Lenzerini:2008:PTS",
  pages =        "231--240",
  year =         "2008",
  DOI =          "https://doi.org/10.1145/1376916.1376949",
  bibdate =      "Fri Jun 20 14:17:29 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "The paper investigates fundamental decision problems
                 and composition synthesis for Web services commonly
                 found in practice. We propose a notion of synthesized
                 Web services (ASTs) to specify the behaviors of the
                 services. Upon receiving a sequence of input messages,
                 an AST issues multiple queries to a database and
                 generates actions, in parallel; it produces external
                 messages and database updates by synthesizing the
                 actions parallely generated. In contrast to previous
                 models for Web services, ASTs advocate parallel
                 processing and (deterministic) synthesis of actions. We
                 classify ASTs based on what queries an AST can issue,
                 how the synthesis of actions is expressed, and whether
                 unbounded input sequences are allowed in a single
                 interaction session. We show that the behaviors of Web
                 services supported by various prior models, data-driven
                 or not, can be specified by different AST classes. For
                 each of these classes we study the non-emptiness,
                 validation and equivalence problems, and establish
                 matching upper and lower bounds on these problems. We
                 also provide complexity bounds on composition synthesis
                 for these AST classes, identifying decidable cases.",
  acknowledgement = ack-nhfb,
  keywords =     "complexity; composition; data-driven web services",
}

@InProceedings{Bojanczyk:2008:XEL,
  author =       "Mikolaj Boja{\'n}czyk and Pawel Parys",
  title =        "{XPath} evaluation in linear time",
  crossref =     "Lenzerini:2008:PTS",
  pages =        "241--250",
  year =         "2008",
  DOI =          "https://doi.org/10.1145/1376916.1376951",
  bibdate =      "Fri Jun 20 14:17:29 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We consider a fragment of XPath where attribute values
                 can only be tested for equality. We show that for any
                 fixed unary query in this fragment, the set of nodes
                 that satisfy the query can be calculated in time linear
                 in the document size.",
  acknowledgement = ack-nhfb,
}

@InProceedings{tenCate:2008:XTC,
  author =       "Balder ten Cate and Luc Segoufin",
  title =        "{XPath}, transitive closure logic, and nested tree
                 walking automata",
  crossref =     "Lenzerini:2008:PTS",
  pages =        "251--260",
  year =         "2008",
  DOI =          "https://doi.org/10.1145/1376916.1376952",
  bibdate =      "Fri Jun 20 14:17:29 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We consider the navigational core of XPath, extended
                 with two operators: the Kleene star for taking the
                 transitive closure of path expressions, and a subtree
                 relativisation operator, allowing one to restrict
                 attention to a specific subtree while evaluating a
                 subexpression. We show that the expressive power of
                 this XPath dialect equals that of FO(MTC), first order
                 logic extended with monadic transitive closure. We also
                 give a characterization in terms of nested tree-walking
                 automata. Using the latter we then proceed to show that
                 the language is strictly less expressive than MSO. This
                 solves an open question about the relative expressive
                 power of FO(MTC) and MSO on trees. We also investigate
                 the complexity for our XPath dialect. We show that
                 query evaluation be done in polynomial time (combined
                 complexity), but that satisfiability and query
                 containment (as well as emptiness for our automaton
                 model) are 2ExpTime-complete (it is ExpTime-complete
                 for Core XPath).",
  acknowledgement = ack-nhfb,
  keywords =     "transitive closure; tree walking automata; XML;
                 XPath",
}

@InProceedings{Gardner:2008:LHR,
  author =       "Philippa A. Gardner and Gareth D. Smith and Mark J.
                 Wheelhouse and Uri D. Zarfaty",
  title =        "Local {Hoare} reasoning about {DOM}",
  crossref =     "Lenzerini:2008:PTS",
  pages =        "261--270",
  year =         "2008",
  DOI =          "https://doi.org/10.1145/1376916.1376953",
  bibdate =      "Fri Jun 20 14:17:29 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "The W3C Document Object Model (DOM) specifies an XML
                 update library. DOM is written in English, and is
                 therefore not compositional and not complete. We
                 provide a first step towards a compositional
                 specification of DOM. Unlike DOM, we are able to work
                 with a minimal set of commands and obtain a complete
                 reasoning for straight-line code. Our work transfers
                 O'Hearn, Reynolds and Yang's local Hoare reasoning for
                 analysing heaps to XML, viewing XML as an in-place
                 memory store as does DOM. In particular, we apply
                 recent work by Calcagno, Gardner and Zarfaty on local
                 Hoare reasoning about simple tree update to this
                 real-world DOM application. Our reasoning not only
                 formally specifies a significant subset of DOM Core
                 Level 1, but can also be used to verify, for example,
                 invariant properties of simple Javascript programs.",
  acknowledgement = ack-nhfb,
  keywords =     "context logic; dom; local Hoare reasoning; XML",
}

@InProceedings{Foster:2008:AXQ,
  author =       "J. Nathan Foster and Todd J. Green and Val Tannen",
  title =        "Annotated {XML}: queries and provenance",
  crossref =     "Lenzerini:2008:PTS",
  pages =        "271--280",
  year =         "2008",
  DOI =          "https://doi.org/10.1145/1376916.1376954",
  bibdate =      "Fri Jun 20 14:17:29 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We present a formal framework for capturing the
                 provenance of data appearing in XQuery views of XML.
                 Building on previous work on relations and their
                 (positive) query languages, we decorate unordered XML
                 with annotations from commutative semirings and show
                 that these annotations suffice for a large positive
                 fragment of XQuery applied to this data. In addition to
                 tracking provenance metadata, the framework can be used
                 to represent and process XML with repetitions,
                 incomplete XML, and probabilistic XML, and provides a
                 basis for enforcing access control policies in security
                 applications.\par

                 Each of these applications builds on our semantics for
                 XQuery, which we present in several steps: we
                 generalize the semantics of the Nested Relational
                 Calculus(NRC) to handle semiring-annotated complex
                 values, we extend it with a recursive type and
                 structural recursion operator for trees, and we define
                 a semantics for XQuery on annotated XML by translation
                 into this calculus.",
  acknowledgement = ack-nhfb,
  keywords =     "complex values; data provenance; semirings; XML;
                 XQuery",
}

@InProceedings{Sozio:2008:NOD,
  author =       "Mauro Sozio and Thomas Neumann and Gerhard Weikum",
  title =        "Near-optimal dynamic replication in unstructured
                 peer-to-peer networks",
  crossref =     "Lenzerini:2008:PTS",
  pages =        "281--290",
  year =         "2008",
  DOI =          "https://doi.org/10.1145/1376916.1376956",
  bibdate =      "Fri Jun 20 14:17:29 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Replicating data in distributed systems is often
                 needed for availability and performance. In
                 unstructured peer-to-peer networks, with epidemic
                 messaging for query routing, replicating popular data
                 items is also crucial to ensure high probability of
                 finding the data within a bounded search distance from
                 the requester. This paper considers such networks and
                 aims to maximize the probability of successful search.
                 Prior work along these lines has analyzed the optimal
                 degrees of replication for data items with non-uniform
                 but global request rates, but did not address the issue
                 of where replicas should be placed and was very limited
                 in the capabilities for handling heterogeneity and
                 dynamics of network and workload.\par

                 This paper presents the integrated P2R2 algorithm for
                 dynamic replication that addresses all these issues,
                 and determines both the degrees of replication and the
                 placement of the replicas in a provably near-optimal
                 way. We prove that the P2R2 algorithm can guarantee a
                 successful-search probability that is within a factor
                 of 2 of the optimal solution. The algorithm is
                 efficient and can handle workload evolution. We prove
                 that, whenever the access patterns are in steady state,
                 our algorithm converges to the desired near-optimal
                 placement. We further show by simulations that the
                 convergence rate is fast and that our algorithm
                 outperforms prior methods.",
  acknowledgement = ack-nhfb,
  keywords =     "p2p networks; replication",
}

@InProceedings{deMoor:2008:TID,
  author =       "Oege de Moor and Damien Sereni and Pavel Avgustinov
                 and Mathieu Verbaere",
  title =        "Type inference for datalog and its application to
                 query optimisation",
  crossref =     "Lenzerini:2008:PTS",
  pages =        "291--300",
  year =         "2008",
  DOI =          "https://doi.org/10.1145/1376916.1376957",
  bibdate =      "Fri Jun 20 14:17:29 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Certain variants of object-oriented Datalog can be
                 compiled to Datalog with negation. We seek to apply
                 optimisations akin to virtual method resolution (a
                 well-known technique in compiling Java and other OO
                 languages) to improve efficiency of the resulting
                 Datalog programs. The effectiveness of such
                 optimisations strongly depends on the precision of the
                 underlying type inference algorithm. Previous work on
                 type inference for Datalog has focussed on Cartesian
                 abstractions, where the type of each field is computed
                 separately. Such Cartesian type inference is inherently
                 imprecise in the presence of field equalities. We
                 propose a type system where equalities are tracked, and
                 present a type inference algorithm. The algorithm is
                 proved sound. We also prove that it is optimal for
                 Datalog without negation, in the sense that the
                 inferred type is as tight as possible. Extensive
                 experiments with our type-based optimisations, in a
                 commercial implementation of object-oriented Datalog,
                 confirm the benefits of this non-Cartesian type
                 inference algorithm.",
  acknowledgement = ack-nhfb,
  keywords =     "datalog; query optimization; type inference",
}

@InProceedings{Sharfman:2008:SSG,
  author =       "Izchak Sharfman and Assaf Schuster and Daniel Keren",
  title =        "Shape sensitive geometric monitoring",
  crossref =     "Lenzerini:2008:PTS",
  pages =        "301--310",
  year =         "2008",
  DOI =          "https://doi.org/10.1145/1376916.1376958",
  bibdate =      "Fri Jun 20 14:17:29 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "A fundamental problem in distributed computation is
                 the distributed evaluation of functions. The goal is to
                 determine the value of a function over a set of
                 distributed inputs, in a communication efficient
                 manner. Specifically, we assume that each node holds a
                 time varying input vector, and we are interested in
                 determining, at any given time, whether the value of an
                 arbitrary function on the average of these vectors
                 crosses a predetermined threshold.\par

                 In this paper, we introduce a new method for monitoring
                 distributed data, which we term shape sensitive
                 geometric monitoring. It is based on a geometric
                 interpretation of the problem, which enables to define
                 local constraints on the data received at the nodes. It
                 is guaranteed that as long as none of these constraints
                 has been violated, the value of the function does not
                 cross the threshold. We generalize previous work on
                 geometric monitoring, and solve two problems which
                 seriously hampered its performance: as opposed to the
                 constraints used so far, which depend only on the
                 current values of the local input vectors, here we
                 incorporate their temporal behavior into the
                 constraints. Also, the new constraints are tailored to
                 the geometric properties of the specific function which
                 is being monitored, while the previous constraints were
                 generic.\par

                 Experimental results on real world data reveal that
                 using the new geometric constraints reduces
                 communication by up to three orders of magnitude in
                 comparison to existing approaches, and considerably
                 narrows the gap between existing results and a newly
                 defined lower bound on the communication complexity.",
  acknowledgement = ack-nhfb,
  keywords =     "stream systems",
}

@InProceedings{Adler:2008:TWF,
  author =       "Isolde Adler",
  title =        "Tree-width and functional dependencies in databases",
  crossref =     "Lenzerini:2008:PTS",
  pages =        "311--320",
  year =         "2008",
  DOI =          "https://doi.org/10.1145/1376916.1376959",
  bibdate =      "Fri Jun 20 14:17:29 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Conjunctive query (CQ) evaluation on relational
                 databases is NP-complete in general. Several
                 restrictions, like bounded tree-width and bounded
                 hypertree-width, allow polynomial time evaluations. We
                 extend the framework in the presence of functional
                 dependencies. Our extended CQ evaluation problem has a
                 concise equivalent formulation in terms of the
                 homomorphism problem (HOM) for non-relational
                 structures. We introduce the notions of 'closure
                 tree-width' and 'hyperclosure tree-width' for arbitrary
                 structures, and we prove that HOM (and hence CQ)
                 restricted to bounded (hyper)closure tree-width becomes
                 tractable. There are classes of structures with bounded
                 closure tree-width but unbounded tree-width. Similar
                 statements hold for hyperclosure tree-width and
                 hypertree-width, and for hyperclosure tree-width and
                 closure tree-width.\par

                 It follows from a result by Gottlob, Mikl{\'o}s, and
                 Schwentick that for fixed $k \geq 2$, deciding whether
                 a given structure has hyperclosure tree-width at most
                 $k$, is NP-complete. We prove an analogous statement
                 for closure tree-width. Nevertheless, for given $k$ we
                 can approximate $k$-bounded closure tree-width in
                 polynomial time.",
  acknowledgement = ack-nhfb,
  keywords =     "conjunctive queries; databases; functional
                 dependencies; hypertree-width; tree-width",
}

@InProceedings{Dalvi:2009:OIT,
  author =       "Nilesh Dalvi and Ravi Kumar and Bo Pang and Raghu
                 Ramakrishnan and Andrew Tomkins and Philip Bohannon and
                 Sathiya Keerthi and Srujana Merugu",
  title =        "Opening and invited talk: a web of concepts",
  crossref =     "Paredaens:2009:PTE",
  pages =        "1--12",
  year =         "2009",
  DOI =          "https://doi.org/10.1145/1559795.1559797",
  bibdate =      "Thu Jul 2 14:05:34 MDT 2009",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We make the case for developing a {\em web of
                 concepts\/} by starting with the current view of web
                 (comprised of hyperlinked pages, or documents, each
                 seen as a bag of words), extracting concept-centric
                 metadata, and stitching it together to create a
                 semantically rich aggregate view of all the information
                 available on the web for each concept instance. The
                 goal of building and maintaining such a web of concepts
                 presents many challenges, but also offers the promise
                 of enabling many powerful applications, including novel
                 search and information discovery paradigms. We present
                 the goal, motivate it with example usage scenarios and
                 some analysis of Yahoo! logs, and discuss the
                 challenges in building and leveraging such a web of
                 concepts. We place this ambitious research agenda in
                 the context of the state of the art in the literature,
                 and describe various ongoing efforts at Yahoo! Research
                 that are related.",
  acknowledgement = ack-nhfb,
  keywords =     "concepts; extraction; ranking; selection",
  remark =       "This volume contains the proceedings of the
                 Twenty-eighth ACM SIGMOD-SIGACT-SIGART Symposium on
                 Principles of Database Systems (PODS 2009), held in
                 Providence, Rhode Island, on June 29--July 1, 2009, in
                 conjunction with the 2009 ACM SIGMOD International
                 Conference on Management of Data. The proceedings
                 include 3 invited papers and 26 contributed papers. One
                 invited paper is based on the keynote address by Raghu
                 Ramakrishnan, while the other two are based on the
                 invited tutorials by Leonid Libkin and Lars Arge,
                 respectively. In addition, the announcement of the 2009
                 ACM PODS Alberto O. Mendelzon Test-of-Time Award also
                 appears in the proceedings.\par

                 The program committee selected 26 contributed papers
                 for presentation at the conference from 97 submissions
                 by authors from 21 countries. Most of the selected
                 papers are preliminary reports on work in progress.
                 While they have been read by the program committee
                 members, they have not been formally refereed. It is
                 expected that many of them will eventually appear in
                 more polished and detailed form in scientific journals.
                 In addition, the program committee also selected the
                 paper {\em Size and Treewidth Bounds for Conjunctive
                 Queries\/} by Georg Gottlob, Stephanie Lee, and Gregory
                 Valiant for the PODS 2009 Best Paper Award, and the
                 paper {\em XPath Evaluation in Linear Time with
                 Polynomial Combined Complexity\/} by Pawel Parys for
                 the PODS 2009 Best Student Paper Award, a new award for
                 the PODS conferences. Warmest congratulations to the
                 authors of these papers.",
}

@InProceedings{Marnette:2009:GSM,
  author =       "Bruno Marnette",
  title =        "Generalized schema-mappings: from termination to
                 tractability",
  crossref =     "Paredaens:2009:PTE",
  pages =        "13--22",
  year =         "2009",
  DOI =          "https://doi.org/10.1145/1559795.1559799",
  bibdate =      "Thu Jul 2 14:05:34 MDT 2009",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Data-Exchange is the problem of creating new databases
                 according to a high-level specification called a
                 schema-mapping while preserving the information encoded
                 in a source database. This paper introduces a notion of
                 generalized schema-mapping that enriches the standard
                 schema-mappings (as defined by Fagin et al) with more
                 expressive power. It then proposes a more general and
                 arguably more intuitive notion of semantics that rely
                 on three criteria: Soundness, Completeness and
                 Laconicity (non-redundancy and minimal size). These
                 semantics are shown to coincide precisely with the
                 notion of cores of universal solutions in the framework
                 of Fagin, Kolaitis and Popa. It is also well-defined
                 and of interest for larger classes of schema-mappings
                 and more expressive source databases (with null-values
                 and equality constraints). After an investigation of
                 the key properties of generalized schema-mappings and
                 their semantics, a criterion called Termination of the
                 Oblivious Chase (TOC) is identified that ensures
                 polynomial data-complexity. This criterion strictly
                 generalizes the previously known criterion of
                 Weak-Acyclicity. To prove the tractability of TOC
                 schema-mappings, a new polynomial time algorithm is
                 provided that, unlike the algorithm of Gottlob and Nash
                 from which it is inspired, does not rely on the
                 syntactic property of Weak-Acyclicity. As the problem
                 of deciding whether a Schema-mapping satisfies the TOC
                 criterion is only recursively enumerable, a more
                 restrictive criterion called Super-weak Acylicity (SwA)
                 is identified that can be decided in Polynomial-time
                 while generalizing substantially the notion of
                 Weak-Acyclicity.",
  acknowledgement = ack-nhfb,
  keywords =     "core; data exchange; universal solution; weak
                 acyclicity",
}

@InProceedings{Fagin:2009:RDE,
  author =       "Ronald Fagin and Phokion G. Kolaitis and Lucian Popa
                 and Wang-Chiew Tan",
  title =        "Reverse data exchange: coping with nulls",
  crossref =     "Paredaens:2009:PTE",
  pages =        "23--32",
  year =         "2009",
  DOI =          "https://doi.org/10.1145/1559795.1559800",
  bibdate =      "Thu Jul 2 14:05:34 MDT 2009",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "An inverse of a schema mapping $M$ is intended to
                 `undo' what $M$ does, thus providing a way to perform
                 `reverse' data exchange. In recent years, three
                 different formalizations of this concept have been
                 introduced and studied, namely, the notions of an
                 inverse of a schema mapping, a quasi-inverse of a
                 schema mapping, and a maximum recovery of a schema
                 mapping. The study of these notions has been carried
                 out in the context in which source instances are
                 restricted to consist entirely of constants, while
                 target instances may contain both constants and labeled
                 nulls. This restriction on source instances is crucial
                 for obtaining some of the main technical results about
                 these three notions, but, at the same time, limits
                 their usefulness, since reverse data exchange naturally
                 leads to source instances that may contain both
                 constants and labeled nulls.\par

                 We develop a new framework for reverse data exchange
                 that supports source instances that may contain nulls,
                 thus overcoming the semantic mismatch between source
                 and target instances of the previous formalizations.
                 The development of this new framework requires a
                 careful reformulation of all the important notions,
                 including the notions of the identity schema mapping,
                 inverse, and maximum recovery. To this effect, we
                 introduce the notions of extended identity schema
                 mapping, extended inverse, and maximum extended
                 recovery, by making systematic use of the homomorphism
                 relation on instances. We give results concerning the
                 existence of extended inverses and of maximum extended
                 recoveries, and results concerning their applications
                 to reverse data exchange and query answering. Moreover,
                 we show that maximum extended recoveries can be used to
                 capture in a quantitative way the amount of information
                 loss embodied in a schema mapping specified by
                 source-to-target tuple-generating dependencies.",
  acknowledgement = ack-nhfb,
  keywords =     "chase; data exchange; data integration; inverse;
                 maximum recovery; model management; quasi-inverse;
                 schema mapping",
}

@InProceedings{Amano:2009:XSM,
  author =       "Shun'ichi Amano and Leonid Libkin and Filip Murlak",
  title =        "{XML} schema mappings",
  crossref =     "Paredaens:2009:PTE",
  pages =        "33--42",
  year =         "2009",
  DOI =          "https://doi.org/10.1145/1559795.1559801",
  bibdate =      "Thu Jul 2 14:05:34 MDT 2009",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Relational schema mappings have been extensively
                 studied in connection with data integration and
                 exchange problems, but mappings between XML schemas
                 have not received the same amount of attention. Our
                 goal is to develop a theory of expressive XML schema
                 mappings. Such mappings should be able to use various
                 forms of navigation in a document, and specify
                 conditions on data values. We develop a language for
                 XML schema mappings, and concentrate on three types of
                 problems: static analysis of mappings, their
                 complexity, and their composition. We look at static
                 analysis problems related to various flavors of
                 consistency: for example, whether it is possible to map
                 some document of a source schema into a document of the
                 target schema, or whether all documents of a source
                 schema can be mapped. We classify the complexity of
                 these problems. We then move to the complexity of
                 mappings themselves, i.e., recognizing pairs of
                 documents such that one can be mapped into the other,
                 and provide a classification based on sets of features
                 used in mappings. Finally we look at composition of XML
                 schema mappings. We study its complexity and show that
                 it is harder to achieve closure under composition for
                 XML than for relational mappings. Nevertheless, we find
                 a robust class of XML schema mappings that have good
                 complexity properties and are closed under
                 composition.",
  acknowledgement = ack-nhfb,
  keywords =     "complexity; composition; consistency; mappings;
                 schemas; XML",
}

@InProceedings{Beeri:2009:APA,
  author =       "Catriel Beeri and Phokion G. Kolaitis and Christos H.
                 Papadimitriou",
  title =        "The {ACM} {PODS} Alberto {O}. Mendelzon
                 test-of-time-award 2009",
  crossref =     "Paredaens:2009:PTE",
  pages =        "43--43",
  year =         "2009",
  DOI =          "https://doi.org/10.1145/1559795.1559803",
  bibdate =      "Thu Jul 2 14:05:34 MDT 2009",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gottlob:2009:STB,
  author =       "Georg Gottlob and Stephanie Tien Lee and Gregory J.
                 Valiant",
  title =        "Size and treewidth bounds for conjunctive queries",
  crossref =     "Paredaens:2009:PTE",
  pages =        "45--54",
  year =         "2009",
  DOI =          "https://doi.org/10.1145/1559795.1559804",
  bibdate =      "Thu Jul 2 14:05:34 MDT 2009",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "This paper provides new worst-case bounds for the size
                 and treewith of the result $Q(D)$ of a conjunctive
                 query $Q$ to a database $D$. We derive bounds for the
                 result size $|Q(D)|$ in terms of structural properties
                 of $Q$, both in the absence and in the presence of keys
                 and functional dependencies. These bounds are based on
                 a novel `coloring' of the query variables that
                 associates a {\em coloring number\/} $C(Q)$ to each
                 query $Q$. Using this coloring number, we derive tight
                 bounds for the size of $Q(D)$ in case (i) no functional
                 dependencies or keys are specified, and (ii) simple
                 (one-attribute) keys are given. These results
                 generalize recent size-bounds for join queries obtained
                 by Atserias, Grohe, and Marx (FOCS 2008). An extension
                 of our coloring technique also gives a lower bound for
                 $|Q(D)|$ in the general setting of a query with
                 arbitrary functional dependencies. Our new coloring
                 scheme also allows us to precisely characterize (both
                 in the absence of keys and with simple keys) the
                 treewidth-preserving queries--the queries for which the
                 output treewidth is bounded by a function of the input
                 treewidth. Finally we characterize the queries that
                 preserve the sparsity of the input in the general
                 setting with arbitrary functional dependencies.",
  acknowledgement = ack-nhfb,
  keywords =     "conjunctive queries; database theory; size bounds;
                 treewidth",
}

@InProceedings{Parys:2009:XEL,
  author =       "Pawel Parys",
  title =        "{XPath} evaluation in linear time with polynomial
                 combined complexity",
  crossref =     "Paredaens:2009:PTE",
  pages =        "55--64",
  year =         "2009",
  DOI =          "https://doi.org/10.1145/1559795.1559805",
  bibdate =      "Thu Jul 2 14:05:34 MDT 2009",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We consider a fragment of XPath 1.0, where attribute
                 and text values may be compared. We show that for any
                 unary query in this fragment, the set of nodes that
                 satisfy the query can be calculated in time linear in
                 the document size and polynomial in the size of the
                 query. The previous algorithm for this fragment also
                 had linear data complexity but exponential complexity
                 in the query size.",
  acknowledgement = ack-nhfb,
  keywords =     "tree with data; XML; XPath",
}

@InProceedings{Libkin:2009:FMT,
  author =       "Leonid Libkin",
  title =        "The finite model theory toolbox of a database
                 theoretician",
  crossref =     "Paredaens:2009:PTE",
  pages =        "65--76",
  year =         "2009",
  DOI =          "https://doi.org/10.1145/1559795.1559807",
  bibdate =      "Thu Jul 2 14:05:34 MDT 2009",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "For many years, finite model theory was viewed as the
                 backbone of database theory, and database theory in
                 turn supplied finite model theory with key motivations
                 and problems. By now, finite model theory has built a
                 large arsenal of tools that can easily be used by
                 database theoreticians without going to the basics such
                 as combinatorial games. We survey such tools here,
                 focusing not on how they are proved, but rather on how
                 to apply them, as-is, in various questions that come up
                 in database theory.",
  acknowledgement = ack-nhfb,
  keywords =     "complexity; expressive power; finite models; games;
                 logics; order; query languages; types",
}

@InProceedings{Cali:2009:GDB,
  author =       "Andrea Cal{\`\i} and Georg Gottlob and Thomas
                 Lukasiewicz",
  title =        "A general datalog-based framework for tractable query
                 answering over ontologies",
  crossref =     "Paredaens:2009:PTE",
  pages =        "77--86",
  year =         "2009",
  DOI =          "https://doi.org/10.1145/1559795.1559809",
  bibdate =      "Thu Jul 2 14:05:34 MDT 2009",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "In this paper, we introduce a family of expressive
                 extensions of Datalog, called Datalog+/-, as a new
                 paradigm for query answering over ontologies. The
                 Datalog+/- family admits existentially quantified
                 variables in rule heads, and has suitable restrictions
                 to ensure highly efficient ontology querying. We show
                 in particular that Datalog+/- generalizes the DL-Lite
                 family of tractable description logics, which are the
                 most common tractable ontology languages in the context
                 of the Semantic Web and databases. We also show how
                 stratified negation can be added to Datalog+/- while
                 keeping ontology querying tractable. Furthermore, the
                 Datalog+/- family is of interest in its own right and
                 can, moreover, be used in various contexts such as data
                 integration and data exchange.",
  acknowledgement = ack-nhfb,
  keywords =     "chase; complexity; conjunctive queries; constraints;
                 datalog; dependencies; ontologies; query evaluation;
                 semantic web; tractability",
}

@InProceedings{Abiteboul:2009:SRQ,
  author =       "Serge Abiteboul and Pierre Bourhis and Bogdan
                 Marinoiu",
  title =        "Satisfiability and relevance for queries over active
                 documents",
  crossref =     "Paredaens:2009:PTE",
  pages =        "87--96",
  year =         "2009",
  DOI =          "https://doi.org/10.1145/1559795.1559810",
  bibdate =      "Thu Jul 2 14:05:34 MDT 2009",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "ManyWeb applications are based on dynamic interactions
                 between Web components exchanging flows of information.
                 Such a situation arises for instance in mashup systems
                 [22] or when monitoring distributed autonomous systems
                 [6]. This is a challenging problem that has generated
                 recently a lot of attention; see Web 2.0 [38]. For
                 capturing interactions between Web components, we use
                 active documents interacting with the rest of the world
                 via streams of updates. Their input streams specify
                 updates to the document (in the spirit of RSS feeds),
                 whereas their output streams are defined by queries on
                 the document. In most of the paper, the focus is on
                 input streams where the updates are only insertions,
                 although we do consider also deletions.\par

                 We introduce and study two fundamental concepts in this
                 setting, namely, satisfiability and relevance. Some
                 fact is {\em satisfiable\/} for an active document and
                 a query if it has a chance to be in the result of the
                 query in some future state. Given an active document
                 and a query, a call in the document is {\em relevant\/}
                 if the data brought by this call has a chance to impact
                 the answer to the query. We analyze the complexity of
                 computing satisfiability in our core model (insertions
                 only) and for extensions (e.g., with deletions). We
                 also analyze the complexity of computing relevance in
                 the core model.",
  acknowledgement = ack-nhfb,
  keywords =     "Active XML; query satisfiability; relevance",
}

@InProceedings{Fan:2009:RIC,
  author =       "Wenfei Fan and Floris Geerts",
  title =        "Relative information completeness",
  crossref =     "Paredaens:2009:PTE",
  pages =        "97--106",
  year =         "2009",
  DOI =          "https://doi.org/10.1145/1559795.1559811",
  bibdate =      "Thu Jul 2 14:05:34 MDT 2009",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "The paper investigates the question of whether a
                 partially closed database has complete information to
                 answer a query. In practice an enterprise often
                 maintains master data Dm, a closed-world database. We
                 say that a database D is partially closed if it
                 satisfies a set V of containment constraints of the
                 form `q(D) is a subset of p(Dm)', where q is a query in
                 a language Lc and p is a projection query. The part of
                 D not constrained by (Dm,V) is open, from which some
                 tuples may be missing. The database D is said to be
                 complete for a query Q relative to (Dm,V) if for all
                 partially closed extensions D' of D, Q(D')=Q(D), i.e.,
                 adding tuples to D either violates some constraints in
                 V or does not change the answer to Q.\par

                 We first show that the proposed model can also capture
                 the consistency of data, in addition to its relative
                 completeness. Indeed, integrity constraints studied for
                 consistency can be expressed as containment
                 constraints. We then study two problems. One is to
                 decide, given Dm, V, a query Q in a language Lq and a
                 partially closed database D, whether D is complete for
                 Q relative to (Dm,V). The other is to determine, given
                 Dm, V and Q, whether there exists a partially closed
                 database that is complete for Q relative to (Dm,V). We
                 establish matching lower and upper bounds on these
                 problems for a variety of languages Lq and Lc. We also
                 provide characterizations for a database to be
                 relatively complete, and for a query to allow a
                 relatively complete database, when Lq and Lc are
                 conjunctive queries.",
  acknowledgement = ack-nhfb,
  keywords =     "consistency; constraints; information completeness;
                 master data",
}

@InProceedings{Rastogi:2009:RPO,
  author =       "Vibhor Rastogi and Michael Hay and Gerome Miklau and
                 Dan Suciu",
  title =        "Relationship privacy: output perturbation for queries
                 with joins",
  crossref =     "Paredaens:2009:PTE",
  pages =        "107--116",
  year =         "2009",
  DOI =          "https://doi.org/10.1145/1559795.1559812",
  bibdate =      "Thu Jul 2 14:05:34 MDT 2009",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We study privacy-preserving query answering over data
                 containing relationships. A social network is a prime
                 example of such data, where the nodes represent
                 individuals and edges represent relationships. Nearly
                 all interesting queries over social networks involve
                 joins, and for such queries, existing output
                 perturbation algorithms severely distort query answers.
                 We propose an algorithm that significantly improves
                 utility over competing techniques, typically reducing
                 the error bound from polynomial in the number of nodes
                 to polylogarithmic. The algorithm is, to the best of
                 our knowledge, the first to answer such queries with
                 acceptable accuracy, even for worst-case
                 inputs.\par

                 The improved utility is achieved by relaxing the
                 privacy condition. Instead of ensuring strict
                 differential privacy, we guarantee a weaker (but still
                 quite practical) condition based on adversarial
                 privacy. To explain precisely the nature of our
                 relaxation in privacy, we provide a new result that
                 characterizes the relationship between
                 $\epsilon$-indistinguishability (a variant of the
                 differential privacy definition) and adversarial
                 privacy, which is of independent interest: an algorithm
                 is $\epsilon$-indistinguishable iff it is private for a
                 particular class of adversaries (defined precisely
                 herein). Our perturbation algorithm guarantees privacy
                 against adversaries in this class whose prior
                 distribution is numerically bounded.",
  acknowledgement = ack-nhfb,
  keywords =     "join queries; output perturbation; privacy preserving
                 data mining; private data analysis; sensitivity; social
                 networks",
}

@InProceedings{Kirsch:2009:ERA,
  author =       "Adam Kirsch and Michael Mitzenmacher and Andrea
                 Pietracaprina and Geppino Pucci and Eli Upfal and Fabio
                 Vandin",
  title =        "An efficient rigorous approach for identifying
                 statistically significant frequent itemsets",
  crossref =     "Paredaens:2009:PTE",
  pages =        "117--126",
  year =         "2009",
  DOI =          "https://doi.org/10.1145/1559795.1559814",
  bibdate =      "Thu Jul 2 14:05:34 MDT 2009",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "As advances in technology allow for the collection,
                 storage, and analysis of vast amounts of data, the task
                 of screening and assessing the significance of
                 discovered patterns is becoming a major challenge in
                 data mining applications. In this work, we address
                 significance in the context of frequent itemset mining.
                 Specifically, we develop a novel methodology to
                 identify a meaningful support threshold $s^*$ for a
                 dataset, such that the number of itemsets with support
                 at least $s^*$ represents a substantial deviation from
                 what would be expected in a random dataset with the
                 same number of transactions and the same individual
                 item frequencies. These itemsets can then be flagged as
                 statistically significant with a small false discovery
                 rate.\par

                 Our methodology hinges on a Poisson approximation to
                 the distribution of the number of itemsets in a random
                 dataset with support at least $s$, for any $s$ greater
                 than or equal to a minimum threshold $s_{\hbox{min}}$.
                 We obtain this result through a novel application of
                 the Chen--Stein approximation method, which is of
                 independent interest. Based on this approximation, we
                 develop an efficient parametric multi-hypothesis test
                 for identifying the desired threshold $s^*$. A crucial
                 feature of our approach is that, unlike most previous
                 work, it takes into account the entire dataset rather
                 than individual discoveries. It is therefore better
                 able to distinguish between significant observations
                 and random fluctuations. We present extensive
                 experimental results to substantiate the effectiveness
                 of our methodology.",
  acknowledgement = ack-nhfb,
  keywords =     "false discovery rate; frequent itemset mining;
                 multi-hypothesis test; Poisson approximation;
                 statistical significance",
}

@InProceedings{Chierichetti:2009:SC,
  author =       "Flavio Chierichetti and Ravi Kumar and Sergei
                 Vassilvitskii",
  title =        "Similarity caching",
  crossref =     "Paredaens:2009:PTE",
  pages =        "127--136",
  year =         "2009",
  DOI =          "https://doi.org/10.1145/1559795.1559815",
  bibdate =      "Thu Jul 2 14:05:34 MDT 2009",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We introduce the {\em similarity caching problem}, a
                 variant of classical caching in which an algorithm can
                 return an element from the cache that is similar, but
                 not necessarily identical, to the query element. We are
                 motivated by buffer management questions in approximate
                 nearest-neighbor applications, especially in the
                 context of caching targeted advertisements on the web.
                 Formally, we assume the queries lie in a metric space,
                 with distance function $d(\ldots{})$. A query $p$ is
                 considered a cache hit if there is a point $q$ in the
                 cache that is sufficiently close to $p$, i.e., for a
                 threshold radius $r$, we have $d(p,q) \leq r$. The goal
                 is then to minimize the number of cache misses,
                 vis-{\`a}-vis the optimal algorithm. As with classical
                 caching, we use the competitive ratio to measure the
                 performance of different algorithms.\par

                 While similarity caching is a strict generalization of
                 classical caching, we show that unless the algorithm is
                 allowed extra power (either in the size of the cache or
                 the threshold $r$) over the optimal offline algorithm,
                 the problem is intractable. We then proceed to quantify
                 the hardness as a function of the complexity of the
                 underlying metric space. We show that the problem
                 becomes easier as we proceed from general metric spaces
                 to those of bounded doubling dimension, and to
                 Euclidean metrics. Finally, we investigate several
                 extensions of the problem: dependence of the threshold
                 $r$ on the query and a smoother trade-off between the
                 cache-miss cost and the query-query similarity.",
  acknowledgement = ack-nhfb,
  keywords =     "buffer management; caching; competitive analysis;
                 nearest-neighbor",
}

@InProceedings{Agarwal:2009:IUD,
  author =       "Pankaj K. Agarwal and Siu-Wing Cheng and Yufei Tao and
                 Ke Yi",
  title =        "Indexing uncertain data",
  crossref =     "Paredaens:2009:PTE",
  pages =        "137--146",
  year =         "2009",
  DOI =          "https://doi.org/10.1145/1559795.1559816",
  bibdate =      "Thu Jul 2 14:05:34 MDT 2009",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Querying uncertain data has emerged as an important
                 problem in data management due to the imprecise nature
                 of many measurement data. In this paper we study
                 answering range queries over uncertain data.
                 Specifically, we are given a collection $P$ of $n$
                 points in R, each represented by its one-dimensional
                 probability density function (pdf). The goal is to
                 build an index on $P$ such that given a query interval
                 $I$ and a probability threshold $\tau$, we can quickly
                 report all points of $P$ that lie in $I$ with
                 probability at least $\tau$. We present various
                 indexing schemes with linear or near-linear space and
                 logarithmic query time. Our schemes support pdf's that
                 are either histograms or more complex ones such as
                 Gaussian or piecewise algebraic. They also extend to
                 the external memory model in which the goal is to
                 minimize the number of disk accesses when querying the
                 index.",
  acknowledgement = ack-nhfb,
  keywords =     "indexing; range query; uncertain data",
}

@InProceedings{Braverman:2009:OSS,
  author =       "Vladimir Braverman and Rafail Ostrovsky and Carlo
                 Zaniolo",
  title =        "Optimal sampling from sliding windows",
  crossref =     "Paredaens:2009:PTE",
  pages =        "147--156",
  year =         "2009",
  DOI =          "https://doi.org/10.1145/1559795.1559818",
  bibdate =      "Thu Jul 2 14:05:34 MDT 2009",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "A {\em sliding windows\/} model is an important case
                 of the streaming model, where only the most `recent'
                 elements remain active and the rest are discarded in a
                 stream. The sliding windows model is important for many
                 applications (see, e.g., Babcock, Babu, Datar, Motwani
                 and Widom (PODS 02); and Datar, Gionis, Indyk and
                 Motwani (SODA 02)). There are two equally important
                 types of the sliding windows model -- windows with
                 fixed size, (e.g., where items arrive one at a time,
                 and only the most recent $n$ items remain active for
                 some fixed parameter $n$), and bursty windows (e.g.,
                 where many items can arrive in `bursts' at a single
                 step and where only items from the last $t$ steps
                 remain active, again for some fixed parameter
                 $t$).\par

                 {\em Random sampling\/} is a fundamental tool for data
                 streams, as numerous algorithms operate on the sampled
                 data instead of on the entire stream. Effective
                 sampling from sliding windows is a nontrivial problem,
                 as elements eventually expire. In fact, the deletions
                 are {\em implicit\/}; i.e., it is not possible to
                 identify deleted elements without storing the entire
                 window. The implicit nature of deletions on sliding
                 windows does not allow the existing methods (even those
                 that support explicit deletions, e.g., Cormode,
                 Muthukrishnan and Rozenbaum (VLDB 05); Frahling, Indyk
                 and Sohler (SOCG 05)) to be directly `translated' to
                 the sliding windows model. One trivial approach to
                 overcoming the problem of implicit deletions is that of
                 over-sampling. When $k$ samples are required, the
                 over-sampling method maintains $k' > k$ samples in the
                 hope that at least $k$ samples are not expired. The
                 obvious disadvantages of this method are
                 twofold:\par

                 (a) It introduces additional costs and thus decreases
                 the performance; and\par

                 (b) The memory bounds are not deterministic, which is
                 atypical for streaming algorithms (where even small
                 probability events may eventually happen for a stream
                 that is big enough).\par

                 Babcock, Datar and Motwani (SODA 02), were the first to
                 stress the importance of improvements to over-sampling.
                 They formally introduced the problem of sampling from
                 sliding windows and improved the over-sampling method
                 for {\em sampling with replacement}. Their elegant
                 solutions for sampling with replacement are optimal
                 {\em in expectation}, and thus resolve disadvantage
                 $(a)$ mentioned above. Unfortunately, the randomized
                 bounds do not resolve disadvantage $(b)$ above.
                 Interestingly, all algorithms that employ the ideas of
                 Babcock, Datar and Motwani have the same central
                 problem of having to deal with randomized complexity
                 (see e.g., Datar and Muthukrishnan (ESA 02);
                 Chakrabarti, Cormode and McGregor (SODA 07)). Further,
                 the proposed solutions of Babcock, Datar and Motwani
                 for {\em sampling without replacement\/} are based on
                 the criticized over-sampling method and thus do not
                 solve problem $(a)$. Therefore, the question of whether
                 we can solve sampling on sliding windows optimally
                 (i.e., resolving both disadvantages) is implicit in the
                 paper of Babcock, Datar and Motwani and has remained
                 open for all variants of the problem.\par

                 In this paper we answer these questions affirmatively
                 and provide optimal sampling schemas for all variants
                 of the problem, i.e., sampling with or without
                 replacement from fixed or bursty windows. Specifically,
                 for fixed-size windows, we provide optimal solutions
                 that require $O(k)$ memory; for bursty windows, we show
                 algorithms that require $O(k \log n)$, which is optimal
                 since it matches the lower bound by Gemulla and Lehner
                 (SIGMOD 08). In contrast to the work of Babcock, Datar
                 and Motwani, our solutions have deterministic bounds.
                 Thus, we prove a perhaps somewhat surprising fact: the
                 memory complexity of the sampling-based algorithm for
                 all variants of the sliding windows model is comparable
                 with that of streaming models (i.e., without the
                 sliding windows). This is the first result of this
                 type, since all previous `translations' of
                 sampling-based algorithms to sliding windows incur
                 randomized memory guarantees only.",
  acknowledgement = ack-nhfb,
  keywords =     "data streams; random sampling; sliding windows",
}

@InProceedings{Berinde:2009:SOH,
  author =       "Radu Berinde and Graham Cormode and Piotr Indyk and
                 Martin J. Strauss",
  title =        "Space-optimal heavy hitters with strong error bounds",
  crossref =     "Paredaens:2009:PTE",
  pages =        "157--166",
  year =         "2009",
  DOI =          "https://doi.org/10.1145/1559795.1559819",
  bibdate =      "Thu Jul 2 14:05:34 MDT 2009",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "The problem of finding heavy hitters and approximating
                 the frequencies of items is at the heart of many
                 problems in data stream analysis. It has been observed
                 that several proposed solutions to this problem can
                 outperform their worst-case guarantees on real data.
                 This leads to the question of whether some stronger
                 bounds can be guaranteed. We answer this in the
                 positive by showing that a class of `counter-based
                 algorithms' (including the popular and very
                 space-efficient FREQUENT and SPACESAVING algorithms)
                 provide much stronger approximation guarantees than
                 previously known. Specifically, we show that errors in
                 the approximation of individual elements do not depend
                 on the frequencies of the most frequent elements, but
                 only on the frequency of the remaining `tail.' This
                 shows that counter-based methods are the most
                 space-efficient (in fact, space-optimal) algorithms
                 having this strong error bound.\par

                 This tail guarantee allows these algorithms to solve
                 the `sparse recovery' problem. Here, the goal is to
                 recover a faithful representation of the vector of
                 frequencies, $f$. We prove that using space $O(k)$, the
                 algorithms construct an approximation $f*$ to the
                 frequency vector $f$ so that the L1 error $||f -
                 f*||_1$ is close to the best possible error
                 $\hbox{min}_{f_2} || f_2 - f ||_1$, where $f$ 2 ranges
                 over all vectors with at most $k$ non-zero entries.
                 This improves the previously best known space bound of
                 about $O(k \log n)$ for streams without element
                 deletions (where $n$ is the size of the domain from
                 which stream elements are drawn). Other consequences of
                 the tail guarantees are results for skewed (Zipfian)
                 data, and guarantees for accuracy of merging multiple
                 summarized streams.",
  acknowledgement = ack-nhfb,
  keywords =     "frequency estimation; heavy hitters; streaming
                 algorithms",
}

@InProceedings{Yi:2009:OTD,
  author =       "Ke Yi and Qin Zhang",
  title =        "Optimal tracking of distributed heavy hitters and
                 quantiles",
  crossref =     "Paredaens:2009:PTE",
  pages =        "167--174",
  year =         "2009",
  DOI =          "https://doi.org/10.1145/1559795.1559820",
  bibdate =      "Thu Jul 2 14:05:34 MDT 2009",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We consider the problem of tracking heavy hitters and
                 quantiles in the distributed streaming model. The heavy
                 hitters and quantiles are two important statistics for
                 characterizing a data distribution. Let $A$ be a
                 multiset of elements, drawn from the universe $U =
                 \{1,\ldots{}, u\}$. For a given $0 \leq \Phi \leq 1$,
                 the $\Phi$-heavy hitters are those elements of $A$
                 whose frequency in $A$ is at least $\Phi |A|$; the
                 $\Phi$-quantile of $A$ is an element $x$ of $U$ such
                 that at most $\Phi|A|$ elements of $A$ are smaller than
                 $A$ and at most $(1-\Phi)|A|$ elements of $A$ are
                 greater than $x$. Suppose the elements of $A$ are
                 received at $k$ remote {\em sites\/} over time, and
                 each of the sites has a two-way communication channel
                 to a designated {\em coordinator}, whose goal is to
                 track the set of $\Phi$-heavy hitters and the
                 $\Phi$-quantile of $A$ approximately at all times with
                 minimum communication. We give tracking algorithms with
                 worst-case communication cost $O(k/\epsilon \cdot \log
                 n)$ for both problems, where $n$ is the total number of
                 items in $A$, and $\epsilon$ is the approximation
                 error. This substantially improves upon the previous
                 known algorithms. We also give matching lower bounds on
                 the communication costs for both problems, showing that
                 our algorithms are optimal. We also consider a more
                 general version of the problem where we simultaneously
                 track the $\Phi$-quantiles for all $0 \leq \Phi \leq
                 1$.",
  acknowledgement = ack-nhfb,
  keywords =     "distributed tracking; heavy hitter; quantile",
}

@InProceedings{Arge:2009:WCE,
  author =       "Lars Arge",
  title =        "Worst-case efficient range search indexing: invited
                 tutorial",
  crossref =     "Paredaens:2009:PTE",
  pages =        "175--176",
  year =         "2009",
  DOI =          "https://doi.org/10.1145/1559795.1559822",
  bibdate =      "Thu Jul 2 14:05:34 MDT 2009",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "In this tutorial we will describe some of the recent
                 advances in the development of worst-case efficient
                 range search indexing structures, that is, structures
                 for storing a set of data points such that the points
                 in a axis-parallel (hyper-) query rectangle can be
                 found efficiently (with as few disk accesses - or I/Os
                 - as possible). We first quickly discuss the well-known
                 and optimal structure for the one-dimensional version
                 of the problem, the B-tree [10, 12], along with its
                 variants weight-balanced B-trees [9], multi-version (or
                 persistent) B-trees [6, 11, 13, 22] and buffer-trees
                 [4]. Then we discuss the external priority search tree
                 [8], which solves a restricted version of the
                 two-dimensional version of the problem where the query
                 rectangle is unbounded on one side. This structure is
                 then used in a range tree index structure [8, 21] that
                 answers general two-dimensional queries in the same
                 number of I/Os as the B-tree in the one-dimensional
                 case, but using super-linear space. We also describe
                 the linear space kdB-tree [19, 20] and O-tree [17]
                 index structures that also solve the problem
                 efficiently (but using more I/Os than the range tree).
                 A detailed presentation of all the above structures can
                 be found in lecture notes by the author [5]. Finally,
                 we also discuss lower bounds techniques, most notably
                 the theory of indexability [16], that can be used to
                 prove that both the range tree and kdB-tree/O-tree are
                 optimal among query efficient and linear space
                 structures, respectively [2, 8, 17], as well as recent
                 index structures for higher-dimensional range search
                 indexing [1]. We end by mentioning various R-tree
                 variant [7, 18, 15] that can be used to solve the
                 extended version of range search indexing where the
                 queries as well as the data are (hyper-) rectangles.
                 More comprehensive surveys of efficient index
                 structures can be found in [3, 14, 23].",
  acknowledgement = ack-nhfb,
  keywords =     "indexing; range search",
}

@InProceedings{Pagh:2009:SIO,
  author =       "Rasmus Pagh and Srinivasa Rao Satti",
  title =        "Secondary indexing in one dimension: beyond {B}-trees
                 and bitmap indexes",
  crossref =     "Paredaens:2009:PTE",
  pages =        "177--186",
  year =         "2009",
  DOI =          "https://doi.org/10.1145/1559795.1559824",
  bibdate =      "Thu Jul 2 14:05:34 MDT 2009",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Let $\sigma$ be a finite, ordered alphabet, and
                 consider a string $x = \chi_1 \chi_2 \ldots{} \chi_n
                 \in \sigma^n$. A {\em secondary index\/} for $x$
                 answers alphabet range queries of the form: Given a
                 range $[\alpha_l,\alpha_r ] \subseteq \sigma$, return
                 the set $I_{[\alpha_l,\alpha_r]} = \{i | \chi_i \in
                 [\alpha_l, \alpha_r]\}$. Secondary indexes are heavily
                 used in relational databases and scientific data
                 analysis. It is well-known that the obvious solution,
                 storing a dictionary for the set $\cup_i \{\chi_i\}$
                 with a position set associated with each character,
                 does not always give optimal query time. In this paper
                 we give the first theoretically optimal data structure
                 for the secondary indexing problem. In the I/O model,
                 the amount of data read when answering a query is
                 within a constant factor of the minimum space needed to
                 represent the set $I_{[\alpha_l, \alpha_r]}$, assuming
                 that the size of internal memory is $(|\sigma| \lg
                 n)^\delta$ blocks, for some constant $\delta > 0$. The
                 space usage of the data structure is $O(n \lg
                 |\sigma|)$ bits in the worst case, and we further show
                 how to bound the size of the data structure in terms of
                 the $0$-th order entropy of $x$. We show how to support
                 updates achieving various time-space trade-offs.\par

                 We also consider an approximate version of the basic
                 secondary indexing problem where a query reports a
                 superset of $I_{[\alpha_l,\alpha_r]}$ containing each
                 element not in $I_{[\alpha_l, \alpha_r]}$ with
                 probability at most \epsilon, where $\epsilon > 0$ is
                 the false positive probability. For this problem the
                 amount of data that needs to be read by the query
                 algorithm is reduced to $O(|I_{(\alpha_l, \alpha_r]} |
                 \lg(1/\epsilon))$ bits.",
  acknowledgement = ack-nhfb,
  keywords =     "b-tree; bitmap index; range query",
}

@InProceedings{Yi:2009:DIL,
  author =       "Ke Yi",
  title =        "Dynamic indexability and lower bounds for dynamic
                 one-dimensional range query indexes",
  crossref =     "Paredaens:2009:PTE",
  pages =        "187--196",
  year =         "2009",
  DOI =          "https://doi.org/10.1145/1559795.1559825",
  bibdate =      "Thu Jul 2 14:05:34 MDT 2009",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "The {\em B-tree\/} is a fundamental external index
                 structure that is widely used for answering
                 one-dimensional range reporting queries. Given a set of
                 $N$ keys, a range query can be answered in $O(\log_B N
                 \over M + K \over B)$ I/Os, where $B$ is the disk block
                 size, $K$ the output size, and $M$ the size of the main
                 memory buffer. When keys are inserted or deleted, the
                 B-tree is updated in $O(\log_B N)$ I/Os, if we require
                 the resulting changes to be committed to disk right
                 away. Otherwise, the memory buffer can be used to
                 buffer the recent updates, and changes can be written
                 to disk in batches, which significantly lowers the
                 amortized update cost. A systematic way of batching up
                 updates is to use the {\em logarithmic method,\/}
                 combined with {\em fractional cascading,\/} resulting
                 in a dynamic B-tree that supports insertions in $O(1
                 \over B \log N \over M)$ I/Os and queries in $O(\log N
                 \over M + K \over B)$ I/Os. Such bounds have also been
                 matched by several known dynamic B-tree variants in the
                 database literature. Note that, however, the query cost
                 of these dynamic B-trees is substantially worse than
                 the $O(\log_B N \over M + K \over B)$ bound of the
                 static B-tree by a factor of $O(\log B)$.\par

                 In this paper, we prove that for any dynamic one
                 dimensional range query index structure with query cost
                 $O(q + K \over B)$ and amortized insertion cost $O(u /
                 B)$, the tradeoff $q \cdot \log(u / q) = &\#169;(\log
                 B)$ must hold if $q = O(\log B)$. For most reasonable
                 values of the parameters, we have $N \over M =
                 B^{O(1)}$, in which case our query-insertion tradeoff
                 implies that the bounds mentioned above are already
                 optimal. We also prove a lower bound of $u \cdot \log q
                 = &\#169;(\log B)$, which is relevant for larger values
                 of $q$. Our lower bounds hold in a dynamic version of
                 the {\em indexability model}, which is of independent
                 interests. Dynamic indexability is a clean yet powerful
                 model for studying dynamic indexing problems, and can
                 potentially lead to more interesting complexity
                 results.",
  acknowledgement = ack-nhfb,
  keywords =     "dynamization; indexability; lower bound; range query",
}

@InProceedings{Figueira:2009:SDX,
  author =       "Diego Figueira",
  title =        "Satisfiability of downward {XPath} with data equality
                 tests",
  crossref =     "Paredaens:2009:PTE",
  pages =        "197--206",
  year =         "2009",
  DOI =          "https://doi.org/10.1145/1559795.1559827",
  bibdate =      "Thu Jul 2 14:05:34 MDT 2009",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "In this work we investigate the satisfiability problem
                 for the logic XPath$(\downarrow*, \downarrow, =)$, that
                 includes all downward axes as well as equality and
                 inequality tests. We address this problem in the
                 absence of DTDs and the sibling axis. We prove that
                 this fragment is decidable, and we nail down its
                 complexity, showing the problem to be ExpTime-complete.
                 The result also holds when path expressions allow
                 closure under the Kleene star operator. To obtain these
                 results, we introduce a new automaton model over data
                 trees that captures XPath$(\downarrow*, \downarrow, =)$
                 and has an ExpTime emptiness problem. Furthermore, we
                 give the exact complexity of several downward-looking
                 fragments.",
  acknowledgement = ack-nhfb,
  keywords =     "bip automaton; data values; data-tree; infinite
                 alphabet; unranked unordered tree; XML; XPath",
}

@InProceedings{DeHaan:2009:ENQ,
  author =       "David DeHaan",
  title =        "Equivalence of nested queries with mixed semantics",
  crossref =     "Paredaens:2009:PTE",
  pages =        "207--216",
  year =         "2009",
  DOI =          "https://doi.org/10.1145/1559795.1559828",
  bibdate =      "Thu Jul 2 14:05:34 MDT 2009",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We consider the problem of deciding query equivalence
                 for a conjunctive language in which queries output
                 complex objects composed from a mixture of nested,
                 unordered collection types. Using an encoding of nested
                 objects as flat relations, we translate the problem to
                 deciding the equivalence between encodings output by
                 relational conjunctive queries. This encoding
                 equivalence cleanly unifies and generalizes previous
                 results for deciding equivalence of conjunctive queries
                 evaluated under various processing semantics. As part
                 of our characterization of encoding equivalence, we
                 define a normal form for encoding queries and contend
                 that this normal form offers new insight into the
                 fundamental principles governing the behaviour of
                 nested aggregation.",
  acknowledgement = ack-nhfb,
  keywords =     "aggregation; bag-set semantics; conjunctive queries;
                 normalized bags; query equivalence; set semantics",
}

@InProceedings{Chirkova:2009:ESQ,
  author =       "Rada Chirkova and Michael R. Genesereth",
  title =        "Equivalence of {SQL} queries in presence of embedded
                 dependencies",
  crossref =     "Paredaens:2009:PTE",
  pages =        "217--226",
  year =         "2009",
  DOI =          "https://doi.org/10.1145/1559795.1559829",
  bibdate =      "Thu Jul 2 14:05:34 MDT 2009",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We consider the problem of finding equivalent
                 minimal-size reformulations of SQL queries in presence
                 of embedded dependencies [1]. Our focus is on
                 select-project-join (SPJ) queries with equality
                 comparisons, also known as safe conjunctive (CQ)
                 queries, possibly with grouping and aggregation. For
                 SPJ queries, the semantics of the SQL standard treats
                 query answers as {\em multisets (bags),\/} whereas the
                 stored relations are treated either as sets, which is
                 called {\em bag-set semantics,\/} or as bags, which is
                 called {\em bag semantics}. (Under {\em set semantics},
                 both query answers and stored relations are treated as
                 sets.)\par

                 In the context of the above Query-Reformulation
                 Problem, we develop a comprehensive framework for
                 equivalence of CQ queries under bag and bag-set
                 semantics in presence of embedded dependencies, and
                 make a number of conceptual and technical
                 contributions. Specifically, we develop equivalence
                 tests for CQ queries in presence of arbitrary sets of
                 embedded dependencies under bag and bag-set semantics,
                 under the condition that chase [10] under set semantics
                 {\em (set-chase)\/} on the inputs terminates. We also
                 present equivalence tests for CQ queries {\em with
                 grouping and aggregation\/} in presence of embedded
                 dependencies. We use our equivalence tests to develop
                 sound and complete (whenever set-chase on the inputs
                 terminates) algorithms for solving instances of the
                 Query-Reformulation Problem with CQ queries under each
                 of bag and bag-set semantics, as well as for instances
                 of the problem with aggregate queries.\par

                 Our contributions are clearly applicable beyond the
                 Query-Reformulation Problem considered in this paper.
                 Specifically, the results of this paper can be used in
                 developing algorithms for rewriting CQ queries and
                 queries in more expressive languages (e.g., including
                 grouping and aggregation, or arithmetic comparisons)
                 using views in presence of embedded dependencies, under
                 bag or bag-set semantics for query evaluation.",
  acknowledgement = ack-nhfb,
  keywords =     "conjunctive queries; embedded dependencies; query
                 equivalence",
}

@InProceedings{Cohen:2009:RTA,
  author =       "Sara Cohen and Benny Kimelfeld and Yehoshua Sagiv",
  title =        "Running tree automata on probabilistic {XML}",
  crossref =     "Paredaens:2009:PTE",
  pages =        "227--236",
  year =         "2009",
  DOI =          "https://doi.org/10.1145/1559795.1559831",
  bibdate =      "Thu Jul 2 14:05:34 MDT 2009",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Tree automata (specifically, bottom-up and unranked)
                 form a powerful tool for querying and maintaining
                 validity of XML documents. XML with uncertain data can
                 be modeled as a probability space of labeled trees, and
                 that space is often represented by a tree with
                 distributional nodes. This paper investigates the
                 problem of evaluating a tree automaton over such a
                 representation, where the goal is to compute the
                 probability that the automaton accepts a random
                 possible world. This problem is generally intractable,
                 but for the case where the tree automaton is
                 deterministic (and its transitions are defined by
                 deterministic string automata), an efficient algorithm
                 is presented. The paper discusses the applications of
                 this result, including the ability to sample and to
                 evaluate queries (e.g., in monadic second-order logic)
                 while requiring a-priori conformance to a schema (e.g.,
                 DTD). XML schemas also include attribute constraints,
                 and the complexity of key, foreign-key and inclusion
                 constraints are studied in the context of probabilistic
                 XML. Finally, the paper discusses the generalization of
                 the results to an extended data model, where
                 distributional nodes can repeatedly sample the same
                 subtree, thereby adding another exponent to the size of
                 the probability space.",
  acknowledgement = ack-nhfb,
  keywords =     "probabilistic trees; probabilistic XML; tree automata;
                 XML constraints; XML query evaluation; XML schema",
}

@InProceedings{Barcelo:2009:XII,
  author =       "Pablo Barcel{\'o} and Leonid Libkin and Antonella
                 Poggi and Cristina Sirangelo",
  title =        "{XML} with incomplete information: models, properties,
                 and query answering",
  crossref =     "Paredaens:2009:PTE",
  pages =        "237--246",
  year =         "2009",
  DOI =          "https://doi.org/10.1145/1559795.1559832",
  bibdate =      "Thu Jul 2 14:05:34 MDT 2009",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We study models of incomplete information for XML,
                 their computational properties, and query answering.
                 While our approach is motivated by the study of
                 relational incompleteness, incomplete information in
                 XML documents may appear not only as null values but
                 also as missing structural information. Our goal is to
                 provide a classification of incomplete descriptions of
                 XML documents, and separate features - or groups of
                 features - that lead to hard computational problems
                 from those that admit efficient algorithms. Our
                 classification of incomplete information is based on
                 the combination of null values with partial structural
                 descriptions of documents. The key computational
                 problems we consider are consistency of partial
                 descriptions, representability of complete documents by
                 incomplete ones, and query answering. We show how
                 factors such as schema information, the presence of
                 node ids, and missing structural information affect the
                 complexity of these main computational problems, and
                 find robust classes of incomplete XML descriptions that
                 permit tractable query evaluation.",
  acknowledgement = ack-nhfb,
  keywords =     "certain answers; consistency; incomplete information;
                 membership; query answering; XML",
}

@InProceedings{Abiteboul:2009:DXD,
  author =       "Serge Abiteboul and Georg Gottlob and Marco Manna",
  title =        "Distributed {XML} design",
  crossref =     "Paredaens:2009:PTE",
  pages =        "247--258",
  year =         "2009",
  DOI =          "https://doi.org/10.1145/1559795.1559833",
  bibdate =      "Thu Jul 2 14:05:34 MDT 2009",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "A {\em distributed XML document\/} is an XML document
                 that spans several machines or Web repositories. We
                 assume that a distribution design of the document tree
                 is given, providing an XML tree some of whose leaves
                 are 'docking points', to which XML subtrees can be
                 attached. These subtrees may be provided and controlled
                 by peers at remote locations, or may correspond to the
                 result of function calls, e.g., Web services. If a
                 global type $\tau$, e.g. a DTD, is specified for a
                 distributed document $T$, it would be most desirable to
                 be able to break this type into a collection of local
                 types, called a local typing, such that the document
                 satisfies $\tau$ if and only if each peer (or function)
                 satisfies its local type. In this paper we lay out the
                 fundamentals of a theory of local typing and provide
                 formal definitions of three main variants of locality:
                 local typing, maximal local typing, and perfect typing,
                 the latter being the most desirable. We study the
                 following relevant decision problems: (i) given a
                 typing for a design, determine whether it is local,
                 maximal local, or perfect; (ii) given a design,
                 establish whether a (maximal) local, or perfect typing
                 does exist. For some of these problems we provide tight
                 complexity bounds (polynomial space), while for the
                 others we show exponential upper bounds. A main
                 contribution is a polynomial-space algorithm for
                 computing a perfect typing in this context, if it
                 exists.",
  acknowledgement = ack-nhfb,
  keywords =     "distributed XML; dtd; XML typing; XML-schema",
}

@InProceedings{Li:2009:CAQ,
  author =       "Jian Li and Amol Deshpande",
  title =        "Consensus answers for queries over probabilistic
                 databases",
  crossref =     "Paredaens:2009:PTE",
  pages =        "259--268",
  year =         "2009",
  DOI =          "https://doi.org/10.1145/1559795.1559835",
  bibdate =      "Thu Jul 2 14:05:34 MDT 2009",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We address the problem of finding a 'best'
                 deterministic query answer to a query over a
                 probabilistic database. For this purpose, we propose
                 the notion of a consensus world (or a consensus answer)
                 which is a deterministic world (answer) that minimizes
                 the expected distance to the possible worlds (answers).
                 This problem can be seen as a generalization of the
                 well-studied inconsistent information aggregation
                 problems (e.g. rank aggregation) to probabilistic
                 databases. We consider this problem for various types
                 of queries including SPJ queries, Top-k ranking
                 queries, group-by aggregate queries, and clustering.
                 For different distance metrics, we obtain polynomial
                 time optimal or approximation algorithms for computing
                 the consensus answers (or prove NP-hardness). Most of
                 our results are for a general probabilistic database
                 model, called and/xor tree model, which significantly
                 generalizes previous probabilistic database models like
                 x-tuples and block-independent disjoint models, and is
                 of independent interest.",
  acknowledgement = ack-nhfb,
  keywords =     "consensus answers; probabilistic and/xor tree;
                 probabilistic databases; query processing; rank
                 aggregation",
}

@InProceedings{Guha:2009:EEC,
  author =       "Sudipto Guha and Kamesh Munagala",
  title =        "Exceeding expectations and clustering uncertain data",
  crossref =     "Paredaens:2009:PTE",
  pages =        "269--278",
  year =         "2009",
  DOI =          "https://doi.org/10.1145/1559795.1559836",
  bibdate =      "Thu Jul 2 14:05:34 MDT 2009",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Database technology is playing an increasingly
                 important role in understanding and solving large-scale
                 and complex scientific and societal problems and
                 phenomena, for instance, understanding biological
                 networks, climate modeling, electronic markets, etc. In
                 these settings, uncertainty or imprecise information is
                 a pervasive issue that becomes a serious impediment to
                 understanding and effectively utilizing such systems.
                 Clustering is one of the key problems in this
                 context.\par In this paper we focus on the problem of
                 clustering, specifically the {\em k\/} -center problem.
                 Since the problem is NP-Hard in deterministic setting,
                 a natural avenue is to consider approximation
                 algorithms with a bounded performance ratio. In an
                 earlier paper Cormode and McGregor had considered
                 certain variants of this problem, but failed to provide
                 approximations that preserved the number of centers. In
                 this paper we remedy the situation and provide true
                 approximation algorithms for a wider class of these
                 problems.\par

                 However, the key aspect of this paper is to devise
                 general techniques for optimization under uncertainty.
                 We show that a particular formulation which uses the
                 contribution of a random variable above its expectation
                 is useful in this context. We believe these techniques
                 will find wider applications in optimization under
                 uncertainty.",
  acknowledgement = ack-nhfb,
  keywords =     "approximation algorithms; clustering",
}

@InProceedings{Atallah:2009:CAS,
  author =       "Mikhail J. Atallah and Yinian Qi",
  title =        "Computing all skyline probabilities for uncertain
                 data",
  crossref =     "Paredaens:2009:PTE",
  pages =        "279--287",
  year =         "2009",
  DOI =          "https://doi.org/10.1145/1559795.1559837",
  bibdate =      "Thu Jul 2 14:05:34 MDT 2009",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Skyline computation is widely used in multi-criteria
                 decision making. As research in uncertain databases
                 draws increasing attention, skyline queries with
                 uncertain data have also been studied, e.g.
                 probabilistic skylines. The previous work requires
                 'thresholding' for its efficiency -- the efficiency
                 relies on the assumption that points with skyline
                 probabilities below a certain threshold can be ignored.
                 But there are situations where 'thresholding' is not
                 desirable -- low probability events cannot be ignored
                 when their consequences are significant. In such cases
                 it is necessary to compute skyline probabilities of all
                 data items. We provide the first algorithm for this
                 problem whose worst-case time complexity is
                 sub-quadratic. The techniques we use are interesting in
                 their own right, as they rely on a space partitioning
                 technique combined with using the existing dominance
                 counting algorithm. The effectiveness of our algorithm
                 is experimentally verified.",
  acknowledgement = ack-nhfb,
  keywords =     "probabilistic skyline; uncertain data",
}

@InProceedings{Hellerstein:2010:DRE,
  author =       "Joseph M. Hellerstein",
  title =        "Datalog redux: experience and conjecture",
  crossref =     "VanGucht:2010:PPT",
  pages =        "1--2",
  year =         "2010",
  DOI =          "https://doi.org/10.1145/1807085.1807087",
  bibdate =      "Mon Mar 28 12:24:43 MDT 2011",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Barcelo:2010:ELP,
  author =       "Pablo Barcelo and Carlos Hurtado and Leonid Libkin and
                 Peter Wood",
  title =        "Expressive languages for path queries over
                 graph-structured data",
  crossref =     "VanGucht:2010:PPT",
  pages =        "3--14",
  year =         "2010",
  DOI =          "https://doi.org/10.1145/1807085.1807089",
  bibdate =      "Mon Mar 28 12:24:43 MDT 2011",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kimelfeld:2010:TMS,
  author =       "Benny Kimelfeld and Christopher R{\'e}",
  title =        "Transducing {Markov} sequences",
  crossref =     "VanGucht:2010:PPT",
  pages =        "15--26",
  year =         "2010",
  DOI =          "https://doi.org/10.1145/1807085.1807090",
  bibdate =      "Mon Mar 28 12:24:43 MDT 2011",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Benedikt:2010:PHO,
  author =       "Michael Benedikt and Gabriele Puppis and Huy Vu",
  title =        "Positive higher-order queries",
  crossref =     "VanGucht:2010:PPT",
  pages =        "27--38",
  year =         "2010",
  DOI =          "https://doi.org/10.1145/1807085.1807091",
  bibdate =      "Mon Mar 28 12:24:43 MDT 2011",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Su:2010:APA,
  author =       "Jianwen Su and Phokion G. Kolaitis",
  title =        "The {ACM PODS Alberto O. Mendelzon Test-of-Time-Award
                 2010}",
  crossref =     "VanGucht:2010:PPT",
  pages =        "39--40",
  year =         "2010",
  DOI =          "https://doi.org/10.1145/1807085.1807093",
  bibdate =      "Mon Mar 28 12:24:43 MDT 2011",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kane:2010:OAD,
  author =       "Daniel M. Kane and Jelani Nelson and David P.
                 Woodruff",
  title =        "An optimal algorithm for the distinct elements
                 problem",
  crossref =     "VanGucht:2010:PPT",
  pages =        "41--52",
  year =         "2010",
  DOI =          "https://doi.org/10.1145/1807085.1807094",
  bibdate =      "Mon Mar 28 12:24:43 MDT 2011",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Re:2010:UCE,
  author =       "Christopher R{\'e} and Dan Suciu",
  title =        "Understanding cardinality estimation using entropy
                 maximization",
  crossref =     "VanGucht:2010:PPT",
  pages =        "53--64",
  year =         "2010",
  DOI =          "https://doi.org/10.1145/1807085.1807095",
  bibdate =      "Mon Mar 28 12:24:43 MDT 2011",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Weikum:2010:IKH,
  author =       "Gerhard Weikum and Martin Theobald",
  title =        "From information to knowledge: harvesting entities and
                 relationships from {Web} sources",
  crossref =     "VanGucht:2010:PPT",
  pages =        "65--76",
  year =         "2010",
  DOI =          "https://doi.org/10.1145/1807085.1807097",
  bibdate =      "Mon Mar 28 12:24:43 MDT 2011",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cormode:2010:OSD,
  author =       "Graham Cormode and S. Muthukrishnan and Ke Yi and Qin
                 Zhang",
  title =        "Optimal sampling from distributed streams",
  crossref =     "VanGucht:2010:PPT",
  pages =        "77--86",
  year =         "2010",
  DOI =          "https://doi.org/10.1145/1807085.1807099",
  bibdate =      "Mon Mar 28 12:24:43 MDT 2011",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Koch:2010:IQE,
  author =       "Christoph Koch",
  title =        "Incremental query evaluation in a ring of databases",
  crossref =     "VanGucht:2010:PPT",
  pages =        "87--98",
  year =         "2010",
  DOI =          "https://doi.org/10.1145/1807085.1807100",
  bibdate =      "Mon Mar 28 12:24:43 MDT 2011",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Nelson:2010:FMS,
  author =       "Jelani Nelson and David P. Woodruff",
  title =        "Fast {Manhattan} sketches in data streams",
  crossref =     "VanGucht:2010:PPT",
  pages =        "99--110",
  year =         "2010",
  DOI =          "https://doi.org/10.1145/1807085.1807101",
  bibdate =      "Mon Mar 28 12:24:43 MDT 2011",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Meier:2010:SQO,
  author =       "Michael Meier and Michael Schmidt and Fang Wei and
                 Georg Lausen",
  title =        "Semantic query optimization in the presence of types",
  crossref =     "VanGucht:2010:PPT",
  pages =        "111--122",
  year =         "2010",
  DOI =          "https://doi.org/10.1145/1807085.1807102",
  bibdate =      "Mon Mar 28 12:24:43 MDT 2011",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Li:2010:OLC,
  author =       "Chao Li and Michael Hay and Vibhor Rastogi and Gerome
                 Miklau and Andrew McGregor",
  title =        "Optimizing linear counting queries under differential
                 privacy",
  crossref =     "VanGucht:2010:PPT",
  pages =        "123--134",
  year =         "2010",
  DOI =          "https://doi.org/10.1145/1807085.1807104",
  bibdate =      "Mon Mar 28 12:24:43 MDT 2011",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gupte:2010:UOP,
  author =       "Mangesh Gupte and Mukund Sundararajan",
  title =        "Universally optimal privacy mechanisms for minimax
                 agents",
  crossref =     "VanGucht:2010:PPT",
  pages =        "135--146",
  year =         "2010",
  DOI =          "https://doi.org/10.1145/1807085.1807105",
  bibdate =      "Mon Mar 28 12:24:43 MDT 2011",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kifer:2010:TAS,
  author =       "Daniel Kifer and Bing-Rong Lin",
  title =        "Towards an axiomatization of statistical privacy and
                 utility",
  crossref =     "VanGucht:2010:PPT",
  pages =        "147--158",
  year =         "2010",
  DOI =          "https://doi.org/10.1145/1807085.1807106",
  bibdate =      "Mon Mar 28 12:24:43 MDT 2011",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Jayram:2010:ICT,
  author =       "T. S. Jayram",
  title =        "Information complexity: a tutorial",
  crossref =     "VanGucht:2010:PPT",
  pages =        "159--168",
  year =         "2010",
  DOI =          "https://doi.org/10.1145/1807085.1807108",
  bibdate =      "Mon Mar 28 12:24:43 MDT 2011",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Fan:2010:CMT,
  author =       "Wenfei Fan and Floris Geerts",
  title =        "Capturing missing tuples and missing values",
  crossref =     "VanGucht:2010:PPT",
  pages =        "169--178",
  year =         "2010",
  DOI =          "https://doi.org/10.1145/1807085.1807109",
  bibdate =      "Mon Mar 28 12:24:43 MDT 2011",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Wijsen:2010:FOE,
  author =       "Jef Wijsen",
  title =        "On the first-order expressibility of computing certain
                 answers to conjunctive queries over uncertain
                 databases",
  crossref =     "VanGucht:2010:PPT",
  pages =        "179--190",
  year =         "2010",
  DOI =          "https://doi.org/10.1145/1807085.1807111",
  bibdate =      "Mon Mar 28 12:24:43 MDT 2011",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{David:2010:CAX,
  author =       "Claire David and Leonid Libkin and Filip Murlak",
  title =        "Certain answers for {XML} queries",
  crossref =     "VanGucht:2010:PPT",
  pages =        "191--202",
  year =         "2010",
  DOI =          "https://doi.org/10.1145/1807085.1807112",
  bibdate =      "Mon Mar 28 12:24:43 MDT 2011",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Dalvi:2010:CQP,
  author =       "Nilesh Dalvi and Karl Schnaitter and Dan Suciu",
  title =        "Computing query probability with incidence algebras",
  crossref =     "VanGucht:2010:PPT",
  pages =        "203--214",
  year =         "2010",
  DOI =          "https://doi.org/10.1145/1807085.1807113",
  bibdate =      "Mon Mar 28 12:24:43 MDT 2011",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Deutch:2010:PFM,
  author =       "Daniel Deutch and Christoph Koch and Tova Milo",
  title =        "On probabilistic fixpoint and {Markov} chain query
                 languages",
  crossref =     "VanGucht:2010:PPT",
  pages =        "215--226",
  year =         "2010",
  DOI =          "https://doi.org/10.1145/1807085.1807114",
  bibdate =      "Mon Mar 28 12:24:43 MDT 2011",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Arenas:2010:FSM,
  author =       "Marcelo Arenas and Jorge P{\'e}rez and Juan L. Reutter
                 and Cristian Riveros",
  title =        "Foundations of schema mapping management",
  crossref =     "VanGucht:2010:PPT",
  pages =        "227--238",
  year =         "2010",
  DOI =          "https://doi.org/10.1145/1807085.1807116",
  bibdate =      "Mon Mar 28 12:24:43 MDT 2011",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Martens:2010:SDX,
  author =       "Wim Martens and Matthias Niewerth and Thomas
                 Schwentick",
  title =        "Schema design for {XML} repositories: complexity and
                 tractability",
  crossref =     "VanGucht:2010:PPT",
  pages =        "239--250",
  year =         "2010",
  DOI =          "https://doi.org/10.1145/1807085.1807117",
  bibdate =      "Mon Mar 28 12:24:43 MDT 2011",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gelade:2010:SXS,
  author =       "Wouter Gelade and Tomasz Idziaszek and Wim Martens and
                 Frank Neven",
  title =        "Simplifying {XML} schema: single-type approximations
                 of regular tree languages",
  crossref =     "VanGucht:2010:PPT",
  pages =        "251--260",
  year =         "2010",
  DOI =          "https://doi.org/10.1145/1807085.1807118",
  bibdate =      "Mon Mar 28 12:24:43 MDT 2011",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Alexe:2010:CSM,
  author =       "Bogdan Alexe and Phokion G. Kolaitis and Wang-Chiew
                 Tan",
  title =        "Characterizing schema mappings via data examples",
  crossref =     "VanGucht:2010:PPT",
  pages =        "261--272",
  year =         "2010",
  DOI =          "https://doi.org/10.1145/1807085.1807120",
  bibdate =      "Mon Mar 28 12:24:43 MDT 2011",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Fagin:2010:UQS,
  author =       "Ronald Fagin and Benny Kimelfeld and Yunyao Li and
                 Sriram Raghavan and Shivakumar Vaithyanathan",
  title =        "Understanding queries in a search database system",
  crossref =     "VanGucht:2010:PPT",
  pages =        "273--284",
  year =         "2010",
  DOI =          "https://doi.org/10.1145/1807085.1807121",
  bibdate =      "Mon Mar 28 12:24:43 MDT 2011",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Lemay:2010:LAT,
  author =       "Aurelien Lemay and Sebastian Maneth and Joachim
                 Niehren",
  title =        "A learning algorithm for top-down {XML}
                 transformations",
  crossref =     "VanGucht:2010:PPT",
  pages =        "285--296",
  year =         "2010",
  DOI =          "https://doi.org/10.1145/1807085.1807122",
  bibdate =      "Mon Mar 28 12:24:43 MDT 2011",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Pagh:2010:COH,
  author =       "Rasmus Pagh and Zhewei Wei and Ke Yi and Qin Zhang",
  title =        "Cache-oblivious hashing",
  crossref =     "VanGucht:2010:PPT",
  pages =        "297--304",
  year =         "2010",
  DOI =          "https://doi.org/10.1145/1807085.1807124",
  bibdate =      "Mon Mar 28 12:24:43 MDT 2011",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bender:2010:PGB,
  author =       "Michael A. Bender and Haodong Hu and Bradley C.
                 Kuszmaul",
  title =        "Performance guarantees for {B}-trees with
                 different-sized atomic keys",
  crossref =     "VanGucht:2010:PPT",
  pages =        "305--316",
  year =         "2010",
  DOI =          "https://doi.org/10.1145/1807085.1807125",
  bibdate =      "Mon Mar 28 12:24:43 MDT 2011",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hartmann:2010:WDD,
  author =       "Sven Hartmann and Sebastian Link",
  title =        "When data dependencies over {SQL} tables meet the
                 logics of paradox and {S-3}",
  crossref =     "VanGucht:2010:PPT",
  pages =        "317--326",
  year =         "2010",
  DOI =          "https://doi.org/10.1145/1807085.1807126",
  bibdate =      "Mon Mar 28 12:24:43 MDT 2011",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Greco:2010:PTP,
  author =       "Gianluigi Greco and Francesco Scarcello",
  title =        "The power of tree projections: local consistency,
                 greedy algorithms, and larger islands of tractability",
  crossref =     "VanGucht:2010:PPT",
  pages =        "327--338",
  year =         "2010",
  DOI =          "https://doi.org/10.1145/1807085.1807127",
  bibdate =      "Mon Mar 28 12:24:43 MDT 2011",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Deutch:2011:QBW,
  author =       "Daniel Deutch and Tova Milo",
  title =        "A quest for beauty and wealth (or, business processes
                 for database researchers)",
  crossref =     "Lenzerini:2011:PPT",
  pages =        "1--12",
  year =         "2011",
  DOI =          "https://doi.org/10.1145/1989284.1989286",
  bibdate =      "Mon Apr 23 08:27:56 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "While classic data management focuses on the data
                 itself, research on Business Processes considers also
                 the context in which this data is generated and
                 manipulated, namely the processes, the users, and the
                 goals that this data serves. This allows the analysts a
                 better perspective of the organizational needs centered
                 around the data. As such, this research is of
                 fundamental importance. Much of the success of database
                 systems in the last decade is due to the beauty and
                 elegance of the relational model and its declarative
                 query languages, combined with a rich spectrum of
                 underlying evaluation and optimization techniques, and
                 efficient implementations. This, in turn, has lead to
                 an economic wealth for both the users and vendors of
                 database systems. Similar beauty and wealth are sought
                 for in the context of Business Processes. Much like the
                 case for traditional database research, elegant
                 modeling and rich underlying technology are likely to
                 bring economic wealth for the Business Process owners
                 and their users; both can benefit from easy formulation
                 and analysis of the processes. While there have been
                 many important advances in this research in recent
                 years, there is still much to be desired: specifically,
                 there have been many works that focus on the processes
                 behavior (flow), and many that focus on its data, but
                 only very few works have dealt with both. We will
                 discuss here the important advantages of a holistic
                 flow-and-data framework for Business Processes, the
                 progress towards such a framework, and highlight the
                 current gaps and research directions.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Cohen:2011:GMY,
  author =       "Edith Cohen and Haim Kaplan",
  title =        "Get the most out of your sample: optimal unbiased
                 estimators using partial information",
  crossref =     "Lenzerini:2011:PPT",
  pages =        "13--24",
  year =         "2011",
  DOI =          "https://doi.org/10.1145/1989284.1989288",
  bibdate =      "Mon Apr 23 08:27:56 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Random sampling is an essential tool in the processing
                 and transmission of data. It is used to summarize data
                 too large to store or manipulate and meet resource
                 constraints on bandwidth or battery power. Estimators
                 that are applied to the sample facilitate fast
                 approximate processing of queries posed over the
                 original data and the value of the sample hinges on the
                 quality of these estimators. Our work targets data sets
                 such as request and traffic logs and sensor
                 measurements, where data is repeatedly collected over
                 multiple instances: time periods, locations, or
                 snapshots. We are interested in operations, like
                 quantiles and range, that span multiple instances.
                 Subset-sums of these operations are used for
                 applications ranging from planning to anomaly and
                 change detection. Unbiased low-variance estimators are
                 particularly effective as the relative error decreases
                 with aggregation. The Horvitz--Thompson estimator,
                 known to minimize variance for subset-sums over a
                 sample of a single instance, is not optimal for
                 multi-instance operations because it fails to exploit
                 samples which provide partial information on the
                 estimated quantity. We present a general principled
                 methodology for the derivation of optimal unbiased
                 estimators over sampled instances and aim to understand
                 its potential. We demonstrate significant improvement
                 in estimate accuracy of fundamental queries for common
                 sampling schemes.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Sheng:2011:FID,
  author =       "Cheng Sheng and Yufei Tao",
  title =        "{FIFO} indexes for decomposable problems",
  crossref =     "Lenzerini:2011:PPT",
  pages =        "25--35",
  year =         "2011",
  DOI =          "https://doi.org/10.1145/1989284.1989291",
  bibdate =      "Mon Apr 23 08:27:56 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "This paper studies first-in-first-out (FIFO) indexes,
                 each of which manages a dataset where objects are
                 deleted in the same order as their insertions. We give
                 a technique that converts a static data structure to a
                 FIFO index for all decomposable problems, provided that
                 the static structure can be constructed efficiently. We
                 present FIFO access methods to solve several problems
                 including half-plane search, nearest neighbor search,
                 and extreme-point search. All of our structures consume
                 linear space, and have optimal or near-optimal query
                 cost.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Mir:2011:PPA,
  author =       "Darakhshan Mir and S. Muthukrishnan and Aleksandar
                 Nikolov and Rebecca N. Wright",
  title =        "Pan-private algorithms via statistics on sketches",
  crossref =     "Lenzerini:2011:PPT",
  pages =        "37--48",
  year =         "2011",
  DOI =          "https://doi.org/10.1145/1989284.1989290",
  bibdate =      "Mon Apr 23 08:27:56 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Consider fully dynamic data, where we track data as it
                 gets inserted and deleted. There are well developed
                 notions of private data analyses with dynamic data, for
                 example, using differential privacy. We want to go
                 beyond privacy, and consider privacy together with
                 security, formulated recently as pan-privacy by Dwork
                 et al. (ICS 2010). Informally, pan-privacy preserves
                 differential privacy while computing desired statistics
                 on the data, even if the internal memory of the
                 algorithm is compromised (say, by a malicious break-in
                 or insider curiosity or by fiat by the government or
                 law). We study pan-private algorithms for basic
                 analyses, like estimating distinct count, moments, and
                 heavy hitter count, with fully dynamic data. We present
                 the first known pan-private algorithms for these
                 problems in the fully dynamic model. Our algorithms
                 rely on sketching techniques popular in streaming: in
                 some cases, we add suitable noise to a previously known
                 sketch, using a novel approach of calibrating noise to
                 the underlying problem structure and the projection
                 matrix of the sketch; in other cases, we maintain
                 certain statistics on sketches; in yet others, we
                 define novel sketches. We also present the first known
                 lower bounds explicitly for pan privacy, showing our
                 results to be nearly optimal for these problems. Our
                 lower bounds are stronger than those implied by
                 differential privacy or dynamic data streaming alone
                 and hold even if unbounded memory and/or unbounded
                 processing time are allowed. The lower bounds use a
                 noisy decoding argument and exploit a connection
                 between pan-private algorithms and data sanitization.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Jowhari:2011:TBS,
  author =       "Hossein Jowhari and Mert Sa{\u{g}}lam and G{\'a}bor
                 Tardos",
  title =        "Tight bounds for {$L_p$} samplers, finding duplicates
                 in streams, and related problems",
  crossref =     "Lenzerini:2011:PPT",
  pages =        "49--58",
  year =         "2011",
  DOI =          "https://doi.org/10.1145/1989284.1989289",
  bibdate =      "Mon Apr 23 08:27:56 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "In this paper, we present near-optimal space bounds
                 for $L_p$ -samplers. Given a stream of updates
                 (additions and subtraction) to the coordinates of an
                 underlying vector $x$ in $R^n$, a perfect $L_p$ sampler
                 outputs the $i$-th coordinate with probability $x_i^p
                 xpp$. In SODA 2010, Monemizadeh and Woodruff showed
                 polylog space upper bounds for approximate
                 $L_p$-samplers and demonstrated various applications of
                 them. Very recently, Andoni, Krauthgamer and Onak
                 improved the upper bounds and gave a $O(\epsilon^{-p}
                 \log^3 n)$ space $\epsilon$ relative error and constant
                 failure rate $L_p$ -sampler for $p \in [1,2]$. In this
                 work, we give another such algorithm requiring only
                 $O(\epsilon^{-p} \log^2 n)$ space for $p \in (1,2)$.
                 For $p \in (0,1)$, our space bound is $O(\epsilon^{-1}
                 \log^2 n)$, while for the $p = 1$ case we have an
                 $O(log(1 / \epsilon) \epsilon^- \log^2 n)$ space
                 algorithm. We also give a $O(\log^2 n)$ bits zero
                 relative error $L_0$-sampler, improving the $O(\log^3
                 n)$ bits algorithm due to Frahling, Indyk and Sohler.
                 As an application of our samplers, we give better upper
                 bounds for the problem of finding duplicates in data
                 streams. In case the length of the stream is longer
                 than the alphabet size, L$_1$ sampling gives us an
                 $O(\log^2 n)$ space algorithm, thus improving the
                 previous $O(\log^3 n)$ bound due to Gopalan and
                 Radhakrishnan. In the second part of our work, we prove
                 an $\Omega(\log^2 n)$ lower bound for sampling from $0,
                 \pm{} 1$ vectors (in this special case, the parameter
                 $p$ is not relevant for $L_p$ sampling). This matches
                 the space of our sampling algorithms for constant
                 $\epsilon > 0$. We also prove tight space lower bounds
                 for the finding duplicates and heavy hitters problems.
                 We obtain these lower bounds using reductions from the
                 communication complexity problem augmented indexing.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Libkin:2011:IIC,
  author =       "Leonid Libkin",
  title =        "Incomplete information and certain answers in general
                 data models",
  crossref =     "Lenzerini:2011:PPT",
  pages =        "59--70",
  year =         "2011",
  DOI =          "https://doi.org/10.1145/1989284.1989294",
  bibdate =      "Mon Apr 23 08:27:56 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "While incomplete information is ubiquitous in all data
                 models --- especially in applications involving data
                 translation or integration --- our understanding of it
                 is still not completely satisfactory. For example, even
                 such a basic notion as certain answers for XML queries
                 was only introduced recently, and in a way seemingly
                 rather different from relational certain answers. The
                 goal of this paper is to introduce a general approach
                 to handling incompleteness, and to test its
                 applicability in known data models such as relations
                 and documents. The approach is based on representing
                 degrees of incompleteness via semantics-based orderings
                 on database objects. We use it to both obtain new
                 results on incompleteness and to explain some
                 previously observed phenomena. Specifically we show
                 that certain answers for relational and XML queries are
                 two instances of the same general concept; we describe
                 structural properties behind the naive evaluation of
                 queries; answer open questions on the existence of
                 certain answers in the XML setting; and show that
                 previously studied ordering-based approaches were only
                 adequate for SQL's primitive view of nulls. We define a
                 general setting that subsumes relations and documents
                 to help us explain in a uniform way how to compute
                 certain answers, and when good solutions can be found
                 in data exchange. We also look at the complexity of
                 common problems related to incompleteness, and
                 generalize several results from relational and XML
                 contexts.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Fan:2011:DCD,
  author =       "Wenfei Fan and Floris Geerts and Jef Wijsen",
  title =        "Determining the currency of data",
  crossref =     "Lenzerini:2011:PPT",
  pages =        "71--82",
  year =         "2011",
  DOI =          "https://doi.org/10.1145/1989284.1989295",
  bibdate =      "Mon Apr 23 08:27:56 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Data in real-life databases become obsolete rapidly.
                 One often finds that multiple values of the same entity
                 reside in a database. While all of these values were
                 once correct, most of them may have become stale and
                 inaccurate. Worse still, the values often do not carry
                 reliable timestamps. With this comes the need for
                 studying data currency, to identify the current value
                 of an entity in a database and to answer queries with
                 the current values, in the absence of timestamps. This
                 paper investigates the currency of data. (1) We propose
                 a model that specifies partial currency orders in terms
                 of simple constraints. The model also allows us to
                 express what values are copied from other data sources,
                 bearing currency orders in those sources, in terms of
                 copy functions defined on correlated attributes. (2) We
                 study fundamental problems for data currency, to
                 determine whether a specification is consistent,
                 whether a value is more current than another, and
                 whether a query answer is certain no matter how partial
                 currency orders are completed. (3) Moreover, we
                 identify several problems associated with copy
                 functions, to decide whether a copy function imports
                 sufficient current data to answer a query, whether such
                 a function copies redundant data, whether a copy
                 function can be extended to import necessary current
                 data for a query while respecting the constraints, and
                 whether it suffices to copy data of a bounded size. (4)
                 We establish upper and lower bounds of these problems,
                 all matching, for combined complexity and data
                 complexity, and for a variety of query languages. We
                 also identify special cases that warrant lower
                 complexity.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Arenas:2011:DEB,
  author =       "Marcelo Arenas and Jorge P{\'e}rez and Juan Reutter",
  title =        "Data exchange beyond complete data",
  crossref =     "Lenzerini:2011:PPT",
  pages =        "83--94",
  year =         "2011",
  DOI =          "https://doi.org/10.1145/1989284.1989293",
  bibdate =      "Mon Apr 23 08:27:56 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "In the traditional data exchange setting, source
                 instances are restricted to be complete in the sense
                 that every fact is either true or false in these
                 instances. Although natural for a typical database
                 translation scenario, this restriction is gradually
                 becoming an impediment to the development of a wide
                 range of applications that need to exchange objects
                 that admit several interpretations. In particular, we
                 are motivated by two specific applications that go
                 beyond the usual data exchange scenario: exchanging
                 incomplete information and exchanging knowledge bases.
                 In this paper, we propose a general framework for data
                 exchange that can deal with these two applications.
                 More specifically, we address the problem of exchanging
                 information given by representation systems, which are
                 essentially finite descriptions of (possibly infinite)
                 sets of complete instances. We make use of the
                 classical semantics of mappings specified by sets of
                 logical sentences to give a meaningful semantics to the
                 notion of exchanging representatives, from which the
                 standard notions of solution, space of solutions, and
                 universal solution naturally arise. We also introduce
                 the notion of strong representation system for a class
                 of mappings, that resembles the concept of strong
                 representation system for a query language. We show the
                 robustness of our proposal by applying it to the two
                 applications mentioned above: exchanging incomplete
                 information and exchanging knowledge bases, which are
                 both instantiations of the exchanging problem for
                 representation systems. We study these two applications
                 in detail, presenting results regarding expressiveness,
                 query answering and complexity of computing solutions,
                 and also algorithms to materialize solutions.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Orlandi:2011:SES,
  author =       "Alessio Orlandi and Rossano Venturini",
  title =        "Space-efficient substring occurrence estimation",
  crossref =     "Lenzerini:2011:PPT",
  pages =        "95--106",
  year =         "2011",
  DOI =          "https://doi.org/10.1145/1989284.1989300",
  bibdate =      "Mon Apr 23 08:27:56 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We study the problem of estimating the number of
                 occurrences of substrings in textual data: A text $T$
                 on some alphabet $\Sigma$ of size $\sigma$ is
                 preprocessed and an index $I$ is built. The index is
                 used in lieu of the text to answer queries of the form
                 CountH($P$), returning an approximated number of the
                 occurrences of an arbitrary pattern $P$ as a substring
                 of $T$. The problem has its main application in
                 selectivity estimation related to the LIKE predicate in
                 textual databases [15, 14, 5]. Our focus is on
                 obtaining an algorithmic solution with guaranteed error
                 rates and small footprint. To achieve that, we first
                 enrich previous work in the area of compressed
                 text-indexing [8, 11, 6, 17] providing an optimal data
                 structure that requires $\Theta(|T| \log \sigma / l)
                 bits where $l \geq 1$ is the additive error on any
                 answer. We also approach the issue of guaranteeing
                 exact answers for sufficiently frequent patterns,
                 providing a data structure whose size scales with the
                 amount of such patterns. Our theoretical findings are
                 sustained by experiments showing the practical impact
                 of our data structures.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Sheng:2011:FSE,
  author =       "Cheng Sheng and Yufei Tao",
  title =        "On finding skylines in external memory",
  crossref =     "Lenzerini:2011:PPT",
  pages =        "107--116",
  year =         "2011",
  DOI =          "https://doi.org/10.1145/1989284.1989298",
  bibdate =      "Mon Apr 23 08:27:56 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We consider the skyline problem (a.k.a. the maxima
                 problem), which has been extensively studied in the
                 database community. The input is a set P of d
                 -dimensional points. A point dominates another if the
                 former has a lower coordinate than the latter on every
                 dimension. The goal is to find the skyline, which is
                 the set of points p \in P such that p is not dominated
                 by any other data point. In the external-memory model,
                 the 2-d version of the problem is known to be solvable
                 in O ((N / B)\log $_{M/B}$ (N / B)) I/Os, where N is
                 the cardinality of P, B the size of a disk block, and M
                 the capacity of main memory. For fixed d {$>$}= 3, we
                 present an algorithm with I/O-complexity O ((N / B)\log
                 d -2/ M / B (N / B )). Previously, the best solution
                 was adapted from an in-memory algorithm, and requires O
                 ((N / B) \log d -2/2(N / M)) I/Os.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Wei:2011:BSA,
  author =       "Zhewei Wei and Ke Yi",
  title =        "Beyond simple aggregates: indexing for summary
                 queries",
  crossref =     "Lenzerini:2011:PPT",
  pages =        "117--128",
  year =         "2011",
  DOI =          "https://doi.org/10.1145/1989284.1989299",
  bibdate =      "Mon Apr 23 08:27:56 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Database queries can be broadly classified into two
                 categories: reporting queries and aggregation queries.
                 The former retrieves a collection of records from the
                 database that match the query's conditions, while the
                 latter returns an aggregate, such as count, sum,
                 average, or max (min), of a particular attribute of
                 these records. Aggregation queries are especially
                 useful in business intelligence and data analysis
                 applications where users are interested not in the
                 actual records, but some statistics of them. They can
                 also be executed much more efficiently than reporting
                 queries, by embedding properly precomputed aggregates
                 into an index. However, reporting and aggregation
                 queries provide only two extremes for exploring the
                 data. Data analysts often need more insight into the
                 data distribution than what those simple aggregates
                 provide, and yet certainly do not want the sheer volume
                 of data returned by reporting queries. In this paper,
                 we design indexing techniques that allow for extracting
                 a statistical summary of all the records in the query.
                 The summaries we support include frequent items,
                 quantiles, various sketches, and wavelets, all of which
                 are of central importance in massive data analysis. Our
                 indexes require linear space and extract a summary with
                 the optimal or near-optimal query cost.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Sheng:2011:NRT,
  author =       "Cheng Sheng and Yufei Tao",
  title =        "New results on two-dimensional orthogonal range
                 aggregation in external memory",
  crossref =     "Lenzerini:2011:PPT",
  pages =        "129--139",
  year =         "2011",
  DOI =          "https://doi.org/10.1145/1989284.1989297",
  bibdate =      "Mon Apr 23 08:27:56 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We consider the orthogonal range aggregation problem.
                 The dataset S consists of N axis-parallel rectangles in
                 R$^2$, each of which is associated with an integer
                 weight. Given an axis-parallel rectangle Q and an
                 aggregate function F, a query reports the aggregated
                 result of the weights of the rectangles in S
                 intersecting Q. The goal is to preprocess S into a
                 structure such that all queries can be answered
                 efficiently. We present indexing schemes to solve the
                 problem in external memory when F = max (hence, min)
                 and F = sum (hence, count and average), respectively.
                 Our schemes have linear or near-linear space, and
                 answer a query in O (\log $_B$ N) or O (\log B$^2$ / B
                 N ) I/Os, where B is the disk block size.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Amsterdamer:2011:PM,
  author =       "Yael Amsterdamer and Daniel Deutch and Tova Milo and
                 Val Tannen",
  title =        "On provenance minimization",
  crossref =     "Lenzerini:2011:PPT",
  pages =        "141--152",
  year =         "2011",
  DOI =          "https://doi.org/10.1145/1989284.1989303",
  bibdate =      "Mon Apr 23 08:27:56 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Provenance information has been proved to be very
                 effective in capturing the computational process
                 performed by queries, and has been used extensively as
                 the input to many advanced data management tools (e.g.
                 view maintenance, trust assessment, or query answering
                 in probabilistic databases). We study here the core of
                 provenance information, namely the part of provenance
                 that appears in the computation of every query
                 equivalent to the given one. This provenance core is
                 informative as it describes the part of the
                 computational process that is inherent to the query. It
                 is also useful as a compact input to the above
                 mentioned data management tools. We study algorithms
                 that, given a query, compute an equivalent query that
                 realizes the core provenance for all tuples in its
                 result. We study these algorithms for queries of
                 varying expressive power. Finally, we observe that, in
                 general, one would not want to require database systems
                 to evaluate a specific query that realizes the core
                 provenance, but instead to be able to find, possibly
                 off-line, the core provenance of a given tuple in the
                 output (computed by an arbitrary equivalent query),
                 without rewriting the query. We provide algorithms for
                 such direct computation of the core provenance.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Amsterdamer:2011:PAQ,
  author =       "Yael Amsterdamer and Daniel Deutch and Val Tannen",
  title =        "Provenance for aggregate queries",
  crossref =     "Lenzerini:2011:PPT",
  pages =        "153--164",
  year =         "2011",
  DOI =          "https://doi.org/10.1145/1989284.1989302",
  bibdate =      "Mon Apr 23 08:27:56 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We study in this paper provenance information for
                 queries with aggregation. Provenance information was
                 studied in the context of various query languages that
                 do not allow for aggregation, and recent work has
                 suggested to capture provenance by annotating the
                 different database tuples with elements of a
                 commutative semiring and propagating the annotations
                 through query evaluation. We show that aggregate
                 queries pose novel challenges rendering this approach
                 inapplicable. Consequently, we propose a new approach,
                 where we annotate with provenance information not just
                 tuples but also the individual values within tuples,
                 using provenance to describe the values computation. We
                 realize this approach in a concrete construction, first
                 for ``simple'' queries where the aggregation operator
                 is the last one applied, and then for arbitrary
                 (positive) relational algebra queries with aggregation;
                 the latter queries are shown to be more challenging in
                 this context. Finally, we use aggregation to encode
                 queries with difference, and study the semantics
                 obtained for such queries on provenance annotated
                 databases.",
  acknowledgement = ack-nhfb,
}

@InProceedings{He:2011:CPP,
  author =       "Yeye He and Siddharth Barman and Di Wang and Jeffrey
                 F. Naughton",
  title =        "On the complexity of privacy-preserving complex event
                 processing",
  crossref =     "Lenzerini:2011:PPT",
  pages =        "165--174",
  year =         "2011",
  DOI =          "https://doi.org/10.1145/1989284.1989304",
  bibdate =      "Mon Apr 23 08:27:56 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Complex Event Processing (CEP) Systems are stream
                 processing systems that monitor incoming event streams
                 in search of user-specified event patterns. While CEP
                 systems have been adopted in a variety of applications,
                 the privacy implications of event pattern reporting
                 mechanisms have yet to be studied --- a stark contrast
                 to the significant amount of attention that has been
                 devoted to privacy for relational systems. In this
                 paper we present a privacy problem that arises when the
                 system must support desired patterns (those that should
                 be reported if detected) and private patterns (those
                 that should not be revealed). We formalize this
                 problem, which we term privacy-preserving, utility
                 maximizing CEP (PP-CEP), and analyze its complexity
                 under various assumptions. Our results show that this
                 is a rich problem to study and shed some light on the
                 difficulty of developing algorithms that preserve
                 utility without compromising privacy.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Davidson:2011:PVM,
  author =       "Susan B. Davidson and Sanjeev Khanna and Tova Milo and
                 Debmalya Panigrahi and Sudeepa Roy",
  title =        "Provenance views for module privacy",
  crossref =     "Lenzerini:2011:PPT",
  pages =        "175--186",
  year =         "2011",
  DOI =          "https://doi.org/10.1145/1989284.1989305",
  bibdate =      "Mon Apr 23 08:27:56 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Scientific workflow systems increasingly store
                 provenance information about the module executions used
                 to produce a data item, as well as the parameter
                 settings and intermediate data items passed between
                 module executions. However, authors/owners of workflows
                 may wish to keep some of this information confidential.
                 In particular, a module may be proprietary, and users
                 should not be able to infer its behavior by seeing
                 mappings between all data inputs and outputs. The
                 problem we address in this paper is the following:
                 Given a workflow, abstractly modeled by a relation R, a
                 privacy requirement ? and costs associated with data.
                 The owner of the workflow decides which data
                 (attributes) to hide, and provides the user with a view
                 R' which is the projection of R over attributes which
                 have not been hidden. The goal is to minimize the cost
                 of hidden data while guaranteeing that individual
                 modules are ?-private. We call this the Secure-View
                 problem. We formally define the problem, study its
                 complexity, and offer algorithmic solutions.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kimelfeld:2011:MCV,
  author =       "Benny Kimelfeld and Jan Vondr{\'a}k and Ryan
                 Williams",
  title =        "Maximizing conjunctive views in deletion propagation",
  crossref =     "Lenzerini:2011:PPT",
  pages =        "187--198",
  year =         "2011",
  DOI =          "https://doi.org/10.1145/1989284.1989308",
  bibdate =      "Mon Apr 23 08:27:56 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "In deletion propagation, tuples from the database are
                 deleted in order to reflect the deletion of a tuple
                 from the view. Such an operation may result in the
                 (often necessary) deletion of additional tuples from
                 the view, besides the intentionally deleted one. The
                 complexity of deletion propagation is studied, where
                 the view is defined by a conjunctive query (CQ), and
                 the goal is to maximize the number of tuples that
                 remain in the view. Buneman et al. showed that for some
                 simple CQs, this problem can be solved by a trivial
                 algorithm. This paper identifies additional cases of
                 CQs where the trivial algorithm succeeds, and in
                 contrast, it proves that for some other CQs the problem
                 is NP-hard to approximate better than some constant
                 ratio. In fact, this paper shows that among the CQs
                 without self joins, the hard CQs are exactly the ones
                 that the trivial algorithm fails on. In other words,
                 for every CQ without self joins, deletion propagation
                 is either APX-hard or solvable by the trivial
                 algorithm. The paper then presents approximation
                 algorithms for certain CQs where deletion propagation
                 is APX-hard. Specifically, two constant-ratio (and
                 polynomial-time) approximation algorithms are given for
                 the class of star CQs without self joins. The first
                 algorithm is a greedy algorithm, and the second is
                 based on randomized rounding of a linear program. While
                 the first algorithm is more efficient, the second one
                 has a better approximation ratio. Furthermore, the
                 second algorithm can be extended to a significant
                 generalization of star CQs. Finally, the paper shows
                 that self joins can have a major negative effect on the
                 approximability of the problem.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Barcelo:2011:QGP,
  author =       "Pablo Barcel{\'o} and Leonid Libkin and Juan L.
                 Reutter",
  title =        "Querying graph patterns",
  crossref =     "Lenzerini:2011:PPT",
  pages =        "199--210",
  year =         "2011",
  DOI =          "https://doi.org/10.1145/1989284.1989307",
  bibdate =      "Mon Apr 23 08:27:56 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Graph data appears in a variety of application
                 domains, and many uses of it, such as querying,
                 matching, and transforming data, naturally result in
                 incompletely specified graph data, i.e., graph
                 patterns. While queries need to be posed against such
                 data, techniques for querying patterns are generally
                 lacking, and properties of such queries are not well
                 understood. Our goal is to study the basics of querying
                 graph patterns. We first identify key features of
                 patterns, such as node and label variables and edges
                 specified by regular expressions, and define a
                 classification of patterns based on them. We then study
                 standard graph queries on graph patterns, and give
                 precise characterizations of both data and combined
                 complexity for each class of patterns. If complexity is
                 high, we do further analysis of features that lead to
                 intractability, as well as lower complexity
                 restrictions. We introduce a new automata model for
                 query answering with two modes of acceptance: one
                 captures queries returning nodes, and the other queries
                 returning paths. We study properties of such automata,
                 and the key computational tasks associated with them.
                 Finally, we provide additional restrictions for
                 tractability, and show that some intractable cases can
                 be naturally cast as instances of constraint
                 satisfaction problem.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Benedikt:2011:DRA,
  author =       "Michael Benedikt and Georg Gottlob and Pierre
                 Senellart",
  title =        "Determining relevance of accesses at runtime",
  crossref =     "Lenzerini:2011:PPT",
  pages =        "211--222",
  year =         "2011",
  DOI =          "https://doi.org/10.1145/1989284.1989309",
  bibdate =      "Mon Apr 23 08:27:56 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Consider the situation where a query is to be answered
                 using Web sources that restrict the accesses that can
                 be made on backend relational data by requiring some
                 attributes to be given as input of the service. The
                 accesses provide lookups on the collection of
                 attributes values that match the binding. They can
                 differ in whether or not they require arguments to be
                 generated from prior accesses. Prior work has focused
                 on the question of whether a query can be answered
                 using a set of data sources, and in developing static
                 access plans (e.g., Datalog programs) that implement
                 query answering. We are interested in dynamic aspects
                 of the query answering problem: given partial
                 information about the data, which accesses could
                 provide relevant data for answering a given query? We
                 consider immediate and long-term notions of ``relevant
                 accesses'', and ascertain the complexity of query
                 relevance, for both conjunctive queries and arbitrary
                 positive queries. In the process, we relate dynamic
                 relevance of an access to query containment under
                 access limitations and characterize the complexity of
                 this problem; we produce several complexity results
                 about containment that are of interest by themselves.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Koutris:2011:PEC,
  author =       "Paraschos Koutris and Dan Suciu",
  title =        "Parallel evaluation of conjunctive queries",
  crossref =     "Lenzerini:2011:PPT",
  pages =        "223--234",
  year =         "2011",
  DOI =          "https://doi.org/10.1145/1989284.1989310",
  bibdate =      "Mon Apr 23 08:27:56 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "The availability of large data centers with tens of
                 thousands of servers has led to the popular adoption of
                 massive parallelism for data analysis on large
                 datasets. Several query languages exist for running
                 queries on massively parallel architectures, some based
                 on the MapReduce infrastructure, others using
                 proprietary implementations. Motivated by this trend,
                 this paper analyzes the parallel complexity of
                 conjunctive queries. We propose a very simple model of
                 parallel computation that captures these architectures,
                 in which the complexity parameter is the number of
                 parallel steps requiring synchronization of all
                 servers. We study the complexity of conjunctive queries
                 and give a complete characterization of the queries
                 which can be computed in one parallel step. These form
                 a strict subset of hierarchical queries, and include
                 flat queries like R(x,y), S(x,z), T(x,v), U(x,w), tall
                 queries like R(x), S(x,y), T(x,y,z), U(x,y,z,w), and
                 combinations thereof, which we call tall-flat queries.
                 We describe an algorithm for computing in parallel any
                 tall-flat query, and prove that any query that is not
                 tall-flat cannot be computed in one step in this model.
                 Finally, we present extensions of our results to
                 queries that are not tall-flat.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kimelfeld:2011:FMT,
  author =       "Benny Kimelfeld and Yehoshua Sagiv",
  title =        "Finding a minimal tree pattern under neighborhood
                 constraints",
  crossref =     "Lenzerini:2011:PPT",
  pages =        "235--246",
  year =         "2011",
  DOI =          "https://doi.org/10.1145/1989284.1989318",
  bibdate =      "Mon Apr 23 08:27:56 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Tools that automatically generate queries are useful
                 when schemas are hard to understand due to size or
                 complexity. Usually, these tools find minimal tree
                 patterns that contain a given set (or bag) of labels.
                 The labels could be, for example, XML tags or relation
                 names. The only restriction is that, in a tree pattern,
                 adjacent labels must be among some specified pairs. A
                 more expressive framework is developed here, where a
                 schema is a mapping of each label to a collection of
                 bags of labels. A tree pattern conforms to the schema
                 if for all nodes v, the bag comprising the labels of
                 the neighbors is contained in one of the bags to which
                 the label of v is mapped. The problem at hand is to
                 find a minimal tree pattern that conforms to the schema
                 and contains a given bag of labels. This problem is
                 NP-hard even when using the simplest conceivable
                 language for describing schemas. In practice, however,
                 the set of labels is small, so efficiency is realized
                 by means of an algorithm that is fixed-parameter
                 tractable (FPT). Two languages for specifying schemas
                 are discussed. In the first, one expresses pairwise
                 mutual exclusions between labels. Though W[1]-hardness
                 (hence, unlikeliness of an FPT algorithm) is shown, an
                 FPT algorithm is described for the case where the
                 mutual exclusions form a circular-arc graph (e.g.,
                 disjoint cliques). The second language is that of
                 regular expressions, and for that another FPT algorithm
                 is described.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Antonopoulos:2011:CTP,
  author =       "Timos Antonopoulos and Wim Martens and Frank Neven",
  title =        "The complexity of text-preserving {XML}
                 transformations",
  crossref =     "Lenzerini:2011:PPT",
  pages =        "247--258",
  year =         "2011",
  DOI =          "https://doi.org/10.1145/1989284.1989316",
  bibdate =      "Mon Apr 23 08:27:56 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "While XML is nowadays adopted as the de facto standard
                 for data exchange, historically, its predecessor SGML
                 was invented for describing electronic documents, i.e.,
                 marked up text. Actually, today there are still large
                 volumes of such XML texts. We consider simple
                 transformations which can change the internal structure
                 of documents, that is, the mark-up, and can filter out
                 parts of the text but do not disrupt the ordering of
                 the words. Specifically, we focus on XML
                 transformations where the transformed document is a
                 subsequence of the input document when ignoring
                 mark-up. We call the latter text-preserving XML
                 transformations. We characterize such transformations
                 as copy- and rearrange-free transductions. Furthermore,
                 we study the problem of deciding whether a given XML
                 transducer is text-preserving over a given tree
                 language. We consider top-down transducers as well as
                 the abstraction of XSLT called DTL. We show that
                 deciding whether a transformation is text-preserving
                 over an unranked regular tree language is in PTime for
                 top-down transducers, EXPTime-complete for DTL with
                 XPath, and decidable for DTL with MSO patterns.
                 Finally, we obtain that for every transducer in one of
                 the above mentioned classes, the maximal subset of the
                 input schema can be computed on which the
                 transformation is text-preserving.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bojanczyk:2011:EET,
  author =       "Mikolaj Bojanczyk and Diego Figueira",
  title =        "Efficient evaluation for a temporal logic on changing
                 {XML} documents",
  crossref =     "Lenzerini:2011:PPT",
  pages =        "259--270",
  year =         "2011",
  DOI =          "https://doi.org/10.1145/1989284.1989317",
  bibdate =      "Mon Apr 23 08:27:56 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We consider a sequence $t_1$, \ldots{}, $t_k$ of XML
                 documents that is produced by a sequence of local edit
                 operations. To describe properties of such a sequence,
                 we use a temporal logic. The logic can navigate both in
                 time and in the document, e.g. a formula can say that
                 every node with label a eventually gets a descendant
                 with label b. For every fixed formula, we provide an
                 evaluation algorithm that works in time O (k $\cdot$
                 \log(n)), where k is the number of edit operations and
                 n is the maximal size of document that is produced. In
                 the algorithm, we represent formulas of the logic by a
                 kind of automaton, which works on sequences of
                 documents. The algorithm works on XML documents of
                 bounded depth.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Fagin:2011:RRS,
  author =       "Ronald Fagin and Benny Kimelfeld and Yunyao Li and
                 Sriram Raghavan and Shivakumar Vaithyanathan",
  title =        "Rewrite rules for search database systems",
  crossref =     "Lenzerini:2011:PPT",
  pages =        "271--282",
  year =         "2011",
  DOI =          "https://doi.org/10.1145/1989284.1989322",
  bibdate =      "Mon Apr 23 08:27:56 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "The results of a search engine can be improved by
                 consulting auxiliary data. In a search database system,
                 the association between the user query and the
                 auxiliary data is driven by rewrite rules that augment
                 the user query with a set of alternative queries. This
                 paper develops a framework that formalizes the notion
                 of a rewrite program, which is essentially a collection
                 of hedge-rewriting rules. When applied to a search
                 query, the rewrite program produces a set of
                 alternative queries that constitutes a least fixpoint
                 (lfp). The main focus of the paper is on the
                 lfp-convergence of a rewrite program, where a rewrite
                 program is lfp-convergent if the least fixpoint of
                 every search query is finite. Determining whether a
                 given rewrite program is lfp-convergent is undecidable;
                 to accommodate that, the paper proposes a safety
                 condition, and shows that safety guarantees
                 lfp-convergence, and that safety can be decided in
                 polynomial time. The effectiveness of the safety
                 condition in capturing lfp-convergence is illustrated
                 by an application to a rewrite program in an
                 implemented system that is intended for widespread
                 use.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ameloot:2011:RTD,
  author =       "Tom J. Ameloot and Frank Neven and Jan {Van den
                 Bussche}",
  title =        "Relational transducers for declarative networking",
  crossref =     "Lenzerini:2011:PPT",
  pages =        "283--292",
  year =         "2011",
  DOI =          "https://doi.org/10.1145/1989284.1989321",
  bibdate =      "Mon Apr 23 08:27:56 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Motivated by a recent conjecture concerning the
                 expressiveness of declarative networking, we propose a
                 formal computation model for ``eventually consistent''
                 distributed querying, based on relational transducers.
                 A tight link has been conjectured between
                 coordination-freeness of computations, and monotonicity
                 of the queries expressed by such computations. Indeed,
                 we propose a formal definition of coordination-freeness
                 and confirm that the class of monotone queries is
                 captured by coordination-free transducer networks.
                 Coordination-freeness is a semantic property, but the
                 syntactic class of ``oblivious'' transducers we define
                 also captures the same class of monotone queries.
                 Transducer networks that are not coordination-free are
                 much more powerful.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Abiteboul:2011:RBL,
  author =       "Serge Abiteboul and Meghyn Bienvenu and Alban Galland
                 and {\'E}milien Antoine",
  title =        "A rule-based language for web data management",
  crossref =     "Lenzerini:2011:PPT",
  pages =        "293--304",
  year =         "2011",
  DOI =          "https://doi.org/10.1145/1989284.1989320",
  bibdate =      "Mon Apr 23 08:27:56 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "There is a new trend to use Datalog-style rule-based
                 languages to specify modern distributed applications,
                 notably on the Web. We introduce here such a language
                 for a distributed data model where peers exchange
                 messages (i.e. logical facts) as well as rules. The
                 model is formally defined and its interest for
                 distributed data management is illustrated through a
                 variety of examples. A contribution of our work is a
                 study of the impact on expressiveness of
                 ``delegations'' (the installation of rules by a peer in
                 some other peer) and explicit timestamps. We also
                 validate the semantics of our model by showing that
                 under certain natural conditions, our semantics
                 converges to the same semantics as the centralized
                 system with the same rules. Indeed, we show this is
                 even true when updates are considered.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Arenas:2011:QSW,
  author =       "Marcelo Arenas and Jorge P{\'e}rez",
  title =        "Querying {Semantic Web} data with {SPARQL}",
  crossref =     "Lenzerini:2011:PPT",
  pages =        "305--316",
  year =         "2011",
  DOI =          "https://doi.org/10.1145/1989284.1989312",
  bibdate =      "Mon Apr 23 08:27:56 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "The Semantic Web is the initiative of the W3C to make
                 information on the Web readable not only by humans but
                 also by machines. RDF is the data model for Semantic
                 Web data, and SPARQL is the standard query language for
                 this data model. In the last ten years, we have
                 witnessed a constant growth in the amount of RDF data
                 available on the Web, which have motivated the
                 theoretical study of some fundamental aspects of SPARQL
                 and the development of efficient mechanisms for
                 implementing this query language. Some of the
                 distinctive features of RDF have made the study and
                 implementation of SPARQL challenging. First, as opposed
                 to usual database applications, the semantics of RDF is
                 open world, making RDF databases inherently incomplete.
                 Thus, one usually obtains partial answers when querying
                 RDF with SPARQL, and the possibility of adding optional
                 information if present is a crucial feature of SPARQL.
                 Second, RDF databases have a graph structure and are
                 interlinked, thus making graph navigational
                 capabilities a necessary component of SPARQL. Last, but
                 not least, SPARQL has to work at Web scale! RDF and
                 SPARQL have attracted interest from the database
                 community. However, we think that this community has
                 much more to say about these technologies, and, in
                 particular, about the fundamental database problems
                 that need to be solved in order to provide solid
                 foundations for the development of these technologies.
                 In this paper, we survey some of the main results about
                 the theory of RDF and SPARQL putting emphasis on some
                 research opportunities for the database community.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Muthukrishnan:2011:TDS,
  author =       "S. Muthukrishnan",
  title =        "Theory of data stream computing: where to go",
  crossref =     "Lenzerini:2011:PPT",
  pages =        "317--319",
  year =         "2011",
  DOI =          "https://doi.org/10.1145/1989284.1989314",
  bibdate =      "Mon Apr 23 08:27:56 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Computing power has been growing steadily, just as
                 communication rate and memory size. Simultaneously our
                 ability to create data has been growing phenomenally
                 and therefore the need to analyze it. We now have
                 examples of massive data streams that are created in
                 far higher rate than we can capture and store in memory
                 economically, gathered in far more quantity than can be
                 transported to central databases without overwhelming
                 the communication infrastructure, and arrives far
                 faster than we can compute with them in a sophisticated
                 way. This phenomenon has challenged how we store,
                 communicate and compute with data. Theories developed
                 over past 50 years have relied on full capture, storage
                 and communication of data. Instead, what we need for
                 managing modern massive data streams are new methods
                 built around working with less. The past 10 years have
                 seen new theories emerge in computing (data stream
                 algorithms), communication (compressed sensing),
                 databases (data stream management systems) and other
                 areas to address the challenges of massive data
                 streams. Still, lot remains open and new applications
                 of massive data streams have emerged recently. We
                 present an overview of these challenges.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chaudhuri:2012:WNH,
  author =       "Surajit Chaudhuri",
  title =        "What next?: a half-dozen data management research
                 goals for big data and the cloud",
  crossref =     "Krotzsch:2012:PPA",
  pages =        "1--4",
  year =         "2012",
  DOI =          "https://doi.org/10.1145/2213556.2213558",
  bibdate =      "Tue Nov 6 11:31:12 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "In this short paper, I describe six data management
                 research challenges relevant for Big Data and the
                 Cloud. Although some of these problems are not new,
                 their importance is amplified by Big Data and Cloud
                 Computing.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ahn:2012:GSS,
  author =       "Kook Jin Ahn and Sudipto Guha and Andrew McGregor",
  title =        "Graph sketches: sparsification, spanners, and
                 subgraphs",
  crossref =     "Krotzsch:2012:PPA",
  pages =        "5--14",
  year =         "2012",
  DOI =          "https://doi.org/10.1145/2213556.2213560",
  bibdate =      "Tue Nov 6 11:31:12 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "When processing massive data sets, a core task is to
                 construct synopses of the data. To be useful, a
                 synopsis data structure should be easy to construct
                 while also yielding good approximations of the relevant
                 properties of the data set. A particularly useful class
                 of synopses are sketches, i.e., those based on linear
                 projections of the data. These are applicable in many
                 models including various parallel, stream, and
                 compressed sensing settings. A rich body of analytic
                 and empirical work exists for sketching numerical data
                 such as the frequencies of a set of entities. Our work
                 investigates graph sketching where the graphs of
                 interest encode the relationships between these
                 entities. The main challenge is to capture this richer
                 structure and build the necessary synopses with only
                 linear measurements. In this paper we consider
                 properties of graphs including the size of the cuts,
                 the distances between nodes, and the prevalence of
                 dense sub-graphs. Our main result is a sketch-based
                 sparsifier construction: we show that {\~O}( n \epsilon
                 $^{-2}$ ) random linear projections of a graph on n
                 nodes suffice to (1+ \epsilon ) approximate all cut
                 values. Similarly, we show that {\~O}( \epsilon $^{-2}$
                 ) linear projections suffice for (additively)
                 approximating the fraction of induced sub-graphs that
                 match a given pattern such as a small clique. Finally,
                 for distance estimation we present sketch-based spanner
                 constructions. In this last result the sketches are
                 adaptive, i.e., the linear projections are performed in
                 a small number of batches where each projection may be
                 chosen dependent on the outcome of earlier sketches.
                 All of the above results immediately give rise to data
                 stream algorithms that also apply to dynamic graph
                 streams where edges are both inserted and deleted. The
                 non-adaptive sketches, such as those for sparsification
                 and subgraphs, give us single-pass algorithms for
                 distributed data streams with insertion and deletions.
                 The adaptive sketches can be used to analyze MapReduce
                 algorithms that use a small number of rounds.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Indyk:2012:ATH,
  author =       "Piotr Indyk and Reut Levi and Ronitt Rubinfeld",
  title =        "Approximating and testing $k$-histogram distributions
                 in sub-linear time",
  crossref =     "Krotzsch:2012:PPA",
  pages =        "15--22",
  year =         "2012",
  DOI =          "https://doi.org/10.1145/2213556.2213561",
  bibdate =      "Tue Nov 6 11:31:12 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "A discrete distribution p, over [n], is a k histogram
                 if its probability distribution function can be
                 represented as a piece-wise constant function with k
                 pieces. Such a function is represented by a list of k
                 intervals and k corresponding values. We consider the
                 following problem: given a collection of samples from a
                 distribution p, find a k -histogram that
                 (approximately) minimizes the l$_2$ distance to the
                 distribution p. We give time and sample efficient
                 algorithms for this problem. We further provide
                 algorithms that distinguish distributions that have the
                 property of being a k -histogram from distributions
                 that are \epsilon -far from any k -histogram in the
                 l$_1$ distance and l$_2$ distance respectively.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Agarwal:2012:MS,
  author =       "Pankaj K. Agarwal and Graham Cormode and Zengfeng
                 Huang and Jeff Phillips and Zhewei Wei and Ke Yi",
  title =        "Mergeable summaries",
  crossref =     "Krotzsch:2012:PPA",
  pages =        "23--34",
  year =         "2012",
  DOI =          "https://doi.org/10.1145/2213556.2213562",
  bibdate =      "Tue Nov 6 11:31:12 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We study the mergeability of data summaries.
                 Informally speaking, mergeability requires that, given
                 two summaries on two data sets, there is a way to merge
                 the two summaries into a single summary on the union of
                 the two data sets, while preserving the error and size
                 guarantees. This property means that the summaries can
                 be merged in a way like other algebraic operators such
                 as sum and max, which is especially useful for
                 computing summaries on massive distributed data.
                 Several data summaries are trivially mergeable by
                 construction, most notably all the sketches that are
                 linear functions of the data sets. But some other
                 fundamental ones like those for heavy hitters and
                 quantiles, are not (known to be) mergeable. In this
                 paper, we demonstrate that these summaries are indeed
                 mergeable or can be made mergeable after appropriate
                 modifications. Specifically, we show that for \epsilon
                 -approximate heavy hitters, there is a deterministic
                 mergeable summary of size O (1/ \epsilon ) for \epsilon
                 -approximate quantiles, there is a deterministic
                 summary of size O (1 over \epsilon log( \epsilon n
                 ))that has a restricted form of mergeability, and a
                 randomized one of size O (1 over \epsilon log$^{3/2}$ 1
                 over \epsilon ) with full mergeability. We also extend
                 our results to geometric summaries such as \epsilon
                 -approximations and \epsilon kernels. We also achieve
                 two results of independent interest: (1) we provide the
                 best known randomized streaming bound for \epsilon
                 -approximate quantiles that depends only on \epsilon ,
                 of size O (1 over \epsilon log$^{3/2}$ 1 over \epsilon
                 , and (2) we demonstrate that the MG and the
                 SpaceSaving summaries for heavy hitters are
                 isomorphic.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hull:2012:APA,
  author =       "Richard Hull and Phokion G. Kolaitis and Dirk {Van
                 Gucht}",
  title =        "The {ACM PODS Alberto O. Mendelzon Test-of-Time
                 Award 2012}",
  crossref =     "Krotzsch:2012:PPA",
  pages =        "35--36",
  year =         "2012",
  DOI =          "https://doi.org/10.1145/2213556.2213564",
  bibdate =      "Tue Nov 6 11:31:12 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ngo:2012:WCO,
  author =       "Hung Q. Ngo and Ely Porat and Christopher R{\'e} and
                 Atri Rudra",
  title =        "Worst-case optimal join algorithms: [extended
                 abstract]",
  crossref =     "Krotzsch:2012:PPA",
  pages =        "37--48",
  year =         "2012",
  DOI =          "https://doi.org/10.1145/2213556.2213565",
  bibdate =      "Tue Nov 6 11:31:12 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Efficient join processing is one of the most
                 fundamental and well-studied tasks in database
                 research. In this work, we examine algorithms for
                 natural join queries over many relations and describe a
                 novel algorithm to process these queries optimally in
                 terms of worst-case data complexity. Our result builds
                 on recent work by Atserias, Grohe, and Marx, who gave
                 bounds on the size of a full conjunctive query in terms
                 of the sizes of the individual relations in the body of
                 the query. These bounds, however, are not constructive:
                 they rely on Shearer's entropy inequality which is
                 information-theoretic. Thus, the previous results leave
                 open the question of whether there exist algorithms
                 whose running time achieve these optimal bounds. An
                 answer to this question may be interesting to database
                 practice, as we show in this paper that any
                 project-join plan is polynomially slower than the
                 optimal bound for some queries. We construct an
                 algorithm whose running time is worst-case optimal for
                 all natural join queries. Our result may be of
                 independent interest, as our algorithm also yields a
                 constructive proof of the general fractional cover
                 bound by Atserias, Grohe, and Marx without using
                 Shearer's inequality. In addition, we show that this
                 bound is equivalent to a geometric inequality by
                 Bollob{\'a}s and Thomason, one of whose special cases
                 is the famous Loomis-Whitney inequality. Hence, our
                 results algorithmically prove these inequalities as
                 well. Finally, we discuss how our algorithm can be used
                 to compute a relaxed notion of joins.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Groz:2012:DRE,
  author =       "Benot{\^\i}t Groz and Sebastian Maneth and Slawek
                 Staworko",
  title =        "Deterministic regular expressions in linear time",
  crossref =     "Krotzsch:2012:PPA",
  pages =        "49--60",
  year =         "2012",
  DOI =          "https://doi.org/10.1145/2213556.2213566",
  bibdate =      "Tue Nov 6 11:31:12 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Deterministic regular expressions are widely used in
                 XML processing. For instance, all regular expressions
                 in DTDs and XML Schemas are required to be
                 deterministic. In this paper we show that determinism
                 of a regular expression $e$ can be tested in linear
                 time. The best known algorithms, based on the Glushkov
                 automaton, require $O(\sigma |e|)$ time, where $\sigma$
                 is the number of distinct symbols in $e$. We further
                 show that matching a word $w$ against an expression $e$
                 can be achieved in combined linear time $O(|e| + |w|)$,
                 for a wide range of deterministic regular expressions:
                 (i) star-free (for multiple input words), (ii)
                 bounded-occurrence, i.e., expressions in which each
                 symbol appears a bounded number of times, and (iii)
                 bounded plus-depth, i.e., expressions in which the
                 nesting depth of alternating plus (union) and
                 concatenation symbols is bounded. Our algorithms use a
                 new structural decomposition of the parse tree of
                 $e$. For matching arbitrary deterministic regular
                 expressions we present an $O(|e| + |w| \log \log |e|)$
                 time algorithm.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Pierce:2012:LFB,
  author =       "Benjamin C. Pierce",
  title =        "Linguistic foundations for bidirectional
                 transformations: invited tutorial",
  crossref =     "Krotzsch:2012:PPA",
  pages =        "61--64",
  year =         "2012",
  DOI =          "https://doi.org/10.1145/2213556.2213568",
  bibdate =      "Tue Nov 6 11:31:12 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Computing is full of situations where two different
                 structures must be ``connected'' in such a way that
                 updates to each can be propagated to the other. This is
                 a generalization of the classical view update problem,
                 which has been studied for decades in the database
                 community [11, 2, 22]; more recently, related problems
                 have attracted considerable interest in other areas,
                 including programming languages [42, 28, 34, 39, 4, 7,
                 33, 16, 1, 37, 35, 47, 49] software model
                 transformation [43, 50, 44, 45, 12, 13, 14, 24, 25, 10,
                 51], user interfaces [38] and system configuration
                 [36]. See [18, 17, 10, 30] for recent surveys. Among
                 the fruits of this cross-pollination has been the
                 development of a linguistic perspective on the problem.
                 Rather than taking some view definition language as
                 fixed (e.g., choosing some subset of relational
                 algebra) and looking for tractable ways of
                 ``inverting'' view definitions to propagate updates
                 from view to source [9], we can directly design new
                 bidirectional programming languages in which every
                 expression defines a pair of functions mapping updates
                 on one structure to updates on the other. Such
                 structures are often called lenses [18]. The
                 foundational theory of lenses has been studied
                 extensively [20, 47, 26, 32, 48, 40, 15, 31, 46, 41,
                 21, 27], and lens-based language designs have been
                 developed in several domains, including strings [5, 19,
                 3, 36], trees [18, 28, 39, 35, 29], relations [6],
                 graphs [23], and software models [43, 50, 44, 12, 13,
                 14, 24, 25, 8]. These languages share some common
                 elements with modern functional languages---in
                 particular, they come with very expressive type
                 systems. In other respects, they are rather novel and
                 surprising. This tutorial surveys recent developments
                 in the theory of lenses and the practice of
                 bidirectional programming languages.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Choromanski:2012:PDN,
  author =       "Krzysztof Choromanski and Tal Malkin",
  title =        "The power of the {Dinur--Nissim} algorithm: breaking
                 privacy of statistical and graph databases",
  crossref =     "Krotzsch:2012:PPA",
  pages =        "65--76",
  year =         "2012",
  DOI =          "https://doi.org/10.1145/2213556.2213570",
  bibdate =      "Tue Nov 6 11:31:12 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "A few years ago, Dinur and Nissim (PODS, 2003)
                 proposed an algorithm for breaking database privacy
                 when statistical queries are answered with a
                 perturbation error of magnitude o ( \sqrt n ) for a
                 database of size n. This negative result is very strong
                 in the sense that it completely reconstructs \Omega ( n
                 ) data bits with an algorithm that is simple, uses
                 random queries, and does not put any restriction on the
                 perturbation other than its magnitude. Their algorithm
                 works for a model where the database consists of bits,
                 and the statistical queries asked by the adversary are
                 sum queries for a subset of locations. In this paper we
                 extend the attack to work for much more general
                 settings in terms of the type of statistical query
                 allowed, the database domain, and the general tradeoff
                 between perturbation and privacy. Specifically, we
                 prove: For queries of the type \Sigma $_i^n$ =1 \phi
                 $_i$ x$_i$; where \phi _{i} are i.i.d. and with a
                 finite third moment and positive variance (this
                 includes as a special case the sum queries of
                 Dinur-Nissim and several subsequent extensions), we
                 prove that the quadratic relation between the
                 perturbation and what the adversary can reconstruct
                 holds even for smaller perturbations, and even for a
                 larger data domain. If \phi $_i$ is Gaussian,
                 Poissonian, or bounded and of positive variance, this
                 holds for arbitrary data domains and perturbation; for
                 other \phi $_i$ this holds as long as the domain is not
                 too large and the perturbation is not too small. A
                 positive result showing that for a sum query the
                 negative result mentioned above is tight. Specifically,
                 we build a distribution on bit databases and an
                 answering algorithm such that any adversary who wants
                 to recover a little more than the negative result above
                 allows, will not succeed except with negligible
                 probability. We consider a richer class of summation
                 queries, focusing on databases representing graphs,
                 where each entry is an edge, and the query is a
                 structural function of a subgraph. We show an attack
                 that recovers a big portion of the graph edges, as long
                 as the graph and the function satisfy certain
                 properties. The attacking algorithms in both our
                 negative results are straight-forward extensions of the
                 Dinur-Nissim attack, based on asking \phi -weighted
                 queries or queries choosing a subgraph uniformly at
                 random. The novelty of our work is in the analysis,
                 showing that this simple attack is much more powerful
                 than was previously known, as well as pointing to
                 possible limits of this approach and putting forth new
                 application domains such as graph problems (which may
                 occur in social networks, Internet graphs, etc). These
                 results may find applications not only for breaking
                 privacy, but also in the positive direction, for
                 recovering complicated structure information using
                 inaccurate estimates about its substructures.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kifer:2012:RCF,
  author =       "Daniel Kifer and Ashwin Machanavajjhala",
  title =        "A rigorous and customizable framework for privacy",
  crossref =     "Krotzsch:2012:PPA",
  pages =        "77--88",
  year =         "2012",
  DOI =          "https://doi.org/10.1145/2213556.2213571",
  bibdate =      "Tue Nov 6 11:31:12 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "In this paper we introduce a new and general privacy
                 framework called Pufferfish. The Pufferfish framework
                 can be used to create new privacy definitions that are
                 customized to the needs of a given application. The
                 goal of Pufferfish is to allow experts in an
                 application domain, who frequently do not have
                 expertise in privacy, to develop rigorous privacy
                 definitions for their data sharing needs. In addition
                 to this, the Pufferfish framework can also be used to
                 study existing privacy definitions. We illustrate the
                 benefits with several applications of this privacy
                 framework: we use it to formalize and prove the
                 statement that differential privacy assumes
                 independence between records, we use it to define and
                 study the notion of composition in a broader context
                 than before, we show how to apply it to protect
                 unbounded continuous attributes and aggregate
                 information, and we show how to use it to rigorously
                 account for prior data releases.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Letelier:2012:SAO,
  author =       "Andr{\'e}s Letelier and Jorge P{\'e}rez and Reinhard
                 Pichler and Sebastian Skritek",
  title =        "Static analysis and optimization of {Semantic Web}
                 queries",
  crossref =     "Krotzsch:2012:PPA",
  pages =        "89--100",
  year =         "2012",
  DOI =          "https://doi.org/10.1145/2213556.2213572",
  bibdate =      "Tue Nov 6 11:31:12 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Static analysis is a fundamental task in query
                 optimization. In this paper we study static analysis
                 and optimization techniques for SPARQL, which is the
                 standard language for querying Semantic Web data. Of
                 particular interest for us is the optionality feature
                 in SPARQL. It is crucial in Semantic Web data
                 management, where data sources are inherently
                 incomplete and the user is usually interested in
                 partial answers to queries. This feature is one of the
                 most complicated constructors in SPARQL and also the
                 one that makes this language depart from classical
                 query languages such as relational conjunctive queries.
                 We focus on the class of well-designed SPARQL queries,
                 which has been proposed in the literature as a fragment
                 of the language with good properties regarding query
                 evaluation. We first propose a tree representation for
                 SPARQL queries, called pattern trees, which captures
                 the class of well-designed SPARQL graph patterns and
                 which can be considered as a query execution plan.
                 Among other results, we propose several transformation
                 rules for pattern trees, a simple normal form, and
                 study equivalence and containment. We also study the
                 enumeration and counting problems for this class of
                 queries.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Losemann:2012:CEP,
  author =       "Katja Losemann and Wim Martens",
  title =        "The complexity of evaluating path expressions in
                 {SPARQL}",
  crossref =     "Krotzsch:2012:PPA",
  pages =        "101--112",
  year =         "2012",
  DOI =          "https://doi.org/10.1145/2213556.2213573",
  bibdate =      "Tue Nov 6 11:31:12 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "The World Wide Web Consortium (W3C) recently
                 introduced property paths in SPARQL 1.1, a query
                 language for RDF data. Property paths allow SPARQL
                 queries to evaluate regular expressions over graph
                 data. However, they differ from standard regular
                 expressions in several notable aspects. For example,
                 they have a limited form of negation, they have
                 numerical occurrence indicators as syntactic sugar, and
                 their semantics on graphs is defined in a non-standard
                 manner. We formalize the W3C semantics of property
                 paths and investigate various query evaluation problems
                 on graphs. More specifically, let x and y be two nodes
                 in an edge-labeled graph and r be an expression. We
                 study the complexities of (1) deciding whether there
                 exists a path from x to y that matches r and (2)
                 counting how many paths from x to y match r. Our main
                 results show that, compared to an alternative semantics
                 of regular expressions on graphs, the complexity of (1)
                 and (2) under W3C semantics is significantly higher.
                 Whereas the alternative semantics remains in polynomial
                 time for large fragments of expressions, the W3C
                 semantics makes problems (1) and (2) intractable almost
                 immediately. As a side-result, we prove that the
                 membership problem for regular expressions with
                 numerical occurrence indicators and negation is in
                 polynomial time.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Nekrich:2012:SER,
  author =       "Yakov Nekrich",
  title =        "Space-efficient range reporting for categorical data",
  crossref =     "Krotzsch:2012:PPA",
  pages =        "113--120",
  year =         "2012",
  DOI =          "https://doi.org/10.1145/2213556.2213575",
  bibdate =      "Tue Nov 6 11:31:12 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "In the colored (or categorical) range reporting
                 problem the set of input points is partitioned into
                 categories and stored in a data structure; a query asks
                 for categories of points that belong to the query
                 range. In this paper we study two-dimensional colored
                 range reporting in the external memory model and
                 present I/O-efficient data structures for this problem.
                 In particular, we describe data structures that answer
                 three-sided colored reporting queries in O ( K/B ) I/Os
                 and two-dimensional colored reporting queries
                 in(log$_2$ log $_B$ N + K/B ) I/Os when points lie on
                 an N x N grid, K is the number of reported colors, and
                 B is the block size. The space usage of both data
                 structures is close to optimal.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Sheng:2012:DTK,
  author =       "Cheng Sheng and Yufei Tao",
  title =        "Dynamic top-$k$ range reporting in external memory",
  crossref =     "Krotzsch:2012:PPA",
  pages =        "121--130",
  year =         "2012",
  DOI =          "https://doi.org/10.1145/2213556.2213576",
  bibdate =      "Tue Nov 6 11:31:12 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "In the top-K range reporting problem, the dataset
                 contains N points in the real domain R, each of which
                 is associated with a real-valued score. Given an
                 interval x$_1$, x$_2$ in R and an integer K {$<$}= N, a
                 query returns the K points in x$_1$, x$_2$ having the
                 smallest scores. We want to store the dataset in a
                 structure so that queries can be answered efficiently.
                 In the external memory model, the state of the art is a
                 static structure that consumes O ( N/B ) space, answers
                 a query in O (log $_B$ N + K/B ) time, and can be
                 constructed in O ( N + ( N log N / B ) log $_{M/B}$ (
                 N/B )) time, where B is the size of a disk block, and M
                 the size of memory. We present a fully-dynamic
                 structure that retains the same space and query bounds,
                 and can be updated in O (log $^2_B$ N ) amortized time
                 per insertion and deletion. Our structure can be
                 constructed in O (( N/B ) log $_{M/B}$ (N/B)) time.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Tao:2012:IRS,
  author =       "Yufei Tao",
  title =        "Indexability of {$2$D} range search revisited:
                 constant redundancy and weak indivisibility",
  crossref =     "Krotzsch:2012:PPA",
  pages =        "131--142",
  year =         "2012",
  DOI =          "https://doi.org/10.1145/2213556.2213577",
  bibdate =      "Tue Nov 6 11:31:12 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "In the 2D orthogonal range search problem, we want to
                 preprocess a set of 2D points so that, given any
                 axis-parallel query rectangle, we can report all the
                 data points in the rectangle efficiently. This paper
                 presents a lower bound on the query time that can be
                 achieved by any external memory structure that stores a
                 point at most r times, where r is a constant integer.
                 Previous research has resolved the bound at two
                 extremes: r = 1, and r being arbitrarily large. We, on
                 the other hand, derive the explicit tradeoff at every
                 specific r. A premise that lingers in existing studies
                 is the so-called indivisibility assumption: all the
                 information bits of a point are treated as an atom,
                 i.e., they are always stored together in the same
                 block. We partially remove this assumption by allowing
                 a data structure to freely divide a point into
                 individual bits stored in different blocks. The only
                 assumption is that, those bits must be retrieved for
                 reporting, as opposed to being computed --- we refer to
                 this requirement as the weak indivisibility assumption.
                 We also describe structures to show that our lower
                 bound is tight up to only a small factor.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Mahoney:2012:ACI,
  author =       "Michael W. Mahoney",
  title =        "Approximate computation and implicit regularization
                 for very large-scale data analysis",
  crossref =     "Krotzsch:2012:PPA",
  pages =        "143--154",
  year =         "2012",
  DOI =          "https://doi.org/10.1145/2213556.2213579",
  bibdate =      "Tue Nov 6 11:31:12 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Database theory and database practice are typically
                 the domain of computer scientists who adopt what may be
                 termed an algorithmic perspective on their data. This
                 perspective is very different than the more statistical
                 perspective adopted by statisticians, scientific
                 computers, machine learners, and other who work on what
                 may be broadly termed statistical data analysis. In
                 this article, I will address fundamental aspects of
                 this algorithmic-statistical disconnect, with an eye to
                 bridging the gap between these two very different
                 approaches. A concept that lies at the heart of this
                 disconnect is that of statistical regularization, a
                 notion that has to do with how robust is the output of
                 an algorithm to the noise properties of the input data.
                 Although it is nearly completely absent from computer
                 science, which historically has taken the input data as
                 given and modeled algorithms discretely, regularization
                 in one form or another is central to nearly every
                 application domain that applies algorithms to noisy
                 data. By using several case studies, I will illustrate,
                 both theoretically and empirically, the nonobvious fact
                 that approximate computation, in and of itself, can
                 implicitly lead to statistical regularization. This and
                 other recent work suggests that, by exploiting in a
                 more principled way the statistical properties implicit
                 in worst-case algorithms, one can in many cases satisfy
                 the bicriteria of having algorithms that are scalable
                 to very large-scale databases and that also have good
                 inferential or predictive properties.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Borodin:2012:MSD,
  author =       "Allan Borodin and Hyun Chul Lee and Yuli Ye",
  title =        "{Max-Sum} diversification, monotone submodular functions
                 and dynamic updates",
  crossref =     "Krotzsch:2012:PPA",
  pages =        "155--166",
  year =         "2012",
  DOI =          "https://doi.org/10.1145/2213556.2213580",
  bibdate =      "Tue Nov 6 11:31:12 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Result diversification has many important applications
                 in databases, operations research, information
                 retrieval, and finance. In this paper, we study and
                 extend a particular version of result diversification,
                 known as max-sum diversification. More specifically, we
                 consider the setting where we are given a set of
                 elements in a metric space and a set valuation function
                 f defined on every subset. For any given subset S, the
                 overall objective is a linear combination of f ( S )
                 and the sum of the distances induced by S. The goal is
                 to find a subset S satisfying some constraints that
                 maximizes the overall objective. This problem is first
                 studied by Gollapudi and Sharma in [17] for modular set
                 functions and for sets satisfying a cardinality
                 constraint (uniform matroids). In their paper, they
                 give a 2-approximation algorithm by reducing to an
                 earlier result in [20]. The first part of this paper
                 considers an extension of the modular case to the
                 monotone submodular case, for which the algorithm in
                 [17] no longer applies. Interestingly, we are able to
                 maintain the same 2-approximation using a natural, but
                 different greedy algorithm. We then further extend the
                 problem by considering any matroid constraint and show
                 that a natural single swap local search algorithm
                 provides a 2-approximation in this more general
                 setting. This extends the Nemhauser, Wolsey and Fisher
                 approximation result [20] for the problem of submodular
                 function maximization subject to a matroid constraint
                 (without the distance function component). The second
                 part of the paper focuses on dynamic updates for the
                 modular case. Suppose we have a good initial
                 approximate solution and then there is a single
                 weight-perturbation either on the valuation of an
                 element or on the distance between two elements. Given
                 that users expect some stability in the results they
                 see, we ask how easy is it to maintain a good
                 approximation without significantly changing the
                 initial set. We measure this by the number of updates,
                 where each update is a swap of a single element in the
                 current solution with a single element outside the
                 current solution. We show that we can maintain an
                 approximation ratio of 3 by just a single update if the
                 perturbation is not too large.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Koutris:2012:QBD,
  author =       "Paraschos Koutris and Prasang Upadhyaya and Magdalena
                 Balazinska and Bill Howe and Dan Suciu",
  title =        "Query-based data pricing",
  crossref =     "Krotzsch:2012:PPA",
  pages =        "167--178",
  year =         "2012",
  DOI =          "https://doi.org/10.1145/2213556.2213582",
  bibdate =      "Tue Nov 6 11:31:12 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Data is increasingly being bought and sold online, and
                 Web-based marketplace services have emerged to
                 facilitate these activities. However, current
                 mechanisms for pricing data are very simple: buyers can
                 choose only from a set of explicit views, each with a
                 specific price. In this paper, we propose a framework
                 for pricing data on the Internet that, given the price
                 of a few views, allows the price of any query to be
                 derived automatically. We call this capability
                 ``query-based pricing.'' We first identify two
                 important properties that the pricing function must
                 satisfy, called arbitrage-free and discount-free. Then,
                 we prove that there exists a unique function that
                 satisfies these properties and extends the seller's
                 explicit prices to all queries. When both the views and
                 the query are Unions of Conjunctive Queries, the
                 complexity of computing the price is high. To ensure
                 tractability, we restrict the explicit prices to be
                 defined only on selection views (which is the common
                 practice today). We give an algorithm with polynomial
                 time data complexity for computing the price of any
                 chain query by reducing the problem to network flow.
                 Furthermore, we completely characterize the class of
                 Conjunctive Queries without self-joins that have PTIME
                 data complexity (this class is slightly larger than
                 chain queries), and prove that pricing all other
                 queries is NP-complete, thus establishing a dichotomy
                 on the complexity of the pricing problem when all views
                 are selection queries.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Fagin:2012:LTC,
  author =       "Ronald Fagin and Phokion G. Kolaitis",
  title =        "Local transformations and conjunctive-query
                 equivalence",
  crossref =     "Krotzsch:2012:PPA",
  pages =        "179--190",
  year =         "2012",
  DOI =          "https://doi.org/10.1145/2213556.2213583",
  bibdate =      "Tue Nov 6 11:31:12 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Over the past several decades, the study of
                 conjunctive queries has occupied a central place in the
                 theory and practice of database systems. In recent
                 years, conjunctive queries have played a prominent role
                 in the design and use of schema mappings for data
                 integration and data exchange tasks. In this paper, we
                 investigate several different aspects of
                 conjunctive-query equivalence in the context of schema
                 mappings and data exchange. In the first part of the
                 paper, we introduce and study a notion of a local
                 transformation between database instances that is based
                 on conjunctive-query equivalence. We show that the
                 chase procedure for GLAV mappings (that is, schema
                 mappings specified by source-to-target tuple-generating
                 dependencies) is a local transformation with respect to
                 conjunctive-query equivalence. This means that the
                 chase procedure preserves bounded conjunctive-query
                 equivalence, that is, if two source instances are
                 indistinguishable using conjunctive queries of a
                 sufficiently large size, then the target instances
                 obtained by chasing these two source instances are also
                 indistinguishable using conjunctive queries of a given
                 size. Moreover, we obtain polynomial bounds on the
                 level of indistinguishability between source instances
                 needed to guarantee indistinguishability between the
                 target instances produced by the chase. The locality of
                 the chase extends to schema mappings specified by a
                 second-order tuple-generating dependency (SO tgd), but
                 does not hold for schema mappings whose specification
                 includes target constraints. In the second part of the
                 paper, we take a closer look at the composition of two
                 GLAV mappings. In particular, we break GLAV mappings
                 into a small number of well-studied classes (including
                 LAV and GAV), and complete the picture as to when the
                 composition of schema mappings from these various
                 classes can be guaranteed to be a GLAV mapping, and
                 when they can be guaranteed to be conjunctive-query
                 equivalent to a GLAV mapping. We also show that the
                 following problem is decidable: given a schema mapping
                 specified by an SO tgd and a GLAV mapping, are they
                 conjunctive-query equivalent? In contrast, the
                 following problem is known to be undecidable: given a
                 schema mapping specified by an SO tgd and a GLAV
                 mapping, are they logically equivalent?",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kimelfeld:2012:DCD,
  author =       "Benny Kimelfeld",
  title =        "A dichotomy in the complexity of deletion propagation
                 with functional dependencies",
  crossref =     "Krotzsch:2012:PPA",
  pages =        "191--202",
  year =         "2012",
  DOI =          "https://doi.org/10.1145/2213556.2213584",
  bibdate =      "Tue Nov 6 11:31:12 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "A classical variant of the view-update problem is
                 deletion propagation, where tuples from the database
                 are deleted in order to realize a desired deletion of a
                 tuple from the view. This operation may cause a
                 (sometimes necessary) side effect---deletion of
                 additional tuples from the view, besides the
                 intentionally deleted one. The goal is to propagate
                 deletion so as to maximize the number of tuples that
                 remain in the view. In this paper, a view is defined by
                 a self-join-free conjunctive query (sjf-CQ) over a
                 schema with functional dependencies. A condition is
                 formulated on the schema and view definition at hand,
                 and the following dichotomy in complexity is
                 established. If the condition is met, then deletion
                 propagation is solvable in polynomial time by an
                 extremely simple algorithm (very similar to the one
                 observed by Buneman et al.). If the condition is
                 violated, then the problem is NP-hard, and it is even
                 hard to realize an approximation ratio that is better
                 than some constant; moreover, deciding whether there is
                 a side-effect-free solution is NP-complete. This result
                 generalizes a recent result by Kimelfeld et al., who
                 ignore functional dependencies. For the class of
                 sjf-CQs, it also generalizes a result by Cong et al.,
                 stating that deletion propagation is in polynomial time
                 if keys are preserved by the view.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Grossi:2012:WTM,
  author =       "Roberto Grossi and Giuseppe Ottaviano",
  title =        "The wavelet trie: maintaining an indexed sequence of
                 strings in compressed space",
  crossref =     "Krotzsch:2012:PPA",
  pages =        "203--214",
  year =         "2012",
  DOI =          "https://doi.org/10.1145/2213556.2213586",
  bibdate =      "Tue Nov 6 11:31:12 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "An indexed sequence of strings is a data structure for
                 storing a string sequence that supports random access,
                 searching, range counting and analytics operations,
                 both for exact matches and prefix search. String
                 sequences lie at the core of column-oriented databases,
                 log processing, and other storage and query tasks. In
                 these applications each string can appear several times
                 and the order of the strings in the sequence is
                 relevant. The prefix structure of the strings is
                 relevant as well: common prefixes are sought in strings
                 to extract interesting features from the sequence.
                 Moreover, space-efficiency is highly desirable as it
                 translates directly into higher performance, since more
                 data can fit in fast memory. We introduce and study the
                 problem of compressed indexed sequence of strings,
                 representing indexed sequences of strings in
                 nearly-optimal compressed space, both in the static and
                 dynamic settings, while preserving provably good
                 performance for the supported operations. We present a
                 new data structure for this problem, the Wavelet Trie,
                 which combines the classical Patricia Trie with the
                 Wavelet Tree, a succinct data structure for storing a
                 compressed sequence. The resulting Wavelet Trie
                 smoothly adapts to a sequence of strings that changes
                 over time. It improves on the state-of-the-art
                 compressed data structures by supporting a dynamic
                 alphabet (i.e. the set of distinct strings) and prefix
                 queries, both crucial requirements in the
                 aforementioned applications, and on traditional indexes
                 by reducing space occupancy to close to the entropy of
                 the sequence.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Xu:2012:OCP,
  author =       "Pan Xu and Srikanta Tirthapura",
  title =        "On the optimality of clustering properties of space
                 filling curves",
  crossref =     "Krotzsch:2012:PPA",
  pages =        "215--224",
  year =         "2012",
  DOI =          "https://doi.org/10.1145/2213556.2213587",
  bibdate =      "Tue Nov 6 11:31:12 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Space filling curves have for long been used in the
                 design of data structures for multidimensional data. A
                 fundamental quality metric of a space filling curve is
                 its ``clustering number'' with respect to a class of
                 queries, which is the average number of contiguous
                 segments on the space filling curve that a query region
                 can be partitioned into. We present a characterization
                 of the clustering number of a general class of space
                 filling curves, as well as the first non-trivial lower
                 bounds on the clustering number for any space filling
                 curve. Our results also answer an open problem that was
                 posed by Jagadish in 1997.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Agarwal:2012:NNS,
  author =       "Pankaj K. Agarwal and Alon Efrat and Swaminathan
                 Sankararaman and Wuzhou Zhang",
  title =        "Nearest-neighbor searching under uncertainty",
  crossref =     "Krotzsch:2012:PPA",
  pages =        "225--236",
  year =         "2012",
  DOI =          "https://doi.org/10.1145/2213556.2213588",
  bibdate =      "Tue Nov 6 11:31:12 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Nearest-neighbor queries, which ask for returning the
                 nearest neighbor of a query point in a set of points,
                 are important and widely studied in many fields because
                 of a wide range of applications. In many of these
                 applications, such as sensor databases, location based
                 services, face recognition, and mobile data, the
                 location of data is imprecise. We therefore study
                 nearest neighbor queries in a probabilistic framework
                 in which the location of each input point and/or query
                 point is specified as a probability density function
                 and the goal is to return the point that minimizes the
                 expected distance, which we refer to as the expected
                 nearest neighbor (ENN). We present methods for
                 computing an exact ENN or an \epsilon -approximate ENN,
                 for a given error parameter 0 {$<$} \epsilon 0 {$<$} 1,
                 under different distance functions. These methods build
                 an index of near-linear size and answer ENN queries in
                 polylogarithmic or sublinear time, depending on the
                 underlying function. As far as we know, these are the
                 first nontrivial methods for answering exact or
                 \epsilon -approximate ENN queries with provable
                 performance guarantees.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kostylev:2012:CAS,
  author =       "Egor V. Kostylev and Juan L. Reutter and Andr{\'a}s Z.
                 Salamon",
  title =        "Classification of annotation semirings over query
                 containment",
  crossref =     "Krotzsch:2012:PPA",
  pages =        "237--248",
  year =         "2012",
  DOI =          "https://doi.org/10.1145/2213556.2213590",
  bibdate =      "Tue Nov 6 11:31:12 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We study the problem of query containment of (unions
                 of) conjunctive queries over annotated databases.
                 Annotations are typically attached to tuples and
                 represent metadata such as probability, multiplicity,
                 comments, or provenance. It is usually assumed that
                 annotations are drawn from a commutative semiring. Such
                 databases pose new challenges in query optimization,
                 since many related fundamental tasks, such as query
                 containment, have to be reconsidered in the presence of
                 propagation of annotations. We axiomatize several
                 classes of semirings for each of which containment of
                 conjunctive queries is equivalent to existence of a
                 particular type of homomorphism. For each of these
                 types we also specify all semirings for which existence
                 of a corresponding homomorphism is a sufficient (or
                 necessary) condition for the containment. We exploit
                 these techniques to develop new decision procedures for
                 containment of unions of conjunctive queries and
                 axiomatize corresponding classes of semirings. This
                 generalizes previous approaches and allows us to
                 improve known complexity bounds.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Barcelo:2012:EAC,
  author =       "Pablo Barcel{\'o} and Leonid Libkin and Miguel
                 Romero",
  title =        "Efficient approximations of conjunctive queries",
  crossref =     "Krotzsch:2012:PPA",
  pages =        "249--260",
  year =         "2012",
  DOI =          "https://doi.org/10.1145/2213556.2213591",
  bibdate =      "Tue Nov 6 11:31:12 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "When finding exact answers to a query over a large
                 database is infeasible, it is natural to approximate
                 the query by a more efficient one that comes from a
                 class with good bounds on the complexity of query
                 evaluation. In this paper we study such approximations
                 for conjunctive queries. These queries are of special
                 importance in databases, and we have a very good
                 understanding of the classes that admit fast query
                 evaluation, such as acyclic, or bounded
                 (hyper)treewidth queries. We define approximations of a
                 given query Q as queries from one of those classes that
                 disagree with Q as little as possible. We mostly
                 concentrate on approximations that are guaranteed to
                 return correct answers. We prove that for the above
                 classes of tractable conjunctive queries,
                 approximations always exist, and are at most polynomial
                 in the size of the original query. This follows from
                 general results we establish that relate closure
                 properties of classes of conjunctive queries to the
                 existence of approximations. We also show that in many
                 cases, the size of approximations is bounded by the
                 size of the query they approximate. We establish a
                 number of results showing how combinatorial properties
                 of queries affect properties of their approximations,
                 study bounds on the number of approximations, as well
                 as the complexity of finding and identifying
                 approximations. We also look at approximations that
                 return all correct answers and study their
                 properties.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Deng:2012:CPR,
  author =       "Ting Deng and Wenfei Fan and Floris Geerts",
  title =        "On the complexity of package recommendation problems",
  crossref =     "Krotzsch:2012:PPA",
  pages =        "261--272",
  year =         "2012",
  DOI =          "https://doi.org/10.1145/2213556.2213592",
  bibdate =      "Tue Nov 6 11:31:12 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Recommendation systems aim to recommend items that are
                 likely to be of interest to users. This paper
                 investigates several issues fundamental to such
                 systems. We model recommendation systems for packages
                 of items. We use queries to specify multi-criteria for
                 item selections and express compatibility constraints
                 on items in a package, and use functions to compute the
                 cost and usefulness of items to a user. We study
                 recommendations of points of interest, to suggest top-
                 k packages. We also investigate recommendations of top-
                 k items, as a special case. In addition, when sensible
                 suggestions cannot be found, we propose query
                 relaxation recommendations to help users revise their
                 selection criteria, or adjustment recommendations to
                 guide vendors to modify their item collections. We
                 identify several problems, to decide whether a set of
                 packages makes a top- k recommendation, whether a
                 rating bound is maximum for selecting top- k packages,
                 whether we can relax the selection query to find
                 packages that users want, and whether we can update a
                 bounded number of items such that the users'
                 requirements can be satisfied. We also study function
                 problems for computing top- k packages, and counting
                 problems to find how many packages meet the user's
                 criteria. We establish the upper and lower bounds of
                 these problems, all matching, for combined and data
                 complexity. These results reveal the impact of variable
                 sizes of packages, the presence of compatibility
                 constraints, as well as a variety of query languages
                 for specifying selection criteria and compatibility
                 constraints, on the analyses of these problems.",
  acknowledgement = ack-nhfb,
}

@InProceedings{McGregor:2012:SEE,
  author =       "Andrew McGregor and A. Pavan and Srikanta Tirthapura
                 and David Woodruff",
  title =        "Space-efficient estimation of statistics over
                 sub-sampled streams",
  crossref =     "Krotzsch:2012:PPA",
  pages =        "273--282",
  year =         "2012",
  DOI =          "https://doi.org/10.1145/2213556.2213594",
  bibdate =      "Tue Nov 6 11:31:12 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "In many stream monitoring situations, the data arrival
                 rate is so high that it is not even possible to observe
                 each element of the stream. The most common solution is
                 to sample a small fraction of the data stream and use
                 the sample to infer properties and estimate aggregates
                 of the original stream. However, the quantities that
                 need to be computed on the sampled stream are often
                 different from the original quantities of interest and
                 their estimation requires new algorithms. We present
                 upper and lower bounds (often matching) for estimating
                 frequency moments, support size, entropy, and heavy
                 hitters of the original stream from the data observed
                 in the sampled stream.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Tirthapura:2012:REA,
  author =       "Srikanta Tirthapura and David Woodruff",
  title =        "Rectangle-efficient aggregation in spatial data
                 streams",
  crossref =     "Krotzsch:2012:PPA",
  pages =        "283--294",
  year =         "2012",
  DOI =          "https://doi.org/10.1145/2213556.2213595",
  bibdate =      "Tue Nov 6 11:31:12 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We consider the estimation of aggregates over a data
                 stream of multidimensional axis-aligned rectangles.
                 Rectangles are a basic primitive object in spatial
                 databases, and efficient aggregation of rectangles is a
                 fundamental task. The data stream model has emerged as
                 a de facto model for processing massive databases in
                 which the data resides in external memory or the cloud
                 and is streamed through main memory. For a point p, let
                 n(p) denote the sum of the weights of all rectangles in
                 the stream that contain p. We give near-optimal
                 solutions for basic problems, including (1) the k -th
                 frequency moment F$_k$ = \Sigma $_{points p}$ | n(p)
                 |$^k$, (2)~the counting version of stabbing queries,
                 which seeks an estimate of n(p) given p, and (3)
                 identification of heavy-hitters, i.e., points p for
                 which n(p) is large. An important special case of F$_k$
                 is F$_0$, which corresponds to the volume of the union
                 of the rectangles. This is a celebrated problem in
                 computational geometry known as ``Klee's measure
                 problem'', and our work yields the first solution in
                 the streaming model for dimensions greater than one.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Huang:2012:RAT,
  author =       "Zengfeng Huang and Ke Yi and Qin Zhang",
  title =        "Randomized algorithms for tracking distributed count,
                 frequencies, and ranks",
  crossref =     "Krotzsch:2012:PPA",
  pages =        "295--306",
  year =         "2012",
  DOI =          "https://doi.org/10.1145/2213556.2213596",
  bibdate =      "Tue Nov 6 11:31:12 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We show that randomization can lead to significant
                 improvements for a few fundamental problems in
                 distributed tracking. Our basis is the count-tracking
                 problem, where there are k players, each holding a
                 counter n$_i$ that gets incremented over time, and the
                 goal is to track an \Sigma -approximation of their sum
                 n = \Sigma $_i$ n$_i$ continuously at all times, using
                 minimum communication. While the deterministic
                 communication complexity of the problem is \theta ( k /
                 \epsilon o log N ), where N is the final value of n
                 when the tracking finishes, we show that with
                 randomization, the communication cost can be reduced to
                 \theta ( \sqrt k / \epsilon o log N ). Our algorithm is
                 simple and uses only O (1) space at each player, while
                 the lower bound holds even assuming each player has
                 infinite computing power. Then, we extend our
                 techniques to two related distributed tracking
                 problems: frequency-tracking and rank-tracking, and
                 obtain similar improvements over previous deterministic
                 algorithms. Both problems are of central importance in
                 large data monitoring and analysis, and have been
                 extensively studied in the literature.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Liu:2012:CDC,
  author =       "Zhenming Liu and Bozidar Radunovi{\'c} and Milan
                 Vojnovi{\'c}",
  title =        "Continuous distributed counting for non-monotonic
                 streams",
  crossref =     "Krotzsch:2012:PPA",
  pages =        "307--318",
  year =         "2012",
  DOI =          "https://doi.org/10.1145/2213556.2213597",
  bibdate =      "Tue Nov 6 11:31:12 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We consider the continual count tracking problem in a
                 distributed environment where the input is an aggregate
                 stream that originates from $k$ distinct sites and the
                 updates are allowed to be non-monotonic, i.e., both
                 increments and decrements are allowed. The goal is to
                 continually track the count within a prescribed
                 relative accuracy $\epsilon$ at the lowest possible
                 communication cost. Specifically, we consider an
                 adversarial setting where the input values are selected
                 and assigned to sites by an adversary but the order is
                 according to a random permutation or is a random i.i.d
                 process. The input stream of values is allowed to be
                 non-monotonic with an unknown drift $-1 \leq \mu \leq
                 1$ where the case $\mu = 1$ corresponds to the special
                 case of a monotonic stream of only non-negative
                 updates. We show that a randomized algorithm guarantees
                 to track the count accurately with high probability and
                 has the expected communication cost
                 $\tilde{O}(\min\{\sqrt{k} /(|\mu| \epsilon), \sqrt{kn}
                 / \epsilon, n)\}$, for an input stream of length $n$,
                 and establish matching lower bounds. This improves upon
                 previously best known algorithm whose expected
                 communication cost is $\Theta (\min\{\sqrt{k} /
                 \epsilon, n\})$ that applies only to an important but
                 more restrictive class of monotonic input streams, and
                 our results are substantially more positive than the
                 communication complexity of $\Omega(n)$ under fully
                 adversarial input. We also show how our framework can
                 also accommodate other types of random input streams,
                 including fractional Brownian motion that has been
                 widely used to model temporal long-range dependencies
                 observed in many natural phenomena. Last but not least,
                 we show how our non-monotonic counter can be applied to
                 track the second frequency moment and to a Bayesian
                 linear regression problem.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hull:2013:FDA,
  author =       "Richard Hull",
  title =        "Foundations of data-aware process analysis: a database
                 theory perspective",
  crossref =     "Hull:2013:SPC",
  pages =        "1--12",
  year =         "2013",
  DOI =          "https://doi.org/10.1145/2463664.2467796",
  bibdate =      "Wed Mar 5 07:53:56 MST 2014",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "In this work we survey the research on foundations of
                 data-aware (business) processes that has been carried
                 out in the database theory community. We show that this
                 community has indeed developed over the years a
                 multi-faceted culture of merging data and processes. We
                 argue that it is this community that should lay the
                 foundations to solve, at least from the point of view
                 of formal analysis, the dichotomy between data and
                 processes still persisting in business process
                 management.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kimelfeld:2013:CMM,
  author =       "Benny Kimelfeld and Phokion G. Kolaitis",
  title =        "The complexity of mining maximal frequent subgraphs",
  crossref =     "Hull:2013:SPC",
  pages =        "13--24",
  year =         "2013",
  DOI =          "https://doi.org/10.1145/2463664.2465222",
  bibdate =      "Wed Mar 5 07:53:56 MST 2014",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "A frequent subgraph of a given collection of graphs is
                 a graph that is isomorphic to a subgraph of at least as
                 many graphs in the collection as a given threshold.
                 Frequent subgraphs generalize frequent itemsets and
                 arise in various contexts, from bioinformatics to the
                 Web. Since the space of frequent subgraphs is typically
                 extremely large, research in graph mining has focused
                 on special types of frequent subgraphs that can be
                 orders of magnitude smaller in number, yet encapsulate
                 the space of all frequent subgraphs. Maximal frequent
                 subgraphs (i.e., the ones not properly contained in any
                 frequent subgraph) constitute the most useful such
                 type. In this paper, we embark on a comprehensive
                 investigation of the computational complexity of mining
                 maximal frequent subgraphs. Our study is carried out by
                 considering the effect of three different parameters:
                 possible restrictions on the class of graphs; a fixed
                 bound on the threshold; and a fixed bound on the number
                 of desired answers. We focus on specific classes of
                 connected graphs: general graphs, planar graphs, graphs
                 of bounded degree, and graphs of bounded tree-width
                 (trees being a special case). Moreover, each class has
                 two variants: the one in which the nodes are unlabeled,
                 and the one in which they are uniquely labeled. We
                 delineate the complexity of the enumeration problem for
                 each of these variants by determining when it is
                 solvable in (total or incremental) polynomial time and
                 when it is NP-hard. Specifically, for the labeled
                 classes, we show that bounding the threshold yields
                 tractability but, in most cases, bounding the number of
                 answers does not, unless P=NP; an exception is the case
                 of labeled trees, where bounding either of these two
                 parameters yields tractability. The state of affairs
                 turns out to be quite different for the unlabeled
                 classes. The main (and most challenging to prove)
                 result concerns unlabeled trees: we show NP-hardness,
                 even if the input consists of two trees, and both the
                 threshold and the number of desired answers are equal
                 to just two. In other words, we establish that the
                 following problem is NP-complete: given two unlabeled
                 trees, do they have more than one maximal subtree in
                 common?",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gottlob:2013:DMD,
  author =       "Georg Gottlob",
  title =        "Deciding monotone duality and identifying frequent
                 itemsets in quadratic logspace",
  crossref =     "Hull:2013:SPC",
  pages =        "25--36",
  year =         "2013",
  DOI =          "https://doi.org/10.1145/2463664.2463673",
  bibdate =      "Wed Mar 5 07:53:56 MST 2014",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "The monotone duality problem is defined as follows:
                 Given two monotone formulas f and g in irredundant DNF,
                 decide whether f and g are dual. This problem is the
                 same as duality testing for hypergraphs, that is,
                 checking whether a hypergraph H consists of precisely
                 all minimal transversals of a hypergraph G. By
                 exploiting a recent problem-decomposition method by
                 Boros and Makino (ICALP 2009), we show that duality
                 testing for hypergraphs, and thus for monotone DNFs, is
                 feasible in DSPACE(log$^2$ n ), i.e., in quadratic
                 logspace. As the monotone duality problem is equivalent
                 to a number of problems in the areas of databases, data
                 mining, and knowledge discovery, the results presented
                 here yield new complexity results for those problems,
                 too. For example, it follows from our results that
                 whenever, for a Boolean-valued relation (whose
                 attributes represent items), a number of maximal
                 frequent itemsets and a number of minimal infrequent
                 itemsets are known, then it can be decided in quadratic
                 logspace whether there exist additional frequent or
                 infrequent itemsets.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Fagin:2013:SFF,
  author =       "Ronald Fagin and Benny Kimelfeld and Frederick Reiss
                 and Stijn Vansummeren",
  title =        "Spanners: a formal framework for information
                 extraction",
  crossref =     "Hull:2013:SPC",
  pages =        "37--48",
  year =         "2013",
  DOI =          "https://doi.org/10.1145/2463664.2463665",
  bibdate =      "Wed Mar 5 07:53:56 MST 2014",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "An intrinsic part of information extraction is the
                 creation and manipulation of relations extracted from
                 text. In this paper, we develop a foundational
                 framework where the central construct is what we call a
                 spanner. A spanner maps an input string into relations
                 over the spans (intervals specified by bounding
                 indices) of the string. The focus of this paper is on
                 the representation of spanners. Conceptually, there are
                 two kinds of such representations. Spanners defined in
                 a primitive representation extract relations directly
                 from the input string; those defined in an algebra
                 apply algebraic operations to the primitively
                 represented spanners. This framework is driven by
                 SystemT, an IBM commercial product for text analysis,
                 where the primitive representation is that of regular
                 expressions with capture variables. We define
                 additional types of primitive spanner representations
                 by means of two kinds of automata that assign spans to
                 variables. We prove that the first kind has the same
                 expressive power as regular expressions with capture
                 variables; the second kind expresses precisely the
                 algebra of the regular spanners---the closure of the
                 first kind under standard relational operators. The
                 core spanners extend the regular ones by
                 string-equality selection (an extension used in
                 SystemT). We give some fundamental results on the
                 expressiveness of regular and core spanners. As an
                 example, we prove that regular spanners are closed
                 under difference (and complement), but core spanners
                 are not. Finally, we establish connections with related
                 notions in the literature.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Abouzied:2013:LVQ,
  author =       "Azza Abouzied and Dana Angluin and Christos
                 Papadimitriou and Joseph M. Hellerstein and Avi
                 Silberschatz",
  title =        "Learning and verifying quantified boolean queries by
                 example",
  crossref =     "Hull:2013:SPC",
  pages =        "49--60",
  year =         "2013",
  DOI =          "https://doi.org/10.1145/2463664.2465220",
  bibdate =      "Wed Mar 5 07:53:56 MST 2014",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "To help a user specify and verify quantified queries
                 --- a class of database queries known to be very
                 challenging for all but the most expert users --- one
                 can question the user on whether certain data objects
                 are answers or non-answers to her intended query. In
                 this paper, we analyze the number of questions needed
                 to learn or verify qhorn queries, a special class of
                 Boolean quantified queries whose underlying form is
                 conjunctions of quantified Horn expressions. We provide
                 optimal polynomial-question and polynomial-time
                 learning and verification algorithms for two subclasses
                 of the class qhorn with upper constant limits on a
                 query's causal density.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Benedikt:2013:APA,
  author =       "Michael Benedikt and Tova Milo and Dirk {Van Gucht}",
  title =        "The {ACM PODS Alberto O. Mendelzon test-of-time award
                 2013}",
  crossref =     "Hull:2013:SPC",
  pages =        "61--62",
  year =         "2013",
  DOI =          "https://doi.org/10.1145/2463664.2494090",
  bibdate =      "Wed Mar 5 07:53:56 MST 2014",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bojanczyk:2013:VDD,
  author =       "Mikolaj Boja{'n}czyk and Luc Segoufin and Szymon
                 Toru{\'n}czyk",
  title =        "Verification of database-driven systems via
                 amalgamation",
  crossref =     "Hull:2013:SPC",
  pages =        "63--74",
  year =         "2013",
  DOI =          "https://doi.org/10.1145/2463664.2465228",
  bibdate =      "Wed Mar 5 07:53:56 MST 2014",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We describe a general framework for static
                 verification of systems that base their decisions upon
                 queries to databases. The database is specified using
                 constraints, typically a schema, and is not modified
                 during a run of the system. The system is equipped with
                 a finite number of registers for storing intermediate
                 information from the database and the specification
                 consists of a transition table described using
                 quantifier-free formulas that can query either the
                 database or the registers. Our main result concerns
                 systems querying XML databases --- modeled as data
                 trees --- using quantifier-free formulas with
                 predicates such as the descendant axis or comparison of
                 data values. In this scenario we show an ExpSpace
                 algorithm for deciding reachability. Our technique is
                 based on the notion of amalgamation and is quite
                 general. For instance it also applies to relational
                 databases (with an optimal PSpace algorithm). We also
                 show that minor extensions of the model lead to
                 undecidability.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gheerbrant:2013:WNE,
  author =       "Am{\'e}lie Gheerbrant and Leonid Libkin and Cristina
                 Sirangelo",
  title =        "When is naive evaluation possible?",
  crossref =     "Hull:2013:SPC",
  pages =        "75--86",
  year =         "2013",
  DOI =          "https://doi.org/10.1145/2463664.2463674",
  bibdate =      "Wed Mar 5 07:53:56 MST 2014",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "The term naive evaluation refers to evaluating queries
                 over incomplete databases as if nulls were usual data
                 values, i.e., to using the standard database query
                 evaluation engine. Since the semantics of query
                 answering over incomplete databases is that of certain
                 answers, we would like to know when naive evaluation
                 computes them: i.e., when certain answers can be found
                 without inventing new specialized algorithms. For
                 relational databases it is well known that unions of
                 conjunctive queries possess this desirable property,
                 and results on preservation of formulae under
                 homomorphisms tell us that within relational calculus,
                 this class cannot be extended under the open-world
                 assumption. Our goal here is twofold. First, we develop
                 a general framework that allows us to determine, for a
                 given semantics of incompleteness, classes of queries
                 for which naive evaluation computes certain answers.
                 Second, we apply this approach to a variety of
                 semantics, showing that for many classes of queries
                 beyond unions of conjunctive queries, naive evaluation
                 makes perfect sense under assumptions different from
                 open-world. Our key observations are: (1) naive
                 evaluation is equivalent to monotonicity of queries
                 with respect to a semantics-induced ordering, and (2)
                 for most reasonable semantics, such monotonicity is
                 captured by preservation under various types of
                 homomorphisms. Using these results we find classes of
                 queries for which naive evaluation works, e.g.,
                 positive first-order formulae for the closed-world
                 semantics. Even more, we introduce a general
                 relation-based framework for defining semantics of
                 incompleteness, show how it can be used to capture many
                 known semantics and to introduce new ones, and describe
                 classes of first-order queries for which naive
                 evaluation works under such semantics.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Indyk:2013:SHH,
  author =       "Piotr Indyk",
  title =        "Sketching via hashing: from heavy hitters to
                 compressed sensing to {Sparse Fourier Transform}",
  crossref =     "Hull:2013:SPC",
  pages =        "87--90",
  year =         "2013",
  DOI =          "https://doi.org/10.1145/2463664.2465217",
  bibdate =      "Wed Mar 5 07:53:56 MST 2014",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/hash.bib;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Abiteboul:2013:CDD,
  author =       "Serge Abiteboul and Victor Vianu",
  title =        "Collaborative data-driven workflows: think global, act
                 local",
  crossref =     "Hull:2013:SPC",
  pages =        "91--102",
  year =         "2013",
  DOI =          "https://doi.org/10.1145/2463664.2463672",
  bibdate =      "Wed Mar 5 07:53:56 MST 2014",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We introduce and study a model of collaborative
                 data-driven workflows. In a local-as-view style, each
                 peer has a partial view of a global instance that
                 remains purely virtual. Local updates have side effects
                 on other peers' data, defined via the global instance.
                 We also assume that the peers provide (an abstraction
                 of) their specifications, so that each peer can
                 actually see and reason on the specification of the
                 entire system. We study the ability of a peer to carry
                 out runtime reasoning about the global run of the
                 system, and in particular about actions of other peers,
                 based on its own local observations. A main
                 contribution is to show that, under a reasonable
                 restriction (namely, key-visibility ), one can
                 construct a finite symbolic representation of the
                 infinite set of global runs consistent with given local
                 observations. Using the symbolic representation, we
                 show that we can evaluate in PSPACE a large class of
                 properties over global runs, expressed in an extension
                 of first-order logic with past linear-time temporal
                 operators, PLTL-FO. We also provide a variant of the
                 algorithm allowing to incrementally monitor a
                 statically defined property, and then develop an
                 extension allowing to monitor an infinite class of
                 properties sharing the same temporal structure, defined
                 dynamically as the run unfolds. Finally, we consider an
                 extension of the language, that permits workflow
                 control with PLTL-FO formulas. We prove that this does
                 not increase the power of the workflow specification
                 language, thereby showing that the language is closed
                 under such introspective reasoning.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kejlberg-Rasmussen:2013:EPR,
  author =       "Casper Kejlberg-Rasmussen and Yufei Tao and
                 Konstantinos Tsakalidis and Kostas Tsichlas and
                 Jeonghun Yoon",
  title =        "{I/O}-efficient planar range skyline and attrition
                 priority queues",
  crossref =     "Hull:2013:SPC",
  pages =        "103--114",
  year =         "2013",
  DOI =          "https://doi.org/10.1145/2463664.2465225",
  bibdate =      "Wed Mar 5 07:53:56 MST 2014",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We study the static and dynamic planar range skyline
                 reporting problem in the external memory model with
                 block size B, under a linear space budget. The problem
                 asks for an O ( n/B ) space data structure that stores
                 n points in the plane, and supports reporting the k
                 maximal input points (a.k.a. skyline ) among the points
                 that lie within a given query rectangle Q = [ \alpha
                 $_1$ [ \alpha $_2$ ] $ \times $ [ \beta $_1$ \beta
                 $_2$. When Q is 3-sided, i.e. one of its edges is
                 grounded, two variants arise: top-open for \beta $_2$ =
                 \infty and left-open for \alpha $_1$ = --- \infty
                 (symmetrically bottom-open and right-open ) queries. We
                 present optimal static data structures for top-open
                 queries, for the cases where the universe is R$^2$, a U
                 $ \times $ U grid, and rank space [ O ( n )]$^2$. We
                 also show that left-open queries are harder, as they
                 require \Omega (( n / B )$^{ \epsilon }$ + k / B ) I/Os
                 for \epsilon {$>$} 0, when only linear space is
                 allowed. We show that the lower bound is tight, by a
                 structure that supports 4-sided queries in matching
                 complexities. Interestingly, these lower and upper
                 bounds coincide with those of the planar orthogonal
                 range reporting problem, i.e., the skyline requirement
                 does not alter the problem difficulty at all! Finally,
                 we present the first dynamic linear space data
                 structure that supports top-open queries in O(log$_{2B
                 \epsilon }$ n + k / B$^{1 \epsilon }$ {$>$} and updates
                 in O (log$_{2B \epsilon }$ n ) worst case I/Os, for
                 \epsilon \in [0, 1]. This also yields a linear space
                 data structure for 4-sided queries with optimal query
                 I/Os and O (log( n / B )) amortized update I/Os. We
                 consider of independent interest the main component of
                 our dynamic structures, a new real-time I/O-efficient
                 and catenable variant of the fundamental structure
                 priority queue with attrition by Sundar.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Agarwal:2013:NNS,
  author =       "Pankaj K. Agarwal and Boris Aronov and Sariel
                 Har-Peled and Jeff M. Phillips and Ke Yi and Wuzhou
                 Zhang",
  title =        "Nearest neighbor searching under uncertainty {II}",
  crossref =     "Hull:2013:SPC",
  pages =        "115--126",
  year =         "2013",
  DOI =          "https://doi.org/10.1145/2463664.2465219",
  bibdate =      "Wed Mar 5 07:53:56 MST 2014",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Nearest-neighbor ( NN ) search, which returns the
                 nearest neighbor of a query point in a set of points,
                 is an important and widely studied problem in many
                 fields, and it has wide range of applications. In many
                 of them, such as sensor databases, location-based
                 services, face recognition, and mobile data, the
                 location of data is imprecise. We therefore study
                 nearest neighbor queries in a probabilistic framework
                 in which the location of each input point is specified
                 as a probability distribution function. We present
                 efficient algorithms for (i) computing all points that
                 are nearest neighbors of a query point with nonzero
                 probability; (ii) estimating, within a specified
                 additive error, the probability of a point being the
                 nearest neighbor of a query point; (iii) using it to
                 return the point that maximizes the probability being
                 the nearest neighbor, or all the points with
                 probabilities greater than some threshold to be the NN.
                 We also present some experimental results to
                 demonstrate the effectiveness of our approach.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Gogacz:2013:BFC,
  author =       "Tomasz Gogacz and Jerzy Marcinkowski",
  title =        "On the {BDD\slash FC} conjecture",
  crossref =     "Hull:2013:SPC",
  pages =        "127--138",
  year =         "2013",
  DOI =          "https://doi.org/10.1145/2463664.2463668",
  bibdate =      "Wed Mar 5 07:53:56 MST 2014",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Bounded Derivation Depth property (BDD) and Finite
                 Controllability (FC) are two properties of sets of
                 datalog rules and tuple generating dependencies (known
                 as Datalog$^3$ programs), which recently attracted some
                 attention. We conjecture that the first of these
                 properties implies the second, and support this
                 conjecture by some evidence proving, among other
                 results, that it holds true for all theories over
                 binary signature.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ameloot:2013:EPU,
  author =       "Tom J. Ameloot and Jan {Van den Bussche} and Emmanuel
                 Waller",
  title =        "On the expressive power of update primitives",
  crossref =     "Hull:2013:SPC",
  pages =        "139--150",
  year =         "2013",
  DOI =          "https://doi.org/10.1145/2463664.2465218",
  bibdate =      "Wed Mar 5 07:53:56 MST 2014",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "The SQL standard offers three primitive operations
                 (insert, delete, and update which is here called
                 modify) to update a relation based on a generic query.
                 This paper compares the expressiveness of programs
                 composed of these three operations, with the general
                 notion of update that simply replaces the content of
                 the relation by the result of a query. It turns out
                 that replacing cannot be expressed in terms of
                 insertions, deletions, and modifications, and neither
                 can modifications be expressed in terms of insertions
                 and deletions. The expressive power gained by
                 if-then-else control flow in programs is investigated
                 as well. Different ways to perform replacing are
                 discussed: using a temporary variable; using the new
                 SQL merge operation; using SQL's data change delta
                 tables; or using queries involving object creation or
                 arithmetic. Finally the paper investigates the power of
                 alternating the different primitives. For example, an
                 insertion followed by a modification cannot always be
                 expressed as a modification followed by an insertion.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Rudolph:2013:FCD,
  author =       "Sebastian Rudolph and Markus Kr{\"o}tzsch",
  title =        "Flag \& check: data access with monadically defined
                 queries",
  crossref =     "Hull:2013:SPC",
  pages =        "151--162",
  year =         "2013",
  DOI =          "https://doi.org/10.1145/2463664.2465227",
  bibdate =      "Wed Mar 5 07:53:56 MST 2014",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We introduce monadically defined queries (MODEQs) and
                 nested monadically defined queries (NEMODEQs), two
                 querying formalisms that extend conjunctive queries,
                 conjunctive two-way regular path queries, and monadic
                 Datalog queries. Both can be expressed as Datalog
                 queries and in monadic second-order logic, yet they
                 have a decidable query containment problem and
                 favorable query answering complexities: a data
                 complexity of P, and a combined complexity of NP
                 (MODEQs) and PSpace (NEMODEQs). We show that (NE)MODEQ
                 answering remains decidable in the presence of a
                 well-known generic class of tuple-generating
                 dependencies. In addition, techniques to rewrite
                 queries under dependencies into (NE)MODEQs are
                 introduced. Rewriting can be applied partially, and
                 (NE)MODEQ answering is still decidable if the
                 non-rewritable part of the TGDs permits decidable
                 (NE)MODEQ answering on other grounds.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hariri:2013:VRD,
  author =       "Babak Bagheri Hariri and Diego Calvanese and Giuseppe
                 {De Giacomo} and Alin Deutsch and Marco Montali",
  title =        "Verification of relational data-centric dynamic
                 systems with external services",
  crossref =     "Hull:2013:SPC",
  pages =        "163--174",
  year =         "2013",
  DOI =          "https://doi.org/10.1145/2463664.2465221",
  bibdate =      "Wed Mar 5 07:53:56 MST 2014",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Data-centric dynamic systems are systems where both
                 the process controlling the dynamics and the
                 manipulation of data are equally central. We study
                 verification of (first-order) mu-calculus variants over
                 relational data-centric dynamic systems, where data are
                 maintained in a relational database, and the process is
                 described in terms of atomic actions that evolve the
                 database. Action execution may involve calls to
                 external services, thus inserting fresh data into the
                 system. As a result such systems are infinite-state. We
                 show that verification is undecidable in general, and
                 we isolate notable cases where decidability is
                 achieved. Specifically we start by considering service
                 calls that return values deterministically (depending
                 only on passed parameters). We show that in a
                 mu-calculus variant that preserves knowledge of objects
                 appeared along a run we get decidability under the
                 assumption that the fresh data introduced along a run
                 are bounded, though they might not be bounded in the
                 overall system. In fact we tie such a result to a
                 notion related to weak acyclicity studied in data
                 exchange. Then, we move to nondeterministic services
                 and we investigate decidability under the assumption
                 that knowledge of objects is preserved only if they are
                 continuously present. We show that if infinitely many
                 values occur in a run but do not accumulate in the same
                 state, then we get again decidability. We give
                 syntactic conditions to avoid this accumulation through
                 the novel notion of ``generate-recall acyclicity'',
                 which ensures that every service call activation
                 generates new values that cannot be accumulated
                 indefinitely.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Baeza:2013:QGD,
  author =       "Pablo Barcel{\'o} Baeza",
  title =        "Querying graph databases",
  crossref =     "Hull:2013:SPC",
  pages =        "175--188",
  year =         "2013",
  DOI =          "https://doi.org/10.1145/2463664.2465216",
  bibdate =      "Wed Mar 5 07:53:56 MST 2014",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Graph databases have gained renewed interest in the
                 last years, due to its applications in areas such as
                 the Semantic Web and Social Networks Analysis. We study
                 the problem of querying graph databases, and, in
                 particular, the expressiveness and complexity of
                 evaluation for several general-purpose query languages,
                 such as the regular path queries and its extensions
                 with conjunctions and inverses. We distinguish between
                 two semantics for these languages. The first one, based
                 on simple paths, easily leads to intractability, while
                 the second one, based on arbitrary paths, allows
                 tractable evaluation for an expressive family of
                 languages. We also study two recent extensions of these
                 languages that have been motivated by modern
                 applications of graph databases. The first one allows
                 to treat paths as first-class citizens, while the
                 second one permits to express queries that combine the
                 topology of the graph with its underlying data.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Wijsen:2013:CTF,
  author =       "Jef Wijsen",
  title =        "Charting the tractability frontier of certain
                 conjunctive query answering",
  crossref =     "Hull:2013:SPC",
  pages =        "189--200",
  year =         "2013",
  DOI =          "https://doi.org/10.1145/2463664.2463666",
  bibdate =      "Wed Mar 5 07:53:56 MST 2014",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "An uncertain database is defined as a relational
                 database in which primary keys need not be satisfied. A
                 repair (or possible world) of such database is obtained
                 by selecting a maximal number of tuples without ever
                 selecting two distinct tuples with the same primary key
                 value. For a Boolean query q, the decision problem
                 CERTAINTY ( q ) takes as input an uncertain database db
                 and asks whether q is satisfied by every repair of db.
                 Our main focus is on acyclic Boolean conjunctive
                 queries without self-join. Previous work has introduced
                 the notion of (directed) attack graph of such queries,
                 and has proved that CERTAINTY ( q ) is first-order
                 expressible if and only if the attack graph of q is
                 acyclic. The current paper investigates the boundary
                 between tractability and intractability of CERTAINTY (
                 q ). We first classify cycles in attack graphs as
                 either weak or strong, and then prove among others the
                 following. If the attack graph of a query q contains a
                 strong cycle, then CERTAINTY ( q ) is coNP-complete. If
                 the attack graph of q contains no strong cycle and
                 every weak cycle is terminal (i.e., no edge leads from
                 a vertex in the cycle to a vertex outside the cycle),
                 then CERTAINTY ( q ) is in P. We then partially address
                 the only remaining open case, i.e., when the attack
                 graph contains some nonterminal cycle and no strong
                 cycle. Finally, we establish a relationship between the
                 complexities of CERTAINTY ( q ) and evaluating q on
                 probabilistic databases.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Libkin:2013:TRA,
  author =       "Leonid Libkin and Juan Reutter and Domagoj Vrgoc",
  title =        "Trial for {RDF}: adapting graph query languages for
                 {RDF} data",
  crossref =     "Hull:2013:SPC",
  pages =        "201--212",
  year =         "2013",
  DOI =          "https://doi.org/10.1145/2463664.2465226",
  bibdate =      "Wed Mar 5 07:53:56 MST 2014",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Querying RDF data is viewed as one of the main
                 applications of graph query languages, and yet the
                 standard model of graph databases --- essentially
                 labeled graphs --- is different from the triples-based
                 model of RDF. While encodings of RDF databases into
                 graph data exist, we show that even the most natural
                 ones are bound to lose some functionality when used in
                 conjunction with graph query languages. The solution is
                 to work directly with triples, but then many properties
                 taken for granted in the graph database context (e.g.,
                 reachability) lose their natural meaning. Our goal is
                 to introduce languages that work directly over triples
                 and are closed, i.e., they produce sets of triples,
                 rather than graphs. Our basic language is called TriAL,
                 or Triple Algebra: it guarantees closure properties by
                 replacing the product with a family of join operations.
                 We extend TriAL with recursion, and explain why such an
                 extension is more intricate for triples than for
                 graphs. We present a declarative language, namely a
                 fragment of datalog, capturing the recursive algebra.
                 For both languages, the combined complexity of query
                 evaluation is given by low-degree polynomials. We
                 compare our languages with relational languages, such
                 as finite-variable logics, and previously studied graph
                 query languages such as adaptations of XPath, regular
                 path queries, and nested regular expressions; many of
                 these languages are subsumed by the recursive triple
                 algebra. We also provide examples of the usefulness of
                 TriAL in querying graph and RDF data.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bienvenu:2013:OBD,
  author =       "Meghyn Bienvenu and Balder ten Cate and Carsten Lutz
                 and Frank Wolter",
  title =        "Ontology-based data access: a study through
                 disjunctive datalog, {CSP}, and {MMSNP}",
  crossref =     "Hull:2013:SPC",
  pages =        "213--224",
  year =         "2013",
  DOI =          "https://doi.org/10.1145/2463664.2465223",
  bibdate =      "Wed Mar 5 07:53:56 MST 2014",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Ontology-based data access is concerned with querying
                 incomplete data sources in the presence of
                 domain-specific knowledge provided by an ontology. A
                 central notion in this setting is that of an
                 ontology-mediated query, which is a database query
                 coupled with an ontology. In this paper, we study
                 several classes of ontology-mediated queries, where the
                 database queries are given as some form of conjunctive
                 query and the ontologies are formulated in description
                 logics or other relevant fragments of first-order
                 logic, such as the guarded fragment and the
                 unary-negation fragment. The contributions of the paper
                 are three-fold. First, we characterize the expressive
                 power of ontology-mediated queries in terms of
                 fragments of disjunctive datalog. Second, we establish
                 intimate connections between ontology-mediated queries
                 and constraint satisfaction problems (CSPs) and their
                 logical generalization, MMSNP formulas. Third, we
                 exploit these connections to obtain new results
                 regarding (i) first-order rewritability and
                 datalog-rewritability of ontology-mediated queries,
                 (ii) P/NP dichotomies for ontology-mediated queries,
                 and (iii) the query containment problem for
                 ontology-mediated queries.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hernich:2013:WFS,
  author =       "Andr{\'e} Hernich and Clemens Kupke and Thomas
                 Lukasiewicz and Georg Gottlob",
  title =        "Well-founded semantics for extended datalog and
                 ontological reasoning",
  crossref =     "Hull:2013:SPC",
  pages =        "225--236",
  year =         "2013",
  DOI =          "https://doi.org/10.1145/2463664.2465229",
  bibdate =      "Wed Mar 5 07:53:56 MST 2014",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "The Datalog\pm{} family of expressive extensions of
                 Datalog has recently been introduced as a new paradigm
                 for query answering over ontologies, which captures and
                 extends several common description logics. It extends
                 plain Datalog by features such as existentially
                 quantified rule heads and, at the same time, restricts
                 the rule syntax so as to achieve decidability and
                 tractability. In this paper, we continue the research
                 on Datalog\pm{}. More precisely, we generalize the
                 well-founded semantics (WFS), as the standard semantics
                 for nonmonotonic normal programs in the database
                 context, to Datalog\pm{} programs with negation under
                 the unique name assumption (UNA). We prove that for
                 guarded Datalog\pm{} with negation under the standard
                 WFS, answering normal Boolean conjunctive queries is
                 decidable, and we provide precise complexity results
                 for this problem, namely, in particular, completeness
                 for PTIME (resp., 2-EXPTIME) in the data (resp.,
                 combined) complexity.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Baeza:2013:SAG,
  author =       "Pablo Barcel{\'o} Baeza and Miguel Romero and Moshe Y.
                 Vardi",
  title =        "Semantic acyclicity on graph databases",
  crossref =     "Hull:2013:SPC",
  pages =        "237--248",
  year =         "2013",
  DOI =          "https://doi.org/10.1145/2463664.2463671",
  bibdate =      "Wed Mar 5 07:53:56 MST 2014",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "It is known that unions of acyclic conjunctive queries
                 (CQs) can be evaluated in linear time, as opposed to
                 arbitrary CQs, for which the evaluation problem is
                 NP-complete. It follows from techniques in the area of
                 constraint-satisfaction problems that ``semantically
                 acyclic'' unions of CQs --- i.e., unions of CQs that
                 are equivalent to a union of acyclic ones --- can be
                 evaluated in polynomial time, though testing membership
                 in the class of semantically acyclic CQs is
                 NP-complete. We study here the fundamental notion of
                 semantic acyclicity in the context of graph databases
                 and unions of conjunctive regular path queries with
                 inverse (UC2RPQs). It is known that unions of acyclic
                 C2RPQs can be evaluated efficiently, but it is by no
                 means obvious whether the same holds for the class of
                 UC2RPQs that are semantically acyclic. We prove that
                 checking whether a UC2RPQ is semantically acyclic is
                 decidable in 2EXPSPACE, and that it is EXPSPACE-hard
                 even in the absence of inverses. Furthermore, we show
                 that evaluation of semantically acyclic UC2RPQs is
                 fixed-parameter tractable. In addition, our tools yield
                 a strong theory of approximations for UC2RPQs when no
                 equivalent acyclic UC2RPQ exists.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Figueira:2013:XTA,
  author =       "Diego Figueira",
  title =        "On {XPath} with transitive axes and data tests",
  crossref =     "Hull:2013:SPC",
  pages =        "249--260",
  year =         "2013",
  DOI =          "https://doi.org/10.1145/2463664.2463675",
  bibdate =      "Wed Mar 5 07:53:56 MST 2014",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We study the satisfiability problem for XPath with
                 data equality tests. XPath is a node selecting language
                 for XML documents whose satisfiability problem is known
                 to be undecidable, even for very simple fragments.
                 However, we show that the satisfiability for XPath with
                 the rightward, leftward and downward
                 reflexive-transitive axes (namely
                 following-sibling-or-self, preceding-sibling-or-self,
                 descendant-or-self ) is decidable. Our algorithm yields
                 a complexity of 3EXPSPACE, and we also identify an
                 expressive-equivalent normal form for the logic for
                 which the satisfiability problem is in 2EXPSPACE. These
                 results are in contrast with the undecidability of the
                 satisfiability problem as soon as we replace the
                 reflexive-transitive axes with just transitive
                 (non-reflexive) ones.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Bagan:2013:TRS,
  author =       "Guillaume Bagan and Angela Bonifati and Benoit Groz",
  title =        "A trichotomy for regular simple path queries on
                 graphs",
  crossref =     "Hull:2013:SPC",
  pages =        "261--272",
  year =         "2013",
  DOI =          "https://doi.org/10.1145/2463664.2467795",
  bibdate =      "Wed Mar 5 07:53:56 MST 2014",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "Regular path queries (RPQs) select vertices connected
                 by some path in a graph. The edge labels of such a path
                 have to form a word that matches a given regular
                 expression. We investigate the evaluation of RPQs with
                 an additional constraint that prevents multiple
                 traversals of the same vertices. Those regular simple
                 path queries (RSPQs) quickly become intractable, even
                 for basic languages such as (aa) * or a*ba*. In this
                 paper, we establish a comprehensive classification of
                 regular languages with respect to the complexity of the
                 corresponding regular simple path query problem. More
                 precisely, we identify for which languages RSPQs can be
                 evaluated in polynomial time, and show that evaluation
                 is NP-complete for languages outside this fragment. We
                 thus fully characterize the frontier between
                 tractability and intractability for RSPQs, and we
                 refine our results to show the following trichotomy:
                 evaluation of RSPQs is either AC0 , NL-complete or
                 NP-complete in data complexity, depending on the
                 language L. The fragment identified also admits a
                 simple characterization in terms of regular
                 expressions. Finally, we also discuss the complexity of
                 deciding whether a language L belongs to the fragment
                 above. We consider several alternative representations
                 of L: DFAs, NFAs or regular expressions, and prove that
                 this problem is NL-complete for the first
                 representation and PSPACE-complete for the other two.
                 As a conclusion we extend our results from edge-labeled
                 graphs to vertex-labeled graphs.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Beame:2013:CSP,
  author =       "Paul Beame and Paraschos Koutris and Dan Suciu",
  title =        "Communication steps for parallel query processing",
  crossref =     "Hull:2013:SPC",
  pages =        "273--284",
  year =         "2013",
  DOI =          "https://doi.org/10.1145/2463664.2465224",
  bibdate =      "Wed Mar 5 07:53:56 MST 2014",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We consider the problem of computing a relational
                 query q on a large input database of size n, using a
                 large number p of servers. The computation is performed
                 in rounds, and each server can receive only O ( n/p$^{1
                 - \epsilon }$ ) bits of data, where \epsilon \in [0,1]
                 is a parameter that controls replication. We examine
                 how many global communication steps are needed to
                 compute q. We establish both lower and upper bounds, in
                 two settings. For a single round of communication, we
                 give lower bounds in the strongest possible model,
                 where arbitrary bits may be exchanged; we show that any
                 algorithm requires \epsilon {$>$}= 1--1/ \tau *, where
                 \tau * is the fractional vertex cover of the hypergraph
                 of q. We also give an algorithm that matches the lower
                 bound for a specific class of databases. For multiple
                 rounds of communication, we present lower bounds in a
                 model where routing decisions for a tuple are
                 tuple-based. We show that for the class of tree-like
                 queries there exists a tradeoff between the number of
                 rounds and the space exponent \epsilon . The lower
                 bounds for multiple rounds are the first of their kind.
                 Our results also imply that transitive closure cannot
                 be computed in O (1) rounds of communication.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Wong:2013:DIE,
  author =       "Limsoon Wong",
  title =        "A dichotomy in the intensional expressive power of
                 nested relational calculi augmented with aggregate
                 functions and a powerset operator",
  crossref =     "Hull:2013:SPC",
  pages =        "285--296",
  year =         "2013",
  DOI =          "https://doi.org/10.1145/2463664.2463670",
  bibdate =      "Wed Mar 5 07:53:56 MST 2014",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "The extensional aspect of expressive power---i.e.,
                 what queries can or cannot be expressed---has been the
                 subject of many studies of query languages.
                 Paradoxically, although efficiency is of primary
                 concern in computer science, the intensional aspect of
                 expressive power---i.e., what queries can or cannot be
                 implemented efficiently---has been much neglected.
                 Here, we discuss the intensional expressive power of
                 NRC($Q$, +, $ \cdot $, $ \div $, $ \Sigma $, powerset),
                 a nested relational calculus augmented with aggregate
                 functions and a powerset operation. We show that
                 queries on structures such as long chains, deep trees,
                 etc. have a dichotomous behaviour: Either they are
                 already expressible in the calculus without using the
                 powerset operation or they require at least exponential
                 space. This result generalizes in three significant
                 ways several old dichotomy-like results, such as that
                 of Suciu and Paredaens that the complex object algebra
                 of Abiteboul and Beeri needs exponential space to
                 implement the transitive closure of a long chain.
                 Firstly, a more expressive query language---in
                 particular, one that captures SQL---is considered here.
                 Secondly, queries on a more general class of structures
                 than a long chain are considered here. Lastly, our
                 proof is more general and holds for all query languages
                 exhibiting a certain normal form and possessing a
                 locality property.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kazana:2013:EFO,
  author =       "Wojciech Kazana and Luc Segoufin",
  title =        "Enumeration of first-order queries on classes of
                 structures with bounded expansion",
  crossref =     "Hull:2013:SPC",
  pages =        "297--308",
  year =         "2013",
  DOI =          "https://doi.org/10.1145/2463664.2463667",
  bibdate =      "Wed Mar 5 07:53:56 MST 2014",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We consider the evaluation of first-order queries over
                 classes of databases with bounded expansion. The notion
                 of bounded expansion is fairly broad and generalizes
                 bounded degree, bounded treewidth and exclusion of at
                 least one minor. It was known that over a class of
                 databases with bounded expansion, first-order sentences
                 could be evaluated in time linear in the size of the
                 database. We first give a different proof of this
                 result. Moreover, we show that answers to first-order
                 queries can be enumerated with constant delay after a
                 linear time preprocessing. We also show that counting
                 the number of answers to a query can be done in time
                 linear in the size of the database.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Chen:2013:FCC,
  author =       "Hubie Chen and Moritz M{\"u}ller",
  title =        "The fine classification of conjunctive queries and
                 parameterized logarithmic space complexity",
  crossref =     "Hull:2013:SPC",
  pages =        "309--320",
  year =         "2013",
  DOI =          "https://doi.org/10.1145/2463664.2463669",
  bibdate =      "Wed Mar 5 07:53:56 MST 2014",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "We perform a fundamental investigation of the
                 complexity of conjunctive query evaluation from the
                 perspective of parameterized complexity. We classify
                 sets of boolean conjunctive queries according to the
                 complexity of this problem. Previous work showed that a
                 set of conjunctive queries is fixed-parameter tractable
                 precisely when the set is equivalent to a set of
                 queries having bounded treewidth. We present a fine
                 classification of query sets up to parameterized
                 logarithmic space reduction. We show that, in the
                 bounded treewidth regime, there are three complexity
                 degrees and that the properties that determine the
                 degree of a query set are bounded pathwidth and bounded
                 tree depth. We also engage in a study of the two higher
                 degrees via logarithmic space machine characterizations
                 and complete problems. Our work yields a significantly
                 richer perspective on the complexity of conjunctive
                 queries and, at the same time, suggests new avenues of
                 research in parameterized complexity.",
  acknowledgement = ack-nhfb,
}

%%% ====================================================================
%%% Cross-referenced entries must come last:
@Proceedings{King:1975:ICM,
  editor =       "W. F. King",
  booktitle =    "{International Conference on Management of Data, San
                 Jose, California, May 14, 15 and 16th, 1975}",
  title =        "{International Conference on Management of Data, San
                 Jose, California, May 14, 15 and 16th, 1975}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "v + 245",
  year =         "1975",
  ISBN =         "????",
  ISBN-13 =      "????",
  LCCN =         "????",
  bibdate =      "26 October 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  keywords =     "SIGMOD '75",
}

@Proceedings{Rothnie:1976:ASI,
  editor =       "James B. Rothnie",
  booktitle =    "{ACM-SIGMOD International Conference on Management of
                 Data: [proceedings], June 2, 3 and 4, 1976, Washington,
                 DC}",
  title =        "{ACM-SIGMOD International Conference on Management of
                 Data: [proceedings], June 2, 3 and 4, 1976, Washington,
                 DC}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "vi + 196",
  year =         "1976",
  ISBN =         "",
  ISBN-13 =      "",
  LCCN =         "QA76.9.D3 I59 1976",
  bibdate =      "Thu Oct 26 08:37:05 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  keywords =     "SIGMOD '76",
}

@Proceedings{Smith:1977:ASI,
  editor =       "Diane C. P. Smith",
  booktitle =    "{ACM-SIGMOD International Conference on Management of
                 Data, Toronto, Canada, August 3, 4, and 5, 1977:
                 [proceedings]}",
  title =        "{ACM-SIGMOD International Conference on Management of
                 Data, Toronto, Canada, August 3, 4, and 5, 1977:
                 [proceedings]}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "vi + 182",
  year =         "1977",
  ISBN =         "",
  ISBN-13 =      "",
  LCCN =         "QA76.9.D3 I59 1977",
  bibdate =      "Thu Oct 26 08:35:29 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  keywords =     "SIGMOD '77",
}

@Proceedings{Dale:1978:ASI,
  editor =       "Nell Dale and Eugene Lowenthal",
  booktitle =    "{ACM-SIGMOD International Conference on Management of
                 Data, Austin, Texas, May 31, June 1--2, 1978}",
  title =        "{ACM-SIGMOD International Conference on Management of
                 Data, Austin, Texas, May 31, June 1--2, 1978}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "vii + 180",
  year =         "1978",
  ISBN =         "????",
  ISBN-13 =      "????",
  LCCN =         "????",
  bibdate =      "Tue Jan 13 07:46:04 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@Proceedings{Bernstein:1979:ASI,
  editor =       "Philip A. Bernstein",
  booktitle =    "{ACM-Sigmod 1979 International Conference on
                 Management of Data: proceedings, May 30--June 1, the 57
                 Park Plaza Hotel, Boston, Massachusetts}",
  title =        "{ACM-Sigmod 1979 International Conference on
                 Management of Data: proceedings, May 30--June 1, the 57
                 Park Plaza Hotel, Boston, Massachusetts}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "vi + 202",
  year =         "1979",
  ISBN =         "0-89791-001-X",
  ISBN-13 =      "978-0-89791-001-9",
  LCCN =         "QA76.9.D3 I59 1979",
  bibdate =      "Thu Oct 26 08:33:20 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  keywords =     "SIGMOD '79",
}

@Proceedings{Chen:1980:ASI,
  editor =       "Peter P. Chen and R. Clay Sprowls",
  booktitle =    "{ACM-SIGMOD 1980 International Conference on
                 Management of Data: proceedings, May 14--May 16,
                 Miramar-Sheraton Hotel, Santa Monica, California}",
  title =        "{ACM-SIGMOD 1980 International Conference on
                 Management of Data: proceedings, May 14--May 16,
                 Miramar-Sheraton Hotel, Santa Monica, California}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "vii + 213",
  year =         "1980",
  ISBN =         "0-89791-018-4",
  ISBN-13 =      "978-0-89791-018-7",
  LCCN =         "QA76.9.D3 I59 1980",
  bibdate =      "Thu Oct 26 08:31:52 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  keywords =     "SIGMOD '80",
}

@Proceedings{Lien:1982:ASI,
  editor =       "Y. Edmund Lien",
  booktitle =    "{ACM-SIGMOD 1981 International Conference on
                 Management of Data: [proceedings] April 29--May 1, the
                 University of Michigan, Ann Arbor, Michigan}",
  title =        "{ACM-SIGMOD 1981 International Conference on
                 Management of Data: [proceedings] April 29--May 1, the
                 University of Michigan, Ann Arbor, Michigan}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "viii + 230",
  year =         "1982",
  ISBN =         "0-89791-040-0",
  ISBN-13 =      "978-0-89791-040-8",
  LCCN =         "QA76.9.D3 I59 1981",
  bibdate =      "Thu Oct 26 08:26:23 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  note =         "ACM order number 472810.",
  acknowledgement = ack-nhfb,
  keywords =     "SIGMOD '81",
}

@Proceedings{Schkolnick:1982:PIC,
  editor =       "Mario Schkolnick",
  booktitle =    "{Proceedings / International Conference on Management
                 of Data, June 2--4, Orlando, Florida, 1982}",
  title =        "{Proceedings / International Conference on Management
                 of Data, June 2--4, Orlando, Florida, 1982}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "vii + 302",
  year =         "1982",
  ISBN =         "0-89791-073-7",
  ISBN-13 =      "978-0-89791-073-6",
  LCCN =         "QA 76.9 D3 I59 1982",
  bibdate =      "Thu Oct 26 08:30:30 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  keywords =     "SIGMOD '82",
}

@Proceedings{ACM:1982:PPA,
  editor =       "{ACM}",
  booktitle =    "{PODS '82. Proceedings of the ACM Symposium on
                 Principles of Database Systems: 29--31 March 1982,
                 Marina del Ray Hotel, Los Angeles, California}",
  title =        "{PODS '82. Proceedings of the ACM Symposium on
                 Principles of Database Systems: 29--31 March 1982,
                 Marina del Ray Hotel, Los Angeles, California}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "viii + 305",
  year =         "1982",
  ISBN =         "0-89791-070-2",
  ISBN-13 =      "978-0-89791-070-5",
  LCCN =         "QA76.9.D3 A33 1982",
  bibdate =      "Mon Mar 16 09:07:48 1998",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  keywords =     "PODS '82",
}

@Proceedings{DeWitt:1983:SPA,
  editor =       "David J. DeWitt and Georges Gardarin",
  booktitle =    "{SIGMOD 83: proceedings of annual meeting, database
                 week, San Jose, May 23-26, 1983}",
  title =        "{SIGMOD 83: proceedings of annual meeting, database
                 week, San Jose, May 23-26, 1983}",
  volume =       "13(4)",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "vii + 245",
  year =         "1983",
  ISBN =         "0-89791-104-0",
  ISBN-13 =      "978-0-89791-104-7",
  ISSN =         "0163-5808 (print), 1943-5835 (electronic)",
  LCCN =         "QA 76.9 D3 S53 v.13 no.4",
  bibdate =      "Thu Oct 26 09:32:28 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  series =       j-SIGMOD,
  acknowledgement = ack-nhfb,
  keywords =     "SIGMOD '83",
}

@Proceedings{ACM:1983:PPS,
  editor =       "{ACM}",
  booktitle =    "{PODS '83. Proceedings of the Second ACM SIGACT-SIGMOD
                 Symposium on Principles of Database Systems: 21--23
                 March 1983, Colony Square Hotel, Atlanta, Georgia}",
  title =        "{PODS '83. Proceedings of the Second ACM SIGACT-SIGMOD
                 Symposium on Principles of Database Systems: 21--23
                 March 1983, Colony Square Hotel, Atlanta, Georgia}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "vii + 413",
  year =         "1983",
  ISBN =         "0-89791-097-4",
  ISBN-13 =      "978-0-89791-097-2",
  LCCN =         "QA76.9.D3 A15 1983",
  bibdate =      "Mon Mar 16 09:05:01 1998",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  note =         "ACM order number 475830.",
  acknowledgement = ack-nhfb,
  keywords =     "PODS '83",
}

@Proceedings{Yormark:1984:ASI,
  editor =       "Beatrice Yormark",
  booktitle =    "{ACM-Sigmod International Conference on Management of
                 Data: Proceedings of annual meeting: Boston, MA, June
                 18--21, 1984}",
  title =        "{ACM-Sigmod International Conference on Management of
                 Data: Proceedings of annual meeting: Boston, MA, June
                 18--21, 1984}",
  volume =       "14(2)",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "vi + 333",
  year =         "1984",
  ISBN =         "0-89791-128-8",
  ISBN-13 =      "978-0-89791-128-3",
  ISSN =         "0163-5808 (print), 1943-5835 (electronic)",
  LCCN =         "QA76.9.D3 I59 1984",
  bibdate =      "Thu Oct 26 09:29:35 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  note =         "ACM order number 472840.",
  series =       j-SIGMOD,
  acknowledgement = ack-nhfb,
  keywords =     "SIGMOD '84",
}

@Proceedings{ACM:1984:PPT,
  editor =       "{ACM}",
  booktitle =    "{PODS '84. Proceedings of the Third ACM SIGACT-SIGMOD
                 Symposium on Principles of Database Systems: April
                 2--4, 1984, Waterloo, Ontario, Canada}",
  title =        "{PODS '84. Proceedings of the Third ACM SIGACT-SIGMOD
                 Symposium on Principles of Database Systems: April
                 2--4, 1984, Waterloo, Ontario, Canada}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "335",
  year =         "1984",
  ISBN =         "0-89791-128-8",
  ISBN-13 =      "978-0-89791-128-3",
  LCCN =         "QA76.9.D3 A15 1984",
  bibdate =      "Mon Mar 16 09:06:42 1998",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  note =         "ACM order number 475840.",
  acknowledgement = ack-nhfb,
  keywords =     "PODS '84",
}

@Proceedings{ACM:1985:PPF,
  editor =       "{ACM}",
  booktitle =    "{PODS '85. Proceedings of the Fourth ACM SIGACT-SIGMOD
                 Symposium on Principles of Database Systems, March
                 25--27, 1985, Portland, Oregon}",
  title =        "{PODS '85. Proceedings of the Fourth ACM SIGACT-SIGMOD
                 Symposium on Principles of Database Systems, March
                 25--27, 1985, Portland, Oregon}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "275",
  year =         "1985",
  ISBN =         "0-89791-153-9",
  ISBN-13 =      "978-0-89791-153-5",
  LCCN =         "QA 76.9 D3 A296 1985",
  bibdate =      "Sat Sep 17 10:24:09 1994",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  keywords =     "PODS '85",
}

@Proceedings{Navathe:1985:PAS,
  editor =       "Sham Navathe",
  booktitle =    "{Proceedings of ACM-SIGMOD 1985 International
                 Conference on Management of Data, May 28--31, 1985,
                 LaMansion Hotel, Austin, Texas}",
  title =        "{Proceedings of ACM-SIGMOD 1985 International
                 Conference on Management of Data, May 28--31, 1985,
                 LaMansion Hotel, Austin, Texas}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "vii + 475",
  year =         "1985",
  ISBN =         "0-89791-160-1",
  ISBN-13 =      "978-0-89791-160-3",
  LCCN =         "QA 76.9 D3 I59 1985; QA1 .A87",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  keywords =     "SIGMOD '85",
}

@Proceedings{ACM:1986:PPF,
  editor =       "{ACM}",
  booktitle =    "{PODS '86. Proceedings of the Fifth ACM SIGACT-SIGMOD
                 Symposium on Principles of Database Systems, March
                 24--26, 1986, Cambridge, MA}",
  title =        "{PODS '86. Proceedings of the Fifth ACM SIGACT-SIGMOD
                 Symposium on Principles of Database Systems, March
                 24--26, 1986, Cambridge, MA}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "293",
  year =         "1986",
  ISBN =         "0-89791-179-2",
  ISBN-13 =      "978-0-89791-179-5",
  LCCN =         "QA76.9.D3 A296 1986",
  bibdate =      "Thu Mar 12 18:58:45 1998",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  note =         "ACM order number 475860.",
  acknowledgement = ack-nhfb,
  keywords =     "PODS '86",
}

@Proceedings{Zaniolo:1986:PAS,
  editor =       "Carlo Zaniolo",
  booktitle =    "{Proceedings of ACM SIGMOD '86 International
                 Conference on Management of Data, Washington, D.C. May
                 28--30, 1986}",
  title =        "{Proceedings of ACM SIGMOD '86 International
                 Conference on Management of Data, Washington, D.C. May
                 28--30, 1986}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "xi + 407",
  year =         "1986",
  ISBN =         "0-89791-191-1",
  ISBN-13 =      "978-0-89791-191-7",
  LCCN =         "QA 76.9 D3 A18 1986",
  bibdate =      "Thu Oct 26 08:44:03 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  keywords =     "SIGMOD '86",
}

@Proceedings{ACM:1987:PPS,
  editor =       "{ACM}",
  booktitle =    "{PODS '87. Proceedings of the Sixth ACM
                 SIGACT-SIGMOD-SIGART Symposium on Principles of
                 Database Systems, March 23--25, 1987, San Diego,
                 California}",
  title =        "{PODS '87. Proceedings of the Sixth ACM
                 SIGACT-SIGMOD-SIGART Symposium on Principles of
                 Database Systems, March 23--25, 1987, San Diego,
                 California}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "vii + 363",
  year =         "1987",
  ISBN =         "0-89791-223-3",
  ISBN-13 =      "978-0-89791-223-5",
  LCCN =         "QA76.9.D3A296 1987",
  bibdate =      "Thu Mar 12 19:00:48 1998",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  note =         "ACM Order Number 475870.",
  acknowledgement = ack-nhfb,
  keywords =     "PODS '87",
}

@Proceedings{Dayal:1987:PAC,
  editor =       "Umeshwar Dayal and Irv Traiger",
  booktitle =    "{Proceedings of Association for Computing Machinery
                 Special Interest Group on Management of Data 1987
                 annual conference, San Francisco, May 27--29, 1987}",
  title =        "{Proceedings of Association for Computing Machinery
                 Special Interest Group on Management of Data 1987
                 annual conference, San Francisco, May 27--29, 1987}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "xii + 509",
  year =         "1987",
  ISBN =         "0-89791-236-5",
  ISBN-13 =      "978-0-89791-236-5",
  LCCN =         "QA 76.9 D3 P76 1987",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  note =         "ACM order number 472870.",
  acknowledgement = ack-nhfb,
  keywords =     "SIGMOD '87",
}

@Proceedings{ACM:1988:PAC,
  editor =       "{ACM}",
  booktitle =    "{Proceedings of Association for Computing Machinery
                 Special Interest Group on Management of Data: 1988
                 Annual Conference, Chicago, Illinois, June 1--3}",
  title =        "{Proceedings of Association for Computing Machinery
                 Special Interest Group on Management of Data: 1988
                 Annual Conference, Chicago, Illinois, June 1--3}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "xi + 446",
  year =         "1988",
  ISBN =         "????",
  ISBN-13 =      "????",
  LCCN =         "????",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  note =         "ACM order number 472880.",
  acknowledgement = ack-nhfb,
  keywords =     "SIGMOD '88",
}

@Proceedings{ACM:1988:PPS,
  editor =       "{ACM}",
  booktitle =    "{PODS '88. Proceedings of the Seventh ACM
                 SIGACT-SIGMOD-SIGART Symposium on Principles of
                 Database Systems: March 21--23, 1988, Austin, Texas}",
  title =        "{PODS '88. Proceedings of the Seventh ACM
                 SIGACT-SIGMOD-SIGART Symposium on Principles of
                 Database Systems: March 21--23, 1988, Austin, Texas}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "vi + 352",
  year =         "1988",
  ISBN =         "0-89791-263-2",
  ISBN-13 =      "978-0-89791-263-1",
  LCCN =         "QA76.9.D3 A15 1988",
  bibdate =      "Fri Mar 13 17:16:43 1998",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  keywords =     "PODS '88",
}

@Proceedings{ACM:1989:PPE,
  editor =       "{ACM}",
  booktitle =    "{PODS '89. Proceedings of the Eighth ACM
                 SIGACT-SIGMOD-SIGART Symposium on Principles of
                 Database Systems, March 29--31, 1989, Philadelphia,
                 PA}",
  title =        "{PODS '89. Proceedings of the Eighth ACM
                 SIGACT-SIGMOD-SIGART Symposium on Principles of
                 Database Systems, March 29--31, 1989, Philadelphia,
                 PA}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "vii + 401",
  year =         "1989",
  ISBN =         "0-89791-308-6",
  ISBN-13 =      "978-0-89791-308-9",
  LCCN =         "QA 76.9 D3 A26 1989",
  bibdate =      "Thu Mar 12 19:02:04 1998",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  keywords =     "PODS '89",
}

@Proceedings{Clifford:1989:PAS,
  editor =       "James Clifford and Bruce Lindsay and David Maier",
  booktitle =    "{Proceedings of the 1989 ACM SIGMOD international
                 conference on the management of data, Portland, Oregon,
                 May 31--June 2, 1989}",
  title =        "{Proceedings of the 1989 ACM SIGMOD international
                 conference on the management of data, Portland, Oregon,
                 May 31--June 2, 1989}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "xii + 451",
  year =         "1989",
  ISBN =         "????",
  ISBN-13 =      "????",
  LCCN =         "????",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  keywords =     "SIGMOD '89",
}

@Proceedings{Garcia-Molina:1990:PAS,
  editor =       "Hector Garcia-Molina and H. V. Jagadish",
  booktitle =    "{Proceedings of the 1990 ACM SIGMOD International
                 Conference on Management of Data, May 23--25, 1990,
                 Atlantic City, NJ}",
  title =        "{Proceedings of the 1990 ACM SIGMOD International
                 Conference on Management of Data, May 23--25, 1990,
                 Atlantic City, NJ}",
  volume =       "19(2)",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "xii + 398",
  month =        jun,
  year =         "1990",
  ISBN =         "0-89791-365-5",
  ISBN-13 =      "978-0-89791-365-2",
  ISSN =         "0163-5808 (print), 1943-5835 (electronic)",
  LCCN =         "QA 76.9 D3 S53 v.19 no.2 1990; QA1 .A87",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  series =       j-SIGMOD,
  acknowledgement = ack-nhfb,
  keywords =     "SIGMOD '90",
}

@Proceedings{ACM:1990:PPN,
  editor =       "{ACM}",
  booktitle =    "{PODS '90. Proceedings of the Ninth ACM
                 SIGACT-SIGMOD-SIGART Symposium on Principles of
                 Database Systems: April 2--4, 1990, Nashville,
                 Tennessee}",
  title =        "{PODS '90. Proceedings of the Ninth ACM
                 SIGACT-SIGMOD-SIGART Symposium on Principles of
                 Database Systems: April 2--4, 1990, Nashville,
                 Tennessee}",
  volume =       "51(1)",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "vii + 425",
  year =         "1990",
  ISBN =         "0-89791-352-3",
  ISBN-13 =      "978-0-89791-352-2",
  ISSN =         "0022-0000 (print), 1090-2724 (electronic)",
  LCCN =         "QA 76.9 D3 A26 1990",
  bibdate =      "Fri Mar 13 17:19:13 1998",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  note =         "A few papers from this conference were republished in
                 1995 in the Journal of Computer and Systems Sciences.",
  series =       "Journal of Computer and Systems Sciences",
  acknowledgement = ack-nhfb,
  annote =       "36 papers; See also 6836.1508 1990 9th for papers",
  keywords =     "PODS '90",
  source =       "Principles of database systems",
  sponsor =      "Association for Computing Machinery. Special Interest
                 Group for Automata and Computability Theory Association
                 for Computing Machinery. Special Interest Group for the
                 Management of Data Association for Computing Machinery.
                 Special Interest Group for Artificial Intelligence.",
}

@Proceedings{ACM:1991:PPT,
  editor =       "{ACM}",
  booktitle =    "{PODS '91. Proceedings of the Tenth ACM
                 SIGACT-SIGMOD-SOGART Symposium on Principles of
                 Database Systems: May 29--31, 1991, Denver, Colorado}",
  title =        "{PODS '91. Proceedings of the Tenth ACM
                 SIGACT-SIGMOD-SOGART Symposium on Principles of
                 Database Systems: May 29--31, 1991, Denver, Colorado}",
  volume =       "51(2)",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "vii + 341",
  year =         "1991",
  ISBN =         "0-89791-430-9",
  ISBN-13 =      "978-0-89791-430-7",
  ISSN =         "0022-0000 (print), 1090-2724 (electronic)",
  LCCN =         "QA76.9.D3 A296 1991",
  bibdate =      "Thu Mar 12 19:04:01 1998",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  note =         "ACM order number 475910.",
  series =       "Journal of Computer and Systems Sciences",
  acknowledgement = ack-nhfb,
  keywords =     "PODS '91",
  source =       "Principles of database systems",
  sponsor =      "Association for Computing Machinery. Special Interest
                 Group for Automata and Computability Theory Association
                 for Computing Machinery. Special Interest Group for the
                 Management of Data Association for Computing Machinery.
                 Special Interest Group for Artificial Intelligence.",
}

@Proceedings{Clifford:1998:ASP,
  editor =       "James Clifford and Roger King",
  booktitle =    "{ACM SIGMOD 91: proceedings of the 1991 ACM SIGMOD
                 International Conference on Management of Data, Denver,
                 Colorado, May 29--31, 1991}",
  title =        "{ACM SIGMOD 91: proceedings of the 1991 ACM SIGMOD
                 International Conference on Management of Data, Denver,
                 Colorado, May 29--31, 1991}",
  volume =       "20(2)",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "xii + 452",
  year =         "1998",
  ISBN =         "0-89791-425-2",
  ISBN-13 =      "978-0-89791-425-3",
  ISSN =         "0163-5808 (print), 1943-5835 (electronic)",
  LCCN =         "QA 76.9 D3 S53 v.20 no.2 1991; QA1 .A87",
  bibdate =      "Thu Oct 26 08:49:09 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  series =       j-SIGMOD,
  acknowledgement = ack-nhfb,
  keywords =     "SIGMOD '91",
}

@Proceedings{Kim:1992:DSN,
  editor =       "Won Kim and Y. Kambayashi and In Sup Paik",
  booktitle =    "{Database systems for next-generation applications:
                 principles and practice}",
  title =        "{Database systems for next-generation applications:
                 principles and practice}",
  volume =       "1",
  publisher =    pub-WORLD-SCI,
  address =      pub-WORLD-SCI:adr,
  pages =        "ix + 312",
  year =         "1992",
  ISBN =         "981-02-1315-8",
  ISBN-13 =      "978-981-02-1315-2",
  LCCN =         "QA76.9.D3 D3589 1992",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  series =       "Advanced Database Research and Development Series",
  acknowledgement = ack-nhfb,
  annote =       "Also known as DASFAA '89",
  keywords =     "",
  source =       "Database systems for next-generation applications:
                 principles and practice",
}

@Proceedings{Stonebraker:1992:PAS,
  editor =       "Michael Stonebraker",
  booktitle =    "{Proceedings of the 1992 ACM SIGMOD International
                 Conference on Management of Data, San Diego,
                 California, June 2--5, 1992}",
  title =        "{Proceedings of the 1992 ACM SIGMOD International
                 Conference on Management of Data, San Diego,
                 California, June 2--5, 1992}",
  volume =       "21(2)",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "xiv + 416",
  year =         "1992",
  ISBN =         "0-89791-521-6",
  ISBN-13 =      "978-0-89791-521-2",
  ISSN =         "0163-5808 (print), 1943-5835 (electronic)",
  LCCN =         "????",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  series =       j-SIGMOD,
  acknowledgement = ack-nhfb,
  keywords =     "SIGMOD '92",
}

@Proceedings{ACM:1992:PPE,
  editor =       "{ACM}",
  booktitle =    "{PODS '92. Proceedings of the Eleventh ACM
                 SIGACT-SIGMOD-SIGART Symposium on Principles of
                 Database Systems, June 2--4, 1992, San Diego, CA}",
  title =        "{PODS '92. Proceedings of the Eleventh ACM
                 SIGACT-SIGMOD-SIGART Symposium on Principles of
                 Database Systems, June 2--4, 1992, San Diego, CA}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "viii + 392",
  year =         "1992",
  ISBN =         "0-89791-519-4 (paperback), 0-89791-520-8 (casebound)",
  ISBN-13 =      "978-0-89791-519-9 (paperback), 978-0-89791-520-5
                 (casebound)",
  LCCN =         "QA 76.9 D3 A26 1992",
  bibdate =      "Thu Oct 26 06:42:00 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  note =         "ACM order number 475920.",
  acknowledgement = ack-nhfb,
  keywords =     "PODS '92",
}

@Proceedings{ACM:1993:PPT,
  editor =       "{ACM}",
  booktitle =    "{PODS '93. Proceedings of the Twelfth ACM
                 SIGACT-SIGMOD-SIGART Symposium on Principles of
                 Database Systems: May 25--28, 1993, Washington, DC}",
  title =        "{PODS '93. Proceedings of the Twelfth ACM
                 SIGACT-SIGMOD-SIGART Symposium on Principles of
                 Database Systems: May 25--28, 1993, Washington, DC}",
  volume =       "12",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "vi + 312",
  year =         "1993",
  ISBN =         "0-89791-593-3",
  ISBN-13 =      "978-0-89791-593-9",
  LCCN =         "QA 76.9 D3 A26 1993",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  series =       "Proceedings of the ACM SIGACT SIGMOD SIGART Symposium
                 on Principles of Database Systems",
  acknowledgement = ack-nhfb,
  keywords =     "PODS '93",
  source =       "Principles of database systems",
  sponsor =      "ACM. Special Interest Group for Algorithms and
                 Computation Theory ACM. Special Interest Group for the
                 Management of Data ACM. Special Interest Group for
                 Artificial Intelligence.",
}

@Proceedings{Buneman:1993:PAS,
  editor =       "Peter Buneman and Sushil Jajodia",
  booktitle =    "{Proceedings of the 1993 ACM SIGMOD International
                 Conference on Management of Data, SIGMOD '93,
                 Washington, DC, May 26--28, 1993}",
  title =        "{Proceedings of the 1993 ACM SIGMOD International
                 Conference on Management of Data, SIGMOD '93,
                 Washington, DC, May 26--28, 1993}",
  volume =       "22(2)",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "xvi + 566",
  year =         "1993",
  ISBN =         "0-89791-592-5",
  ISBN-13 =      "978-0-89791-592-2",
  ISSN =         "0163-5808 (print), 1943-5835 (electronic)",
  LCCN =         "QA 76.9 D3 S53 v.22 no.2 1993",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  series =       j-SIGMOD,
  acknowledgement = ack-nhfb,
  keywords =     "SIGMOD '93",
}

@Proceedings{ACM:1994:PPT,
  editor =       "{ACM}",
  booktitle =    "{PODS '94. Proceedings of the Thirteenth ACM
                 SIGACT-SIGMOD-SIGART Symposium on Principles of
                 Database Systems, May 24--26, 1994, Minneapolis, MN}",
  title =        "{PODS '94. Proceedings of the Thirteenth ACM
                 SIGACT-SIGMOD-SIGART Symposium on Principles of
                 Database Systems, May 24--26, 1994, Minneapolis, MN}",
  volume =       "13",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "ix + 313",
  year =         "1994",
  ISBN =         "0-89791-642-5",
  ISBN-13 =      "978-0-89791-642-4",
  LCCN =         "QA 76.9 D3 A26 1994",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  keywords =     "PODS '94",
  source =       "Principles of database systems",
  sponsor =      "Association for Computing Machinery. Special Interest
                 Group for Automata and Computability Theory Association
                 for Computing Machinery. Special Interest Group for the
                 Management of data Association for Computing Machinery.
                 Special Interest Group for Artificial Intelligence.",
}

@Proceedings{Snodgrass:1994:PAS,
  editor =       "Richard T. Snodgrass and Marianne Winslett",
  booktitle =    "{Proceedings of the 1994 ACM SIGMOD International
                 Conference on Management of Data / SIGMOD '94,
                 Minneapolis, Minnesota, May 24--27, 1994}",
  title =        "{Proceedings of the 1994 ACM SIGMOD International
                 Conference on Management of Data / SIGMOD '94,
                 Minneapolis, Minnesota, May 24--27, 1994}",
  volume =       "23(2)",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "xv + 526",
  year =         "1994",
  ISBN =         "0-89791-639-5",
  ISBN-13 =      "978-0-89791-639-4",
  ISSN =         "0163-5808 (print), 1943-5835 (electronic)",
  LCCN =         "QA 76.9 D3 S53 v.23 no.2 1994",
  bibdate =      "Wed Oct 25 08:47:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  series =       j-SIGMOD,
  acknowledgement = ack-nhfb,
  keywords =     "SIGMOD '94",
}

@Proceedings{ACM:1995:PPF,
  editor =       "{ACM}",
  booktitle =    "{PODS '95. Proceedings of the Fourteenth ACM
                 SIGACT-SIGMOD-SIGART Symposium on Principles of
                 Database Systems, PODS 1995, San Jose, California, May
                 22--25, 1995}",
  title =        "{PODS '95. Proceedings of the Fourteenth ACM
                 SIGACT-SIGMOD-SIGART Symposium on Principles of
                 Database Systems, PODS 1995, San Jose, California, May
                 22--25, 1995}",
  volume =       "14",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "viii + 292",
  year =         "1995",
  ISBN =         "0-89791-730-8",
  ISBN-13 =      "978-0-89791-730-8",
  LCCN =         "QA 76.9 D3 A26 1995",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1995 ACM SIGMOD
                 international conference on management of data; Also
                 known as PODS 1995",
  keywords =     "PODS '95",
  source =       "Principles of database systems",
  sponsor =      "Association for Computing Machinery. Special Interest
                 Group for Algorithms and Computation Theory Association
                 for Computing Machinery. Special Interest Group for the
                 Management of Data Association for Computing Machinery.
                 Special Interest Group for Artificial Intelligence.",
}

@Proceedings{ACM:1995:PAS,
  editor =       "{ACM}",
  booktitle =    "{Proceedings of the 1995 ACM SIGMOD International
                 Conference on Management of Data: May 23--25, 1995, San
                 Jose, California}",
  title =        "{Proceedings of the 1995 ACM SIGMOD International
                 Conference on Management of Data: May 23--25, 1995, San
                 Jose, California}",
  volume =       "24(2)",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "xv + 491",
  year =         "1995",
  ISBN =         "0-89791-731-6",
  ISBN-13 =      "978-0-89791-731-5",
  ISSN =         "0163-5808 (print), 1943-5835 (electronic)",
  LCCN =         "QA1 .A87",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  note =         "ACM order number 472950.",
  series =       j-SIGMOD,
  acknowledgement = ack-nhfb,
  keywords =     "SIGMOD '95",
}

@Proceedings{ACM:1996:PPF,
  editor =       "{ACM}",
  booktitle =    "{PODS '96. Proceedings of the Fifteenth ACM
                 SIGACT-SIGMOD-SIGART Symposium on Principles of
                 Database Systems, PODS 1996, Montr{\'e}al, Canada, June
                 3--5, 1996}",
  title =        "{PODS '96. Proceedings of the Fifteenth ACM
                 SIGACT-SIGMOD-SIGART Symposium on Principles of
                 Database Systems, PODS 1996, Montr\'eal, Canada, June
                 3--5, 1996}",
  volume =       "15",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "ix + 240",
  year =         "1996",
  ISBN =         "0-89791-781-2",
  ISBN-13 =      "978-0-89791-781-0",
  LCCN =         "QA 76.9 D3 A26 1996",
  bibdate =      "Sat Dec 7 16:52:15 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  note =         "ACM order number 475960.",
  acknowledgement = ack-nhfb,
  annote =       "Held in conjunction with the 1996 ACM SIGMOD
                 international conference on management of data. Also
                 known as PODS 1996",
  keywords =     "PODS '96",
  source =       "Principles of database systems",
  sponsor =      "Association for Computing Machinery; Special Interest
                 Group for Algorithms and Computational Theory. ACM;
                 Special Interest Group for the Management of Data. ACM;
                 Special Interest Group for Artificial Intelligence.",
}

@Proceedings{Jagadish:1996:PAS,
  editor =       "H. V. Jagadish and Inderpal Singh Mumick",
  booktitle =    "{Proceedings of the 1996 ACM SIGMOD International
                 Conference on Management of Data, Montreal, Quebec,
                 Canada, June 4--6, 1996}",
  title =        "{Proceedings of the 1996 ACM SIGMOD International
                 Conference on Management of Data, Montreal, Quebec,
                 Canada, June 4--6, 1996}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "xii + 560",
  year =         "1996",
  ISBN =         "0-89791-794-4",
  ISBN-13 =      "978-0-89791-794-0",
  LCCN =         "QA 76.9 D3 S53 v.25 no.2 1996; QA1 .A87",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  keywords =     "SIGMOD '96",
}

@Proceedings{Peckman:1997:PAS,
  editor =       "Joan M. Peckman",
  booktitle =    "{Proceedings, ACM SIGMOD International Conference on
                 Management of Data: SIGMOD 1997: May 13--15, 1997,
                 Tucson, Arizona, USA}",
  title =        "{Proceedings, ACM SIGMOD International Conference on
                 Management of Data: SIGMOD 1997: May 13--15, 1997,
                 Tucson, Arizona, USA}",
  volume =       "26(2)",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "xiv + 586",
  year =         "1997",
  ISBN =         "0-89791-911-4",
  ISBN-13 =      "978-0-89791-911-1",
  ISSN =         "0163-5808 (print), 1943-5835 (electronic)",
  LCCN =         "QA1 .A87",
  bibdate =      "Wed Oct 25 08:47:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  series =       j-SIGMOD,
  acknowledgement = ack-nhfb,
  keywords =     "SIGMOD '97",
}

@Proceedings{ACM:1997:PPS,
  editor =       "{ACM}",
  booktitle =    "{PODS '97. Proceedings of the Sixteenth ACM
                 SIG-SIGMOD-SIGART Symposium on Principles of Database
                 Systems, May 12--14, 1997, Tucson, Arizona}",
  title =        "{PODS '97. Proceedings of the Sixteenth ACM
                 SIG-SIGMOD-SIGART Symposium on Principles of Database
                 Systems, May 12--14, 1997, Tucson, Arizona}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "viii + 268",
  year =         "1997",
  ISBN =         "0-89791-910-6",
  ISBN-13 =      "978-0-89791-910-4",
  LCCN =         "QA 76.9 D3 A26 1997",
  bibdate =      "Wed Oct 25 05:41:24 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
  keywords =     "PODS '97",
}

@Proceedings{Haas:1998:PAS,
  editor =       "Laura Haas and Ashutosh Tiwary",
  booktitle =    "{Proceedings of the 1998 ACM SIGMOD International
                 Conference on Management of Data: June 1--4, 1998,
                 Seattle, Washington, USA}",
  title =        "{Proceedings of the 1998 ACM SIGMOD International
                 Conference on Management of Data: June 1--4, 1998,
                 Seattle, Washington, USA}",
  volume =       "27(2)",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "xiii + 599",
  year =         "1998",
  ISBN =         "????",
  ISBN-13 =      "????",
  ISSN =         "0163-5808 (print), 1943-5835 (electronic)",
  LCCN =         "QA1 .A87",
  bibdate =      "Wed Oct 25 08:47:44 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  series =       j-SIGMOD,
  acknowledgement = ack-nhfb,
  keywords =     "SIGMOD '98",
}

@Proceedings{ACM:1998:PPA,
  editor =       "{ACM}",
  booktitle =    "{PODS '98. Proceedings of the ACM
                 SIGACT--SIGMOD--SIGART Symposium on Principles of
                 Database Systems, June 1--3, 1998, Seattle,
                 Washington}",
  title =        "{PODS '98. Proceedings of the ACM
                 SIGACT--SIGMOD--SIGART Symposium on Principles of
                 Database Systems, June 1--3, 1998, Seattle,
                 Washington}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "ix + 286",
  year =         "1998",
  ISBN =         "0-89791-996-3",
  ISBN-13 =      "978-0-89791-996-8",
  LCCN =         "QA76.9.D3 A296 1998",
  bibdate =      "Wed Oct 25 05:37:57 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  note =         "ACM order number 475980.",
  acknowledgement = ack-nhfb,
  keywords =     "PODS '98",
  source =       "Principles of database systems",
  sponsor =      "ACM; Special Interest Group for Algorithms and
                 Computation Theory. ACM; Special Interest Group for the
                 Management of Data. ACM; Special Interest Group for
                 Artificial Intelligence.",
}

@Proceedings{Delis:1999:PAS,
  editor =       "Alex Delis and Christos Faloutsos and Shahram
                 Ghandeharizadeh",
  booktitle =    "{Proceedings of the 1999 ACM SIGMOD International
                 Conference on Management of Data: SIGMOD '99,
                 Philadelphia, PA, USA, June 1--3, 1999}",
  title =        "{Proceedings of the 1999 ACM SIGMOD International
                 Conference on Management of Data: SIGMOD '99,
                 Philadelphia, PA, USA, June 1--3, 1999}",
  volume =       "28(2)",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "xii + 602",
  year =         "1999",
  ISBN =         "????",
  ISBN-13 =      "????",
  ISSN =         "0163-5808 (print), 1943-5835 (electronic)",
  LCCN =         "QA1 .A87",
  bibdate =      "Wed Oct 25 08:47:40 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  series =       j-SIGMOD,
  acknowledgement = ack-nhfb,
  keywords =     "SIGMOD '99",
}

@Proceedings{ACM:1999:PEA,
  editor =       "{ACM}",
  booktitle =    "{Proceedings of the Eighteenth ACM
                 SIGMOD-SIGACT-SIGART Symposium on Principles of
                 Database Systems: PODS 1999: Philadelphia,
                 Pennsylvania, May 31--June 2, 1999}",
  title =        "{Proceedings of the Eighteenth ACM
                 SIGMOD-SIGACT-SIGART Symposium on Principles of
                 Database Systems: PODS 1999: Philadelphia,
                 Pennsylvania, May 31--June 2, 1999}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "ix + 369",
  year =         "1999",
  ISBN =         "1-58113-062-7",
  ISBN-13 =      "978-1-58113-062-1",
  LCCN =         "QA76.9.D3 A296 1999",
  bibdate =      "Wed Oct 25 05:30:41 MDT 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib; OCLC
                 Proceedings database",
  note =         "ACM order number 475990.",
  acknowledgement = ack-nhfb,
  keywords =     "PODS '99",
}

@Proceedings{Chen:2000:PAS,
  editor =       "Weidong Chen and Jeffery Naughton and Philip A.
                 Bernstein",
  booktitle =    "{Proceedings of the 2000 ACM SIGMOD International
                 Conference on Management of Data: May 16--18, 2000,
                 Dallas, Texas}",
  title =        "{Proceedings of the 2000 ACM SIGMOD International
                 Conference on Management of Data: May 16--18, 2000,
                 Dallas, Texas}",
  volume =       "29(2)",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "xii + 604",
  year =         "2000",
  ISBN =         "????",
  ISBN-13 =      "????",
  ISSN =         "0163-5808 (print), 1943-5835 (electronic)",
  LCCN =         "QA1 .A87",
  bibdate =      "Wed Oct 25 08:47:39 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  series =       j-SIGMOD,
  acknowledgement = ack-nhfb,
  keywords =     "SIGMOD '2000",
}

@Proceedings{ACM:2001:PTA,
  editor =       "{ACM}",
  booktitle =    "{Proceedings of the Twentieth ACM SIGMOD-SIGACT-SIGART
                 Symposium on Principles of Database Systems: PODS 2001:
                 Santa Barbara, California, May 21--23, 2001}",
  title =        "{Proceedings of the Twentieth ACM SIGMOD-SIGACT-SIGART
                 Symposium on Principles of Database Systems: PODS 2001:
                 Santa Barbara, California, May 21--23, 2001}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "viii + 301",
  year =         "2001",
  ISBN =         "1-58113-361-8",
  ISBN-13 =      "978-1-58113-361-5",
  ISSN =         "0163-5808 (print), 1943-5835 (electronic)",
  LCCN =         "QA76.9.D3 A296 2001",
  bibdate =      "Wed Feb 20 08:09:39 2002",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  note =         "ACM order number 475010.",
  series =       j-SIGMOD,
  acknowledgement = ack-nhfb,
  keywords =     "PODS '2001",
  xxnote =       "Check editor??",
}

@Proceedings{Sellis:2001:PAS,
  editor =       "Timos Sellis and Sharad Mehrotra",
  booktitle =    "{Proceedings of the 2001 ACM SIGMOD International
                 Conference on Management of Data 2001, Santa Barbara,
                 California, United States, May 21--24, 2001}",
  title =        "{Proceedings of the 2001 ACM SIGMOD International
                 Conference on Management of Data 2001, Santa Barbara,
                 California, United States, May 21--24, 2001}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "xv + 630",
  year =         "2001",
  ISBN =         "????",
  ISBN-13 =      "????",
  ISSN =         "0163-5808 (print), 1943-5835 (electronic)",
  LCCN =         "????",
  bibdate =      "Fri Oct 31 08:06:56 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  note =         "ACM order number 472010.",
  acknowledgement = ack-nhfb,
}

@Proceedings{Franklin:2002:PAS,
  editor =       "Michael Franklin and Bongki Moon and Anastassia
                 Ailamaki",
  booktitle =    "{Proceedings of the ACM SIGMOD International
                 Conference on Management of Data, June 3--6, 2002,
                 Madison, WI, USA}",
  title =        "{Proceedings of the ACM SIGMOD International
                 Conference on Management of Data, June 3--6, 2002,
                 Madison, WI, USA}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "xiv + 641",
  year =         "2002",
  ISBN =         "????",
  ISBN-13 =      "????",
  LCCN =         "????",
  bibdate =      "Fri Oct 31 08:15:18 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  note =         "ACM order number 475020.",
  acknowledgement = ack-nhfb,
}

@Proceedings{ACM:2002:PTF,
  editor =       "{ACM}",
  booktitle =    "{Proceedings of the Twenty-First ACM
                 SIGMOD-SIGACT-SIGART Symposium on Principles of
                 Database Systems: PODS 2002: Madison, Wisconsin, June
                 3--5, 2002}",
  title =        "{Proceedings of the Twenty-First ACM
                 SIGMOD-SIGACT-SIGART Symposium on Principles of
                 Database Systems: PODS 2002: Madison, Wisconsin, June
                 3--5, 2002}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "viii + 303",
  year =         "2002",
  ISBN =         "1-58113-507-6",
  ISBN-13 =      "978-1-58113-507-7",
  LCCN =         "QA76.9.D3 A296 2002",
  bibdate =      "Fri Oct 31 08:16:45 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  note =         "ACM order number 475021.",
  acknowledgement = ack-nhfb,
}

@Proceedings{ACM:2003:PTS,
  editor =       "{ACM}",
  booktitle =    "{Proceedings of the Twenty-Second ACM
                 SIGMOD-SIGACT-SIGART Symposium on Principles of
                 Database Systems: PODS 2003: San Diego, Calif., June
                 9--11, 2003}",
  title =        "{Proceedings of the Twenty-Second ACM
                 SIGMOD-SIGACT-SIGART Symposium on Principles of
                 Database Systems: PODS 2003: San Diego, Calif., June
                 9--11, 2003}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "viii + 308",
  year =         "2003",
  ISBN =         "1-58113-670-6",
  ISBN-13 =      "978-1-58113-670-8",
  LCCN =         "QA76.9.D3 A296 2003",
  bibdate =      "Fri Oct 31 08:19:07 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  note =         "ACM order number 475030",
  acknowledgement = ack-nhfb,
}

@Proceedings{ACM:2003:PAS,
  editor =       "{ACM}",
  booktitle =    "{Proceedings of the 2003 ACM SIGMOD International
                 Conference on Management of Data 2003, San Diego,
                 California, June 09--12, 2003}",
  title =        "{Proceedings of the 2003 ACM SIGMOD International
                 Conference on Management of Data 2003, San Diego,
                 California, June 09--12, 2003}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "xvi + 687",
  year =         "2003",
  ISBN =         "1-58113-634-X",
  ISBN-13 =      "978-1-58113-634-0",
  LCCN =         "????",
  bibdate =      "Fri Oct 31 08:24:52 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@Proceedings{ACM:2004:PAS,
  editor =       "{ACM}",
  booktitle =    "{Proceedings of the 2004 ACM SIGMOD International
                 Conference on Management of Data 2004, Paris, France,
                 June 13--18, 2004}",
  title =        "{Proceedings of the 2004 ACM SIGMOD International
                 Conference on Management of Data 2004, Paris, France,
                 June 13--18, 2004}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "xix + 974",
  year =         "2004",
  ISBN =         "1-58113-859-8",
  ISBN-13 =      "978-1-58113-859-7",
  LCCN =         "????",
  bibdate =      "Fri Oct 31 08:24:52 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@Proceedings{ACM:2005:PTF,
  editor =       "{ACM}",
  booktitle =    "{Proceedings of the Twenty-Fourth ACM
                 SIGMOD-SIGACT-SIGART Symposium on Principles of
                 Database Systems: PODS 2005: Baltimore, Maryland, June
                 13-15, 2005}",
  title =        "{Proceedings of the Twenty-Fourth ACM
                 SIGMOD-SIGACT-SIGART Symposium on Principles of
                 Database Systems: PODS 2005: Baltimore, Maryland, June
                 13-15, 2005}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "x + 380",
  year =         "2005",
  ISBN =         "1-59593-062-0",
  ISBN-13 =      "978-1-59593-062-0",
  LCCN =         "QA76.9.D3 A296 2005",
  bibdate =      "Wed Aug 23 12:13:46 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib;
                 melvyl.cdlib.org:210/CDL90",
  note =         "ACM order number 475050.",
  acknowledgement = ack-nhfb,
}

@Proceedings{ACM:2006:PTF,
  editor =       "{ACM}",
  booktitle =    "{Proceedings of the Twenty-Fifth ACM
                 SIGMOD-SIGACT-SIGART Symposium on Principles of
                 Database Systems, Chicago, IL, USA June 26--28, 2006}",
  title =        "{Proceedings of the Twenty-Fifth ACM
                 SIGMOD-SIGACT-SIGART Symposium on Principles of
                 Database Systems, Chicago, IL, USA June 26--28, 2006}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "xii + 366",
  year =         "2006",
  ISBN =         "1-59593-318-2",
  ISBN-13 =      "978-1-59593-318-8",
  LCCN =         "QA76.9.D3 A296 2006",
  bibdate =      "Wed Aug 23 12:13:46 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@Proceedings{ACM:2007:PTS,
  editor =       "ACM",
  booktitle =    "{Proceedings of the Twenty-Sixth ACM
                 SIGMOD-SIGACT-SIGART Symposium on Principles of
                 Database Systems: PODS 2007, Beijing, China, June
                 11--13, 2007}",
  title =        "{Proceedings of the Twenty-Sixth ACM
                 SIGMOD-SIGACT-SIGART Symposium on Principles of
                 Database Systems: PODS 2007, Beijing, China, June
                 11--13, 2007}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "xi + 313",
  year =         "2007",
  ISBN =         "1-59593-685-8",
  ISBN-13 =      "978-1-59593-685-1",
  LCCN =         "????",
  bibdate =      "Fri Jun 20 13:10:08 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  meetingname =  "ACM SIGACT-SIGMOD-SIGART Symposium on Principles of
                 Database Systems (26th : 2007 : Beijing, China)",
}

@Proceedings{Lenzerini:2008:PTS,
  editor =       "Maurizio Lenzerini and Domenico Lembo",
  booktitle =    "{Proceedings of the Twenty-Seventh ACM
                 SIGMOD-SIGACT-SIGART Symposium on Principles of
                 Database Systems: PODS'08, Vancouver, BC, Canada, June
                 9--11, 2008}",
  title =        "{Proceedings of the Twenty-Seventh ACM
                 SIGMOD-SIGACT-SIGART Symposium on Principles of
                 Database Systems: PODS'08, Vancouver, BC, Canada, June
                 9--11, 2008}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "xi + 313",
  year =         "2008",
  ISBN =         "1-60560-932-3",
  ISBN-13 =      "978-1-60560-932-4",
  LCCN =         "????",
  bibdate =      "Fri Jun 20 13:10:29 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 https://www.math.utah.edu/pub/tex/bib/java2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  xxISBN =       "1-59593-685-8",
  xxisbn-13 =    "978-1-59593-685-1",
  xxnote =       "There is library confusion about the ISBN: I found
                 1-60558-152-6 (tagged invalid in catalog),
                 1-605-60932-3, 1-59593-685-9, 1-59593-685-X (invalid
                 checksum).",
}

@Proceedings{Paredaens:2009:PTE,
  editor =       "Jan Paredaens and Jianwen Su",
  booktitle =    "{Proceedings of the twenty-eighth ACM
                 SIGMOD-SIGACT-SIGART symposium on Principles of
                 database systems: PODS'09, Providence, Rhode Island,
                 June 29--July 1, 2009}",
  title =        "{Proceedings of the twenty-eighth ACM
                 SIGMOD-SIGACT-SIGART symposium on Principles of
                 database systems, PODS'09, Providence, Rhode Island,
                 June 29--July 1, 2009}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "x + 288",
  year =         "2009",
  ISBN =         "1-60558-553-X",
  ISBN-13 =      "978-1-60558-553-6",
  LCCN =         "????",
  bibdate =      "Thu Jul 02 12:41:14 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib",
  acknowledgement = ack-nhfb,
}

@Proceedings{VanGucht:2010:PPT,
  editor =       "Dirk {Van Gucht}",
  booktitle =    "{PODS'10: proceedings of the Twenty-Ninth ACM
                 SIGMOD-SIGACT-SIGART Symposium on Principles of
                 Database Systems: Indianapolis, Indiana, USA, June
                 6--11, 2010}",
  title =        "{PODS'10: proceedings of the Twenty-Ninth ACM
                 SIGMOD-SIGACT-SIGART Symposium on Principles of
                 Database Systems: Indianapolis, Indiana, USA, June
                 6--11, 2010}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "x + 339",
  year =         "2010",
  ISBN =         "1-4503-0033-2",
  ISBN-13 =      "978-1-4503-0033-9",
  LCCN =         "????",
  bibdate =      "Mon Mar 28 12:28:38 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/pods.bib;
                 z3950.gbv.de:20011/gvk",
  acknowledgement = ack-nhfb,
}

@Proceedings{Lenzerini:2011:PPT,
  editor =       "Maurizio Lenzerini",
  booktitle =    "{PODS'11: Proceedings of the thirtieth ACM
                 SIGMOD-SIGACT-SIGART symposium on Principles of
                 database systems: June 13--15, 2011, Athens, Greece}",
  title =        "{PODS'11: Proceedings of the thirtieth ACM
                 SIGMOD-SIGACT-SIGART symposium on Principles of
                 database systems: June 13--15, 2011, Athens, Greece}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "322",
  year =         "2011",
  ISBN =         "1-4503-0660-8",
  ISBN-13 =      "978-1-4503-0660-7",
  LCCN =         "????",
  bibdate =      "Mon Apr 23 08:23:08 MDT 2012",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://dl.acm.org/citation.cfm?id=1989284",
  acknowledgement = ack-nhfb,
  subject =      "Informatique; Congr\`es; Ordinateurs",
}

@Proceedings{Krotzsch:2012:PPA,
  editor =       "Markus Kr{\"o}tzsch and Maurizio Lenzerini and Michael
                 Benedikt",
  booktitle =    "{PODS'12: Proceedings of the 31st ACM
                 SIGMOD-SIGACT-SIGART symposium on Principles of
                 database systems: May 20--24, 2012, Scottsdale, AZ,
                 USA}",
  title =        "{PODS'12: Proceedings of the 31st ACM
                 SIGMOD-SIGACT-SIGART symposium on Principles of
                 database systems: May 20--24, 2012, Scottsdale, AZ,
                 USA}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "????",
  year =         "2012",
  ISBN =         "????",
  LCCN =         "????",
  bibdate =      "Tue Nov 06 11:29:58 2012",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://www.sigmod.org/2012/",
  acknowledgement = ack-nhfb,
  subject =      "Informatique; Congr\`es; Ordinateurs",
}

@Proceedings{Hull:2013:SPC,
  editor =       "Richard Hull and Wenfei Fan",
  booktitle =    "{SIGMOD/PODS'13: compilation proceedings of the 2013
                 ACM Symposium on Principles of Database Systems, ACM
                 SIGMOD international conference on management of data,
                 and SIGMOD/PODS 2013 PhD symposium: June 22--27, 2013,
                 New York, New York, USA}",
  title =        "{SIGMOD/PODS'13: compilation proceedings of the 2013
                 ACM Symposium on Principles of Database Systems, ACM
                 SIGMOD international conference on management of data,
                 and SIGMOD/PODS 2013 PhD symposium: June 22--27, 2013,
                 New York, New York, USA}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "????",
  year =         "2013",
  ISBN =         "1-4503-2066-X, 1-4503-2037-6",
  ISBN-13 =      "978-1-4503-2066-5, 978-1-4503-2037-5",
  LCCN =         "????",
  bibdate =      "Wed Mar 5 07:48:23 MST 2014",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/hash.bib;
                 https://www.math.utah.edu/pub/tex/bib/pods.bib",
  URL =          "http://dl.acm.org/citation.cfm?id=2463664;
                 http://www.sigmod.org/2013/",
  acknowledgement = ack-nhfb,
}