Filter Results:
- Full text PDF available (26)
Publication Year
1991
2019
- This year (3)
- Last 5 years (16)
- Last 10 years (51)
Publication Type
Co-author
Journals and Conferences
Learn More
- Dimitris Papadias, Yufei Tao, Greg Fu, Bernhard Seeger
- ACM Trans. Database Syst.
- 2005
The skyline of a d-dimensional dataset contains the points that are not dominated by any other point on all dimensions. Skyline computation has recently received considerable attention in the… (More)
- Dimitris Papadias, Jun Zhang, Nikos Mamoulis, Yufei Tao
- VLDB
- 2003
Despite the importance of spatial networks in real-life applications, most of the spatial database literature focuses on Euclidean spaces. In this paper we propose an architecture that integrates… (More)
- Dimitris Papadias, Yufei Tao, Greg Fu, Bernhard Seeger
- SIGMOD Conference
- 2003
The skyline of a set of d-dimensional points contains the points that are not dominated by any other point on all dimensions. Skyline computation has recently received considerable attention in the… (More)
- Panos Kalnis, Gabriel Ghinita, Kyriakos Mouratidis, Dimitris Papadias
- IEEE Transactions on Knowledge and Data…
- 2007
The increasing trend of embedding positioning capabilities (for example, GPS) in mobile devices facilitates the widespread use of location-based services. For such applications to succeed, privacy… (More)
- Yufei Tao, Dimitris Papadias, Xiang Lian
- VLDB
- 2004
Given a point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Existing methods for processing such queries have at least… (More)
- Yufei Tao, Dimitris Papadias, Qiongmao Shen
- VLDB
- 2002
A continuous nearest neighbor query retrieves the nearest neighbor (NN) of every point on a line segment (e.g., “find all my nearest gas stations during my route from point s to point e”). The result… (More)
- Yufei Tao, Dimitris Papadias, Jimeng Sun
- VLDB
- 2003
A predictive spatio-temporal query retrieves the set of moving objects that will intersect a query window during a future time interval. Currently, the only access method for processing such queries… (More)
- Kyriakos Mouratidis, Marios Hadjieleftheriou, Dimitris Papadias
- SIGMOD Conference
- 2005
Given a set of objects P and a query point q, a k nearest neighbor (k-NN) query retrieves the k objects in P that lie closest to q. Even though the problem is well-studied for static datasets, the… (More)
- Yufei Tao, Dimitris Papadias
- VLDB
- 2001
Among the various types of spatio-temporal queries, the most common ones involve window queries in time. In particular, timestamp (or timeslice) queries retrieve all objects that intersect a window… (More)
- Dimitris Papadias, Yufei Tao, Kyriakos Mouratidis, Chun Kit Hui
- ACM Trans. Database Syst.
- 2005
Given two spatial datasets <i>P</i> (e.g., facilities) and <i>Q</i> (queries), an <i>aggregate nearest neighbor</i> (ANN) query retrieves the point(s) of <i>P</i> with the smallest aggregate… (More)