J
José A. Blakeley
Researcher at Microsoft
Publications - 93
Citations - 3748
José A. Blakeley is an academic researcher from Microsoft. The author has contributed to research in topics: Data access & Query optimization. The author has an hindex of 30, co-authored 93 publications receiving 3706 citations. Previous affiliations of José A. Blakeley include University of Waterloo & Darmstadt University of Applied Sciences.
Papers
More filters
Journal ArticleDOI
Efficiently updating materialized views
TL;DR: This work proposes a method in which all database updates to base relations are first filtered to remove from consideration those that cannot possibly affect the view.
Proceedings Article
Updating Derived Relations: Detecting Irrelevant and Autonomously Computable Updates
TL;DR: The class of derived relations considered in this paper is restricted to those defined by PSJ-expressions, that is, any relational algebra expressions constructed from an arbitrary number of project, select and join operations (but containing no self-joins).
Top-k Query Evaluation with Probabilistic Guarantees
Martin Theobald,Gerhard Weikum,Ralf Schenkel,Mario A. Nascimento,M. Tamer Özsu,Donald Kossmann,Renée J. Miller,José A. Blakeley,K. Bernhard Schiefer +8 more
TL;DR: In this paper, a family of approximate top-k algorithms based on probabilistic arguments is introduced, where various forms of convolution and derived bounds are employed to predict when it is safe, with high probability, to drop candidate items and to prune the index scans.
Journal ArticleDOI
Updating derived relations: detecting irrelevant and autonomously computable updates
TL;DR: The class of derived relations considered in this paper is restricted to those defined by PSJ-expressions, that is, any relational algebra expressions constructed from an arbitrary number of project, select and join operations (but containing no self-joins).
Book
Efficiently updating materialized views
TL;DR: In this paper, the authors propose a method in which all database updates to base relations are first filtered to remove from consideration those that cannot possibly affect the view, and then a differential algorithm is applied to re-evaluate the view expression.