Lipyeow Lim
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Lipyeow Lim has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Min Wang
IBM T. J. Watson Research Center
2 shared publications - Bishwaranjan Bhattacharjee
IBM T. J. Watson Research Center
1 shared publication - Haixun Wang
IBM T. J. Watson Research Center
1 shared publication - Jeffrey Scott Vitter
Purdue University Department of Computer Science West Lafayette, Indiana, 47907–2107
1 shared publication - Ramesh K. Agarwal
Washington University in St. Louis
1 shared publication - Sriram Padmanabhan
IBM Silicon Valley Lab., San Jose, USA
1 shared publication
Latest Publications
- 1 April 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1531-1533
Optimizing Hierarchical Access in OLAP Environment
In online analytic processing (OLAP) deployments, different users, lines of businesses and business units often create adhoc aggregation hierarchies tailor-made for specific reporting or analytical applications. As a result, a large number of these application specific hierarchies accumulate over time. System administrators typically are not able to optimize all these hierarchical accesses by hand due to the large number of hierarchies. However, many optimization opportunities exist due to the significant amount of overlap between some hierarhies. In this paper, we sketch a novel method for optimizing OLAP aggregation queries using precomputed aggregates on other overlapping hierarchies. Our method detects common sub-structures among hierarchies and provides a rewriting algorithm to exploit any precomputations on these shared sub-structures.
- 1 April 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1531-1533
Optimizing Hierarchical Access in OLAP Environment
In online analytic processing (OLAP) deployments, different users, lines of businesses and business units often create adhoc aggregation hierarchies tailor-made for specific reporting or analytical applications. As a result, a large number of these application specific hierarchies accumulate over time. System administrators typically are not able to optimize all these hierarchical accesses by hand due to the large number of hierarchies. However, many optimization opportunities exist due to the significant amount of overlap between some hierarhies. In this paper, we sketch a novel method for optimizing OLAP aggregation queries using precomputed aggregates on other overlapping hierarchies. Our method detects common sub-structures among hierarchies and provides a rewriting algorithm to exploit any precomputations on these shared sub-structures.
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636382,p. 1438-1442
Semantic Data Management: Towards Querying Data with their Meaning
Relational database management systems are constantly being extended and augmented to accommodate data in different domains. Recently, with the increasing use of ontology in various applications, the need to support ontology, especially the related inferencing operation, in DBMS has become more concrete and urgent. However, manipulating knowledge along with relational data in DBMSs is not a trivial undertaking due to the mismatch in data models. In this paper, we introduce a framework for managing relational data and hierarchical domain knowledge together. Our framework persists taxonomies contained in ontologies by leveraging XML support in hybrid relational-XML DBMSs (e.g., IBM's DB2 v9) and rewrites ontology-based semantic matching queries using the industry-standard query languages, SQL/XML and XQuery. Compared with previous approaches, our approach does not materialize transitive closures of ontological relationships to support inferencing. Consequently, our method has wide applicability and good performance.
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636382,p. 1438-1442
Semantic Data Management: Towards Querying Data with their Meaning
Relational database management systems are constantly being extended and augmented to accommodate data in different domains. Recently, with the increasing use of ontology in various applications, the need to support ontology, especially the related inferencing operation, in DBMS has become more concrete and urgent. However, manipulating knowledge along with relational data in DBMSs is not a trivial undertaking due to the mismatch in data models. In this paper, we introduce a framework for managing relational data and hierarchical domain knowledge together. Our framework persists taxonomies contained in ontologies by leveraging XML support in hybrid relational-XML DBMSs (e.g., IBM's DB2 v9) and rewrites ontology-based semantic matching queries using the industry-standard query languages, SQL/XML and XQuery. Compared with previous approaches, our approach does not materialize transitive closures of ontological relationships to support inferencing. Consequently, our method has wide applicability and good performance.
- 2 March 2007
- Published by Springer Nature in World Wide Web
- Vol. 10 (1) , 37-69
Efficient Update of Indexes for Dynamically Changing Web Documents
- 2 March 2007
- Published by Springer Nature in World Wide Web
- Vol. 10 (1) , 37-69
Efficient Update of Indexes for Dynamically Changing Web Documents