Search For:

Displaying 1-25 out of 25 total
On Anti-Corruption Privacy Preserving Publication
Found in: Data Engineering, International Conference on
By Yufei Tao, Xiaokui Xiao, Jiexing Li, Donghui Zhang
Issue Date:April 2008
pp. 725-734
This paper deals with a new type of privacy threat, called
 
On Monitoring the top-k Unsafe Places
Found in: Data Engineering, International Conference on
By Donghui Zhang, Yang Du, Ling Hu
Issue Date:April 2008
pp. 337-345
In a city, protecting units like police cars move around and protect places such as banks and residential buildings. Different places may have different requirements in how many protecting units should be nearby. If any place has less protecting units arou...
 
On Multidimensional k-Anonymity with Local Recoding Generalization
Found in: Data Engineering, International Conference on
By Yang Du, Tian Xia, Yufei Tao, Donghui Zhang, Feng Zhu
Issue Date:April 2007
pp. 1422-1424
This paper presents the first theoretical study, on using local-recoding generalization (LRG) to compute a k-anonymous table with quality guarantee. First, we prove that it is NP-hard both to find the table with the maximum quality, and to discover a solut...
 
On Skylining with Flexible Dominance Relation
Found in: Data Engineering, International Conference on
By Tian Xia, Donghui Zhang, Yufei Tao
Issue Date:April 2008
pp. 1397-1399
Given a set of d dimensional objects, a skyline query finds the objects (
 
Continuous Evaluation of Monochromatic and Bichromatic Reverse Nearest Neighbors
Found in: Data Engineering, International Conference on
By James M. Kang, Mohamed F. Mokbel, Shashi Shekhar, Tian Xia, Donghui Zhang
Issue Date:April 2007
pp. 806-815
This paper presents a novel algorithm for Incremental and General Evaluation of continuous Reverse Nearest neighbor queries (IGERN, for short). The IGERN algorithm is general as it is applicable for both the monochromatic and bichromatic reverse nearest ne...
 
Finding Fastest Paths on A Road Network with Speed Patterns
Found in: Data Engineering, International Conference on
By Evangelos Kanoulas, Yang Du, Tian Xia, Donghui Zhang
Issue Date:April 2006
pp. 10
This paper proposes and solves the Time-Interval All Fastest Path (allFP) query. Given a user-defined leaving or arrival time interval I, a source node s and an end node e, allFP asks for a set of all fastest paths from s to e, one for each sub-interval of...
 
Continuous Reverse Nearest Neighbor Monitoring
Found in: Data Engineering, International Conference on
By Tian Xia, Donghui Zhang
Issue Date:April 2006
pp. 77
Continuous spatio-temporal queries have recently received increasing attention due to the abundance of location-aware applications. This paper addresses the Continuous Reverse Nearest Neighbor (CRNN) Query. Given a set of objects O and a query set Q, the C...
 
Index Based Processing of Semi-Restrictive Temporal Joins
Found in: Temporal Representation and Reasoning, International Syposium on
By Donghui Zhang, Vassilis J. Tsotras
Issue Date:July 2002
pp. 70
Temporal joins are important but very costly operations. While a temporal join can involve the whole time (and/or key) domain, we consider the more general case where the join is defined by some time-key rectangle from the whole space (i.e., when the user ...
 
Efficient Temporal Join Processing Using Indices
Found in: Data Engineering, International Conference on
By Donghui Zhang, Vassilis J. Tsotras, Bernhard Seeger
Issue Date:March 2002
pp. 0103
We examine the problem of processing temporal joins in the presence of indexing schemes. Previous work on temporal joins has concentrated on non-indexed relations which were fully scanned. Given the large data volumes created by the ever increasing time di...
 
Storing and Querying Multiversion XML Documents using Durable Node Numbers
Found in: Web Information Systems Engineering, International Conference on
By Shu-Yao Chien, Carlo Zaniolo, Vassilis J. Tsotras, Donghui Zhang
Issue Date:December 2001
pp. 0232
Managing multiple versions of XML documents represents an important problem for many traditional applications, such as software configuration control, as well as new ones, such as link permanence of web documents. Research on managing multiversion XML docu...
 
SciDB: A Database Management System for Applications with Complex Analytics
Found in: Computing in Science & Engineering
By Michael Stonebraker,Paul Brown,Donghui Zhang,Jacek Becla
Issue Date:May 2013
pp. 54-62
A description and discussion of the SciDB database management system focuses on lessons learned, application areas, performance comparisons against other solutions, and additional approaches to managing data and complex analytics.
 
Fast peak-to-peak behavior with SSD buffer pool
Found in: 2013 IEEE International Conference on Data Engineering (ICDE 2013)
By Jaeyoung Do,Donghui Zhang,Jignesh M. Patel,David J. DeWitt
Issue Date:April 2013
pp. 1129-1140
A promising use of flash SSDs in a DBMS is to extend the main memory buffer pool by caching selected pages that have been evicted from the buffer pool. Such a use has been shown to produce significant gains in the steady state performance of the DBMS. One ...
 
Superseding Nearest Neighbor Search on Uncertain Spatial Databases
Found in: IEEE Transactions on Knowledge and Data Engineering
By Sze Man Yuen, Yufei Tao, Xiaokui Xiao, Jian Pei, Donghui Zhang
Issue Date:July 2010
pp. 1041-1055
This paper proposes a new problem, called superseding nearest neighbor search, on uncertain spatial databases, where each object is described by a multidimensional probability density function. Given a query point q, an object is a nearest neighbor (NN) ca...
 
Incremental and General Evaluation of Reverse Nearest Neighbors
Found in: IEEE Transactions on Knowledge and Data Engineering
By James M. Kang, Mohamed F. Mokbel, Shashi Shekhar, Tian Xia, Donghui Zhang
Issue Date:July 2010
pp. 983-999
This paper presents a novel algorithm for Incremental and General Evaluation of continuous Reverse Nearest neighbor queries (IGERN, for short). The IGERN algorithm is general in that it is applicable for both continuous monochromatic and bichromatic revers...
 
ANGEL: Enhancing the Utility of Generalization for Privacy Preserving Publication
Found in: IEEE Transactions on Knowledge and Data Engineering
By Yufei Tao, Hekang Chen, Xiaokui Xiao, Shuigeng Zhou, Donghui Zhang
Issue Date:July 2009
pp. 1073-1087
Generalization is a well-known method for privacy preserving data publication. Despite its vast popularity, it has several drawbacks such as heavy information loss, difficulty of supporting marginal publication, and so on. To overcome these drawbacks, we d...
 
Online subspace skyline query processing using the compressed skycube
Found in: ACM Transactions on Database Systems (TODS)
By Cindy Chen, Donghui Zhang, Jie Wang, Tian Xia, Zheng Fang
Issue Date:May 2012
pp. 1-36
The skyline query can help identify the “best” objects in a multi-attribute dataset. During the past decade, this query has received considerable attention in the database research community. Most research focused on computing the “skylin...
     
LHlf: lock-free linear hashing (poster paper)
Found in: Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming (PPoPP '12)
By Donghui Zhang, Per-Ake Larson
Issue Date:February 2012
pp. 307-308
LHlf is a new hash table designed to allow very high levels of concurrency. The table is lock free and grows and shrinks auto-matically according to the number of items in the table. Insertions, lookups and deletions are never blocked. LHlf is based on lin...
     
Turbocharging DBMS buffer pool using SSDs
Found in: Proceedings of the 2011 international conference on Management of data (SIGMOD '11)
By Alan Halverson, David J. DeWitt, Donghui Zhang, Jaeyoung Do, Jeffrey F. Naughton, Jignesh M. Patel
Issue Date:June 2011
pp. 1113-1124
Flash solid-state drives (SSDs) are changing the I/O landscape, which has largely been dominated by traditional hard disk drives (HDDs) for the last 50 years. In this paper we propose and systematically explore designs for using an SSD to improve the perfo...
     
Efficient skyline computation in metric space
Found in: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (EDBT '09)
By David Fuhry, Donghui Zhang, Ruoming Jin
Issue Date:March 2009
pp. 94-104
Given a set of n query points in a general metric space, a metric-space skyline (MSS) query asks what are the closest points to all these query points in the database. Here, consider for any point p, if there are no other points in the database which have ...
     
On computing temporal aggregates with range predicates
Found in: ACM Transactions on Database Systems (TODS)
By Alexander Markowetz,Bernhard Seeger,Dimitrios Gunopulos,Donghui Zhang,Vassilis J. Tsotras
Issue Date:June 2008
pp. 1-39
Computing temporal aggregates is an important but costly operation for applications that maintain time-evolving data (data warehouses, temporal databases, etc.) Due to the large volume of such data, performance improvements for temporal aggregate queries a...
     
Refreshing the sky: the compressed skycube with efficient support for frequent updates
Found in: Proceedings of the 2006 ACM SIGMOD international conference on Management of data (SIGMOD '06)
By Donghui Zhang, Tian Xia
Issue Date:June 2006
pp. 491-502
The skyline query is important in many applications such as multi-criteria decision making, data mining, and user-preference queries. Given a set of d-dimensional objects, the skyline query finds the objects that are not dominated by others. In practice, d...
     
A novel improvement to the R*-tree spatial index using gain/loss metrics
Found in: Proceedings of the 12th annual ACM international workshop on Geographic information systems (GIS '04)
By Donghui Zhang, Tian Xia
Issue Date:November 2004
pp. 204-213
The R*-tree is a state-of-the-art spatial index structure. It has already found its way into commercial systems. The most important improvement of the R*-tree over the original R-tree is that it utilizes forced reinsertion. That is, if a disk page overflow...
     
Online event-driven subsequence matching over financial data streams
Found in: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (SIGMOD '04)
By Betty Salzberg, Donghui Zhang, Huanmei Wu
Issue Date:June 2004
pp. 23-34
Subsequence similarity matching in time series databases is an important research area for many applications. This paper presents a new approximate approach for automatic online subsequence similarity matching over massive data streams. With a simultaneous...
     
Efficient aggregation over objects with extent
Found in: Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (PODS '02)
By Dimitrios Gunopulos, Donghui Zhang, Vassilis J. Tsotras
Issue Date:June 2002
pp. 121-132
We examine the problem of efficiently computing sum/count/avg aggregates over objects with non-zero extent. Recent work on computing multi-dimensional aggregates has concentrated on objects with zero extent (points) on a multi-dimensional grid, or one-dime...
     
Improving min/max aggregation over spatial objects
Found in: Proceedings of the ninth ACM international symposium on Advances in geographic information systems (GIS '01)
By Donghui Zhang, Vassilis J. Tsotras
Issue Date:November 2001
pp. 88-93
We examine the problem of computing MIN/MAX aggregates over a collection of spatial objects. Each spatial object is associated with a weight (value), for example, the average temperature or rainfall over the area covered by the object. Given a query rectan...
     
 1