Search For:

Displaying 1-25 out of 25 total
ViewJoin: Efficient view-based evaluation of tree pattern queries
Found in: Data Engineering, International Conference on
By Ding Chen, Chee-Yong Chan
Issue Date:March 2010
pp. 816-827
There is a lot of recent interest in applying views to optimize the processing of tree pattern queries (TPQs). However, existing work in this area has focused predominantly on logical optimization issues, namely, view selection and query rewriting. With th...
 
Optimized query evaluation using cooperative sorts
Found in: Data Engineering, International Conference on
By Yu Cao, Ramadhana Bramandia, Chee-Yong Chan, Kian-Lee Tan
Issue Date:March 2010
pp. 601-612
Many applications require sorting a table over multiple sort orders: generation of multiple reports from a table, evaluation of a complex query that involves multiple instances of a relation, and batch processing of a set of queries. In this paper, we stud...
 
Continuous Reverse k-Nearest-Neighbor Monitoring
Found in: Mobile Data Management, IEEE International Conference on
By Wei Wu, Fei Yang, Chee Yong Chan, Kian-Lee Tan
Issue Date:April 2008
pp. 132-139
The processing of a Continuous Reverse k-Nearest-Neighbor (CRkNN) query on moving objects can be divided into two sub tasks: continuous filter, and continuous refinement. The algorithms for the two tasks can be completely independent. Existing CRkNN soluti...
 
Piggyback Optimization of XML Data Dissemination
Found in: Data Engineering, International Conference on
By Chee-Yong Chan, Yuan Ni
Issue Date:April 2007
pp. 1454-1455
No summary available.
 
Content-based Dissemination of Fragmented XML Data
Found in: Distributed Computing Systems, International Conference on
By Chee-Yong Chan, Yuan Ni
Issue Date:July 2006
pp. 44
Content-based dissemination of data using pub/sub systems is an effective means to deliver relevant data to interested data consumers. With the emergence of XML as the standard for data representation and exchange, a lot of attention has been focused on pu...
 
Efficient Processing of Skyline Queries with Partially-Ordered Domains
Found in: Data Engineering, International Conference on
By Chee-Yong Chan, Pin-Kwang Eng, Kian-Lee Tan
Issue Date:April 2005
pp. 190-191
No summary available.
   
Scalable Filtering of XML Data for Web Services
Found in: IEEE Internet Computing
By Pascal Felber, Chee-Yong Chan, Minos Garofalakis, Rajeev Rastogi
Issue Date:January 2003
pp. 49-57
<p>Scalable content-based routing architectures for Web applications can handle the growing number of XML messages associated with Web services.</p>
 
Efficient Filtering of XML Documents with XPath Expressions
Found in: Data Engineering, International Conference on
By Chee-Yong Chan, Pascal Felber, Minos Garofalakis, Rajeev Rastogi
Issue Date:March 2002
pp. 0235
We propose a novel index structure, termed XTrie, that supports the efficient filtering of XML documents based on XPath expressions. Our XTrie index structure offers several novel features that make it especially attractive for large-scale publish/subscrib...
 
Efficient Scheduling of Page Access in Index-Based Join Processing
Found in: IEEE Transactions on Knowledge and Data Engineering
By Chee Yong Chan, Beng Chin Ooi
Issue Date:November 1997
pp. 1005-1011
<p><b>Abstract</b>—This paper examines the issue of scheduling page accesses in join processing, and proposes new heuristics for the following scheduling problems: 1) an optimal page access sequence for a join such that there are no page ...
 
Indexing OODB instances based on access proximity
Found in: Data Engineering, International Conference on
By Chee Yong Chan, Cheng Hian Goh, Beng Chin Ooi
Issue Date:April 1997
pp. 14
Queries in object-oriented databases (OODBs) may be asked with respect to different class scopes: a query may either request for object-instances which belong exclusively to a given class c, or those which belong to any class in the hierarchy rooted at c. ...
 
Nearest group queries
Found in: Proceedings of the 25th International Conference on Scientific and Statistical Database Management (SSDBM)
By Chee-Yong Chan, Dongxiang Zhang, Kian-Lee Tan
Issue Date:July 2013
pp. 1-12
k nearest neighbor (kNN) search is an important problem in a vast number of applications, including clustering, pattern recognition, image retrieval and recommendation systems. It finds k elements from a data source D that are closest to a given query poin...
     
SliceSort: efficient sorting of hierarchical data
Found in: Proceedings of the 21st ACM international conference on Information and knowledge management (CIKM '12)
By Chee-Yong Chan, Quoc Trung Tran
Issue Date:October 2012
pp. 2109-2113
Sorting is a fundamental operation in data processing. While the problem of sorting flat data records has been extensively studied, there is very little work on sorting hierarchical data such as XML documents. Existing hierarchy-aware sorting approaches fo...
     
Evaluation of set-based queries with aggregation constraints
Found in: Proceedings of the 20th ACM international conference on Information and knowledge management (CIKM '11)
By Chee-Yong Chan, Guoping Wang, Quoc Trung Tran
Issue Date:October 2011
pp. 1495-1504
Many applications often require finding a set of items of interest with respect to some aggregation constraints. For example, a tourist might want to find a set of places of interest to visit in a city such that the total expected duration is no more than ...
     
Dissemination of heterogeneous XML data in publish/subscibe systems
Found in: Proceeding of the 18th ACM conference on Information and knowledge management (CIKM '09)
By Chee Yong Chan, Yuan Ni
Issue Date:November 2009
pp. 127-136
The publish-subscribe paradigm is an effective approach for data publishers to asynchronously disseminate relevant data to a large number of data subscribers. A lot of recent research has focused on extending this paradigm to support content-based delivery...
     
Query by output
Found in: Proceedings of the 35th SIGMOD international conference on Management of data (SIGMOD '09)
By Chee-Yong Chan, Quoc Trung Tran, Srinivasan Parthasarathy
Issue Date:June 2009
pp. 3-4
It has recently been asserted that the usability of a database is as important as its capability. Understanding the database schema, the hidden relationships among attributes in the data all play an important role in this context. Subscribing to this viewp...
     
Minimization of tree pattern queries with constraints
Found in: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (SIGMOD '08)
By Chee-Yong Chan, Ding Chen
Issue Date:June 2008
pp. 13-14
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. Since the size of a TPQ is a key determinant of its evaluation cost, recent r...
     
Optimizing complex queries with multiple relation instances
Found in: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (SIGMOD '08)
By Chee-Yong Chan, Gopal C. Das, Kian-Lee Tan, Yu Cao
Issue Date:June 2008
pp. 13-14
Today's query processing engines do not take advantage of the multiple occurrences of a relation in a query to improve performance. Instead, each instance is treated as a distinct relation and has its own independent table access method. In this paper, we ...
     
Dissemination of heterogeneous xml data
Found in: Proceeding of the 17th international conference on World Wide Web (WWW '08)
By Chee-Yong Chan, Yuan Ni
Issue Date:April 2008
pp. 1-7
A lot of recent research has focused on the content-based dissemination of XML data. However, due to the heterogeneous data schemas used by different data publishers even for data in the same domain, an important challenge is how to efficiently and effecti...
     
Efficient xml data dissemination with piggybacking
Found in: Proceedings of the 2007 ACM SIGMOD international conference on Management of data (SIGMOD '07)
By Chee Yong Chan, Yuan Ni
Issue Date:June 2007
pp. 737-748
Content-based dissemination of XML data using the publish-subscribe paradigm is an effective means to deliver relevant data to interested data consumers. To meet the performance challenges of content-based filtering and routing, two key optimizations have ...
     
Multiway SLCA-based keyword search in XML data
Found in: Proceedings of the 16th international conference on World Wide Web (WWW '07)
By Amit K. Goenka, Chee-Yong Chan, Chong Sun
Issue Date:May 2007
pp. 1043-1052
Keyword search for smallest lowest common ancestors (SLCAs)in XML data has recently been proposed as a meaningful way to identify interesting data nodes inXML data where their subtrees contain an input set of keywords. In this paper, we generalize this use...
     
Finding k-dominant skylines in high dimensional space
Found in: Proceedings of the 2006 ACM SIGMOD international conference on Management of data (SIGMOD '06)
By Anthony K. H. Tung, Chee-Yong Chan, H. V. Jagadish, Kian-Lee Tan, Zhenjie Zhang
Issue Date:June 2006
pp. 503-514
Given a d-dimensional data set, a point p dominates another point q if it is better than or equal to q in all dimensions and better than q in at least one dimension. A point is a skyline point if there does not exists any point that can dominate it. Skylin...
     
Stratified computation of skylines with partially-ordered domains
Found in: Proceedings of the 2005 ACM SIGMOD international conference on Management of data (SIGMOD '05)
By Chee-Yong Chan, Kian-Lee Tan, Pin-Kwang Eng
Issue Date:June 2005
pp. 203-214
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 BBS) that are designed for totally-ordered attributes ca...
     
Secure XML querying with security views
Found in: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (SIGMOD '04)
By Chee-Yong Chan, Minos Garofalakis, Wenfei Fan
Issue Date:June 2004
pp. 587-598
The prevalent use of XML highlights the need for a generic, flexible access-control mechanism for XML documents that supports efficient and secure query access, without revealing sensitive information unauthorized users. This paper introduces a novel parad...
     
An efficient bitmap encoding scheme for selection queries
Found in: Proceedings of the 1999 ACM SIGMOD international conference on Management of data (SIGMOD '99)
By Chee-Yong Chan, Yannis E. Ioannidis
Issue Date:May 1999
pp. 358-367
Bitmap indexes are useful in processing complex queries in decision support systems, and they have been implemented in several commercial database systems. A key design parameter for bitmap indexes is the encoding scheme, which determines the bits that are...
     
Bitmap index design and evaluation
Found in: Proceedings of the 1998 ACM SIGMOD international conference on Management of data (SIGMOD '98)
By Chee-Yong Chan, Yannis E. Ioannidis
Issue Date:June 1998
pp. 227-234
Bitmap indexing has been touted as a promising approach for processing complex adhoc queries in read-mostly environments, like those of decision support systems. Nevertheless, only few possible bitmap schemes have been proposed in the past and very little ...
     
 1