PODS Technical Program

Monday (June 1, 1998)	9-10	Invited Talk: Fuzzy Queries in Multimedia Database Systems -- Ronald Fagin (IBM Almaden Research Center)  Chair: Jan Paredaens (Univ. of Antwerp)
	10-10.30	Break
	10.30-12	Session 1: New Applications   Chair: Dan Suciu (AT&T Labs)	Expressiveness of structured document query languages based on attribute grammars (PODS Co-Best Paper) --- F. Neven, J.Van den Bussche
			A new framework for itemset generation --- C. Aggarwal, P. Yu
			Logic based modeling and analysis of workflows --- H. Davulcu, M. Kifer, C.R.Ramakrishnan, I.V.Ramakrishnan
	12-2	Lunch
	2-3.30	Session 2: Invited Tutorial  An Overview of Query Optimization in Relational Systems -- S. Chaudhuri (Microsoft Research)   Chair: Ken Ross (Columbia Univ.)
	3.30-4	Break
	4-5.30	Session 3: Search and Indexing   Chair: Christos Faloutsos (Univ. of Maryland)	A lower bound theorem for indexing schemes and its application to multidimensional range queries (PODS Co-Best and Best Newcomer Paper) --- V. Samoladas, D. P. Miranker
			Tight bounds for 2-dimensional indexing schemes --- E. Koutsoupias, D. S. Taylor
			A Cost Model for Similarity Queries in Metric Spaces --- P. Ciaccia, M. Patella, P. Zezula
	5.30-6	Break
	6-7	Session 4: Performance  Chair: Surajit Chaudhuri (Microsoft Research)	Data Base Design Principles for Striping and Placement of Delay-Sensitive Data on Disks --- S. Christodoulakis, F. Zioga
			Throughput-competitive admission control for continuous media databases --- M. Garofalakis, Y. Ioannidis, B. Ozden, A. Silberschatz
Tuesday (June 2, 1998)	8.30-10	SIGMOD Opening and Plenary Keynote: Bill Gates (Microsoft Corporation)
	10-10.30	Break
	10.30-12	Session 5: Constraint and Spatial Databases  Chair: Jan Van den Bussche (Univ. of Limburg)	Querying Spatial Databases via Topological Invariants --- L. Segoufin, V. Vianu
			Safe constraint queries --- M. Benedikt, L. Libkin
			An Expressive Language for Linear Spatial Database Queries --- L. Vandeurzen, M. Gyssens, D. Van Gucht
	12-2	SIGMOD/PODS Awards Lunch
	2-3.30	Session 6: Invited Tutorial  External Memory Algorithms -- J. Vitter (Duke Univ.)   Chair: Laks Lakshmanan (Concordia Univ.)
	3.30-4	Break
	4-5.30	Session 7: Semistructured Data  Chair: Victor Vianu (Univ. of California, San Diego)	Path constraints on semistructured and structured databases --- P. Buneman, W. Fan, S. Weinstein
			Query containment for conjunctive queries with regular expressions --- D. Florescu, A. Levy, D. Suciu
			On the Decidability of Query Containment under Constraints --- D. Calvanese, G. D. Giacomo, M. Lenzerini
	5.30-6	Break
	6-7	Session 8: Advanced Information Retrieval  Chair: Alberto Mendelzon (Univ. of Toronto)	Latent semantic indexing: a probabilistic analysis --- C. Papadimitriou, P. Raghavan, H. Tamaki, S. Vempala
			Efficient searching with linear constraints --- P. Agarwal, L. Arge, J. Erickson, P. Franciosa, J. Vitter
Wednesday (June 3, 1998)	8-9.30	Session 9: New Models  Chair: Jeff Vitter (Duke Univ.)	Relational Transducers for Electronic Commerce --- S. Abiteboul, V. Vianu, B. Fordham, Y. Yesha
			Generalizing data to provide anonymity when disclosing information --- P. Samarati, L. Sweeney
			Typed query languages for databases containing queries --- F. Neven, J. Van den Bussche, D. Van Gucht, G. Vossen
	9.30-10	Break
	10-11.30	Session 10: Query Containment  Chair: Leonid Libkin (Bell Labs.)	On the complexity of the containment problem for conjunctive queries with built-in predicates --- P. Kolaitis, D. Martin, M. Thakur
			Conjunctive-Query Containment and Constraint Satisfaction --- P. Kolaitis, M. Vardi
			Deciding equivalences among aggregate queries --- W. Nutt, Y. Sagiv, S. Shurin
	11.30-1.30	Lunch
	1.30-3	Session 11: Invited Tutorial  Data Bases in Digital Libraries: Where Computer Science and Information Management Meet -- J. Klavans (Columbia Univ.)   Chair: Gerhard Weikum (Univ. of Saarland)
	3-3.30	Break
	3.30-5	Session 12: Complexity  Chair: Ronald Fagin (IBM Almaden Research Center)	The complexity of Query Reliability --- E. Gradel, Y. Gurevich, C. Hirsch
			Dynamic Tree Isomorphism via First-Order Updates to a Relational Database --- K. Etessami
			Complexity of Nonrecursive Logic Programs with Complex Values --- S. Vorobyov, A. Voronkov
	5-5.30	Break
	5.30-7	Session 13: Views  Chair: Rajeev Motwani (Stanford Univ.)	Complexity of answering queries using materialized views --- S. Abiteboul, O. Duschka
			Decidability and Undecidability Results for the Termination Problem of Active Database Rules --- J. Bailey, G. Dong, K. Ramamohanarao
			Dynamic assembly of views in data cubes --- J. Smith, C. Li, V. Castelli, A. Jhingran