An Adaptable Distributed Query Processing Architecture (2008)
Zhou, Yongluan, Ooi, Beng Chin, Tan, Kian-Lee, Tok, Wee Hyong
Optimizing Continuous Multijoin Queries over Distributed Streams (2008)
Zhou, Yongluan, Ying, Yan, Ooi, Beng Chin, Tan, Kian-Lee, Zhou, Aoying
A graph method for keyword-based selection of the top-K databases (2008)
Vu, Quang Hieu, Ooi, Beng Chin, Papadias, Dimitris, Tung, Anthony K. H.
While database management systems offer a comprehensive solution to data storage, they require deep knowledge of the schema, as well as the data manipulation language, in order to perform effective...
Disseminating Streaming Data in a Dynamic Environment: an Adaptive and Cost-Based Approach (2007)
Zhou, Yongluan, Ooi, Beng Chin, Tan, Kian-Lee
In a distributed stream processing system, streaming data are continuously disseminated from the sources to the distributed processing servers. To enhance the dissemination efficiency, these servers...
Collaborative Data Publishing and Searching System (2007)
Ooi, Beng Chin, Yu, Bei, Li, Guoliang
In this paper, we present a folksonomy-based collaborative data publishing and searching system. The system accepts data objects described with user-created metadata, called data units. The system...
Collaborative Data Publishing and Searching System (2007)
Ooi, Beng Chin, Yu, Bei, Li, Guoliang
In this paper, we present a folksonomy-based collaborative data publishing and searching system. The system accepts data objects described with user-created metadata, called data units. The system...
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 Effective Indexing for Very Large Video Sequence Database (2006)
Heng Tao Shen, Beng Chin Ooi, Xiaofang Zhou, Zi Huang
With rapid advances in video processing technologies and ever fast increments in network bandwidth, the popularity of video content publishing and sharing has made similarity search an indispensable...
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 Effective Indexing for Very Large Video Sequence Database (2006)
Heng Tao Shen, Beng Chin Ooi, Xiaofang Zhou, Zi Huang
With rapid advances in video processing technologies and ever fast increments in network bandwidth, the popularity of video content publishing and sharing has made similarity search an indispensable...
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...
Keyword Join: Realizing Keyword Search for Information Integration (2005)
Yu, Bei, Liu, Ling, Ooi, Beng Chin, Tan, Kian Lee
Information integration has been widely addressed over the last several decades. However, it is far from solved due to the complexity of resolving schema and data heterogeneities. In this paper, we...
Keyword Join: Realizing Keyword Search for Information Integration (2005)
Yu, Bei, Liu, Ling, Ooi, Beng Chin, Tan, Kian Lee
Information integration has been widely addressed over the last several decades. However, it is far from solved due to the complexity of resolving schema and data heterogeneities. In this paper, we...
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...
Towards Effective Indexing for Large Video Sequence Data (2005)
Shen, Heng Tao, Ooi, Beng Chin, Zhou, Xiaofang, Huang, Zhou
With rapid advances in video processing technologies and ever fast increments in network bandwidth, the popularity of video content publishing and sharing has made similarity search an indispensable...
Keyword Join: Realizing Keyword Search in P2P-based Database Systems (2004)
Yu, Bei, Liu, Ling, Ooi, Beng Chin, Tan, Kian Lee
In this paper, we present a P2P-based database sharing system that provides information sharing capabilities through keyword-based search techniques. Our system requires neither a global schema nor...
Keyword Join: Realizing Keyword Search in P2P-based Database Systems (2004)
Yu, Bei, Liu, Ling, Ooi, Beng Chin, Tan, Kian Lee
In this paper, we present a P2P-based database sharing system that provides information sharing capabilities through keyword-based search techniques. Our system requires neither a global schema nor...
An Adaptable Distributed Query Processing Architecture (2004)
Yongluan Zhou, Beng Chin Ooi, Kian-lee Tan, Wee Hyong Tok
Traditionally, distributed query optimization techniques generate static query plans at compile time. However, the optimality of these plans depends on many parameters (such as the selectivities of...
GORDER: An Efficient Method for KNN Join Processing (2004)
Chenyi Xia, Hongjun Lu, Beng Chin Ooi, Jing Hu
An important but very expensive primitive operation of high-dimensional databases is the KNearest Neighbor (KNN) similarity join. The operation combines each point of one dataset with its KNNs in the...
Query and Update Efficient B -Tree Based Indexing of (2004)
Christian S. Jensen, Dan Lin, Beng Chin Ooi
A number of emerging applications of data management technology involve the monitoring and querying of large quantities of continuous variables, e.g., the positions of mobile service users, termed...
Global Optimization of Histograms (2004)
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...
Answering Similarity Queries in Peer-to-Peer Networks (2004)
Panos Kalnis, Wee Siong Ng, Beng Chin Ooi, Kian-lee Tan
this paper we investigate a different problem: Users ask fuzzy queries like "find the top-k images which are similar to a given sample ". Such queries are common in image retrieval systems. Since...
LDC: Enabling Search By Partial Distance In A Hyper-Dimensional (2003)
Nick Koudas, Beng Chin Ooi, Heng Tao Shen
Recent advances in research fields like multimedia and bioinformatics have brought about a new generation of hyper-dimensional databases which can contain hundreds or even thousands of dimensions....
LDC: Enabling Search By Partial Distance In A Hyper-Dimensional (2003)
Nick Koudas, Beng Chin Ooi, Heng Tao Shen
Recent advances in research fields like multimedia and bioinformatics have brought about a new generation of hyper-dimensional databases which can contain hundreds or even thousands of dimensions....
Managing Trust in Peer-to-Peer Systems Using Reputation-Based Techniques (2003)
Beng Chin Ooi, Chu Yee Liau, Kian-lee Tan
In this paper, we examine the issue of managing trust in peerto -peer systems. In particular, we focus on reputation-based schemes. We look at some design considerations in implementing distributed...
Contorting High Dimensional Data for Ecient Main Memory KNN (2003)
Bin Cui, Beng Chin Ooi, Jianwen Su
In this paper, we present a novel index structure, called #- tree, to speed up processing of high-dimensional K-nearest neighbor (KNN) queries in main memory environment. The #-tree is a multi-level...
PeerDB: Peering into Personal Databases (2003)
Beng Chin Ooi, Kian-lee Tan, Aoying Zhou, Chin Hong Goh, Yingguang Li, Chu Yee Liau, ...
eerDB nodes communicate or share resources with each other. Each node comprises four components that are loosely integrated: (a) a data management system (we used MySQL in our implementation) that...
DB-Enabled Peers for Managing Distributed Data (2003)
Beng Chin Ooi, Yanfeng Shu, Kian Lee Tan
Peer-to-peer (P2P) computing is the sharing of computer resources, services and information by direct negotiation and exchange between autonomous and heterogeneous systems. An alternative approach to...
PeerDB-Peering into Personal Databases (2003)
In this talk, we will present the design and evaluation of PeerDB, a peer-to-peer (P2P) distributed data sharing system. PeerDB distinguishes itself from existing P2P systems in several ways. First,...
PeerDB-Peering into Personal Databases (2003)
In this talk, we will present the design and evaluation of PeerDB, a peer-to-peer (P2P) distributed data sharing system. PeerDB distinguishes itself from existing P2P systems in several ways. First,...
PeerDB: A P2P-based System for Distributed Data Sharing (2002)
Beng Chin Ooi, Kian-lee Tan, Aoying Zhou
In this paper, we present the design and evaluation of PeerDB, a peer-to-peer (P2P) distributed data sharing system. PeerDB distinguishes itself from existing P2P systems in several ways. First, it...
An Adaptive and Efficient Dimensionality Reduction Algorithm for High-Dimensional Indexing (2002)
Hui Jin, Beng Chin Ooi, Heng Tao Shen, Cui Yu, Ao Ying Zhou
The notorious "dimensionality curse" is a well-known phenomenon for any multi-dimensional indexes attempting to scale up to high dimensions. One well known approach to overcoming degradation in...
XR-Tree: Indexing XML Data for Efficient Structural Joins (2002)
Haifeng Jiang, Hongjun Lu, Wei Wang, Beng Chin Ooi
XML documents are typically queried with a combination of value search and structure search. While querying by values can leverage traditional database technologies, evaluating structural...
Advanced Database Technologies in a (2002)
Wynne Hsu, Mong Li Lee, Beng Chin Ooi, Pranab Kumar Mohanty, Keng Lik Teo, Chenyi Xia
With the increased emphasis on healthcare worldwide, the issue of being able to efficiently and effectively manage large amount of patient information in diverse medium becomes critical. In this...
B-trees: Bearing Fruits of All Kinds (2002)
Index structures are often used to support search operations in large databases. Many advanced database application domains such as spatial databases, multimedia databases, temporal databases, and...
An adaptive peer-to-peer network for distributed caching of OLAP results (2002)
Kalnis, Panagiotis, Ng, Wee Siong, Ooi, Beng Chin, Papadias, Dimitris, Tan, Kian-Lee
Peer-to-Peer (P2P) systems are becoming increasingly popular as they enable users to exchange digital information by participating in complex networks. Such systems are inexpensive, easy to use,...
Discovery of General Knowledge in Large Spatial Databases (2001)
Wei Lu, Jiawei Han, Beng Chin Ooi
Extraction of interesting and general knowledge from large spatial databases is an important task in the development of spatial data- and knowledge-base systems. In this paper, we investigate...
Indexing the Distance: An Efficient Method to KNN Processing (2001)
Cui Yu, Beng Chin Ooi, Kian-lee Tan, H. V. Jagadish
In this paper, we present an efficient 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...
Global Optimization of Histograms (2001)
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...
Global Optimization of Histograms (2001)
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...
Towards Self-Tuning Data Placement in Parallel Database Systems (2000)
Mong Li Lee, Masaru Kitsuregawa, Beng Chin Ooi, Kian-lee Tan, Anirban Mondal
Parallel database systems are increasingly being deployed to support the performance demands of end-users. While declustering data across multiple nodes facilitates parallelism, existing data...
Online Feedback for Nested Aggregate Queries with Multi-Threading (1999)
Kian-lee Tan, Cheng Hian Goh, Beng Chin Ooi
In this paper, we study the progressive evaluation of nested queries with aggregates (i.e., the inner query block is an aggregate query), where users are provided progressively with (approximate)...
P-Tree: A B-Tree Index for Lists (1999)
Ke Wang, Beng Chin Ooi, Sam Yuan Sung
The high frequency of applications involving large, ordered, nested lists suggests that list is the "next most" natural data type after set. A list differs from a set through positioning and nesting...
Index Nesting -- an Efficient Approach to Indexing in Object-Oriented Databases (1997)
Beng Chin Ooi, Jiawei Han, Hongjun Lu, Kian Lee Tan
. In object-oriented database systems where the concept of the superclass-subclass is supported, an instance of a subclass is also an instance of its superclass. Consequently, the access scope of a...
Indexing in Spatial Databases (1996)
Beng Chin Ooi, Ron Sacks-davis, Jiawei Han
Spatial information processing has been a focus of research in the past decade. In spatial databases, data are associated with spatial coordinates and extents, and are retrieved based on spatial...
Index Nesting -- an Efficient Approach to Indexing in Object-Oriented Databases (1996)
Beng Chin Ooi, Jiawei Han, Hongjun Lu, Kian Lee Tan
. In object-oriented database systems where the concept of the superclass-subclass is supported, an instance of a subclass is also an instance of its superclass. Consequently, the access scope of a...
Discovery of General Knowledge in Large Spatial Databases (1995)
Wei Lu, Jiawei Han, Beng Chin Ooi
Extraction of interesting and general knowledge from large spatial databases is an important task in the development of spatial data- and knowledge-base systems. In this paper, we investigate...