Abstract is missing.
- Will I be Pretty, Will I be Rich? Some Thoughts on Theory vs. Practice in Systems Engineering (Summary)David Harel. 1-3 [doi]
- Beyond Uniformity and Independence: Analysis of R-trees Using the Concept of Fractal DimensionChristos Faloutsos, Ibrahim Kamel. 4-13 [doi]
- On the Relative Cost of Sampling for Join Selectivity EstimationPeter J. Haas, Jeffrey F. Naughton, Arun N. Swami. 14-24 [doi]
- Path Caching: A Technique for Optimal External SearchingSridhar Ramaswamy, Sairam Subramanian. 25-35 [doi]
- Optimal Response Time Retrieval of Replicated DataLing Tony Chen, Doron Rotem. 36-44 [doi]
- Constraint Checking with Partial InformationAshish Gupta, Yehoshua Sagiv, Jeffrey D. Ullman, Jennifer Widom. 45-55 [doi]
- Compiling Query ConstraintsPeter J. Stuckey, S. Sudarshan. 56-67 [doi]
- Constraints among Argument Sizes in Logic ProgramsKirack Sohn. 68-74 [doi]
- Tutorial Database MiningRakesh Agrawal. 75-76 [doi]
- The Power of Sampling in Knowledge DiscoveryJyrki Kivinen, Heikki Mannila. 77-85 [doi]
- Can Datalog be Approximated?Surajit Chaudhuri, Phokion G. Kolaitis. 86-96 [doi]
- Bounded Arity Datalog (!=) Queries on GraphsFoto N. Afrati. 97-106 [doi]
- On the Complexity of Equivalence between Recursive and Nonrecursive Datalog ProgramsSurajit Chaudhuri, Moshe Y. Vardi. 107-116 [doi]
- A Decomposition-Based Simulated Annealing Technique for Data ClusteringKien A. Hua, Sheau-Dong Lang, Wen K. Lee. 117-128 [doi]
- Reducing Recovery Constraints on Locking based ProtocolsGustavo Alonso, Divyakant Agrawal, Amr El Abbadi. 129-138 [doi]
- Relative Serializbility: An Approach for Relaxing the Atomicity of TransactionsDivyakant Agrawal, John L. Bruno, Amr El Abbadi, Vashudha Krishnaswamy. 139-149 [doi]
- Tutorial: Languages for Collection TypesVal Tannen. 150-154 [doi]
- New Techniques for Studying Set Languages, Bag Languages and Aggregate FunctionsLeonid Libkin, Limsoon Wong. 155-166 [doi]
- A Query Language for NCDan Suciu, Val Tannen. 167-178 [doi]
- A Query Language for List-Based Complex ObjectsLatha S. Colby, Edward L. Robertson, Lawrence V. Saxton, Dirk Van Gucht. 179-189 [doi]
- Universal Finiteness and SatisfiabilityInderpal Singh Mumick, Oded Shmueli. 190-200 [doi]
- Any Algorithm in the Complex Object Algebra with Powerset Needs Exponential Space to Compute Transitive ClosureDan Suciu, Jan Paredaens. 201-209 [doi]
- Dyn-FO: A Parallel, Dynamic Complexity ClassSushant Patnaik, Neil Immerman. 210-221 [doi]
- Functional Database Query Languages as Typed Lambda Calculi of Fixed OrderGerd G. Hillebrand, Paris C. Kanellakis. 222-231 [doi]
- Object MigrationAlberto O. Mendelzon, Tova Milo, Emmanuel Waller. 232-242 [doi]
- Making Object-Oriented Schemas More ExpressiveDiego Calvanese, Maurizio Lenzerini. 243-254 [doi]
- A Polymorphic Calculus for Views and Object SharingAtsushi Ohori, Keishi Tajima. 255-266 [doi]
- Adding Disjunction to DatalogThomas Eiter, Georg Gottlob, Heikki Mannila. 267-278 [doi]
- Towards a Theory of Spatial Database QueriesJan Paredaens, Jan Van den Bussche, Dirk Van Gucht. 279-288 [doi]
- Finitely Representable DatabasesStéphane Grumbach, Jianwen Su. 289-300 [doi]
- Tutorial: Text Dominated Databases, Theory Practice and ExperienceGaston H. Gonnet. 301-302 [doi]
- Reasoning about Strings in DatabasesGösta Grahne, Matti Nykänen, Esko Ukkonen. 303-312 [doi]