Search For:

Displaying 1-27 out of 27 total
Incremental Maintenance of the Minimum Bisimulation of Cyclic Graphs
Found in: IEEE Transactions on Knowledge and Data Engineering
By Jintian Deng,Byron Choi,Jianliang Xu,Haibo Hu,Sourav S. Bhowmick
Issue Date:November 2013
pp. 2536-2550
There have been numerous recent applications of graph databases (e.g., the Semantic Web, ontology representation, social networks, XML, chemical databases, and biological databases). A fundamental structural index for data graphs, namely minimum bisimulati...
 
Optimizing Nonindexed Join Processing in Flash Storage-Based Systems
Found in: IEEE Transactions on Computers
By Yu Li, Sai Tung On, Jianliang Xu,Byron Choi, Haibo Hu
Issue Date:July 2013
pp. 1417-1431
Flash memory-based disks (or simply flash disks) have been widely used in today's computer systems. With their continuously increasing capacity and dropping price, it is envisioned that some database systems will operate on flash disks in the near future. ...
 
PRAGUE: Towards Blending Practical Visual Subgraph Query Formulation and Query Processing
Found in: Data Engineering, International Conference on
By Changjiu Jin,Sourav S. Bhowmick,Byron Choi,Shuigeng Zhou
Issue Date:April 2012
pp. 222-233
In a previous paper, we laid out the vision of a novel graph query processing paradigm where instead of processing a visual query graph after its construction, it interleaves visual query formulation and processing by exploiting the latency offered by the ...
 
Flag Commit: Supporting Efficient Transaction Recovery in Flash-Based DBMSs
Found in: IEEE Transactions on Knowledge and Data Engineering
By Sai Tung On,Jianliang Xu,Byron Choi,Haibo Hu,Bingsheng He
Issue Date:September 2012
pp. 1624-1639
Owing to recent advances in semiconductor technologies, flash disks have been a competitive alternative to traditional magnetic disks as external storage media. In this paper, we study how transaction recovery can be efficiently supported in database manag...
 
Processing private queries over untrusted data cloud through privacy homomorphism
Found in: Data Engineering, International Conference on
By Haibo Hu,Jianliang Xu,Chushi Ren,Byron Choi
Issue Date:April 2011
pp. 601-612
Query processing that preserves both the data privacy of the owner and the query privacy of the client is a new research problem. It shows increasing importance as cloud computing drives more businesses to outsource their data and querying services. Howeve...
 
DigestJoin: Exploiting Fast Random Reads for Flash-Based Joins
Found in: Mobile Data Management, IEEE International Conference on
By Yu Li, Sai Tung On, Jianliang Xu, Byron Choi, Haibo Hu
Issue Date:May 2009
pp. 152-161
Flash disks have been an emerging secondary storage media. In particular, there have been portable devices, multimedia players and laptop computers that are configured with no magnetic disks but flash disks.It is envisioned that some RDBMSs will operate on...
 
Incremental Maintenance of 2-Hop Labeling of Large Graphs
Found in: IEEE Transactions on Knowledge and Data Engineering
By Ramadhana Bramandia, Byron Choi, Wee Keong Ng
Issue Date:May 2010
pp. 682-698
Recent interests on xml, the Semantic Web, and Web ontology, among other topics, have sparked a renewed interest on graph-structured databases. A fundamental query on graphs is the reachability test of nodes. Recently, 2-hop labeling has been proposed to i...
 
Multiple Materialized View Selection for XPath Query Rewriting
Found in: Data Engineering, International Conference on
By Nan Tang, Jeffrey Xu Yu, M. Tamer Ozsu, Byron Choi, Kam-Fai Wong
Issue Date:April 2008
pp. 873-882
We study the problem of answering XPATH queries using multiple materialized views. Despite the efforts on answering queries using single materialized view, answering queries using multiple views remains relatively new. We address two important aspects of t...
 
Adaptive Index Utilization in Memory-Resident Structural Joins
Found in: IEEE Transactions on Knowledge and Data Engineering
By Bingsheng He, Qiong Luo, Byron Choi
Issue Date:June 2007
pp. 772-788
We consider adaptive index utilization as a fine-grained problem in autonomic databases in which an existing index is dynamically determined to be used or not in query processing. As a special case, we study this problem for structural joins, the core oper...
 
Updating Recursive XML Views of Relations
Found in: Data Engineering, International Conference on
By Byron Choi, Gao Cong, Wenfei Fan, Stratis D. Viglas
Issue Date:April 2007
pp. 766-775
This paper investigates the view update problem for XML views published from relational data. We consider (possibly) recursively defined XML views, compressed into DAGs and stored in relations. We provide new techniques to efficiently support XML view upda...
 
Cache-Conscious Automata for XML Filtering
Found in: IEEE Transactions on Knowledge and Data Engineering
By Bingsheng He, Qiong Luo, Byron Choi
Issue Date:December 2006
pp. 1629-1644
Hardware cache behavior is an important factor in the performance of memory-resident, data-intensive systems such as XML filtering engines. A key data structure in several recent XML filters is the automaton, which is used to represent the long-running XML...
 
Cache-Conscious Automata for XML Filtering
Found in: Data Engineering, International Conference on
By Bingsheng He, Qiong Luo, Byron Choi
Issue Date:April 2005
pp. 878-889
Hardware cache behavior is an important factor in the performance of memory-resident, data-intensive systems such as XML filtering engines. A key data structure in several recent XML filters is the automaton, which is used to represent the long-running XML...
 
Vectorizing and Querying Large XML Repositories
Found in: Data Engineering, International Conference on
By Peter Buneman, Byron Choi, Wenfei Fan, Robert Hutchison, Robert Mann, Stratis D. Viglas
Issue Date:April 2005
pp. 261-272
Vertical partitioning is a well-known technique for optimizing query performance in relational databases. An extreme form of this technique, which we call vectorization, is to store each column separately. We use a generalization of vectorization as the ba...
 
Authentication of Moving Top-k Spatial Keyword Queries
Found in: IEEE Transactions on Knowledge and Data Engineering
By Dingming Wu,Byron Choi,Jianliang Xu,Christian Jensen
Issue Date:February 2015
pp. 1
A moving top-k spatial keyword (MkSK) query, which takes into account a continuously moving query location, enables a mobile client to be continuously aware of the top-k spatial web objects that best match a query with respect to location and text relevanc...
 
Side-Effect Estimation: A Filtering Approach to the View Update Problem
Found in: IEEE Transactions on Knowledge and Data Engineering
By Yun Peng,Byron Choi,Jianliang Xu,Haibo Hu,Sourav S. Bhowmick
Issue Date:September 2014
pp. 1-1
Views and their updates have long been a fundamental technology required in a wide range of applications. However, it has been known that updates through views is a classical intractable problem. In this paper, we propose a novel, data-oriented approach to...
 
Private search on key-value stores with hierarchical indexes
Found in: 2014 IEEE 30th International Conference on Data Engineering (ICDE)
By Haibo Hu,Jianliang Xu,Xizhong Xu,Kexin Pei,Byron Choi,Shuigeng Zhou
Issue Date:March 2014
pp. 628-639
Query processing that preserves both the query privacy at the client and the data privacy at the server is a new research problem. It has many practical applications, especially when the queries are about the sensitive attributes of records. However, most ...
   
Towards Efficient Authenticated Subgraph Query Service in Outsourced Graph Databases
Found in: IEEE Transactions on Services Computing
By Zhe Fan,Yun Peng,Byron Choi,Jianliang Xu,Sourav S. Bhowmick
Issue Date:November 2013
pp. 1
Graphs have been a powerful tool that is suitable for a large variety of applications including chemical databases and the Semantic Web, among others. A fundamental query of graph databases is subgraph query: given a query graph q, it retrieves the data gr...
 
Selectivity estimation of twig queries on cyclic graphs
Found in: Data Engineering, International Conference on
By Yun Peng,Byron Choi,Jianliang Xu
Issue Date:April 2011
pp. 960-971
Recent applications including the Semantic Web, Web ontology and XML have sparked a renewed interest on graph-structured databases. Among others, twig queries have been a popular tool for retrieving subgraphs from graph-structured databases. To optimize tw...
 
Spatial-aware interest group queries in location-based social networks
Found in: Proceedings of the 21st ACM international conference on Information and knowledge management (CIKM '12)
By Byron Choi, Dingming Wu, Jianliang Xu, Weifeng Su, Yafei Li
Issue Date:October 2012
pp. 2643-2646
Location-based social networks, such as Foursquare and Facebook Places, are bridging the gap between the physical world and online social networking services through acquired user locations. Some social networks released check-in services that allow users ...
     
Authentication of range query results in mapreduce environments
Found in: Proceedings of the third international workshop on Cloud data management (CloudDB '11)
By Byron Choi, Jianliang Xu, Shen Gao, Ziwei Yang
Issue Date:October 2011
pp. 25-32
Authenticated query processing has been an important problem in outsourced and cloud databases. However, all existing works on query authentication are confined to a single server. In this paper, we present a scalable authentication solution for range quer...
     
PCMLogging: reducing transaction logging overhead with PCM
Found in: Proceedings of the 20th ACM international conference on Information and knowledge management (CIKM '11)
By Bingsheng He, Byron Choi, Haibo Hu, Jianliang Xu, Shen Gao
Issue Date:October 2011
pp. 2401-2404
Phase Changing Memory (PCM), as one of the most promising next-generation memory technologies, offers various attractive properties such as non-volatility, bit-alterability, and low idle energy consumption. In this paper, we present PCMLogging, a novel log...
     
Predicting the optimal ad-hoc index for reachability queries on graph databases
Found in: Proceedings of the 20th ACM international conference on Information and knowledge management (CIKM '11)
By Byron Choi, Fei Liu, Jianliang Xu, Jintian Deng, Yun Peng
Issue Date:October 2011
pp. 2357-2360
Due to the recent advances in graph databases, a large number of ad-hoc indexes for a fundamental query, in particular, reachability query, have been proposed. The performances of these indexes on different graphs have known to be very different. Worst sti...
     
GBLENDER: visual subgraph query formulation meets query processing
Found in: Proceedings of the 2011 international conference on Management of data (SIGMOD '11)
By Byron Choi, Changjiu Jin, Shuigeng Zhou, Sourav S. Bhowmick, Xiaokui Xiao
Issue Date:June 2011
pp. 1327-1330
Due to the complexity of graph query languages, the need for visual query interfaces that can reduce the burden of query formulation is fundamental to the spreading of graph data management tools to wider community. We present a novel HCI (human-computer i...
     
StableBuffer: optimizing write performance for DBMS applications on flash devices
Found in: Proceedings of the 19th ACM international conference on Information and knowledge management (CIKM '10)
By Byron Choi, Haibo Hu, Jianliang Xu, Yu Li
Issue Date:October 2010
pp. 339-348
Flash devices have been widely used in embedded systems, laptop computers, and enterprise servers. However, the poor random writes have been an obstacle to running write-intensive DBMS applications on flash devices. In this paper, we exploit the recently d...
     
Online spam-blog detection through blog search
Found in: Proceeding of the 17th ACM conference on Information and knowledge mining (CIKM '08)
By Aixin Sun, Byron Choi, Linhong Zhu
Issue Date:October 2008
pp. 1001-1001
In this work, we propose a novel post-indexing spam-blog (or splog) detection method, which capitalizes on the results returned by blog search engines. More specifically, we analyze the search results of a sequence of temporally-ordered queries returned by...
     
On incremental maintenance of 2-hop labeling of graphs
Found in: Proceeding of the 17th international conference on World Wide Web (WWW '08)
By Byron Choi, Ramadhana Bramandia, Wee Keong Ng
Issue Date:April 2008
pp. 1-7
Recent interests on XML, Semantic Web, and Web ontology, among other topics, have sparked a renewed interest on graph-structured databases. A fundamental query on graphs is the reachability test of nodes. Recently, 2-hop labeling has been proposed to index...
     
Incremental evaluation of schema-directed XML publishing
Found in: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (SIGMOD '04)
By Byron Choi, Philip Bohannon, Wenfei Fan
Issue Date:June 2004
pp. 503-514
When large XML documents published from a database are maintained externally, it is inefficient to repeatedly recompute them when the database is updated. Vastly preferable is incremental update, as common for views stored in a data warehouse. However, to ...
     
 1