Research Papers

Send the abstract electronically using the interface through this link on or before 5 p.m. PST, November 17, 2000.

Send the full paper electronically (PDF - preferred, or Postscript) during the registration of the abstract or through a URL that you will receive when registering the abstract, on or before 5 p.m. PST, November 27, 2000,  or, if that is impossible for you, send 6 hard copies of the full paper to:

    Timos Sellis
    Computer Science Division
    Department of Electrical and Computer Engineering
    National Technical University of Athens
    Zographou 157 73, Athens GREECE
    Tel: +30-1-772-1601
    FAX: +30-1-772-1442

to arrive on or before 5 p.m. (Athens, Greece time) November 27, 2000.  Note that electronic submissions are STRONGLY preferred (and that you get many extra hours to prepare your paper if you submit electronically!) Submitters will be required to send in a timely fashion hard copy if their electronic version cannot be printed.

Detailed Instructions:

Papers should be no more than 25 pages, 1.5 spaced, in no smaller than 10 point font with 1 inch margins (left, right, top, bottom.)  The program committee may reject papers that exceed this length limit on the grounds of length alone.

All submitted papers will be judged based on their quality and relevance through double-blind reviewing, where the identities of the authors are withheld from the reviewers. Consult the Anonymity tips for information on preparing a manuscript for double-blind review. Authors of accepted papers will need to sign an ACM copyright release form and present their paper at the conference.

Note that for accepted papers, an electronic version of the final paper is required by the camera-ready due date (March 2, 2001.)  Be aware that the paper will be released shortly after the camera-ready copy date, so any patent applications should be made before then.

Demonstrations

Note: demo submissions need NOT hide author information
Send the submission electronically using this link  on or before 5 p.m. PST, November 27, 2000. If that's impossible for you, then send e-mail (ASCII, Word, Postcript or PDF) or, if necessary, hard copy to:

       Mike Franklin
        Computer Science Division
        387 Soda Hall #1776
        University of California, Berkeley
        Berkeley, CA 94720 - 1776
        USA

       Submission by Fax:  +30-1-772-1659

to arrive by 5 p.m. PST November 27, 2000.  Note that electronic submissions are STRONGLY preferred. Submitters will be required to send in a timely fashion hard copy if their electronic version cannot be printed.

Detailed Instructions:

The Demos program has become rich and competitive in the recent years.  Demos of large and innovative systems are solicited.  Submit up to 5 pages in hard copy or in electronic form (PDF --- preferred, Postscript, Word, or ASCII) to the Demonstrations Chair (above). Demonstration proposals will be evaluated and selected by the demonstration/exhibit program evaluation committee.

Successful demo proposals are expected to provide one page of description for the electronic and printed proceedings, by the camera-ready due date (March 2, 2001). Other arrangements necessary to perform the demonstrations, will be made after communication with the Local Demonstrations Chair.

Industrial Program

Send the full paper electronically using the interface through this link  on or before 5 p.m. PST, November 27, 2000. If that's impossible for you, then send e-mail (ASCII, Word, Postcript or PDF) or, if necessary, hard copy to:

    Guy Lohman
    Exploratory Database Systems (K55)
    IBM Almaden Research Center
    K55/B1, 650 Harry Road
    San Jose, CA 95120-6099
    USA
    FAX: +1-408-927-3215

to arrive by 5 p.m. PST November 27, 2000.  Note that electronic submissions are STRONGLY preferred. Submitters will be required to send in a timely fashion hard copy if their electronic version cannot be printed.

Detailed Instructions:

Authors should submit either an extended abstract (5 pages maximum) or full paper (same length restriction as research papers).  The ideal submissions are industry reports on new developments in DBMS technology, describing experiences using or developing database management systems, or issues arising from handling large volumes of data in an application setting.

A full paper is expected to have similar technical depth and importance as research papers, but need not have novel research contributions.  The committee may accept a full paper contingent on its being shortened to an extended abstract.  Full papers should be 1.5 spaced, in no smaller than 10 point font and with 1 inch margins (left, right, top, bottom).

All submitted papers will be judged based on their quality and relevance through double-blind reviewing, where the identities of the authors are withheld from the reviewers. Consult the Anonymity tips for information on preparing a manuscript for double-blind review. Authors of accepted papers will need to sign an ACM copyright release form and present their paper at the conference.

Authors of accepted submissions are expected to provide their extended abstract or paper for the electronic proceedings, by the camera-ready due date (March 2, 2001). Be aware that the paper will be released shortly after the camera-ready copy date, so any patent applications should be made before then.

Panels

Send hard copy or e-mail - ASCII only - (do NOT hide author information) to:

    Philip A. Bernstein
    Microsoft Corporation
    One Microsoft Way
    Redmond, WA 98052-6399

to arrive by 5 p.m. PST November 27, 2000.

Detailed instructions:

Panels are expected to address new, exciting, and controversial issues.  Proposals should include a summary of the topic and a list of confirmed participants and their qualifications.  Proposal writers should review detailed guidelines at: http://www.research.microsoft.com/~philbe/panelproposals.htm

Successful panel proposals are expected to provide one page of description for the electronic and printed proceedings, by the camera-ready due date (March 2, 2001).

Tutorials

Send hard copy or e-mail - ASCII, Word, Postcript or PDF - (do NOT hide author information) to arrive by 5 p.m. November 27, 2000 to:

    Gerhard Weikum
    University of the Saarland
    Department of Computer Science
    Im Stadtwald
    Building 36, Room 326
    D-66123 Saarbruecken
    Germany
    Fax: +49-681-302-4014

Note that electronic submissions are STRONGLY preferred. Submitters will be required to send in a timely fashion hard copy if their electronic version cannot be printed.

Detailed Instructions:

Tutorial proposals must be at most 5 pages, they must identify the intended audience, and they must give enough material to provide a sense of what will be covered.  Target duration: 1.5 hours.

Successful tutorial proposals are expected to provide one page of description for the electronic and printed proceedings, by the camera-ready due date (March 2, 2001) and the presentation material(foils, etc) for distribution and the electronic proceedings, when requested by the conference officials.

Anonymity Tips

All papers submitted to the conference undergo a "double-blind" reviewing process - the authors do not know the identity of the program committee members and referees who review the paper, nor do the program committee members and referees know the identity of the authors.

In order to preserve the anonymity of authorship, authors must take care in preparing their manuscript:

Remove authors' names and affiliations from the title page.

Remove acknowledgement of funding sources(s) from the title page.

Use care in naming your files.  For example, if your name is Joe Smith and you submit a postscript file generated from a .dvi file called Joe.Smith.dvi, one might easily infer that you are the author by looking into the postscript file.

In our previous work [1,2], we presented two algorithms for ....  In this paper, we build on that work by ..

Bibliography

[1] Joe Smith, "A Simple Algorithm for  ...," Proceeedings of ACM  SIGMOD 1997, pp. 1 - 10.

[2] Joe Smith, "A More Complicated Algorithm for..," Proceeedings of ACM SIGMOD 1998, pp. 34 - 44

In previous work [1,2], algorithms were presented for .... In this paper, we build on that work by ..

Bibliography

[1] Joe Smith, "A Simple Algorithm for  ...," Proceeedings of ACM  SIGMOD 1997, pp. 1 - 10.

[2] Joe Smith, "A More Complicated Algorithm for..," Proceeedings of ACM SIGMOD 1998, pp. 34 - 44

Bibliography

[1] reference removed for double blind reviewing

[2] reference removed for double blind reviewing

In the end, common sense and careful writing can go a long way towards preserving anonymity.  Remember -  the goal is to preserve anonymity while at the same time allowing the reader to fully grasp the context (related past work, including your own) of the submitted paper.