WorldCat Identities

Jagadish, H. V.

Overview
Works: 58 works in 84 publications in 1 language and 299 library holdings
Genres: Conference papers and proceedings 
Roles: Editor, Author
Classifications: QA76.9.D26, 005.756
Publication Timeline
.
Most widely held works by H. V Jagadish
Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data : May 23-25, 1990, Atlantic City, N.J. by ACM SIGMOD International Conference on Management of Data( Book )

10 editions published between 1989 and 1990 in English and held by 79 WorldCat member libraries worldwide

Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data : SIGMOD '96, Montreal, Quebec, Canada June 4-6, 1996 by ACM-Sigmod International Conference on Management of Data( Book )

4 editions published in 1996 in English and held by 53 WorldCat member libraries worldwide

1996 proceedings ACM SIGMOD International Conference on Management of Data : June 4 to 6, Montréal, Québec, Canada by International Conference on Management of Data( Book )

3 editions published in 1996 in English and held by 8 WorldCat member libraries worldwide

37th International Conference on Very Large Data Bases 2011 : (VLDB 2011), Seattle, Washington, USA, 29 August-3 September 2011 by International Conference on Very Large Data Bases( Book )

1 edition published in 2012 in English and held by 8 WorldCat member libraries worldwide

ISMB 2005 proceedings : thirteenth International Conference on Intelligent Systems for Molecular Biology by International Conference on Intelligent Systems for Molecular Biology( Book )

4 editions published in 2005 in English and held by 6 WorldCat member libraries worldwide

Analysis of the n-dimensional quadtree decomposition for arbitrary hyper-rectangles by Christos Faloutsos( Book )

2 editions published in 1994 in English and held by 5 WorldCat member libraries worldwide

Abstract: "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 includes as special cases the formulae of previous efforts for 2- dimensional spaces [8]. It also agrees with theoretical and empirical results that the number of blocks depends on the hyper-surface of the hyper-rectangle and not on its hyper-volume. The practical use of the derived formula is that it allows the estimation of the space requirements of the n-dimensional quadtree decomposition. Quadtrees are used extensively in 2-dimensional spaces (geographic information systems and spatial databases in general), as well in [sic] higher dimensionality spaces (as oct-trees for 3-dimensional spaces, e.g. in graphics, robotics and 3-dimensional medical images [2]). Our formula permits the estimation of the space requirements for data hyper-rectangles when stored in an index structure like a (n-dimensional) quadtree, as well as the estimation of the search time for query hyper-rectangles. A theoretical contribution of the paper is the observation that the number of blocks is a piece-wise linear function of the sides of the hyper-rectangle."
Efficient management of transitive relationships in large data bases, including IS-A hierarchies by Rakesh Agrawal( Book )

2 editions published in 1991 in English and held by 4 WorldCat member libraries worldwide

Abstract: "We argue that accessing the transitive closure of relationships is an important component of both databases and knowledge representation systems in Artificial Intelligence. The demands for efficient access and management of large relationships motivate the need for explicitly storing the transitive closure in a compressed and local way, while allowing updates to the base relation to be propagated incrementally. We present a transitive closure compression technique, based on labeling spanning trees with numeric intervals, and provide both analytical and empirical evidence of its efficacy, including a proof of optimality. Incremental update algorithms are also presented."
40th International Conference on Very Large Data Bases 2014, (VLDB 2014) : proceedings of the VLDB Endowment, volume 7 no. 1-14, Hangzhou, China, 1-5 September 2014 by International Conference on Very Large Data Bases( Book )

1 edition published in 2014 in English and held by 4 WorldCat member libraries worldwide

Hybrid index organizations for text databases by Christos Faloutsos( Book )

1 edition published in 1991 in English and held by 4 WorldCat member libraries worldwide

Abstract: "In the light of Zipf's law it is unlikely that any single technique for indexing text can do well in all situations. In this paper we propose a hybrid approach to indexing text, and show how it can outperform the traditional inverted B-tree index both in storage overhead, in time to perform a retrieval, and, for dynamic databases, in time for an insertion, both for single term and for multiple term queries. We demonstrate the benefits of our technique on a database of stories from the Associated Press news wire, and we provide formulae and guidelines on how to make optimal choices of the design parameters in real applications."
Database modeling & design by Toby J Teorey( Book )

4 editions published between 2005 and 2011 in English and held by 3 WorldCat member libraries worldwide

"In the extensively revised fourth edition, you'll get clear explanations, lots of terrific examples and an illustrative case, and the really practical advice you have come to count on - with design rules that are applicable to any SQL-based system."--Jacket
Techniques for the design of parallel and pipelined VLSI systems for numerical computation with special reference to signal processing applications by H. V Jagadish( Book )

2 editions published between 1985 and 1986 in English and held by 2 WorldCat member libraries worldwide

The TV-tree : an index structure for high-dimensional data by King-Ip Lin( Book )

1 edition published in 1994 in English and held by 2 WorldCat member libraries worldwide

Abstract: "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 additional discriminatory power is absolutely necessary. We present in detail the design of our tree structure and the associated alogrithms that handle such 'varying length' feature vectors. Finally we report simulation results, comparing the proposed structure with the R*-tree, which is one of the most successful methods for low-dimensionality spaces. The results illustrate the superiority of our method, with up to 80% savings in disk accesses."
Selected papers from the First International Conference on Parallel and Distributed Information Systems : [held in Miami, Florida, Dec. 4 - 6, 1991] by International Conference on Parallel and Distributed Information Systems( Book )

2 editions published in 1993 in English and held by 2 WorldCat member libraries worldwide

1996 Proceedings : ACM SIGMOD international conference on management of data( Book )

2 editions published in 1996 in English and held by 2 WorldCat member libraries worldwide

Enabling domain-awareness for a generic natural language interface( )

1 edition published in 2007 in Undetermined and held by 1 WorldCat member library worldwide

Integrating XML data sources using approximate joins by H. V Jagadish( )

1 edition published in 2006 in English and held by 1 WorldCat member library worldwide

Proceedings : June 4 to 6, Montréal, Québec, Canada by Montréal> International Conference on Management of Data. <1996( Book )

1 edition published in 1996 in English and held by 1 WorldCat member library worldwide

Efficient management of transitive relationships in large databases, including Is-A hierarchies by Rutgers University( Book )

1 edition published in 1991 in English and held by 1 WorldCat member library worldwide

Database Modeling and Design( )

2 editions published between 2010 and 2011 in English and held by 0 WorldCat member libraries worldwide

Database systems and database design technology have undergone significant evolution in recent years. The relational data model and relational database systems dominate business applications; in turn, they are extended by other technologies like data warehousing, OLAP, and data mining. How do you model and design your database application in consideration of new technology or new business needs? In the extensively revised fourth edition, you'll get clear explanations, lots of terrific examples and an illustrative case, and the really practical advice you have come to count on--with design rules that are applicable to any SQL-based system. But you'll also get plenty to help you grow from a new database designer to an experienced designer developing industrial-sized systems
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.73 (from 0.24 for Database m ... to 0.94 for 1996 proce ...)

Database modeling & design
Languages
English (45)

Covers