Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Hemal Khatri

dblp:24/1583 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
0since 2021 · last 2011
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 4 · 1 first-authorSoftware engineering, systems software and programming languages · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 83% Cloud and datacenter computing · 17%
Databases, data mining, and information retrieval
3 papers
Query processing and optimization · 52% Data integration and cleaning · 20% Database theory · 16%

Topics — the 14 heaviest of 15, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Query processing and optimization
query rewriting
0.222009
Query processing over incomplete autonomous databases: query rewriting using learned data dependencies · VLDB J. 2009
QPIAD: Query Processing over Incomplete Autonomous Databases · ICDE 2007
Cloud and datacenter computing
cloud storage
0.112011
Windows Azure Storage: a highly available cloud storage service with strong consistency · SOSP 2011
Distributed systems
fault tolerance
0.112011
Windows Azure Storage: a highly available cloud storage service with strong consistency · SOSP 2011
Distributed systems › replication
geo-replication
0.112011
Windows Azure Storage: a highly available cloud storage service with strong consistency · SOSP 2011
Distributed systems › fault tolerance
high availability
0.112011
Windows Azure Storage: a highly available cloud storage service with strong consistency · SOSP 2011
Distributed systems
replication
0.112011
Windows Azure Storage: a highly available cloud storage service with strong consistency · SOSP 2011
Distributed systems › consistency models
strong consistency
0.112011
Windows Azure Storage: a highly available cloud storage service with strong consistency · SOSP 2011
Data integration and cleaning › dependency discovery
approximate functional dependency
0.112007
QPIAD: Query Processing over Incomplete Autonomous Databases · ICDE 2007
Database theory › incomplete information
incomplete databases
0.112007
QPIAD: Query Processing over Incomplete Autonomous Databases · ICDE 2007
Query processing and optimization › uncertain data query processing
incomplete data query
0.112007
Query Processing over Incomplete Autonomous Databases · VLDB 2007
Database system architecture and tuning
self-managing database systems
0.112007
Query Processing over Incomplete Autonomous Databases · VLDB 2007
Query processing and optimization
uncertain data query processing
0.112007
QPIAD: Query Processing over Incomplete Autonomous Databases · ICDE 2007
Database theory
incomplete information
0.012007
Query Processing over Incomplete Autonomous Databases · VLDB 2007
Data integration and cleaning
missing data
0.012007
QPIAD: Query Processing over Incomplete Autonomous Databases · ICDE 2007

Methods — techniques the papers use, named apart from their topics

naive bayes classifier · 0.1
YearPublicationVenuePosition
2011 Windows Azure Storage: a highly available cloud storage service with strong consistency
abstract
Windows Azure Storage (WAS) is a cloud storage system that provides customers the ability to store seemingly limitless amounts of data for any duration of time. WAS customers have access to their data from anywhere at any time and only pay for what they use and store. In WAS, data is stored durably using both local and geographic replication to facilitate disaster recovery. Currently, WAS storage comes in the form of Blobs (files), Tables (structured storage), and Queues (message delivery). In this paper, we describe the WAS architecture, global namespace, and data model, as well as its resource provisioning, load balancing, and replication systems.
Brad Calder, Ju Wang 0010, Aaron Ogus, Niranjan Nilakantan, Arild Skjolsvold, Sam McKelvie, Yikang Xu, Shashwat Srivastav, Jiesheng Wu, Huseyin Simitci, Jaidev Haridas, Chakravarthy Uddaraju, Hemal Khatri, Andrew Edwards, Vaman Bedekar, Shane Mainali, Rafay Abbasi, Mian Fahim ul Haq, Muhammad Ikram ul Haq, Deepali Bhardwaj, Sowmya Dayanand, Anitha Adusumilli, Marvin McNett, Sriram Sankaran, Kavitha Manivannan, Leonidas Rigas
SOSP13
2009 Query processing over incomplete autonomous databases: query rewriting using learned data dependencies
Garrett Wolf, Aravind Kalavagattu, Hemal Khatri, Raju Balakrishnan, Bhaumik Chokshi, Jianchun Fan, Yi Chen 0001, Subbarao Kambhampati
VLDB J.3
2007 QUIC: A System for Handling Imprecision & Incompleteness in Autonomous Databases (Demo)
Garrett Wolf, Hemal Khatri, Yi Chen 0001, Subbarao Kambhampati
CIDR2
2007 QPIAD: Query Processing over Incomplete Autonomous Databases
abstract
Incompleteness due to missing attribute values (aka "null values") is very common in autonomous Web databases, on which user accesses are usually supported through mediators. Traditional query processing techniques that focus on the strict soundness of answer tuples often ignore tuples with critical missing attributes, even if they wind up being relevant to a user query. Ideally we would like the mediator to retrieve such relevant uncertain answers and gauge their relevance by accessing their likelihood of being relevant answers to the query. However, the autonomous nature of the databases poses several challenges, such as the restricted access privileges, limited query patterns, and sensitivity of database and network resource consumption in the Web environment. We introduce a novel query rewriting and optimization framework QPIAD that tackles these challenges to retrieve relevant uncertain answers. Our technique involves reformulating the user query based on approximate functional dependencies (AFDs) among the database attributes and ranking these queries using value distributions learned from naive Bayes classifiers. Empirical studies demonstrate the effectiveness of our approach in retrieving relevant uncertain answers with high precision, high recall and manageable cost.
Hemal Khatri, Jianchun Fan, Yi Chen 0001, Subbarao Kambhampati
ICDE1
2007 Query Processing over Incomplete Autonomous Databases
Garrett Wolf, Hemal Khatri, Bhaumik Chokshi, Jianchun Fan, Yi Chen 0001, Subbarao Kambhampati
VLDB2