Qunits: queried units for database search (2009)
Keyword search against structured databases has become a popular topic of investigation, since many users find structured queries too hard to express, and enjoy the freedom of a “Google-like ”...
Qunits: queried units in database search (2009)
Keyword search against structured databases has become a popular topic of investigation, since many users find structured queries too hard to express, and enjoy the freedom of a ``Google-like'' query...
N. H. Gehani, H. V. Jagadish, W. D. Roome
OdeFS is a file-like interface to the Ode objectoriented database. OdeFS allows database objects to be accessed and manipulated with standard commands, just like files in a traditional file system....
EFFICIRNT SEARCH IN VERY LARGE DATABASES (2009)
We consider the poblean of performin efficient seer & in a large database system. We wt a novel data slructurhig technique and show how a branch and bound search algorithm...
H. V. Jagadish, Nick Koudas, Divesh Srivastava, Ting Yu, N. Koudas, D. Srivastava, ...
or classroom use provided that the copies are not made or distributed for pro t or commercial advantage, the ACM copyright/server notice, the title of the publication, and its date appear, and notice...
Abstract Counting Twig Matches in a Tree (2009)
Zhiyuan Chen, S. Muthukrishnan, H. V. Jagadish
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data structure. This problem...
Toward Efficient Multifeature Query Processing (2009)
H. V. Jagadish, Beng Chin Ooi, Heng Tao Shen, Kian-lee Tan, Ieee Computer Society
Abstract—In many advanced applications, data are described by multiple high-dimensional features. Moreover, different queries may weight these features differently; some may not even specify all...
Evaluating Universal Quantification in XML (2009)
Shurug Al-khalifa, Ben B. Liu, H. V. Jagadish
Abstract—Queries posed to database systems often involve Universal Quantification. Such queries are typically expensive to evaluate. Although they can be handled by basic access methods, for...
Michigan molecular interactions r2: from interacting proteins to pathways (2009)
Tarcea, V. Glenn, Weymouth, Terry, Ade, Alex, Bookvich, Aaron, Gao, Jing, Mahavisno, Vasudeva, ...
Molecular interaction data exists in a number of repositories, each with its own data format, molecule identifier and information coverage. Michigan molecular interactions (MiMI) assists scientists...
Integrating and annotating the interactome using the MiMI plugin for cytoscape (2009)
Gao, Jing, Ade, Alex S., Tarcea, V. Glenn, Weymouth, Terry E., Mirel, Barbara R., Jagadish, H.V., ...
Summary: The MiMI molecular interaction repository integrates data from multiple sources, resolves interactions to standard gene names and symbols, links to annotation data from GO, MeSH and PubMed...
Term Disambiguation in Natural Language Query for XML (2008)
Yunyao Li, Huahai Yang, H. V. Jagadish
Abstract. Converting a natural language query sentence into a formal database query is a major challenge. We have constructed NaLIX, a natural language interface for querying XML data. Through our...
Efficient Skyline Computation over Low-Cardinality Domains ABSTRACT (2008)
Michael Morse, Jignesh M. Patel, H. V. Jagadish
Current skyline evaluation techniques follow a common paradigm that eliminates data elements from skyline consideration by finding other elements in the dataset that dominate them. The performance of...
H. V. Jagadish, Adriane Chapman, Aaron Elkiss, Magesh Jayapandian, Yunyao Li, Arnab Nandi, ...
Database researchers have striven to improve the capability of a database in terms of both performance and functionality. We assert that the usability of a database is as important as its capability....
General Terms Algorithms, Experimentation (2008)
Yunyao Li, Rajasekar Krishnamurthy, Shivakumar Vaithyanathan, H. V. Jagadish
Many searches on the web have a transactional intent. We argue that pages satisfying transactional needs can be distinguished from the more common pages that have some information and links, but...
A Runapongsa, Jignesh M. Patel, H. V. Jagadish, Yun Chen, Shurug Al-khalifa
We propose a micro-benchmark for XML data management to aid engineers in designing improved XML processing engines. This benchmark is inherently different from application-level benchmarks, which are...
Abstract Similarity-Based Queries (2008)
H. V. Jagadish, Alberto O. Mendelzon, Tova Milo
We develop a domain-independent framework for defining qneries in terms of similarity of objects. Our framework has three components: a pattern language, a transformation rule language, and a query...
Michigan Molecular Interactions (MiMI): Putting the Jigsaw Puzzle Together (2008)
Magesh Jayap, Adriane Chapman, V. Glenn Tarcea, Cong Yu, Aaron Elkiss, Angela Ianni, ...
jigsaw puzzle together
Byoung-kee Yi, H. V. Jagadish, Christos Faloutsos, Presentation Jeff Feasel
• Find all s i that look like q
Abstract Recovering from Main-Memory Lapses (2008)
H. V. Jagadish, Avi Silberschatz, S. Sudarshan
Recovery activities, like logging, checkpointing and restart, are used to restore a database to a consistent state after a system crash has occurred. Recovery re-lated overhead is particularly...
Hans-peter Kriegel, Thomas Brinkhoff, Ralf Schneider, H. V. Jagadish, S. Kicha Ganapathy, High Performance, ...
Daejeon, Korea The Bulletin of the Technical Committee on
Issues in Building Practical Provenance Systems (2008)
Adriane Chapman, H. V. Jagadish
The importance of maintaining provenance has been widely recognized, particularly with respect to highly-manipulated data. However, there are few deployed databases that provide provenance...
Efficient Skyline Computation over Low-Cardinality Domains ABSTRACT (2008)
Michael Morse, Jignesh M. Patel, H. V. Jagadish
Current skyline evaluation techniques follow a common paradigm that eliminates data elements from skyline consideration by finding other elements in the dataset that dominate them. The performance of...
A. Gal, D. R. Llanos, S. Guo, Z. Huang, H. V. Jagadish, B. C. Ooi, ...
Michigan Molecular Interactions (MiMI): Putting the Jigsaw Puzzle Together (2008)
Magesh Jayap, Adriane Chapman, V. Glenn Tarcea, Cong Yu, Aaron Elkiss, Angela Ianni, ...
jigsaw puzzle together
H. V. Jagadish, Adriane Chapman, Aaron Elkiss, Magesh Jayapandian, Yunyao Li, Arnab Nandi, ...
Database researchers have striven to improve the capability of a database in terms of both performance and functionality. We assert that the usability of a database is as important as its capability....
The Crisis in Data Management for Biological Sciences (2008)
H. V. Jagadish, Cell Biology, Frank Olken
The life sciences provide a rich application domain for data management research, with a broad diversity of problems that can make a significant difference to progress in life sciences research. This...
Managing Hierarchically Organized Data in Modern Databases (2008)
Project Award Information � Award Number: IIS-9986030
Publications and Products (2008)
H. V. Jagadish, Prof Jagadish, Leonard Pitt, Prof Pitt
This project aims to study the role of learning, sampling, and summarization as an aid to mining very large data sets. Specific investigations include � Effective summarization of data sets. �...
Michigan Molecular Interactions (MiMI): Putting the Jigsaw Puzzle Together (2008)
Magesh Jayap, Adriane Chapman, V. Glenn Tarcea, Cong Yu, Aaron Elkiss, Angela Ianni, ...
Protein interaction data exists in a number of repositories. Each repository has its own data format, molecule identifier and supplementary information. Michigan Molecular Interactions (MiMI) assists...
Abstract Counting Twig Matches in a Tree (2008)
Zhiyuan Chen, S. Muthukrishnan, H. V. Jagadish
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data structure. This problem...
NaLIX: A Generic Natural Language Search Environment for XML Data. acmtds, accepted (2008)
Yunyao Li, Huahai Yang, H. V. Jagadish
We describe the construction of a generic natural language query interface to an XML database. Our interface can accept an arbitrary English sentence as a query, which can be quite complex and...
Yuqing Wu, Jignesh M. Patel, H. V. Jagadish
Structural join operations are central to evaluating queries against XML data, and are typically the operations responsible for consuming a lion’s share of the query processing time. Thus,...
The Importance of Algebra for XML Query Processing ⋆ (2008)
Stelios Paparizos, H. V. Jagadish
Abstract. Relational algebra has been a crucial foundation for relational database systems, and has played a large role in enabling their success. A corresponding XML algebra for XML query processing...
The Crisis in Data Management for Biological Sciences (2008)
H. V. Jagadish, Cell Biology, Frank Olken
The life sciences provide a rich application domain for data management research, with a broad diversity of problems that can make a signifcant difference to progress in life sciences research. This...
S. K. Abdali, L. Adleman, K. S. Booth, F. P. Preparata, R. Agrawal, H. V. Jagadish, ...
bounds for Boolean matrix multiplication. Acta Informatica, 11:61-75, 1978. [3] R. Agrawal. Alpha: An extension of relational algebra to express a class of recursive
Masaru Kitsuregawa, Betty Salzberg, Gonzalo Navarro, Ricardo Baeza-yates, Erkki Sutinen, Jorma Tarhio, ...
IntegratingDiverseInformationManagementSystems:ABriefSurvey..................................
Luis Gravano, Panagiotis G. Ipeirotis, H. V. Jagadish, Nick Koudas, S. Muthukrishnan, Divesh Srivastava
String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data especially for more complex queries...
Luis Gravano, Panagiotis G. Ipeirotis, H. V. Jagadish, Nick Koudas, S. Muthukrishnan, Divesh Srivastava
String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data especially for more complex queries...
Monmouth University and (2008)
H. V. Jagadish, Beng Chin Ooi, Kian-lee Tan, Cui Yu, Rui Zhang
In this paper, we present an efficient B +-tree based indexing method, called iDistance, for Knearest neighbor (KNN) search in a high-dimensional metric space. iDistance partitions the data based on...
MiMI: Michigan Molecular Interactions (2008)
Adriane Chapman Magesh, Adriane Chapman, Magesh Jayap, Cong Yu, H. V. Jagadish
There is a proliferation of data sources in biology. A complete understanding of a biological problem often requires the integration of multiple data sources, each providing insights on certain...
To Defend Against, Magesh Jayap, Brian Noble, James Mickens, H. V. Jagadish
For many data providers, the "crown jewels" of their business are the data that they have organized. If someone could copy their entire database, it would be a competitive catastrophe. Yet,...
Stefan Berchtold, H. V. Jagadish, Kenneth A. Ross
An important issue in data mining is the recognition of complex dependencies between attributes. Past techniques for identifying attribute dependence include correlation coe#cients, scatterplots, and...
Analysis of the n-dimensional quadtree (2007)
Christos Faloutsos, H. V. Jagadish, Yannis Manolopoulos
decomposition for arbitrary hyper-rectangles
H. V. Jagadish, Divesh Srivastava
SUMMARY Much of the data we deal with every day is organized hierarchically: le systems, library classication schemes and yellow page categories are salient examples. Business data too, benets from a...
Interactive Spatial irectories (2007)
Brian Schmult Jagadish, H. V. Jagadish, S. Kicha Ganapathy
A spatial directory is a directory of places, and information, things and events associated with places, where classification and searching are based on location (or spatial proximity) as well as on...
December Vol No, Letter Editor-in-chief, David Lomet, Letter Special, Christos Faloutsos, Peter J. Haas, ...
this paper we describe and evaluate several popular techniques for data reduction.
September Vol No, Hans-peter Kriegel, Thomas Brinkhoff, Ralf Schneider, Interactive Spatial, Directories Brian, ...
This paper describes the design of an object-oriented geographic information system called GODOT (Geographic Data Management With Object-Oriented Techniques). GODOT has a four-layer architecture,...
September Vol No, Hans-peter Kriegel, Thomas Brinkhoff, Ralf Schneider, Beng-chin Ooi, H. V. Jagadish, ...
This paper describes the design of an object-oriented geographic information system called GODOT (Geographic Data Management With Object-Oriented Techniques). GODOT has a four-layer architecture,...
: The Data Mining Project at ATT Research (2007)
Stefan Berchtold, Christos Faloutsos, H. V. Jagadish, Theodore Johnson, Raymond Ng, Ken Ross
Revision : 6:1 The goal of this white paper is to define research directions. We start with the problem definition, present a classification of tools and issues, and list completed or on-going...
An Intelligent Memory Transaction Engine (2007)
Abhaya Asthana, H. V. Jagadish, Scott C. Knauer
In this paper, we describe the structure and utilization of a high bandwidth, multi-ported, disk-sized memory system capable of storing, maintaining, and manipulating persistent shared data within...
Multi-Granularity Locks in an Object-Oriented Database (2007)
H. V. Jagadish, Daniel F. Lieuwen
Multi-granularity locking is widely accepted today as an important performance booster for concurrency control in relational databases. In this paper, we address the issues that arise in applying the...
September Vol No, Hans-peter Kriegel, Thomas Brinkhoff, Ralf Schneider, Interactive Spatial, Directories Brian, ...
This paper describes the design of an object-oriented geographic information system called GODOT (Geographic Data Management With Object-Oriented Techniques). GODOT has a four-layer architecture,...
Reasoning with Aggregation Constraints in Views (2007)
Shaul Dar, H. V. Jagadish, Alon Y. Levy, Divesh Srivastava
We investigate the problem of using materialized views to compute answers to SQL queries with grouping and aggregation, in the presence of multiset tables. This problem is important in many...
SUNRISE: An Architecture for Billing, Rating and Information Services in a Telephone Network (2007)
H. V. Jagadish, Rama Kanneganti, Inderpal Singh Mumick, Abraham Silberschatz
SUNRISE is a data architecture for the usage and billing information management in a telephone network. Its aim is to provide real-time rating and information services, in addition to on-line billing...
Choosing Bucket Boundaries for Histograms (2007)
H. V. Jagadish, Nick Koudas, Kenneth C. Sevcik
Histograms have long been used to capture attribute value distribution statistics for query optimizers. More recently, there has been a growing interest in the use of histograms to produce quick...
Using Õ-grams in a DBMS for Approximate String Processing (2007)
Luis Gravano, Panagiotis G. Ipeirotis, H. V. Jagadish, Nick Koudas, S. Muthukrishnan, Lauri Pietarinen, ...
String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data. This is due, for example, to the...
Andrew Nierman, H. V. Jagadish
Whereas traditional databases manage only deterministic information, many applications that use databases involve uncertain data. This paper presents a Probabilistic Tree Data Base (ProTDB) to manage...
Luis Gravano, Panagiotis G. Ipeirotis, H. V. Jagadish, Nick Koudas, S. Muthukrishnan, Divesh Srivastava
String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data especially for more complex queries...
H. V. Jagadish, Hui Jin, Beng Chin Ooi, Kian-lee Tan
Histograms are frequently used to represent the distribution of data values in an attribute of a relation. Most previous work has focused on identifying the optimal histogram (given a limited number...
Flip Korn AT&T Labs--Research (2007)
Zhiyuan Chen, H. V. Jagadish, Nick Koudas, S. Muthukrishnan, Raymond Ng, Divesh Srivastava
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data structure. This problem...
Incompleteness in Data Mining (2007)
Database technology, as well as the bulk of data mining technology, is founded upon logic, with absolute notions of truth and falsehood, at least with respect to the data set. Patterns are discovered...
Independence Diagrams: A Technique for Data Visualization (2007)
Stefan Berchtold, H. V. Jagadish, Kenneth A. Ross
An important issue in data visualization is the recognition of complex dependencies between attributes. Past techniques for identifying attribute dependence include correlation coecients,...
Cui Yu, Beng Chin Ooi, Kian-lee Tan, H. V. Jagadish
In this paper, we present an ecient method, called iDistance, for K-nearest neighbor (KNN) search in a high-dimensional space. iDistance partitions the data and selects a reference point for each...
H. V. Jagadish, Divesh Srivastava
SUMMARY Much of the data we deal with every day is organized hierarchically: file systems, library classification schemes and yellow page categories are salient examples. Business data too, benefits...
INVITED PAPER Special Issue on New Generation Database Technologies (2007)
Revisiting The Hierarchical, H. V. Jagadish, Divesh Srivastava
this paper, we develop a framework for a modern hierarchical data model, substantially improved from the original version by taking advantage of the lessons learned in the relational database...
Querying Complex Structured Databases (2007)
Correctly generating a structured query (e.g., an XQuery or a SQL query) requires the user to have a full understanding of the database schema, which can be a daunting task. Alternative query models...
Querying Complex Structured Databases (2007)
Correctly generating a structured query (e.g., an XQuery or a SQL query) requires the user to have a full understanding of the database schema, which can be a daunting task. Alternative query models...
Michigan Molecular Interactions (MiMI): putting the jigsaw puzzle together (2007)
Jayapandian, Magesh, Chapman, Adriane, Tarcea, V. Glenn, Yu, Cong, Elkiss, Aaron, Ianni, Angela, ...
Protein interaction data exists in a number of repositories. Each repository has its own data format, molecule identifier and supplementary information. Michigan Molecular Interactions (MiMI) assists...
Towards efficient multi-feature query processing (2006)
Heng Tao Shen, H.V. Jagadish, Beng Chin Ooi, Kian-Lee Tan
In many advanced applications, data are described by multiple high-dimensional features. Moreover, different queries may weight these features differently; some may not even specify all the features....
Towards efficient multi-feature query processing (2006)
Heng Tao Shen, H.V. Jagadish, Beng Chin Ooi, Kian-Lee Tan
In many advanced applications, data are described by multiple high-dimensional features. Moreover, different queries may weight these features differently; some may not even specify all the features....
Speeding up search in peer-to-peer networks with a multi-way tree structure (2006)
Peer-to-Peer systems have recently become a popular means to share resources. Effective search is a critical requirement in such systems, and a number of distributed search structures have been...
Speeding up search in peer-to-peer networks with a multi-way tree structure (2006)
Peer-to-Peer systems have recently become a popular means to share resources. Effective search is a critical requirement in such systems, and a number of distributed search structures have been...
Vbi-tree: A peer-to-peer framework for supporting multi-dimensional indexing schemes (2006)
Multi-dimensional data indexing has received much attention in a centralized database. However, not so much work has been done on this topic in the context of Peerto-Peer systems. In this paper, we...
On high dimensional skylines (2006)
Chee-yong Chan, H. V. Jagadish, Kian-lee Tan
Abstract. In many decision-making applications, the skyline query is frequently used to find a set of dominating data points (called skyline points) in a multidimensional dataset. In a...
H.V.Jagadish. Getting work done on the web: Supporting transactional queries (2006)
Yunyao Li, Rajasekar Krishnamurthy, Shivakumar Vaithyanathan, H. V. Jagadish
Many searches on the web have a transactional intent. In this paper we argue that pages satisfying transactional needs can be distinguished from the more common pages that have some information and...
Constructing a Generic Natural Language Interface for an XML Database (2006)
Yunyao Li, Huahai Yang, H. V. Jagadish
Abstract. We describe the construction of a generic natural language query interface to an XML database. Our interface can accept an arbitrary English sentence as a query, which can be quite complex...
Constructing a Generic Natural Language Interface for an XML Database (2006)
Yunyao Li, Huahai Yang, H. V. Jagadish
Abstract. We describe the construction of a generic natural language query interface to an XML database. Our interface can accept an arbitrary English sentence as a query, which can be quite complex...
BATON: A Balanced Tree Structure for Peer-to-Peer Networks (2005)
Jagadish, H.V., Ooi, Beng Chin, Rinard, Martin C., Vu, Quang Hieu
We propose a balanced tree structure overlay on a peer-to-peer network capable of supporting both exact queries and range queries efficiently. In spite of the tree structure causing distinctions to...
BATON: A Balanced Tree Structure for Peer-to-Peer Networks (2005)
Jagadish, H.V., Ooi, Beng Chin, Rinard, Martin C., Vu, Quang Hieu
We propose a balanced tree structure overlay on a peer-to-peer network capable of supporting both exact queries and range queries efficiently. In spite of the tree structure causing distinctions to...
Special issue on data management, analysis, and mining for the life sciences (2005)
Raschid, Louiqa, Jagadish, H. V., Gaasterland, Terry
Peer Reviewed
BATON: A Balanced Tree Structure for Peer-to-Peer Networks (2005)
H. V. Jagadish, Beng Chin Ooi, Quang Hieu Vu
We propose a balanced tree structure overlay on a peer-to-peer network capable of supporting both exact queries and range queries efficiently. In spite of the tree structure causing distinctions to...
NaLIX: an Interactive Natural Language Interface for Querying XML (2005)
Yunyao Li, Huahai Yang, H. V. Jagadish
Database query languages can be intimidating to the nonexpert, leading to the immense recent popularity for keyword based search in spite of its significant limitations. The holy grail has been the...
BATON: A Balanced Tree Structure for Peer-to-Peer Networks (2005)
H. V. Jagadish, Beng Chin Ooi, Quang Hieu Vu
We propose a balanced tree structure overlay on a peer-to-peer network capable of supporting both exact queries and range queries efficiently.
BATON: A Balanced Tree Structure for Peer-to-Peer Networks (2005)
H. V. Jagadish, Beng Chin Ooi, Quang Hieu Vu
We propose a balanced tree structure overlay on a peer-to-peer network capable of supporting both exact queries and range queries efficiently. In spite of the tree structure causing distinctions to...
Yunyao Li, Cong Yu, H. V. Jagadish
The widespread adoption of XML holds out the promise that document structure can be exploited to specify precise database queries. However, the user may have only a limited knowledge of the XML...
ItCompress: An iterative semantic compression algorithm (2004)
H. V. Jagadish, Raymond T. Ng, Beng Chin, Ooi Anthony, K. H. Tung
Real datasets are often large enough to necessitate data compression. Traditional ‘syntactic ’ data compression methods treat the table as a large byte string and operate at the byte level. The...
The VLDB Journal (2006) DOI 10.1007/s00778-006-0003-4 REGULAR PAPER (2004)
Yunyao Li, Cong Yu, H. V. Jagadish
Abstract The widespread adoption of XML holds the promise that document structure can be exploited to specify precise database queries. However, users may have only a limited knowledge of the XML...
Yunyao Li, Cong Yu, H. V. Jagadish
The widespread adoption of XML holds out the promise that document structure can be exploited to specify precise database queries. However, the user may have only a limited knowledge of the XML...
A Compressed Accessibility Map for XML (2004)
Ting Yu North, Ting Yu, H. V. Jagadish
this paper, we introduce a compressed accessibility map (CAM) as a space- and time-e#cient solution to the access control problem for XML data. A CAM compactly identifies the XML data items to which...
ItCompress: An iterative semantic compression algorithm (2004)
H. V. Jagadish, Raymond T. Ng, Beng Chin Ooi
Real datasets are often large enough to necessitate data compression. Traditional ‘syntactic ’ data compression methods treat the table as a large byte string and operate at the byte level. The...
Colorful XML: One hierarchy isn’t enough (2004)
H. V. Jagadish, Divesh Srivastava
XML has a tree-structured data model, which is used to uniformly represent structured as well as semi-structured data, and also enable concise query specification in XQuery, via the use of its XPath...
Yunyao Li, Cong Yu, H. V. Jagadish
The widespread adoption of XML holds out the promise that document structure can be exploited to specify precise database queries. However, the user may have only a limited knowledge of the XML...
Colorful XML: One hierarchy isn’t enough (2004)
H. V. Jagadish, Divesh Srivastava
XML has a tree-structured data model, which is used to uniformly represent structured as well as semi-structured data, and also enable concise query specification in XQuery, via the use of its XPath...
Peer Reviewed
Effective Integration of Protein Data through Better Data Modeling (2003)
Chapman, Adriane, Yu, Cong, Jagadish, H.V.
Protein data, from sequence and structure to interaction, is being generated through many diverse methodologies; it is stored and reported in numerous forms and multiple places. The magnitude of the...
From Tree Patterns to Generalized Tree Patterns: On Efficient Evaluation of XQuery (2003)
Zhimin Chen, H. V. Jagadish, Stelios Paparizos
XQuery is the de facto standard XML query language, and it is important to have efficient query evaluation techniques available for it. A core operation in the evaluation of XQuery is the finding of...
The Michigan Benchmark: Towards XML Query Performance Diagnostics (2003)
Kanda Runapongsa, Jignesh M. Patel, H. V. Jagadish, Yun Chen, Shurug Al-Khalifa
We propose a micro-benchmark for XML data management to aid engineers in designing improved XML processing engines. This benchmark is inherently different from application-level benchmarks, which are...
Approximate String Joins in a Database (Almost) for Free (2003)
Erratum Luis Gravano, Luis Gravano, Panagiotis G. Ipeirotis, H. V. Jagadish, Nick Koudas, S. Muthukrishnan, ...
case the result returned by the Figure 1 query is incomplete and su#ers from "false negatives," in contrast to our claim to the contrary in [GIJ 01b]. In general, the string pairs that are...
The Michigan Benchmark: Towards XML Query Performance Diagnostics (2003)
Kanda Runapongsa, Jignesh M. Patel, H. V. Jagadish, Yun Chen, Shurug Al-Khalifa
We propose a micro-benchmark for XML data management to aid engineers in designing improved XML processing engines. This benchmark is inherently different from application-level benchmarks, which are...
TIMBER: A native XML database (2002)
Paparizos, S., Al-Khalifa, S., Wu, Y., Wiwatwattana, N., Jagadish, H.V., Nierman, A., ...
This paper describes the overall design and architecture of the Timber XML database system currently being implemented at the University of Michigan. The system is based upon a bulk algebra for...
The Michigan Benchmark: A microbenchmark for XML query processing systems (2002)
Kanda Runapongsa, Jignesh M. Patel, H. V. Jagadish, Shurug Al-khalifa
With the continuing increasing popularity of the eXtensible Markup Language (XML) as a representation format for a wide variety of data, and it is clear that large repositories of XML data sets will...
TIMBER: A Native XML Database (2002)
H. V. Jagadish, Shurug Al-khalifa, Adriane Chapman, Andrew Nierman, Stelios Paparizos, ...
Abstract. This paper describes the overall design and architecture of the Timber XML database system currently being implemented at the University of Michigan. The system is based upon a bulk algebra...
The michigan benchmark: Towards XML query performance diagnostics (2002)
Kanda Runapongsa, Jignesh M. Patel, H. V. Jagadish, Yun Chen, Shurug Al-khalifa
We propose a micro-benchmark for XML data management to aid engineers in designing improved XML processing engines. This benchmark is inherently different from application-level benchmarks, which are...
ProTDB: Probabilistic data in XML (2002)
Andrew Nierman, H. V. Jagadish
Abstract Whereas traditional databases manage onlydeterministic information, many applications that use databases involve uncertain data.This paper presents a Probabilistic Tree Data Base (ProTDB) to...
ProTDB: Probabilistic data in XML (2002)
Andrew Nierman, H. V. Jagadish
Whereas traditional databases manage only deterministic information, many applications that use databases involve uncertain data. This paper presents a Probabilistic Tree Data Base (ProTDB) to manage...
A physical algebra for XML (2002)
Stylianos Paparizos, Shurug Al-khalifa, H. V. Jagadish, Andrew Nierman, Yuqing Wu
We present a physical algebra for the manipulation of XML in a database. We show how to map logical algebra operators to this physical algebra. We also present several physical algebra identities...
Compressed Accessibility Map: Efficient Access Control for XML (2002)
Ting Yu, Divesh Srivastava, H. V. Jagadish
XML is widely regm'ded as a promising memm for data representation integq'ation, md exchmge. As compmfies trmmact business over the Internet, the sensitive nature of the information mmdates...
TIMBER: A Native XML Database (2002)
H. V. Jagadish, Shurug Al-khalifa, Adriane Chapman, Andrew Nierman, Stelios Paparizos, ...
The date of receipt and acceptance will be inserted by the editor Abstract This paper describes the overall design and architecture of the Timber XML database system currently being implemented at...
Stelios Paparizos, Shurug Al-khalifa, H. V. Jagadish, Laks Lakshmanan, Andrew Nierman, Divesh Srivastava, ...
Abstract. XML permits repeated and missing sub-elements, and missing attributes. We discuss the consequent implications on grouping, both with respect to specification and with respect to...
Evaluating Structural Similarity in XML Documents (2002)
Andrew Nierman, H. V. Jagadish
XML documents on the web are often found without DTDs, particularly when these documents have been created from legacy HTML. Yet having knowledge of the DTD can be valuable in querying and...
Structural joins: a primitive for efficient XML query pattern matching (2002)
Shurug Al-khalifa, H. V. Jagadish, Nick Koudas, Jignesh M. Patel, Divesh Srivastava, Yuqing Wu
XML queries typically specify patterns of selection predicates on multiple elements that have some specified tree structured relationships. The primitive tree structured relationships are...
TIMBER: A Native XML Database (2002)
H. V. Jagadish, Adriane Chapman, Andrew Nierman, Stelios Paparizos, ...
This paper describes the overall design and architecture of the Timber XML database system currently being implemented at the University of Michigan. The system is based upon a bulk algebra for...
Estimating Answer Sizes for XML (2002)
Queries Yuqing Wu, Yuqing Wu, Jignesh M. Patel, H. V. Jagadish
Estimating the sizes of query results, and intermediate results, is crucial to many aspects of query processing. In particular, it is necessary for e#ective query optimization. Even at the user...
Structural Joins: A Primitive for Efficient XML Query Pattern Matching (2002)
H. V. Jagadish, Nick Koudas, Jignesh M. Patel, Divesh Srivastava, Yuqing Wu
XML queries typically specify patterns of selection predicates on multiple elements that have some specified tree structured relationships. The primitive tree structured relationships are...
Stelios Paparizos Shurug, Stelios Paparizos, Shurug Al-khalifa, H. V. Jagadish, Laks Lakshmanan, Andrew Nierman, ...
XML permits repeated and missing sub-elements, and missing attributes. We discuss the consequent implications on grouping, both with respect to specification and with respect to implementation. The...
Analysis of the clustering properties of the Hilbert space-filling curve (2001)
Bongki Moon, H. V. Jagadish, Christos Faloutsos, Joel H. Saltz
AbstractÐSeveral schemes for the linear mapping of a multidimensional space have been proposed for various applications, such as access methods for spatio-temporal databases and image compression....
Approximate string joins in a database (almost) for free (2001)
Luis Gravano, Panagiotis G. Ipeirotis, H. V. Jagadish, Nick Koudas, S. Muthukrishnan, Divesh Srivastava
In [GIJ + 01a, GIJ + 01b] we described how to use q-grams in an RDBMS to perform approximate string joins. We also showed how to implement the approximate join using plain SQL queries. Specifically,...
Using q-grams in a DBMS for Approximate String Processing (2001)
Luis Gravano, Panagiotis G. Ipeirotis, H. V. Jagadish, Nick Koudas, S. Muthukrishnan, Lauri Pietarinen, ...
String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data. This is due, for example, to the...
TAX: A tree algebra for XML (2001)
H. V. Jagadish, Divesh Srivastava, Keith Thompson
Querying XML has been the subject of much recent investigation. A formal bulk algebra is essential for applying database-style optimization to XML queries. We develop such an algebra, called TAX...
Approximate string joins in a database (almost) for free (2001)
Luis Gravano, Panagiotis G. Ipeirotis, H. V. Jagadish, Nick Koudas, S. Muthukrishnan, Divesh Srivastava
String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data especially for more complex queries...
Using q-grams in a DBMS for Approximate String Processing (2001)
Luis Gravano, Panagiotis G. Ipeirotis, H. V. Jagadish, Nick Koudas, S. Muthukrishnan, Lauri Pietarinen, ...
String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data. This is due, for example, to the...
Analysis of the clustering properties of the Hilbert space-filling curve (2001)
Bongki Moon, H. V. Jagadish, Christos Faloutsos, Joel H. Saltz
AbstractÐSeveral schemes for the linear mapping of a multidimensional space have been proposed for various applications, such as access methods for spatio-temporal databases and image compression....
One-dimensional and multi-dimensional substring selectivity estimation (2000)
Kapitskaia, Olga, Srivastava, Divesh, Jagadish, H.V., Ng, Raymond T.
With the increasing importance of XML, LDAP directories, and text-based information sources on the Internet, there is an ever-greater need to evaluate queries involving (sub)string matching. In many...
Unified Fine-Granularity Buffering of Index and Data: Approach and Implementation (2000)
Qiang Cao, Josep Torrellas, H. V. Jagadish
Abstract Disk I/O is recognized as a major performance bottleneck in many database applications. Consequently, a topic of considerable study in database systems has traditionally been buffer...
Online data mining for co-evolving time sequences (2000)
In many applications, the data of interest comprises multiple sequences that evolve over time. Examples include currency exchange rates, network traffic data. We develop a fast method to analyze such...
On bounding-schemas for LDAP directories (2000)
Sihem Amer-yahia, H. V. Jagadish, Divesh Srivastava
As our world gets more networked, ever increasing amounts of information---e.g., about people, network resources, and policies---are being stored in directories, in particular, in X.500 style...
Independent quantization: An index compression technique for high-dimensional data spaces (2000)
Stefan Berchtold, Christian Böhm, H. V. Jagadish, Hans-peter Kriegel, Jörg S
Two major approaches have been proposed to efficiently process queries in databases: Speeding up the search by using index structures, and speeding up the search by operating on a compressed...
On Effective Multi-Dimensional Indexing for Strings (2000)
H. V. Jagadish, Nick Koudas, Divesh Srivastava
As databases have expanded in scope from storing purely business data to include XML documents, product catalogs, e-mail messages, and directory data, it has become increasingly important to search...
Independent Quantization: An Index Compression Technique for High-Dimensional Data Spaces (2000)
Stefan Berchtold, Christian Böhm, H. V. Jagadish, Hans-Peter Kriegel, Jörg Sander, Jörg S
Two major approaches have been proposed to efficiently process queries in databases: Speeding up the search by using index structures, and speeding up the search by operating on a compressed...
Unified Fine-Granularity Buffering of Index and Data: Approach and Implementation (2000)
Qiang Cao, Josep Torrellas, H. V. Jagadish
Disk I/O is recognized as a major performance bottleneck in many database applications. Consequently, a topic of considerable study in database systems has traditionally been buer management....
Online Data Mining for Co-Evolving Time Sequences (2000)
Byoung-kee Yi, N. D. Sidiropoulos, Theodore Johnson, H. V. Jagadish, Christos Faloutsos, Alexandros Biliris
In many applications, the data of interest comprises multiple sequences that evolve over time. Examples include currency exchange rates, network traffic data. We develop a fast method to analyze such...
Online Data Mining for Co-Evolving Time Sequences (2000)
Byoung-Kee Yi, N. D. Sidiropoulos, T. Johnson, H. V. Jagadish, C. Faloutsos, ...
In many applications, the data of interest comprises multiple sequences that evolve over time. Examples include currency exchange rates, network traffic data, and demographic data on multiple...
Online Data Mining for Co-Evolving Time Sequences (2000)
Byoung-kee Yi, N. D. Sidiropoulos, Theodore Johnson, H. V. Jagadish, Christos Faloutsos, ...
In many applications, the data of interest comprises multiple sequences that evolve over time. Examples include currency exchange rates, network traffic data. We develop a fast method to analyze such...
On Bounding-Schemas for LDAP Directories (2000)
Sihem Amer-yahia, H. V. Jagadish, Divesh Srivastava
As our world gets more networked, ever increasing amounts of information---e.g., about people, network resources, and policies---are being stored in directories, in particular, in X.500 style...
Independent quantization: An index compression technique for high-dimensional data spaces (2000)
Stefan Berchtold, Christian Böhm, H. V. Jagadish, Hans-peter Kriegel, Jörg S
Two major approaches have been proposed to efficiently process queries in databases: Speeding up the search by using index structures, and speeding up the search by operating on a compressed...
Online data mining for co-evolving time sequences (2000)
H. V. Jagadish, C. Faloutsos, T. Johnson, A. Biliris
under Contract No. N66001-97-C-8517. Additional funding was provided by donations from NEC and Intel. Any opinions, ndings, and conclusions or recommendations expressed in this material are those of...
William Dumouchel, Christos Faloutsos, Peter J. Haas, Joseph M. Hellerstein, Yannis Ioannidis, H. V. Jagadish, ...
The Bulletin of the Technical Committee on Data Engineering is published quarterly and is distributed to all TC members. Its scope includes the design, implementation, modelling, theory and...
Querying network directories (1999)
H. V. Jagadish, Tova Milo, Divesh Srivastava, Dimitra Vista
Hierarchically structured directories have recently proliferated with the growth of the Internet, and are being used to store not only address books and contact information for people, but also...
Range Selectivity Estimation for Continuous Attributes (1999)
Flip Korn, Theodore Johnson, H. V. Jagadish
Many commercial database systems maintain histograms to efficiently estimate query selectivities as part of query optimization. Most work on histogram design is implicitly geared towards discrete or...
On Bounding-Schemas for LDAP Directories (1999)
Sihem Amer-yahia, H. V. Jagadish, Divesh Srivastava
. As our world gets more networked, ever increasing amounts of information are being stored in LDAP directories. While LDAP directories have considerable flexibility in the modeling and retrieval of...
What can Hierarchies do for Data Warehouses? (1999)
H. V. Jagadish, Divesh Srivastava
Data in a warehouse typically has multiple dimensions of interest, such as location, time, and product. It is well-recognized that these dimensions have hierarchies defined on them, such as...
Multi-Dimensional Substring Selectivity Estimation (1999)
H. V. Jagadish, Olga Kapitskaia, Raymond T. Ng, Divesh Srivastava
With the explosion of the Internet, LDAP directories and XML, there is an ever greater need to evaluate queries involving (sub)string matching. In many cases, matches need to be on multiple...
Snakes and Sandwiches: Optimal Clustering Strategies for a Data Warehouse (1999)
H. V. Jagadish, Jagadish Of Illinois, Divesh Srivastava
Physical layout of data is a crucial determinant of performance in a data warehouse. The optimal clustering of data on disk, for minimizing expected I/O, depends on the query workload. In practice,...
What can Hierarchies do for Data Warehouses? (1999)
Jagadish Of Michigan, H. V. Jagadish, Divesh Srivastava
Data in a warehouse typically has multiple dimensions of interest, such as location, time, and product. It is well-recognized that these dimensions have hierarchies defined on them, such as...
Querying Network Directories (1999)
H. V. Jagadish, Jagadish Of Illinois, Tova Milo, Divesh Srivastava, Dimitra Vista
Hierarchically structured directories have recently proliferated with the growth of the Internet, and are being used to store not only address books and contact information for people, but also...
Snakes and Sandwiches: Optimal Clustering Strategies for a Data Warehouse (1999)
H. V. Jagadish, U Of Illinois, Divesh Srivastava
Physical layout of data is a crucial determinant of performance in a data warehouse. The optimal clustering of data on disk, for minimizing expected I/O, depends on the query workload. In practice,...
Substring Selectivity Estimation (1999)
H. V. Jagadish, U Of Illinois, Raymond T. Ng, Divesh Srivastava
With the explosion of the Internet, LDAP directories and XML, there is an ever greater need to evaluate queries involving (sub)string matching. Effective query optimization in this context requires...
Querying Network Directories (1999)
H. V. Jagadish, U Of Illinois, Tova Milo, Divesh Srivastava, Dimitra Vista
Hierarchically structured directories have recently proliferated with the growth of the Internet, and are being used to store not only address books and contact information for people, but also...
December Vol, Christos Faloutsos, Peter J. Haas, Joseph M. Hellerstein, Yannis Ioannidis, H. V. Jagadish, ...
this paper we describe and evaluate several popular techniques for data reduction. Historically, the primary need for data reduction has been internal to a database system, in a cost-based query...
Snakes and sandwiches: Optimal clustering strategies for a data warehouse (1999)
H. V. Jagadish, Divesh Srivastava
Physical layout of data is a crucial determinant of performance in a data warehouse. The optimal clustering of data on disk, for minimizing expected I/O, depends on the query workload. In practice,...
Querying network directories (1999)
H. V. Jagadish, Divesh Srivastava, Dimitra Vista
Hierarchically structured directories have recently proliferated with the growth of the Internet, and are being used to store not only address books and contact information for people, but also...
The Asilomar Report on Database Research (1998)
Bernstein, Phil, Brodie, Michael, Ceri, Stefano, DeWitt, David, Franklin, Mike, Garcia-Molina, Hector, ...
The database research community is rightly proud of success in basic research, and its remarkable record of technology transfer. Now the field needs to radically broaden its research focus to attack...
Online Data Mining for Co-Evolving Time Sequences (1998)
Yi, B. K., Sidiropoulos, N. D., Johnson, T., Jagadish, H. V., Faloutsos, C.
In many applications, the data of interest comprises multiple sequences that evolve over time. Examples include currency exchange rates, network traffic data, and demographic data on multiple...
Optimal Histograms with Quality Guarantees (1998)
H. V. Jagadish, Viswanath Poosala, Nick Koudas, Ken Sevcik, S. Muthukrishnan, Torsten Suel
Histograms are commonly used to capture attribute value distribution statistics for query optimizers. More recently, histograms have also been considered as a way to produce quick approximate answers...
Managing Conflicts between Rules (1998)
H. V. Jagadish, Alberto O. Mendelzon, Inderpal Singh Mumick
Rules are used as a programmingparadigm in several application domains, including active databases, planning, expert systems, and billing. For example, active databases have rules that execute upon...
Flexible List Management in a Directory (1998)
Jagadish Att, H. V. Jagadish, Mark A. Jones, Divesh Srivastava
Lists of entities must often be specified in many real-world applications such as customer lists, electronic distribution lists and access control lists. These lists are typically specified through...
Independence Diagrams: A Technique for Visual Data Mining (1998)
Stefan Berchtold, H. V. Jagadish, Kenneth A. Ross
An important issue in data mining is the recognition of complex dependencies between attributes. Past techniques for identifying attribute dependence include correlation coefficients, scatterplots,...
Asynchronous Version Advancement in a Distributed Three Version Database (1998)
H. V. Jagadish, Inderpal Singh Mumick, Michael Rabinovich
We present an efficient protocol for multi-version concurrency control in distributed databases. The protocol creates no more than three versions of any data item, while guaranteeing that (1) update...
Optimal Histograms with Quality Guarantees (1998)
H. V. Jagadish, Viswanat H Poosala, Nick Koudas, Ken Sevcik
Histograms are commonly used to capture attribute value distribution statistics for query optimizers. More recently, histograms have also been considered as a way to produce quick approximate answers...
Recovering Information from Summary Data (1997)
Faloutsos, C., Jagadish, H.V., Sidiropoulos, N.D.
Data is often stored in summarized form, as a histogram of aggregates (COUNTs,SUMs, or AVeraGes) over specified ranges. Queries regarding specific values, or ranges different from those stored,...
Recovering Information from Summary Data (1997)
Faloutsos, C., Jagadish, H.V., Sidiropoulos, N.D.
Data is often stored in summarized form, as a histogram of aggregates (COUNTs,SUMs, or AVeraGes) over specified ranges. Queries regarding specific values, or ranges different from those stored,...
Efficient Retrieval of Similar Time Sequences Under Time Warping (1997)
Yi, B., Jagadish, H. V., Faloutsos, C.
Fast similarity searching in large time-sequence databases has attracted a lot of research interest. All of them use the Euclidean distance ($L_2$), or some variation of $L_p$ metric. $L_p$ metrics...
Recovering Information from Summary Data (1997)
Faloutsos, Christos, Jagadish, H.V., Sidiropoulos, N.D.
Data is often stored in summarized form, as a histogram of aggregates (COUNTs,SUMs, or AVeraGes) over specified ranges. Queries regarding specific values, or ranges different from those stored,...
Recovering Information from Summary Data (1997)
Faloutsos, Christos, Jagadish, H.V., Sidiropoulos, N.D.
Data is often stored in summarized form, as a histogram of aggregates (COUNTs,SUMs, or AVeraGes) over specified ranges. Queries regarding specific values, or ranges different from those stored,...
Efficient Retrieval of Similar Time Sequences Under Time Warping (1997)
Yi, B., Jagadish, H.V., Faloutsos, Christos
Fast similarity searching in large time-sequence databases has attracted a lot of research interest. All of them use the Euclidean distance ($L_2$), or some variation of $L_p$ metric. $L_p$ metrics...
Analysis of the n-dimensional quadtree decomposition for arbitrary hyperectangles (1997)
Christos Faloutsos, H. V. Jagadish, Yannis Manolopoulos, Ieee Computer Society
Abstract—We give a closed-form expression for the average number of n-dimensional quadtree nodes (“pieces ” or “blocks”) required by an n-dimensional hyperrectangle aligned with the axes....
Efficiently Supporting Ad Hoc Queries in Large Datasets of Time Sequences (1997)
Flip Korn, H. V. Jagadish, Christos Faloutsos
Ad hoc querying is difficult on very large datasets, since it is usually not possible to have the entire dataset on disk. While compression can be used to decrease the size of the dataset, compressed...
Incremental Organization for Data Recording and Warehousing (1997)
H. V. Jagadish, S. Seshadri, S. Sudarshan, Rama Kanneganti
Data warehouses and recording systems typically have a large continuous stream of incoming data, that must be stored in a manner suitable for future access. Access to stored records is usually based...
Recovering Information from Summary Data (1997)
Christos Faloutsos Dept, Christos Faloutsos, H. V. Jagadish, N. D. Sidiropoulos
Data is often stored in summarized form, as a histogram of aggregates (COUNTs, SUMs, or AVeraGes) over specified ranges. We study how to estimate the original detail data from the stored summary. We...
Incremental Organization for Data Recording and Warehousing (1997)
Jagadish Narayan Seshadri, H. V. Jagadish, S. Seshadri, S. Sudarshan, Rama Kanneganti
Data warehouses and recording systems typically have a large continuous stream of incoming data, that must be stored in a manner suitable for future access. Access to stored records is usually based...
Recovering Information from Summary Data (1997)
Christos Faloutsos, H. V. Jagadish, N. D. Sidiropoulos
Data is often stored in summarized form, as a histogram of aggregates (COUNTs, SUMs, or AVeraGes) over specified ranges. We study how to estimate the original detail data from the stored summary. We...
A Signature Technique for Similarity-Based Queries (1997)
Exte Nd Ed, C. Faloutsos, H. V. Jagadish, A. O. Mendelzon, T. Milo
) C. Faloutsos Univ. of Maryland christos@cs.umd.edu H. V. Jagadish AT&T Labs jag@research.att.com A. O. Mendelzon Univ. of Toronto mendel@db.toronto.edu T. Milo Tel Aviv Univ....
Efficiently Supporting Ad Hoc Queries in Large Datasets of Time Sequences (1997)
Flip Korn, H. V. Jagadish, Christos Faloutsos
Ad hoc querying is difficult on very large datasets, since it is usually not possible to have the entire dataset on disk. While compression can be used to decrease the size of the dataset, compressed...
Efficient Retrieval of Similar Time Sequences Under Time Warping (1997)
Byoung-kee Yi, H. V. Jagadish, Christos Faloutsos
Fast similarity searching in large time-sequence databases has attracted a lot of research interest [1, 5, 2, 6, 3, 10]. All of them use the Euclidean distance (L 2 ), or some variation of L p...
The New Jersey Data Reduction Report (1997)
Daniel Barbar'a, William Dumouchel, Christos Faloutsos, Peter J. Haas, Joseph M. Hellerstein, Yannis Ioannidis, ...
this paper we describe and evaluate several popular techniques for data reduction. Historically, the primary need for data reduction has been internal to a database system, in a cost-based query...
Analysis of the n-Dimensional Quadtree Decomposition for Arbitrary Hyper-rectangles (1997)
Christos Faloutsos, H. V. Jagadish, Yannis Manolopoulos
We give a closed-form expression for the average number of n-dimensional quadtree nodes (`pieces' or `blocks') required by an n-dimensional hyper-rectangle aligned with the axes. Our...
Recovering Information from Summary Data (1997)
Christos Faloutsos, H. V. Jagadish, N. D. Sidiropoulos
Data is often stored in summarized form, as a histogram of aggregates (COUNTs, SUMs, or AVeraGes) over specified ranges. We study how to estimate the original detail data from the stored summary. We...
A Signature Technique for Similarity-Based Queries (Extended Abstract) (1997)
C. Faloutsos, H. V. Jagadish, A. O. Mendelzon, T. Milo
) C. Faloutsos , H. V. Jagadish AT&T Bell Labs Murray Hill, NJ 07974 fchristos,jagg@research.att.com A. O. Mendelzon Dept. of Computer Science Univ. of Toronto mendel@db.toronto.edu T. Milo Tel...
A Signature Technique for Similarity-Based Queries (Extended Abstract) (1997)
C. Faloutsos, H. V. Jagadish, A. O. Mendelzon, T. Milo
) C. Faloutsos Univ. of Maryland christos@cs.umd.edu H. V. Jagadish AT&T Labs jag@research.att.com A. O. Mendelzon Univ. of Toronto mendel@db.toronto.edu T. Milo Tel Aviv Univ....
Scalable Versioning in Distributed Databases with Commuting Updates (1997)
H. V. Jagadish, Inderpal Singh Mumick, Michael Rabinovich
We present a multiversioning scheme for a distributed system with the workload consisting of read-only transactions and update transactions, (most of) which commute on individual nodes. The scheme...
SUNRISE II: A Scalable and Timely Billing Architecture (1997)
H. V. Jagadish, Inderpal Singh Mumick
SUNRISE II is an architecture describing the management of customer and usage data for billing and other account services in any transaction based system. The architecture provides real-time rating,...
• problem #1: text- LSI: find ‘concepts’ (1997)
Christos Faloutsos, Flip Korn, H. V. Jagadish, Christos Faloutsos “efficiently, A. Labrinidis, C. Faloutsos, ...
www.cs.cmu.edu/~christos/PUBLICATIONS.OLDER/sigmod97.ps.gz
C.: The New Jersey Data Reduction Report (1997)
Daniel Barbara, William Dumouchel, Christos Faloutsos, Peter J. Haas, Joseph M. Hellerstein, Yannis Ioannidis, ...
There is often a need to get quick approximate answers from large databases. This leads to a need for data reduction. There are many di erent approaches to this problem, some of them not...
Analysis of the Clustering Properties of Hilbert Space-filling Curve (1996)
Moon, Bongki, Jagadish, H.V., Faloutsos, Christos, Saltz, Joel
Several schemes for linear mapping of multidimensional space have been proposed for many applications such as access methods for spatio-temporal databases, image compression and so on. In all these...
Analysis of the Clustering Properties of Hilbert Space-filling Curve (1996)
Moon, Bongki, Jagadish, H.V., Faloutsos, Christos, Saltz, Joel
Several schemes for linear mapping of multidimensional space have been proposed for many applications such as access methods for spatio-temporal databases, image compression and so on. In all these...
Analysis of the Clustering Properties of the Hilbert Space-Filling Curve (1996)
Bongki Moon, H. V. Jagadish, Christos Faloutsos, Joel H. Saltz
Several schemes for linear mapping of a multidimensional space have been proposed for various applications such as access methods for spatio-temporal databases and image compression. In these...
Fine-granularity Locking and Client-Based Logging for Distributed Architectures (1996)
E. Panagos, A. Biliris, H.V. Jagadish, R. Rastogi
We present algorithms for fine-granularity locking and client-based logging where all transactional facilities in a distributed client-server architecture are provided locally. Multiple clients are...
Data Integration using Self-Maintainable Views (1996)
Ashish Gupta, H. V. Jagadish, Inderpal Singh Mumick
. In this paper we de#ne the concept of self-maintainable views # these are views that can be maintained using only the contents of the view and the database modi#cations, without accessing any of...
Client-Based Logging for High Performance Distributed Architectures (1996)
Panagos Biliris, E. Panagos, A. Biliris, H. V. Jagadish, R. Rastogi
In this paper, we propose logging and recovery algorithms for distributed architectures that use local disk space to provide transactional facilities locally. Each node has its own log file where all...
Data Integration using Self-Maintainable Views (1996)
Ashish Gupta, H. V. Jagadish, Inderpal Singh Mumick
. In this paper we define the concept of self-maintainable views -- these are views that can be maintained using only the contents of the view and the database modifications, without accessing any of...
Data Integration Using Self-Maintainable Views (1996)
Ashish Gupta, H. V. Jagadish, Inderpal S. Mumick
Integration of data from multiple databases is an important problem. We consider a model for data integration wherein data from multiple databases is combined into an integrated view that is...
Analysis of the Clustering Properties of Hilbert Space-filling Curve (1996)
Bongki Moon, H. V. Jagadish, Christos Faloutsos, Joel H. Saltz
Several schemes for linear mapping of multidimensional space have been proposed for many applications such as access methods for spatio-temporaldatabases, image compression and so on. In all these...
Answering Queries with Aggregation Using Views (1996)
Divesh Srivastava, Shaul Dar, H. V. Jagadish, Alon Y. Levy
We present novel algorithms for the problem of using materialized views to compute answers to SQL queries with grouping and aggregation, in the presence of multiset tables. In addition to its obvious...
Queries in an object-oriented graphical interface (1995)
S. Dar, N. H. Gehani, H. V. Jagadish, J. Srinivasan
Many database users prefer to access and manipulate information in databases visually, without using a textual interface, such as a traditional programming language or SQL. Consequently, there is...
Similarity-Based Queries (1995)
H. V. Jagadish, Alberto O. Mendelzon, Tova Milo
We develop a domain-independent framework for defining queries in terms of similarity of objects. Our framework has three components: a pattern language, a transformation rule language, and a query...
Analysis of the n-dimensional quadtree decomposition for arbitrary hyper-rectangles (1994)
Faloutsos, Christos, Jagadish, H.V., Manolopoulos, Yannis
We give a closed-form expression for the average number of $n$-dimensional quadtree nodes (`pieces' or `blocks') required by an $n$-dimensional hyper-rectangle aligned with the axes. Our formula...
Analysis of the n-dimensional quadtree decomposition for arbitrary hyper-rectangles (1994)
Faloutsos, Christos, Jagadish, H.V., Manolopoulos, Yannis
We give a closed-form expression for the average number of $n$-dimensional quadtree nodes (`pieces' or `blocks') required by an $n$-dimensional hyper-rectangle aligned with the axes. Our formula...
The TV-tree -- an Index Structure for High-Dimensional Data (1994)
Lin, K-I., Jagadish, H.V., Faloutsos, C.
We propose a file structure to index high-dimensionality data, typically, points in some feature space. The idea is to use only a few of the features, utilizing additional features whenever the...
Analysis of the n-dimensional quadtree decomposition for arbitrary hyper-rectangles (1994)
Faloutsos, C., Jagadish, H.V., Manolopoulos, Y.
We give a closed-form expression for the average number of n- dimensional quadtree nodes (ieces' or locks') required by an n-dimensional hyper-rectangle aligned with the axes. Our formula...
The TV-tree -- an Index Structure for High-Dimensional Data (1994)
Lin, K-I., Jagadish, H.V., Faloutsos, Christos
We propose a file structure to index high-dimensionality data, typically, points in some feature space. The idea is to use only a few of the features, utilizing additional features whenever the...
Analysis of the n-dimensional quadtree decomposition for arbitrary hyper-rectangles (1994)
Faloutsos, Christos, Jagadish, H.V., Manolopoulos, Y.
We give a closed-form expression for the average number of n- dimensional quadtree nodes (ieces' or locks') required by an n-dimensional hyper-rectangle aligned with the axes. Our formula...
COMPOSE A System For Composite Event Specification and Detection (1994)
Narain Gehani, H. V. Jagadish, Oded Shmueli
Triggers, which make databases active, are specified as event-action pairs. We have developed a model for specifying composite events, which are events that are composed from simple events or from...
OdeFS: A File System Interface to an Object-Oriented Database (1994)
Gehani Jagadish Roome, N. Gehani, H. V. Jagadish, W. D. Roome
OdeFS is a file-like interface to the Ode object-oriented database. Database objects are accessed and manipulated like files in a traditional file system using standard UNIX commands. For example,...
The TV-tree -- an index structure for high-dimensional data (1994)
King-ip Lin, H. V. Jagadish, Christos Faloutsos
We propose a file structure to index high-dimensionality data, typically, points in some feature space. The idea is to use only a few of the features, utilizing additional features whenever the...
ASSET: A System for Supporting Extended Transactions (1994)
A. Biliris, S. Dar, N. Gehani, H. V. Jagadish, K. Ramamritham
Extended transaction models in databases were motivated by the needs of complex applications such as CAD and software engineering. Transactions in such applications have diverse needs, for example,...
ASSET: A System for Supporting Extended Transactions (1994)
Biliris Dar, A. Biliris, S. Dar, N. Gehani, H. V. Jagadish, K. Ramamritham
Extended transaction models in databases were motivated by the needs of complex applications such as CAD and software engineering. Transactions in such applications have diverse needs, for example,...
The TV-tree - an index structure for high-dimensional data (1994)
King-ip Lin, H. V. Jagadish, Christos Faloutsos
We propose a file structure to index high-dimensionality data, typically, points in some feature space. The idea is to use only a few of the features, utilizing additional features whenever the...
Dali: A high performance main memory storage manager (1994)
H. V. Jagadish, Daniel Lieuwen, Rajeev Rastogi, S. Sudarshan, Avi Silberschatz
Performance needs of many database appli-cations dictate that the entire database be stored in main memory. The Dali system is a main memory storage manager designed to provide the persistence,...
QVLDB The W-Tree: An Index Structure for High-Dimensional Data (1993)
King-lp Lin, H. V. Jagadish, Christos Faloutsos
Abstract. We propose a file structure to index high-dimensionality data, which are typically points in some feature space. The idea is to use only a few of the fea-tures, using additional features...
Temporal Queries for Active Database Support (1993)
N. H. Gehani, H. V. Jagadish, Inderpal Singh Mumick, Oded Shmueli
An active database monitors events (such as access, insert, delete, and update of tuples/ objects, and invocation of methods on objects). Each event potentially changes the database state....
Recovering from Main-Memory Lapses (1993)
H. V. Jagadish, Avi Silberschatz, S. Sudarshan
Recovery activities, like logging, checkpointing and restart, are used to restore a database to a consistent state after a system crash has occurred. Recovery related overhead is particularly...
Refereed Conference Publications (1993)
A. Biliris, A. Biliris, T Bell, A. Biliris, N. Gehani, D. Lieuwen, ...
\Client-Based Logging for High Performance Distributed Architectures. " With A.
Diamond-Tree: An Index Structure for High-Dimensionality Approximate Searching (1992)
A selection query applied to a database often has the selection predicate imperfectly specified. We present a technique, called the Diamond-tree, for indexing fields to perform similarity-based...
Diamond-Tree: An Index Structure for High-Dimensionality Approximate Searching (1992)
Faloutsos, Christos, Jagadish, H.V.
A selection query applied to a database often has the selection predicate imperfectly specified. We present a technique, called the Diamond-tree, for indexing fields to perform similarity-based...
Composite event specification in active databases: Model and implementation (1992)
Active database systems require facilities to specify triggers that fire when specified events occur. We propose a language for specifying composite events as eveti expressions, formed using event...
Cql++: A sql for a c++ based object-oriented dbms (1992)
S. Dar, N. H. Gehani, H. V. Jagadish
Ode is a database system and environment based on the object paradigm. It offers an integrated data model for both database and general purpose manipulation [1, 2]. The database is defined, queried,...
Composite event specification in active databases: Model and implementation (1992)
N. H. Gehani, H. V. Jagadish, O. Shmueli
Of late, there has been a surge of interest in active databases [5, Dayal Ladin Hsu Jauhari HiPAC, 2, 8, 12, 14-16]. In an active database, a trigger fires when an event of interest happens and some...
A Proclamation-Based Model for Cooperating Transactions (1992)
H. V. Jagadish, Jagadish Oded Shmueli
We propose a transaction model that provides a framework for transactions to cooperate without sacrificing serializability as a notion of correctness. Cooperation does not depend on detailed...
A Flexible Transaction Facility for an Object-Oriented Database (1992)
A. Biliris, S. Dar, N. Gehani, H. V. Jagadish, K. Ramamritham
Object-oriented databases were motivated by the needs of complex applications such as CAD and software engineering. Transactions in such applications have diverse needs: they may be long lived and...
Integrity Maintenance in an Object-Oriented Database (1992)
We present an approach for integrating inter-object constraint maintenance seamlessly into an objectoriented database system. We develop a constraint compilation scheme that accepts declarative...
Event Specification in an Active Object-Oriented Database (1992)
Gehani Jagadish, N. H. Gehani, H. V. Jagadish, O. Shmueli
The concept of a trigger is central to any active database. Upon the occurrence of a trigger event, the trigger is fired, i.e, the trigger action is executed. We describe a model for...
Events with Attributes in an Active Database (1992)
Jagadish Att Bell, H. V. Jagadish, Inderpal Singh Mumick, Oded Shmueli
In an active database, triggers are fired in response to the occurrence of events. Events may have attributes, and the values of these attributes may be used as parameters to functions invoked in the...
On B-tree Indices for Skewed Distributions (1992)
Christos Faloutsos, H. V. Jagadish
It is often the case that the set of values over which a B-Tree is constructed has a skewed distribution. We present a geometric growth technique to manage postings records in such cases, and show...
Integrity maintenance in an object-oriented database (1992)
We present an approach for integrating inter-object constraint maintenance seamlessly into an object-oriented database system. We develop a constraint compilation scheme that accepts declarative...
A proclamation-based model for cooperating transactions (1992)
We propose a transaction model that provides a framework for transactions to cooperate without sacrificing serializability as a notion of correctness. Cooperation does not depend on detailed...
Ode as an Active Database: Constraints and Triggers (1991)
this paper, after a quick introduction to O++ in Section 2, we state our design goals in providing trigger and constraint facilities for an object-oriented database in Section 3. We then describe the...
Architectural Support for Real-Time Database Systems (1991)
Paul Krzyzanowski, Nandit Soparkar, Abhaya Asthana, Abhaya Asthana, H. V. Jagadish, H. V. Jagadish
The requirements of a real-time database management system indicate that standard architectural platforms may be unable to provide adequate support. We present the design of a back-end...
On Correctly Configuring Versioned Objects (1989)
Rakesh Agrawal, H. V. Jagadish
We consider the problem of configuring a system in software and design database domains, where a system comprises a version for each of its constituent objects. We present a syntactic...
Direct Algorithms for Computing the Transitive Closure of Database Relations (1987)
Rakesh Agrawal, H. V. Jagadish
We present new algorithms for computing the transitive closure of large database relations. Unlike iterative algorithms, such as the semi-naive and the logarithmic algorithms, the termination of our...
Thesis (Ph. D.)--Stanford University, 1986.
Michigan Molecular Interactions (MiMI): putting the jigsaw puzzle together
Jayapandian, Magesh, Chapman, Adriane, Tarcea, V. Glenn, Yu, Cong, Elkiss, Aaron, Ianni, Angela, ...
Protein interaction data exists in a number of repositories. Each repository has its own data format, molecule identifier and supplementary information. Michigan Molecular Interactions (MiMI) assists...
Dinov, Ivo D., Rubin, Daniel, Lorensen, William, Dugan, Jonathan, Ma, Jeff, Murphy, Shawn, ...
The advancement of the computational biology field hinges on progress in three fundamental directions – the development of new computational algorithms, the availability of informatics resource...
Constructing a Generic Natural Language Interface for an XML Database
Yunyao Li, Huahai Yang, H. V. Jagadish
We describe the construction of a generic natural language query interface to an XML database. Our interface can accept an arbitrary English sentence as a query, which can be quite complex and...
ItCompress: An Iterative Semantic Compression Algorithm
Jagadish Raymond Ng, H. V. Jagadish, Raymond T. Ng, Beng Chin, Ooi Anthony, K. H. Tung
Real datasets are often large enough to necessitate data compression. Traditional `syntactic' data compression methods treat the table as a large byte string and operate at the byte level. The...
Michigan molecular interactions r2: from interacting proteins to pathways
Tarcea, V. Glenn, Weymouth, Terry, Ade, Alex, Bookvich, Aaron, Gao, Jing, Mahavisno, Vasudeva, ...
Molecular interaction data exists in a number of repositories, each with its own data format, molecule identifier and information coverage. Michigan molecular interactions (MiMI) assists scientists...