Alberto O. Mendelzon, Jan Paredaens
Proceedings of the 17th Symposium on Principles of Database Systems
PODS-1998, 1998.
@proceedings{PODS-1998, acmid = "275487", address = "Seattle, Washington, USA", editor = "Alberto O. Mendelzon and Jan Paredaens", isbn = "0-89791-996-3", publisher = "{ACM Press}", title = "{Proceedings of the 17th Symposium on Principles of Database Systems}", year = 1998, }
Contents (32 items)
- PODS-1998-Fagin #database #fuzzy #multi #query
- Fuzzy Queries in Multimedia Database Systems (RF), pp. 1–10.
- PODS-1998-NevenB #attribute grammar #documentation #query
- Expressiveness of Structured Document Query Languages Based on Attribute Grammars (FN, JVdB), pp. 11–17.
- PODS-1998-AggarwalY #framework #generative
- A New Framework For Itemset Generation (CCA, PSY), pp. 18–24.
- PODS-1998-DavulcuKRR #analysis #logic #modelling #workflow
- Logic Based Modeling and Analysis of Workflows (HD, MK, CRR, IVR), pp. 25–33.
- PODS-1998-Chaudhuri #optimisation #overview #query #relational
- An Overview of Query Optimization in Relational Systems (SC), pp. 34–43.
- PODS-1998-SamoladasM #bound #multi #query #theorem
- A Lower Bound Theorem for Indexing Schemes and Its Application to Multidimensional Range Queries (VS, DPM), pp. 44–51.
- PODS-1998-KoutsoupiasT #2d #bound
- Tight Bounds for 2-Dimensional Indexing Schemes (EK, DST), pp. 52–58.
- PODS-1998-CiacciaPZ #cost analysis #metric #query #similarity
- A Cost Model for Similarity Queries in Metric Spaces (PC, MP, PZ), pp. 59–68.
- PODS-1998-ChristodoulakisZ #database #design
- Data Base Design Principles for Striping and Placement of Delay-Sensitive Data on Disks (SC, FZ), pp. 69–78.
- PODS-1998-GarofalakisIOS #database
- Throughput-Competitive Admission Control for Continuous Media Databases (MNG, YEI, BÖ, AS), pp. 79–88.
- PODS-1998-SegoufinV #database #invariant #query
- Querying Spatial Databases via Topological Invariants (LS, VV), pp. 89–98.
- PODS-1998-BenediktL #constraints #query
- Safe Constraint Queries (MB, LL), pp. 99–108.
- PODS-1998-VandeurzenGG #database #linear #query
- An Expressive Language for Linear Spatial Database Queries (LV, MG, DVG), pp. 109–118.
- PODS-1998-Vitter #algorithm #memory management
- External Memory Algorithms (JSV), pp. 119–128.
- PODS-1998-BunemanFW #constraints #database
- Path Constraints in Semistructured and Structured Databases (PB, WF, SW), pp. 129–138.
- PODS-1998-FlorescuLS #query #regular expression
- Query Containment for Conjunctive Queries with Regular Expressions (DF, AYL, DS), pp. 139–148.
- PODS-1998-CalvaneseGL #constraints #decidability #on the #query
- On the Decidability of Query Containment under Constraints (DC, GDG, ML), pp. 149–158.
- PODS-1998-PapadimitriouRTV #analysis #probability #semantics
- Latent Semantic Indexing: A Probabilistic Analysis (CHP, PR, HT, SV), pp. 159–168.
- PODS-1998-AgarwalAEFV #constraints #linear #performance
- Efficient Searching with Linear Constraints (PKA, LA, JE, PGF, JSV), pp. 169–178.
- PODS-1998-AbiteboulVFY #relational #transducer
- Relational Transducers for Electronic Commerce (SA, VV, BSF, YY), pp. 179–187.
- PODS-1998-SamaratiS
- Generalizing Data to Provide Anonymity when Disclosing Information (PS, LS), p. 188.
- PODS-1998-NevenBGV #database #query
- Typed Query Languages for Databases Containing Queries (FN, JVdB, DVG, GV), pp. 189–196.
- PODS-1998-KolaitisMT #complexity #on the #problem #query
- On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates (PGK, DLM, MNT), pp. 197–204.
- PODS-1998-KolaitisV #constraints
- Conjunctive-Query Containment and Constraint Satisfaction (PGK, MYV), pp. 205–213.
- PODS-1998-NuttSS #query
- Deciding Equivalences Among Aggregate Queries (WN, YS, SS), pp. 214–223.
- PODS-1998-Klavans #database #information management #library
- Data Bases in Digital Libraries: Where Computer Science and Information Management Meet (JK), pp. 224–226.
- PODS-1998-GradelGH #complexity #query #reliability
- The Complexity of Query Reliability (EG, YG, CH), pp. 227–234.
- PODS-1998-Etessami #first-order #morphism
- Dynamic Tree Isomorphism via First-Order Updates (KE), pp. 235–243.
- PODS-1998-VorobyovV #complexity #logic programming #recursion #source code
- Complexity of Nonrecursive Logic Programs with Complex Values (SGV, AV), pp. 244–253.
- PODS-1998-AbiteboulD #complexity #query #using
- Complexity of Answering Queries Using Materialized Views (SA, OMD), pp. 254–263.
- PODS-1998-BaileyDR #database #decidability #problem #termination
- Decidability and Undecidability Results for the Termination Problem of Active Database Rules (JB, GD, KR), pp. 264–273.
- PODS-1998-SmithLCJ #assembly
- Dynamic Assembly of Views in Data Cubes (JRS, CSL, VC, AJ), pp. 274–283.
15 ×#query
9 ×#database
5 ×#constraints
4 ×#complexity
2 ×#analysis
2 ×#bound
2 ×#decidability
2 ×#linear
2 ×#multi
2 ×#on the
9 ×#database
5 ×#constraints
4 ×#complexity
2 ×#analysis
2 ×#bound
2 ×#decidability
2 ×#linear
2 ×#multi
2 ×#on the