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...
Towards Integrated and Efficient Scientific Sensor Data Processing: A Database Approach (2009)
Wu, Ji, Zhou, Yongluan, Aberer, Karl, Tan, Kian-Lee
In this work, we focus on managing scientific environmental data, which are measurement readings collected from wireless sensors. In environmental science applications, raw sensor data often need to...
Separating authentication from query execution in outsourced databases (2009)
Papadopoulos, Stavros, Papadias, Dimitris, Cheng, Weiwei, Tan, Kian-Lee
In the database outsourcing paradigm, a data owner (DO) delegates its DBMS administration to a specialized service provider (SP) that receives and processes queries from clients. The traditional...
Efficient Dynamic Operator Placement in a Locally Distributed Continuous Query System (2008)
Yongluan Zhou, Beng Chin Ooi, Kian-lee Tan, Ji Wu
Abstract. In a distributed processing environment, the static placement of query operators may result in unsatisfactory system performance due to unpredictable factors such as changes of servers ’...
Lidan Shou, Jason Chionh, Zhiyong Huang, Yixin Ruan, Kian-lee Tan
In this paper, we study the problem of interactive walkthrough of a large virtual environment (VE) where the data representing 3D virtual objects can not reside completely in the main memory. We tap...
Finding Semantically Related Images in the WWW (2008)
Heng Tao, Shen Beng, Chin Ooi, Kian-lee Tan
In this demonstration, we present a system designed to find semantically relevant images that are embedded in HTML documents in the WWW. The system has been implemented in Java on a Sun Spare...
Making the Pyramid Technique Robust to Query Types and Workloads (2008)
Rui Zhang, Beng Chin Ooi, Kian-Lee Tan
The effectiveness of many existing high-dimensional indexing structures is limited to specific types of queries and workloads. For example, while the Pyramid technique and the iMinMax are efficient...
Fast High-Dimensional Data Search in Incomplete Databases (2008)
Beng Chin, Ooi Cheng, Hian Goh, Kian-lee Tan
We propose and evaluate two indexing schemes for improving the efficiency of data retrieval in high-dimensional databases that are incomplete. These schemes are novel in that the search keys may...
Cache-On-Demand: Recycling with Certainty (2008)
Kian-lee Tan, Shen-tat Goh, Beng Chin Ooi
Queries posed to a database usually access some com-mon relations, or share some common sub-expressions. In this paper; we examine the issue of caching using a novel framework, called cache-on-demand...
CSV: Visualizing and Mining Cohesive Subgraphs (2008)
Nan Wang, Srinivasan Parthasarathy, Kian-lee Tan
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network analysis, from the...
Giving Meanings to Images (2008)
Heng Tao, Shen Beng, Chin Ooi, Kian-lee Tan
Images are increasingly being embedded in HTML documents on the WWW. Such documents over the WWW essentially provides a rich source of image collection from which users can query. Interestingly, the...
Finding Time-lagged 3D Clusters (2008)
XU, Xin, LU, Ying, TAN, Kian-Lee, TUNG, Anthony K. H.
Existing 3D clustering algorithms on $gene\times sample\times time$ expression data do not consider the \emph{time lags} between correlated gene expression patterns. Besides, they either ignore the...
K.-L.: Hiding data accesses in steganographic file system (2008)
Xuan Zhou, Hweehwa Pang, Kian-lee Tan
To support ubiquitous computing, the underlying data have to be persistent and available anywhere-anytime. The data thus have to migrate from devices local to individual computers, to shared storage...
Leveraging Distributed Publish/Subscribe Systems for Scalable Stream Query Processing (2008)
Yongluan Zhou, Kian-lee Tan, Feng Yu
Abstract. Existing distributed publish/subscribe systems (DPSS) offer loosely coupled and easy to deploy content-based stream delivery services to a large number of users. However, the lack of query...
Received (Day Month Year) Revised (Day Month Year) (2008)
Chern-hooi Chionh, Zhiyong Huang, Kian-lee Tan, Zhen Yao
Comparing protein structures in three dimensions is a computationally expensive process that makes a full scan of a protein against a library of known protein structures impractical. To reduce the...
1. Optimization of Multi-Way Join Queries for Parallel Execution (2008)
Hongjun Lu, Ming-chien Shan, Kian-lee Tan
Most of the existing relational database query optimizers generate multi-way join plans only from those linear ones to reduce the optimiza-tion overhead. For multiprocessor computer systems, this...
ABSTRACT Stratified Computation of Skylines with Partially-Ordered Domains (2008)
Chee-yong Chan, Pin-kwang Eng, Kian-lee Tan
In this paper, we study the evaluation of skyline queries with partially-ordered attributes. Because such attributes lack a total ordering, traditional index-based evaluation algorithms (e.g., NN and...
Rapid retrieval of protein structures from databases (2008)
As protein databases continue to grow in size, exhaustive search methods that compare a query structure against every database structure can no longer provide satisfactory performance. Instead, the...
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...
Giving Meanings to WWW Images (2008)
Heng Tao, Shen Beng, Chin Ooi, Kian-lee Tan
Images are increasingly being embedded in HTML documents on the WWW. Such documents over the WWW essentially provides a rich source of image collection from which users can query. Interestingly, the...
POEMS: A Transformable Architecture for Managing System Overload (2008)
Wee Siong Ng, Panos Kalnis, Beng Chin Ooi, Kian-lee Tan
In a typical organizational scenario, hundreds of personal computers (PCs) are used mainly for simple office tasks. Typically, a central database management system (DBMS) receives requests internally...
Cui Yu, Stéphane Bressan, Beng Chin Ooi, Kian-lee Tan
Abstract. In this paper, we propose a new tunable index scheme, called iMinMax(θ), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minimum...
Efficient Certificate Revocation: A P2P Approach (2008)
Chu Yee Liau, Stéphane Bressan, Kian-Lee Tan, Chu Yee, Liau Stéphane
Certificate revocation is one of the many challenges faced by Public Key Infrastructure (PKI). Certificate revocation is the action of declaring a certificate, which has not expired, is no longer...
Dynamic Clustering-based Query Answering in Peer-to-Peer Systems (2008)
Weining Qian, Shuigeng Zhou, Yi Ren, Aoying Zhou, Beng Chin Ooi, Kian-Lee Tan, ...
P2P computing has been employing in more and more application domains as the technology becomes mature. One popular and successful application area is file sharing. However, current file sharing...
Rethinking the Design of Distributed Stream Processing Systems (2008)
Zhou, Yongluan, Aberer, Karl, Salehi, Ali, Tan, Kian-Lee
In this paper, we present a novel architecture to support large scale stream processing services in a widely distributed environment. The proposed system, COSMOS, distinguishes itself by its loose...
Toward Massive Query Optimization in Large-Scale Distributed Stream Systems (2008)
Zhou, Yongluan, Aberer, Karl, Tan, Kian-Lee
Existing distributed stream systems adopt a tightly-coupled communication paradigm and focus on fine-tuning of operator placements to achieve communication efficiency. This kind of approach is hard...
Sampling From Databases Using B (2007)
Dimuthu Makawita, Ngee Ann Polytechnic, Kian-lee Tan, Huan Liu
Sampling techniques are becoming increasingly important for large databases. However, the problem of obtaining a random sample from index structures has not received much attention. In this paper, we...
Datplex: An Extensible Design-Aid Tool For Physical Database Design (2007)
Hongjun Lu, Beng-chin Ooi, Weiguo Qiu, Kian-lee Tan
In this paper, we describe DATPLEX, an extensible design-aid tool for physical database design. DATPLEX adopts a layered approach where each layer improves over its input design; and is...
Dispatching Mobile Agents with Secure Routes in Parallel (2007)
Abstract. In a distributed environment like the Internet, mobile agents can be employed to perform autonomous tasks such as searching and negotiating. However, for mobile agents to be widely...
BestPeer: A Self-Congurable Peer-to-Peer System (2007)
Wee Siong, Ng Beng, Chin Ooi, Kian-lee Tan
In a peer-to-peer (P2P) distributed system, nodes of equivalent capabilities and responsibilities pool their resources together to share information and services. However, most of the existing P2P...
Finding Semantically Related Images in the WWW (2007)
Heng Tao, Shen Beng, Chin Ooi, Kian-lee Tan
In this demonstration, we present a system designed to find semantically relevant images that are embedded in HTML documents in the WWW. The system has been implemented in Java on a Sun Sparc...
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...
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...
Disk Striping Strategies for Large Video-on-Demand Servers (2007)
Tat Seng, Chua Jiandong, Li Beng, Chin Ooi, Kian-lee Tan
The storage structure of videos on disks affects the number of concurrent users a video- on-demand system can support and hence the average waiting time. In this paper, we propose a phase-based...
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...
An adaptable distributed query processing architecture (2007)
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...
Similarity-Aware Query Allocation in Sensor Networks with Multiple Base Stations (2007)
Xiang, Shili, Lim, Hock Beng, Tan, Kian-Lee, Zhou, Yongluan
In this paper, we consider a large scale sensor network comprising multiple, say K, base stations and a large number of wireless sensors. Such an infrastructure is expected to be more energy...
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....
Authenticating multi-dimensional query results in data publishing (2006)
Weiwei Cheng, Hweehwa Pang, Kian-lee Tan
Abstract. In data publishing, the owner delegates the role of satisfying user queries to a third-party publisher. As the publisher may be untrusted or susceptible to attacks, it could produce...
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...
c ○ Imperial College Press MatAlign: PRECISE PROTEIN STRUCTURE COMPARISON (2006)
We propose a detailed protein structure alignment method named “MatAlign”. It is a two-step algorithm. Firstly, we represent 3D protein structures as 2D distance matrices, and align these...
A.K.H.: Mining frequent closed cubes in 3D datasets (2006)
In this paper, we introduce the concept of frequent closed cube (FCC), which generalizes the notion of 2D frequent closed pattern to 3D context. We propose two novel algorithms to mine FCCs from 3D...
Answering similarity queries in peer-to-peer networks (2006)
Panos Kalnis, Wee Siong, Ng Beng, Chin Ooi, Kian-lee Tan
A variety of Peer-to-Peer (P2P) systems for sharing digital information are currently available and most of them perform searching by exact key matching. In this paper we focus on similarity...
A.K.H.: Mining frequent closed cubes in 3D datasets (2006)
In this paper, we introduce the concept of frequent closed cube (FCC), which generalizes the notion of 2D frequent closed pattern to 3D context. We propose two novel algorithms to mine FCCs from 3D...
An Adaptable Distributed Query Processing Architecture (2005)
Zhou, Yongluan, Ooi, Beng Chin, Tan, Kian-Lee, Tok, Wee Hyong
Wang, Yan, Tan, Kian-Lee, Ren, Jian
In an agent-mediated B2C Internet marketplace, agents, mobile or stationary, can act on behalf of customers to complete tasks involved in buying and selling products. In this paper, we first present...
Wang, Yan, Tan, Kian-Lee, Ren, Jian
In an agent-mediated B2C Internet marketplace, agents, mobile or stationary, can act on behalf of customers to complete tasks involved in buying and selling products. In this paper, we first present...
Wang, Yan, Tan, Kian-Lee, Ren, Jian
In an agent-mediated B2C Internet marketplace, agents, mobile or stationary, can act on behalf of customers to complete tasks involved in buying and selling products. In this paper, we first present...
Towards optimal utilization of main memory for moving object indexing (2005)
Bin Cui, Dan Lin, Kian-lee Tan
Abstract. In moving object databases, existing disk-based indexes are unable to keep up with the high update rate while providing speedy retrieval at the same time. However, efficient management of...
An Adaptable Distributed Query Processing Architecture (2005)
Yongluan Zhou, Beng Chi Ooi, Kian-lee Tan, Wee Hyong Tok
Tradi iadiH# dii rii ed queryopti itifl: techni ques generate stati query plans atcompi: tipi However, theoptiIxH ty of these plans depends on many parameters (such as the selec tiecH es ofoperati...
Dynamic Load Management for Distributed Continuous Query Systems (2005)
Yongluan Zhou, Beng Chin Ooi, Kian-Lee Tan, Beng Chin
this paper, we offer our solution to the problem. More specifically we make the following contributions:
Exploring Bit-Difference for Approximate KNN Search in High-dimensional Databases (2005)
Bin Cui, Heng Tao, Shen Jialie, Kian-Lee Tan
In this paper, we develop a novel index structure to support efficient approximate k-nearest neighbor (KNN) query in high-dimensional databases. In high-dimensional spaces, the computational cost of...
Supporting Multi-dimensional Range Queries in Peer-to-Peer Systems (2005)
Yanfeng Shu Beng, Beng Chin Ooi, Kian-lee Tan
well with range queries on multi-dimensional data. To extend existing P2P systems and thus support multidimensional range queries, one needs to consider such issues as space partitioning and mapping,...
WmXML: A System for Watermarking XML Data (2005)
Xuan Zhou Hweehwa, Xuan Zhou, Hweehwa Pang, Kian-lee Tan, Dhruv Mangla
As increasing amount of data is published in the form of XML, copyright protection of XML data is becoming an important requirement for many applications. While digital watermarking is a widely used...
Wmxml: A system for watermarking xml data (2005)
Xuan Zhou, Hweehwa Pang, Kian-lee Tan, Dhruv Mangla
As increasing amount of data is published in the form of XML, copyright protection of XML data is becoming an important requirement for many applications. While digital watermarking is a widely used...
Generalized multidimensional data mapping and query processing (2005)
Rui Zhang, Panos Kalnis, Beng Chin Ooi, Kian-lee Tan
Multi-dimensional data points can be mapped to one-dimensional space to exploit single dimensional indexing structures such as the B +-tree. In this paper we present a Generalized structure for data...
Indexing highdimensional data for efficient in-memory similarity search (2005)
Bin Cui, Beng Chin Ooi, Jianwen Su, Senior Member, Kian-lee Tan, Ieee Computer Society
Abstract—In main memory systems, the L2 cache typically employs cache line sizes of 32-128 bytes. These values are relatively small compared to high-dimensional data, e.g.,> 32D. The consequence...
Automatic 3D protein structure classification without structural alignment (2005)
In this paper, we present a new scheme named ProtClass for automatic classification of three-dimensional (3D) protein structures. It is a dedicated and unified multiclass classification scheme....
Exploring bit-difference for approximate knn search (2005)
Bin Cui, Heng Tao Shen, Jialie Shen, Kian-lee Tan
Abstract — In this paper, we develop a novel index structure to support efficient approximate k-nearest neighbor (KNN) query in high-dimensional databases. In high-dimensional spaces, the...
Identifying time-lagged gene clusters using gene expression data (2005)
Motivation: Analysis of gene expression data can provide insights into the time-lagged co-regulation of genes/gene clusters. However, existing methods such as the Event Method and the Edge Detection...
Adapting the content native space for load balanced indexing (2004)
Yanfeng Shu, Kian-lee Tan, Aoying Zhou
Abstract. Today, there is an increasing demand to share data with complex data types (e.g., multi-dimensional) over large numbers of data sources. One of the key challenges is sharing these data in a...
Authenticating Query Results in Edge Computing (2004)
Edge computing pushes application logic and the underlying data to the edge of the network, with the aim of improving availability and scalability. As the edge servers are not necessarily secure,...
Mining deterministic biclusters in gene expression data (2004)
Zonghong Zhang, Alvin Teo Bengchinooi, Kian-lee Tan
A bicluster of a gene expression dataset captures the coherence of a subset of genes and a subset of conditions. Biclustering algorithms are used to discover biclusters whose subset of genes are...
BIOINFORMATICS Identifying Time-Lagged Gene Clusters on Gene Expression Data (2004)
Motivation: Analysis of gene expression data can provide insights into the time-lagged co-regulations of genes/gene clusters. However, existing methods such as Event Method and Edge Detection Method...
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....
Mining frequent closed patterns in microarray data (2004)
Gao Cong, Kian-lee Tan, Feng Pan
Microarray data typically contains a large number of columns and a small number of rows, which poses a great challenge for existing frequent (closed) pattern mining algorithms that discover patterns...
Philip Tan, Stuart Madnick, Kian-lee Tan
Abstract The COntext INterchange (COIN) strategy is an approach to solving the problem of interoperability of semantically heterogeneous data sources through context mediation. COIN has used its own...
Rapid 3D protein structure database searching using information retrieval techniques (2004)
Motivation: As the sizes of 3D protein structure databases are growing rapidly nowadays, exhaustive database searching, in which a 3D query structure is compared to each and every structure in the...
Mining gene expression data for positive and negative co-regulated gene clusters (2004)
Motivation: Analysis of gene expression data can provide insights into the positive and negative co-regulation of genes. However, existing methods such as association rule mining are computationally...
Identifying time-lagged gene clusters on gene expression data (2004)
Motivation: Analysis of gene expression data can provide insights into the time-lagged co-regulations of genes/gene clusters. However, existing methods such as Event Method and Edge Detection Method...
Mining gene expression data for positive and negative co-regulated gene clusters (2004)
Motivation: Analysis of gene expression data can provide insights into the positive and negative co-regulation of genes. However, existing methods such as association rule mining are computationally...
Rapid 3D protein structure database searching using information retrieval techniques (2004)
Motivation: As the sizes of 3D protein structure databases are growing rapidly nowadays, exhaustive database searching, in which a 3D query structure is compared to each and every structure in the...
Mining gene expression data for positive and negative co-regulated gene clusters (2004)
Motivation: Analysis of gene expression data can provide insights into the positive and negative co-regulation of genes. However, existing methods such as association rule mining are computationally...
Identifying time-lagged gene clusters on gene expression data (2004)
Motivation: Analysis of gene expression data can provide insights into the time-lagged co-regulations of genes/gene clusters. However, existing methods such as Event Method and Edge Detection Method...
PeerDB: Peering into personal databases (2003)
Beng Chin Ooi, Kian-lee Tan, Aoying Zhou, Chin Hong Goh, Yingguang Li, Chu Yee Liau, ...
In this demonstration, we present a prototype peer-topeer (P2P) application called PeerDB[2] that provides database capabilities. This system has been developed at the National University of...
Managing trust in peer-to-peer systems using reputation-based techniques (2003)
Beng Chin Ooi, Chu Yee Liau, Kian-lee Tan
Abstract. 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...
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...
Contorting High Dimensional Data for Efficient Main Memory KNN Processing (2003)
Bin Cui, Beng Chin Ooi, Jianwen Su, Kian-Lee Tan
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...
StegFS: A Steganographic File System (2003)
Hweehwa Pang, Kian-lee Tan, Xuan Zhou
While user access control and encryption can protect valuable data from passive observers, those techniques leave visible ciphertexts that are likely to alert an active adversary to the existence of...
BLAST++: BLASTing queries in batches (2003)
Wang, Hao, Ooi, Beng Chin, Tan, Kian-Lee, Ong, Twee-Hee, Zhou, Lei
Summary: BLAST++ is a tool that is integrated with NCBI BLAST, allowing multiple, say K, queries to be searched against a database concurrently. The results obtained by BLAST++...
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,...
An adaptive peer-to-peer network for distributed caching of olap results (2002)
Panos Kalnis, Wee Siong, Ng Beng, Chin Ooi, Dimitris Papadias, Kian-lee Tan
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,...
A.: “A Content-Based Resource Location Mechanism in PeerIS (2002)
Bo Ling, Zhiguo Lu, Wee Siong Ng, Bengchin Ooi, Kian-lee Tan, Aoying Zhou
With the flurry of research on P2P computing, many P2P technical challenges have emerged, one of which is how to efficiently locate desired resources. Advances have been made in this hot research...
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...
BestPeer: A Self-Configurable Peer-to-Peer System (2002)
Wee Siong Ng, Ng Beng, Chin Ooi, Kian-lee Tan
this paper, we present BestPeer, a prototype P2P system that we have implemented at the National University of Singapore (see http://sloth.comp.nus.edu.sg/p2p and [1]). BestPeer is a generic P2P...
BestPeer: A Self-Configurable Peer-to-Peer System (2002)
Wee Siong Ng, Beng Chin Ooi, Ng Beng, Chin Ooi, Kian-lee Tan
In this paper, we present BestPeer, a prototype P2P system that we have implemented at the National University of Singapore (see http://sloth.comp.nus.edu.sg/p2p and [1]). BestPeer is a generic P2P...
Efficient Evaluation of Multiple Queries on Streaming XML Data (2002)
Mong Li Lee, Boon Chin Chua, Wynne Hsu, Kian-lee Tan
Traditionally, XML documents are processed at where they are stored. This allows the query processor to exploit pre-computed data structures (e.g., index) to retrieve the desired data efficiently....
Walking through a very large virtual environment in real-time (2001)
Lidan Shou, Jason Chionh, Zhiyong Huang, Yixin Ruan, Kian-lee Tan
Users expect high and constant rendering frame rates when they interactively navigate in a Virtual Environment (VE). However, when the VE is too large to t into the main memory, the frame rates can...
Access Control of XML documents in Relational (2001)
Kian-lee Tan, Mong Li, Lee Yue Wang
In this paper, we present the design and implementation of an access control system for XML documents. Our system stores XML documents as relational tables in a relational database management system,...
Kian-lee Tan, Beng Chin, Ooi David, J. Abel
In a distributed spatial database system, a user may issue a query that relates two spatial relations not stored at the same site. Because of the sheer volume and complexity of spatial data, spatial...
Kian-lee Tan, Beng Chin Ooi, Ieee Computer Society, Ieee Computer Society, David J. Abel
AbstractÐIn a distributed spatial database system, a user may issue a query that relates two spatial relations not stored at the same site. Because of the sheer volume and complexity of spatial...
Rule-assisted prefetching in Web-server caching (2000)
Bin Lan, Stephane Bressan, Beng Chin Ooi, Kian-lee Tan
Web servers manage large number of documents of widely variable sizes. Moreover, the access patterns on the documents may also c hange over time. While some documents are highly popular over a...
Kian-lee Tan, Beng Chin Ooi, Lay Foo Thiang
shapes in image databases using the centroid±radii model
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)...
Abstract MOSAIC: A fast multi-feature image retrieval system (1999)
Content-based image retrieval plays an important role in many multimedia applications. Images are typically retrieved based on a given sample image, a sketch or a simple description of the content....
Fast image retrieval using color-spatial information (1998)
Beng Chin Ooi, Kian-lee Tan, Tat Seng Chua, Wynne Hsu
Abstract. In this paper, we present an image retrieval system that employs both the color and spatial information of images to facilitate the retrieval process. The basic unit used in our technique...
Fast High-Dimensional Data Search in Incomplete Databases (1998)
Beng Chin Ooi, Beng Chin, Ooi Cheng, Cheng Hian Goh, Kian-lee Tan
We propose and evaluate two indexing schemes for improving the efficiency of data retrieval in high-dimensional databases that are incomplete. These schemes are novel in that the search keys may...
An Evaluation of Color-Spatial R.etrieva1 Techniques (1997)
In a color-spatial retrieval technique, the color information is integrated with the knowledge of the colors ’ spatial distribution to facilitate content-based image retrieval. Several techniques...
Using domain knowledge in querying image databases (1996)
Tat-seng Chua, Kah-choo Teo, Beng-chin Ooi, Kian-lee Tan
Current image retrieval systems use associated text and visual attributes of images, such as colors, textures or shapes, as indices for retrieval. The use of these attributes has been quite...
On balancing workload in a highly mobile environment (1995)
Xu Yu, Jeffrey, Tan, Kian-Lee, Qu, Xun
Traditionally, in a distributed database system, it has been assumed that most queries can be processed with the data that reside at the site where the query is submitted. However, this concept of...
Scheduling Issues in Partitioned Temporal Join (1995)
One of the major problems of temporal databases is to develop efficient algorithms for operations that involves the time attributes. An operation that has received much attention in recent years is...
On balancing workload in a highly mobile environment (1995)
Xu Yu, Jeffrey, Tan, Kian-Lee, Qu, Xun
Traditionally, in a distributed database system, it has been assumed that most queries can be processed with the data that reside at the site where the query is submitted. However, this concept of...
Scheduling Issues in Partitioned Temporal Join (1995)
One of the major problems of temporal databases is to develop efficient algorithms for operations that involves the time attributes. An operation that has received much attention in recent years is...
On balancing workload in a highly mobile environment (1995)
Xu Yu, Jeffrey, Tan, Kian-Lee, Qu, Xun
Traditionally, in a distributed database system, it has been assumed that most queries can be processed with the data that reside at the site where the query is submitted. However, this concept of...
Scheduling Issues in Partitioned Temporal Join (1995)
One of the major problems of temporal databases is to develop efficient algorithms for operations that involves the time attributes. An operation that has received much attention in recent years is...
On balancing workload in a highly mobile environment (1995)
Xu Yu, Jeffrey, Tan, Kian-Lee, Qu, Xun
Traditionally, in a distributed database system, it has been assumed that most queries can be processed with the data that reside at the site where the query is submitted. However, this concept of...
Scheduling Issues in Partitioned Temporal Join (1995)
One of the major problems of temporal databases is to develop efficient algorithms for operations that involves the time attributes. An operation that has received much attention in recent years is...
Cheng Hian Goh, Hongjun Lu, Beng-chin Ooi, Kian-lee Tan
Indexing temporal data using existing B +-trees
On Balancing Workload in a Highly Mobile Environment (1995)
Jeffrey X. Yu, Jeffrey Xu Yu, Kian-lee Tan, Kian-lee Tan, Xun Qu, Xun Qu
Traditionally, in a distributed database system, it has been assumed that most queries can be processed with the data that reside at the site where the query is submitted. However, this concept of...
Scheduling Issues in Partitioned Temporal Join (1995)
Jeffrey Yu, Jeffrey X. Yu, Jeffrey X. Yu, Kian-lee Tan, Kian-lee Tan
One of the major problems of temporal databases is to develop efficient algorithms for operations that involves the time attributes. An operation that has received much attention in recent years is...
On Balancing Workload in a Highly Mobile Environment (1995)
Jeffrey X. Yu, Kian-lee Tan, Xun Qu, R. Sweet, Kian-lee Tan, ...
or send email to:
Jeffrey X. Yu, Kian-lee Tan, Kian-lee Tan
or send email to:
On balancing workload in a highly mobile environment (1995)
Xu Yu, Jeffrey, Tan, Kian-Lee, Qu, Xun
Traditionally, in a distributed database system, it has been assumed that most queries can be processed with the data that reside at the site where the query is submitted. However, this concept of...
Scheduling Issues in Partitioned Temporal Join (1995)
One of the major problems of temporal databases is to develop efficient algorithms for operations that involves the time attributes. An operation that has received much attention in recent years is...
On Spatially Partitioned Temporal Join (1994)
Hongjun Lu, Beng-chin Ooi, Kian-lee Tan
This paper presents an innovative partition-based time join strategy for temporal databases where time is represented by time intervals. The proposed method maps time intervals to points in a two...
Disseminating Streaming Data in a Dynamic Environment: an Adaptive and Cost-Based Approach
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...