|
|
|
|
Author
Index
|
|
(Return
to Top) |
Abiteboul, S.
Reasoning about XML Update Constraints
(Page 195)
On the Complexity of Managing Probabilistic XML Data
(Page 283)
Alur, R.
Marrying Words and Trees
(Page 233)
Awasthi, P.
Decision Trees for Entity Identification: Approximation Algorithms and Hardness Results
(Page 53)
|
| (Return
to Top) |
Badia, A.
Non-Linear Prefixes in Query Languages
(Page 185)
Barak, B.
Privacy, Accuracy, and Consistency Too: A Holistic Solution to Contingency Table Release
(Page 273)
Cautis, B.
Reasoning about XML Update Constraints
(Page 195)
Chakaravarthy, V. T.
Decision Trees for Entity Identification: Approximation Algorithms and Hardness Results
(Page 53)
Chaudhuri, K.
Privacy, Accuracy, and Consistency Too: A Holistic Solution to Contingency Table Release
(Page 273)
Chierichetti, F.
Finding Near Neighbors Through Cluster Pruning
(Page 103)
Cohen, E.
Sketching Unaggregated Data Streams for Subpopulation-size Queries
(Page 253)
|
| (Return
to Top) |
Dalvi, N.
Management of Probabilistic Data Foundations and Challenges
(Page 1)
The Dichotomy of Conjunctive Queries on Probabilistic Structures
(Page 293)
De Giacomo, G.
On Reconciling Data Exchange, Data Integration, and Peer Data Management
(Page 133)
Demers, A.
What is "Next" in Event Processing?
(Page 263)
Duffield, N.
Sketching Unaggregated Data Streams for Subpopulation-size Queries
(Page 253)
Dwork, C.
Privacy, Accuracy, and Consistency Too: A Holistic Solution to Contingency Table Release
(Page 273)
Engelfriet, J.
Best
Newcomer Award: XML Transformation by Tree-Walking Transducers
with Invisible Pebbles (Page
63)
Fagin, R.
Quasi-inverses of Schema Mappings
(Page 123)
Fan, W.
Expressiveness and Complexity of XML Publishing Transducers
(Page 83)
Filiot, E.
Polynomial Time Fragments of XPath with Variables
(Page 205)
|
| (Return
to Top) |
Geerts, F.
Expressiveness and Complexity of XML Publishing Transducers
(Page 83)
Gehrke, J.
What is "Next" in Event Processing?
(Page 263)
Gemulla, R.
Maintaining Bernoulli Samples over Evolving Multisets
(Page 93)
Gottlob, G.
Best
Paper Award: Generalized Hypertree Decompositions: NP-Hardness
and Tractable Variants (Page
13)
Monadic Datalog over Finite Structures with Bounded Treewidth
(Page 165)
Green, T. J.
Provenance Semirings
(Page 31)
Guan, Y.
Variance Estimation over Sliding Windows
(Page 225)
Haas, P. J.
Maintaining Bernoulli Samples over Evolving Multisets
(Page 93)
Hernich, A.
CWA-Solutions for Data Exchange Settings with Target Dependencies
(Page 113)
Hoogeboom, H. J.
Best
Newcomer Award: XML Transformation by Tree-Walking Transducers
with Invisible Pebbles (Page
63)
|
| (Return
to Top) |
Jayram, T. S.
Estimating Statistical Aggregates on Probabilistic Data Streams
(Page 243)
Kale, S.
Privacy, Accuracy, and Consistency Too: A Holistic Solution to Contingency Table Release
(Page 273)
Kaplan, H. J.
Sketching Unaggregated Data Streams for Subpopulation-size Queries
(Page 253)
Karvounarakis, G.
Provenance Semirings
(Page 31)
Kasneci, G.
The Complexity of Reasoning about Pattern-based XML Schemas
(Page 155)
Kimelfeld, B.
Maximally Joining Probabilistic Data
(Page 303)
Kolaitis, P. G.
Quasi-inverses of Schema Mappings
(Page 123)
|
| (Return
to Top) |
Lehner, W.
Maintaining Bernoulli Samples over Evolving Multisets
(Page 93)
Lembo, D.
On Reconciling Data Exchange, Data Integration, and Peer Data Management
(Page 133)
Lenzerini, M.
On Reconciling Data Exchange, Data Integration, and Peer Data Management
(Page 133)
Lund, C.
Sketching Unaggregated Data Streams for Subpopulation-size Queries
(Page 253)
Lutz, C.
The Complexity of Query Containment in Expressive Fragments of XPath 2.0
(Page 73)
|
| (Return
to Top) |
Machlin, R.
Index-Based Multidimensional Array Queries: Safety and Equivalence
(Page 175)
Marx, M.
Queries Determined by Views: Pack Your Views
(Page 23)
McGregor, A.
Estimating Statistical Aggregates on Probabilistic Data Streams
(Page 243)
McSherry, F.
Privacy, Accuracy, and Consistency Too: A Holistic Solution to Contingency Table Release
(Page 273)
Miklós, Z.
Best
Paper Award: Generalized Hypertree Decompositions: NP-Hardness
and Tractable Variants (Page
13)
Milo, T.
Reasoning about XML Update Constraints
(Page 195)
Mohania, M.
Decision Trees for Entity Identification: Approximation Algorithms and Hardness Results
(Page 53)
Munagala, K.
Optimization of Continuous Queries with Shared Expensive Filters
(Page 215)
Muthukrishan, S.
Estimating Statistical Aggregates on Probabilistic Data Streams
(Page 243)
Neven, F.
Expressiveness and Complexity of XML Publishing Transducers
(Page 83)
Niehren, J.
Polynomial Time Fragments of XPath with Variables
(Page 205)
|
| (Return
to Top) |
Panconesi, A.
Finding Near Neighbors Through Cluster Pruning
(Page 103)
Pandit, V.
Decision Trees for Entity Identification: Approximation Algorithms and Hardness Results
(Page 53)
Pichler, R.
Monadic Datalog over Finite Structures with Bounded Treewidth
(Page 165)
Popa, L.
Quasi-inverses of Schema Mappings
(Page 123)
Raghavan, P.
Finding Near Neighbors Through Cluster Pruning
(Page 103)
Riedewald, M.
What is "Next" in Event Processing?
(Page 263)
Rosati, R.
On Reconciling Data Exchange, Data Integration, and Peer Data Management
(Page 133)
Roy, S.
Decision Trees for Entity Identification: Approximation Algorithms and Hardness Results
(Page 53)
|
| (Return
to Top) |
Sagiv, Y.
Maximally Joining Probabilistic Data
(Page 303)
Samwel, B.
Best
Newcomer Award: XML Transformation by Tree-Walking Transducers
with Invisible Pebbles (Page
63)
Schweikardt, N.
Invited
Tutorial 1: Machine Models and Lower Bounds for Query Processing
(Page 41)
CWA-Solutions for Data Exchange Settings with Target Dependencies
(Page 113)
Schwentick, T.
Best
Paper Award: Generalized Hypertree Decompositions: NP-Hardness
and Tractable Variants (Page
13)
The Complexity of Reasoning about Pattern-based XML Schemas
(Page 155)
Senellart, P.
On the Complexity of Managing Probabilistic XML Data
(Page 283)
Sozio, M.
Finding Near Neighbors Through Cluster Pruning
(Page 103)
Srivastava, U.
Optimization of Continuous Queries with Shared Expensive Filters
(Page 215)
Suciu, D.
Management of Probabilistic Data Foundations and Challenges
(Page 1)
The Dichotomy of Conjunctive Queries on Probabilistic Structures
(Page 293)
|
| (Return
to Top) |
Talbot, J.-M.
Polynomial Time Fragments of XPath with Variables
(Page 205)
Talwar, K.
Privacy, Accuracy, and Consistency Too: A Holistic Solution to Contingency Table Release
(Page 273)
Tan, W.-C.
Quasi-inverses of Schema Mappings
(Page 123)
Tannen, V.
Provenance Semirings
(Page 31)
ten Cate, B.
The Complexity of Query Containment in Expressive Fragments of XPath 2.0
(Page 73)
Thorup, M.
Sketching Unaggregated Data Streams for Subpopulation-size Queries
(Page 253)
Tiberi, A.
Finding Near Neighbors Through Cluster Pruning
(Page 103)
Tison, S.
Polynomial Time Fragments of XPath with Variables
(Page 205)
|
| (Return
to Top) |
Upfal, E.
Finding Near Neighbors Through Cluster Pruning
(Page 103)
Van den Bussche, J.
Invited
Tutorial 2: A Crash Course on Database Queries (Page
143)
Van Gucht, D.
Invited
Tutorial 2: A Crash Course on Database Queries (Page
143)
Vansummeren, S.
Invited
Tutorial 2: A Crash Course on Database Queries (Page
143)
Non-Linear Prefixes in Query Languages
(Page 185)
Vee, E.
Estimating Statistical Aggregates on Probabilistic Data Streams
(Page 243)
Wei, F.
Monadic Datalog over Finite Structures with Bounded Treewidth
(Page 165)
White, W.
What is "Next" in Event Processing?
(Page 263)
Widom, J.
Optimization of Continuous Queries with Shared Expensive Filters
(Page 215)
Zhang, L.
Variance Estimation over Sliding Windows
(Page 225)
|
|
|
|