Author image not provided
 Donghui Zhang

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article20.12
Citation Count664
Publication count33
Publication years2001-2012
Available for download17
Average downloads per article588.88
Downloads (cumulative)10,011
Downloads (12 Months)139
Downloads (6 Weeks)26
SEARCH
ROLE
Arrow RightAuthor only
· Editor only
· Advisor only
· All roles


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


33 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 33
Result page: 1 2

Sort by:

1 published by ACM
June 2012 ACM Transactions on Database Systems (TODS): Volume 37 Issue 2, May 2012
Publisher: ACM
Bibliometrics:
Citation Count: 7
Downloads (6 Weeks): 1,   Downloads (12 Months): 20,   Downloads (Overall): 508

Full text available: PDFPDF
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 “skyline” of a dataset, or the set of “skyline objects” that are not dominated by any ...
Keywords: Skyline, compressed, subspace, update support, workload

2
July 2010 IEEE Transactions on Knowledge and Data Engineering: Volume 22 Issue 7, July 2010
Publisher: IEEE Educational Activities Department
Bibliometrics:
Citation Count: 14

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) candidate if it has a nonzero probability to be the NN of ...
Keywords: Nearest neighbor, spatial database., uncertain, Nearest neighbor, uncertain, spatial database.

3
July 2010 IEEE Transactions on Knowledge and Data Engineering: Volume 22 Issue 7, July 2010
Publisher: IEEE Educational Activities Department
Bibliometrics:
Citation Count: 4

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 reverse nearest neighbor queries. This problem is faced in a number of applications such ...
Keywords: Continuous queries, and reverse nearest neighbor., query processing, Continuous queries, query processing, and reverse nearest neighbor.

4 published by ACM
November 2009 SIGSPATIAL Special: Volume 1 Issue 3, November 2009
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 0,   Downloads (12 Months): 3,   Downloads (Overall): 144

Full text available: PdfPdf
With the wide usage of location tracking system, continuously mining relationships among moving objects over their location changes is possible and also important to many real applications. This paper shows a novel continuous location-based query, called continuous relational top-k query, or CRTQ , which continuously monitors the k moving objects ...
Keywords: relational, algorithm, query, top-k

5
August 2009 WASA '09: Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 2

Compressed skycubes provide an efficient mechanism for skyline queries that are useful for wireless applications, where the size of a compressed skycube is often much smaller than that of the original skycube. However, even with compression, the entire compressed skycube may still be too large to be placed in the ...
Keywords: Compressed skycube, approximation algorithm

6
July 2009 IEEE Transactions on Knowledge and Data Engineering: Volume 21 Issue 7, July 2009
Publisher: IEEE Educational Activities Department
Bibliometrics:
Citation Count: 8

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 develop ANGEL,1 a new anonymization technique that is as effective as generalization in privacy ...
Keywords: Privacy, ANGEL., Privacy, generalization, ANGEL., generalization

7
August 2008 Proceedings of the VLDB Endowment: Volume 1 Issue 2, August 2008
Publisher: VLDB Endowment
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 5,   Downloads (12 Months): 10,   Downloads (Overall): 150

Full text available: PDFPDF
Reading and perceiving complex SQL queries has been a time consuming task in traditional database applications for decades. When it comes to decision support systems with automatically generated and sometimes highly nested SQL queries, human understanding or tuning of these workloads becomes even more challenging. This demonstration explores visualization methods ...

8 published by ACM
June 2008 ACM Transactions on Database Systems (TODS): Volume 33 Issue 2, June 2008
Publisher: ACM
Bibliometrics:
Citation Count: 13
Downloads (6 Weeks): 1,   Downloads (12 Months): 11,   Downloads (Overall): 480

Full text available: PDFPDF
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 are critical. Previous approaches have aggregate predicates that involve only the time dimension. In this article ...
Keywords: Temporal aggregates, functional aggregates, indexing, range predicates

9
April 2008 ICDE '08: Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 15

This paper deals with a new type of privacy threat, called "corruption", in anonymized data publication. Specifically, an adversary is said to have corrupted some individuals, if s/he has already obtained their sensitive values before consulting the released information. Conventional generalization may lead to severe privacy disclosure in the presence ...

10
April 2008 ICDE '08: Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 21

Given a set of d dimensional objects, a skyline query finds the objects ("skyline") that are not dominated by others. However, skylines do not always provide useful query results to users, and existing methods of various skyline queries have at least one of the following drawbacks: (1) the size of ...

11
April 2008 ICDE '08: Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 5

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 around than it requires, it is an unsafe place. This ...

12 published by ACM
November 2006 CIKM '06: Proceedings of the 15th ACM international conference on Information and knowledge management
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 1,   Downloads (12 Months): 5,   Downloads (Overall): 211

Full text available: PDFPDF
This poster paper summarizes our solution for mining max frequent generalized itemsets (g-itemsets), a compact representation for frequent patterns in the generalized environment.
Keywords: max frequent itemsets, data mining

13
September 2006 VLDB '06: Proceedings of the 32nd international conference on Very large data bases
Publisher: VLDB Endowment
Bibliometrics:
Citation Count: 32
Downloads (6 Weeks): 1,   Downloads (12 Months): 14,   Downloads (Overall): 279

Full text available: PDFPDF
This paper proposes and solves the min-dist optimal-location query in spatial databases. Given a set S of sites, a set O of weighted objects, and a spatial region Q , the min-dist optimal-location query returns a location in Q which, if a new site is built there, minimizes the average ...

14 published by ACM
June 2006 SIGMOD '06: Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Publisher: ACM
Bibliometrics:
Citation Count: 51
Downloads (6 Weeks): 1,   Downloads (12 Months): 8,   Downloads (Overall): 669

Full text available: PDFPDF
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, different users may be interested in different dimensions of the data, and ...
Keywords: compressed skycube, update scheme, skyline

15
April 2006 ICDE '06: Proceedings of the 22nd International Conference on Data Engineering
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 60

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 I. Note ...

16
April 2006 ICDE '06: Proceedings of the 22nd International Conference on Data Engineering
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 26

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 CRNN query monitors the exact reverse nearest neighbors of each query point, under ...

17 published by ACM
February 2006 ACM Transactions on Internet Technology (TOIT): Volume 6 Issue 1, February 2006
Publisher: ACM
Bibliometrics:
Citation Count: 8
Downloads (6 Weeks): 2,   Downloads (12 Months): 10,   Downloads (Overall): 824

Full text available: PDFPDF
Managing multiple versions of XML documents represents a critical requirement for many applications. Recently, there has been much work on supporting complex queries on XML data (e.g., regular path expressions, structural projections, etc.). In this article, we examine the problem of implementing efficiently such complex queries on multiversion XML documents. ...
Keywords: XML document, version retrieval, multiversion, query support

18 published by ACM
November 2005 GIS '05: Proceedings of the 13th annual ACM international workshop on Geographic information systems
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 3,   Downloads (12 Months): 8,   Downloads (Overall): 615

Full text available: PDFPDF
The R*-tree, as a state-of-the-art spatial index, has already found its way into commercial systems like Oracle. In this paper, we aim at improving query performance of the R*-tree. We focus on five widely used spatial queries: range query, aggregation query, nearest neighbor query, skyline query, and join query. The ...
Keywords: R*-tree, outlier

19 published by ACM
November 2005 GIS '05: Proceedings of the 13th annual ACM international workshop on Geographic information systems
Publisher: ACM
Bibliometrics:
Citation Count: 5
Downloads (6 Weeks): 1,   Downloads (12 Months): 9,   Downloads (Overall): 551

Full text available: PDFPDF
Databases of moving objects are important for air traffic control, ground traffic, and battlefield configurations. We introduce the (historical and spatial) range close-pair query for moving objects as an important problem for such databases. The purpose of a range close-pair query for moving objects is to find pairs of objects ...

20
August 2005 VLDB '05: Proceedings of the 31st international conference on Very large data bases
Publisher: VLDB Endowment
Bibliometrics:
Citation Count: 36
Downloads (6 Weeks): 2,   Downloads (12 Months): 6,   Downloads (Overall): 271

Full text available: PdfPdf
Given a set O of weighted objects, a set S of sites, and a query site s, the bichromatic RNN query computes the influence set of s , or the set of objects in O that consider s as the nearest site among all sites in S. The influence of ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us