Amol Deshpande

Amol Deshpande

Auto-generated profile, based on publicly available information

Amol Deshpande

University of Maryland

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 August 2007 in Foundations and Trends® in Databases
Verified
Journal Article
Open access
PDF file
ADAmol Deshpande
Amol Deshpande
ZIZachary Ives
Zachary Ives
VRVijayshankar Raman
Vijayshankar Raman
As the data management field has diversified to consider settings in which queries are increasingly complex, statistics are less available, or data is stored remotely, there has been an acknowledgment that the traditional optimize-then-execute paradigm is insufficient. This has led to a plethora of new techniques, generally placed under the common banner of adaptive query processing, that focus on using runtime feedback to modify query processing in a way that provides better response time or more efficient CPU utilization. In this survey paper, we identify many of the common issues, themes, and approaches that pervade this work, and the settings in which each piece of work is most appropriate. Our goal with this paper is to be a “value-add” over the existing papers on the material, providing not only a brief overview of each technique, but also a basic framework for understanding the field of adaptive query processing in general. We focus primarily on intra-query adaptivity of long-running, but not full-fledged streaming, queries. We conclude with a discussion of open research problems that are of high importance.

1 April 2007
Verified
Conference Paper
Closed access
PSPrithviraj Sen
Prithviraj Sen
ADAmol Deshpande
Amol Deshpande
Probabilistic databases have received considerable attention recently due to the need for storing uncertain data produced by many real world applications. The widespread use of probabilistic databases is hampered by two limitations: (1) current probabilistic databases make simplistic assumptions about the data (e.g., complete independence among tuples) that make it difficult to use them in applications that naturally produce correlated data, and (2) most probabilistic databases can only answer a restricted subset of the queries that can be expressed using traditional query languages. We address both these limitations by proposing a framework that can represent not only probabilistic tuples, but also correlations that may be present among them. Our proposed framework naturally lends itself to the possible world semantics thus preserving the precise query semantics extant in current probabilistic databases. We develop an efficient strategy for query evaluation over such probabilistic databases by casting the query processing problem as an inference problem in an appropriately constructed probabilistic graphical model. We present several optimizations specific to probabilistic databases that enable efficient query evaluation. We validate our approach by presenting an experimental evaluation that illustrates the effectiveness of our techniques at answering various queries using real and synthetic datasets.

15 July 2009 in The VLDB Journal
Verified
Journal Article
Closed access
PDF file
PSPrithviraj Sen
Prithviraj Sen
ADAmol Deshpande
Amol Deshpande
LGLise Getoor
Lise Getoor

1 April 2008
Verified
Conference Paper
Closed access
BKBhargav Kanagal
Bhargav Kanagal
ADAmol Deshpande
Amol Deshpande
In this paper, we address the problem of extending a relational database system to facilitate efficient real-time application of dynamic probabilistic models to streaming data. We use the recently proposed abstraction of model-based views for this purpose, by allowing users to declaratively specify the model to be applied, and by presenting the output of the models to the user as a probabilistic database view. We support declarative querying over such views using an extended version of SQL that allows for querying probabilistic data. Underneath we use particle filters, a class of sequential Monte Carlo algorithms, to represent the present and historical states of the model as sets of weighted samples (particles) that are kept up-to-date as new data arrives. We develop novel techniques to convert the queries on the model-based view directly into queries over particle tables, enabling highly efficient query processing. Finally, we present experimental evaluation of our prototype implementation over several synthetic and real datasets, that demonstrates the feasibility of online modeling of streaming data using our system and establishes the advantages of tight integration between dynamic probabilistic models and databases.

12 January 2017 in Foundations and Trends® in Databases
Verified
Journal Article
Closed access
PDF file
DYDa Yan
Da Yan
YBYingyi Bu
Yingyi Bu
YTYuanyuan Tian
Yuanyuan Tian
ADAmol Deshpande
Amol Deshpande
Due to the growing need to process large graph and network datasets created by modern applications, recent years have witnessed a surging interest in developing big graph platforms. Tens of such big graph systems have already been developed, but there lacks a systematic categorization and comparison of these systems. This article provides a timely and comprehensive survey of existing big graph systems, and summarizes their key ideas and technical contributions from various aspects. In addition to the popular vertex-centric systems which espouse a think-like-a-vertex paradigm for developing parallel graph applications, this survey also covers other programming and computation models, contrasts those against each other, and provides a vision for the future research on big graph analytics platforms. This survey aims to help readers get a systematic picture of the landscape of recent big graph systems, focusing not just on the systems themselves, but also on the key innovations and design philosophies underlying them.

7 October 2005 in The VLDB Journal
Verified
Journal Article
Closed access
PDF file
ADAmol Deshpande
Amol Deshpande
CGCarlos Guestrin
Carlos Guestrin
SMSamuel R. Madden
Samuel R. Madden
JHJoseph M. Hellerstein
Joseph M. Hellerstein
WHWei Hong
Wei Hong