George A. Mihaila

George A. Mihaila

Auto-generated profile, based on publicly available information

George A. Mihaila

IBM T.J. Watson Research Center, Hawthorne, NY

Research Focus & Metrics

Academic Career Length

30Years (1997-Present)

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

Representative Publications

View All Publications
1 April 1997 in International Journal on Digital Libraries
Verified
Journal Article
Closed access
PDF file
AMAlberto O. Mendelzon
Alberto O. Mendelzon
GMGeorge A. Mihaila
George A. Mihaila
TMTova Milo
Tova Milo

1 September 2010 in Proceedings of the VLDB Endowment
Verified
Journal Article
Open access
MCMustafa Canim
Mustafa Canim
GMGeorge A. Mihaila
George A. Mihaila
BBBishwaranjan Bhattacharjee
Bishwaranjan Bhattacharjee
KRKenneth A. Ross
Kenneth A. Ross
CLChristian A. Lang
Christian A. Lang
High-end solid state disks (SSDs) provide much faster access to data compared to conventional hard disk drives. We present a technique for using solid-state storage as a caching layer between RAM and hard disks in database management systems. By caching data that is accessed frequently, disk I/O is reduced. For random I/O, the potential performance gains are particularly significant. Our system continuously monitors the disk access patterns to identify hot regions of the disk. Temperature statistics are maintained at the granularity of an extent, i.e., 32 pages, and are kept current through an aging mechanism. Unlike prior caching methods, once the SSD is populated with pages from warm regions cold pages are not admitted into the cache, leading to low levels of cache pollution. Simulations based on DB2 I/O traces, and a prototype implementation within DB2 both show substantial performance improvements.

9 May 2017
Verified
Conference Paper
Open access
PDF file
BGBehzad Golshan
Behzad Golshan
AHAlon Halevy
Alon Halevy
GMGeorge Mihaila
George Mihaila
WTWang-Chiew Tan
Wang-Chiew Tan
The field of data integration has expanded significantly over the years, from providing a uniform query and update interface to structured databases within an enterprise to the ability to search, ex- change, and even update, structured or unstructured data that are within or external to the enterprise. This paper describes the evolution in the landscape of data integration since the work on rewriting queries using views in the mid-1990's. In addition, we describe two important challenges for the field going forward. The first challenge is to develop good open-source tools for different components of data integration pipelines. The second challenge is to provide practitioners with viable solutions for the long-standing problem of systematically combining structured and unstructured data.

24 December 2002
Verified
Conference Paper
Closed access
AMA.O. Mendelzon
A.O. Mendelzon
GMG.A. Mihaila
G.A. Mihaila
TMT. Milo
T. Milo
The World Wide Web is a large, heterogeneous, distributed collection of documents connected by hypertext links. The most common technology currently used for searching the Web depends on sending information retrieval requests to "index servers". One problem with this is that these queries cannot exploit the structure and topology of the document network. The authors propose a query language, WebSQL, that takes advantage of multiple index servers without requiring users to know about them, and that integrates textual retrieval with structure and topology-based queries. They give a formal semantics for WebSQL using a calculus based on a novel "virtual graph" model of a document network. They propose a new theory of query cost based on the idea of "query locality," that is, how much of the network must be visited to answer a particular query. Finally, they describe a prototype implementation of WebSQL written in Java.

1 August 2009 in Proceedings of the VLDB Endowment
Verified
Journal Article
Open access
MCMustafa Canim
Mustafa Canim
GMGeorge A. Mihaila
George A. Mihaila
BBBishwaranjan Bhattacharjee
Bishwaranjan Bhattacharjee
KRKenneth A. Ross
Kenneth A. Ross
CLChristian A. Lang
Christian A. Lang
Solid state disks (SSDs) provide much faster random access to data compared to conventional hard disk drives. Therefore, the response time of a database engine could be improved by moving the objects that are frequently accessed in a random fashion to the SSD. Considering the price and limited storage capacity of solid state disks, the database administrator needs to determine which objects (tables, indexes, materialized views, etc.), if placed on the SSD, would most improve the performance of the system. In this paper we propose a tool called "Object Placement Advisor" for making a wise decision for the object placement problem. By collecting profile inputs from workload runs, the advisor utility provides a list of objects to be placed on the SSD by applying heuristics like the greedy knapsack technique or dynamic programming. To show that the proposed approach is effective in conventional database management systems, we have conducted experiments on IBM DB2 with queries and schemas based on the TPC-H and TPC-C benchmarks. The results indicate that using a relatively small amount of SSD storage, the response time of the system can be reduced significantly by considering the recommendation of the advisor.

18 May 2007 in Information Systems Frontiers
Verified
Journal Article
Closed access
PDF file
TPThemis Palpanas
Themis Palpanas
PCPawan Chowdhary
Pawan Chowdhary
GMGeorge Mihaila
George Mihaila
FPFlorian Pinel
Florian Pinel