
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Zhiyong Huang, Hua Lu, Beng Chin Ooi, Anthony K.H. Tung, "Continuous Skyline Queries for Moving Objects," IEEE Transactions on Knowledge and Data Engineering, vol. 18, no. 12, pp. 16451658, December, 2006.  
BibTex  x  
@article{ 10.1109/TKDE.2006.185, author = {Zhiyong Huang and Hua Lu and Beng Chin Ooi and Anthony K.H. Tung}, title = {Continuous Skyline Queries for Moving Objects}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {18}, number = {12}, issn = {10414347}, year = {2006}, pages = {16451658}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2006.185}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Continuous Skyline Queries for Moving Objects IS  12 SN  10414347 SP1645 EP1658 EPD  16451658 A1  Zhiyong Huang, A1  Hua Lu, A1  Beng Chin Ooi, A1  Anthony K.H. Tung, PY  2006 KW  Skyline KW  continuous query processing KW  moving object databases. VL  18 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] P.K. Agarwal, L. Arge, and J. Erickson, “Indexing Moving Points,” Proc. ACM Symp. Principles of Database Systems, pp. 175186, 2000.
[2] W.T. Balke, U. Guentzer, and J.X. Zheng, “Efficient Distributed Skylining for Web Information Systems,” Proc. Int'l Conf. Extending Database Technology (EDBT), pp. 256273, 2004.
[3] J. Basch, L.J. Guibas, and J. Hershberger, “Data Structures for Mobile Data,” Proc. ACMSIAM Symp. Discrete Algorithms, pp. 747756, 1997.
[4] R. Benetis, C. Jensen, G. Karciauskas, and S. Saltenis, “Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects,” Proc. Int'l Symp. Database Eng. & Applications, pp.4453, 2002.
[5] J.L. Bentley, H.T. Kung, M. Schkolnick, and C.D. Thompson, “On the Average Number of Maxima in a Set of Vectors and Applications,” J. ACM, vol. 25, no. 4, pp. 536543, 1978.
[6] S. Borzonyi, D. Kossmann, and K. Stocker, “The Skyline Operator,” Proc. Int'l Conf. Data Eng., pp. 421430, 2001.
[7] J. Chomicki, P. Godfrey, J. Gryz, and D. Liang, “Skyline with Presorting,” Proc. Int'l Conf. Data Eng., pp. 717816, 2003.
[8] D. Hearn and M.P. Baker, Computer Graphics C Version. PrenticeHall, 1997.
[9] G. Hjaltason and H. Samet, “Distance Browsing in Spatial Database,” ACM Trans. Database Systems, vol. 24, no. 2, pp. 265318, 1999.
[10] G.S. Iwerks, H. Samet, and K. Smith, “Continuous kNearest Neighbor Queries for Continuously Moving Points with Updates,” Proc. 29th Int'l Conf. Very Large Data Bases, pp. 512523, 2003.
[11] C.S. Jensen, D. Lin, and B.C. Ooi, “Query and Update Efficient V+Tree Based Indexing of Moving Objects,” Proc. 30th Int'l Conf. Very Large Data Bases, pp. 768779, 2004.
[12] G. Kollios, D. Gunopulos, and V.J. Tsotras, “On Indexing Mobile Objects,” Proc. 18th ACM SIGACTSIGMODSIGART Symp. Principles of Database Systems, pp. 261272, 1999.
[13] D. Kossmann, F. Ramsak, and S. Rost, “Shooting Stars in the Sky: An Online Algorithm for Skyline Queries,” Proc. 28th Int'l Conf. Very Large Data Bases, pp. 275286, 2002.
[14] H.T. Kung, F. Luccio, and F.P. Preparata, “On Finding the Maxima of a Set of Vectors,” J. ACM, vol. 22, no. 4, pp. 469476, 1975.
[15] D.H. McLain, “Drawing Contours from Arbitrary Data Points,” Computer J., vol. 17, no. 4, pp. 318324, 1974.
[16] H. Mokhtar, J. Su, and O. Ibarra, “On Moving Object Queries,” Proc. 21st ACM PODS Symp. Principles of Database Systems, pp. 188198, 2002.
[17] J. Nievergelt and H. Hinterberger, “The Grid File: An Adaptable, Symmetric Multikey File Structure,” ACM Trans. Database Systems, vol. 9, no. 1, pp. 3871, 1984.
[18] D. Papadias, Y. Tao, G. Fu, and B. Seeger, “An Optimal and Progressive Algorithm for Skyline Queries,” Proc. 2003 ACM SIGMOD Int'l Conf. Management of Data, pp. 467478, 2003.
[19] D. Papadias, Y. Tao, G. Fu, and B. Seeger, “Progressive Skyline Computation in Database Systems,” ACM Trans. Database Systems, vol. 30, no. 1, pp. 4182, 2005.
[20] F.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction. SpringerVerlag, 1985.
[21] K. Raptopoulou, A. Papadopoulos, and Y. Manolopoulos, “Fast NearestNeighbor Query Processing in MovingObject Databases,” GeoInformatica, vol. 7, no. 2, pp. 113137, 2003.
[22] N. Roussopoulos, S. Kelley, and F. Vincent, “Nearest Neighbor Queries,” Proc. 1995 ACM SIGMOD Int'l Conf. Management of Data, pp. 7179, 1995.
[23] S. Saltenis, C.S. Jensen, S.T. Leutenegger, and M.A. Lopez, “Indexing the Positions of Continuously Moving Objects,” Proc. 2000 ACM SIGMOD Int'l Conf. Management of Data, pp. 331342, 2000.
[24] Z. Song and N. Roussopoulos, “Hashing Moving Objects,” Proc. Second Int'l Conf. Mobile Data Management, pp. 161172, 2001.
[25] R.E. Steuer, Multiple Criteria Optimization. Wiley, 1986.
[26] K.L. Tan, P.K. Eng, and B.C. Ooi, “Efficient Progressive Skyline Computation,” Proc. 27th Int'l Conf. Very Large Data Bases, pp. 301310, 2001.
[27] Y. Tao and D. Papadias, “TimeParameterized Queries in SpatioTemporal Databases,” Proc. 2002 ACM SIGMOD Int'l Conf. Management of Data, pp. 334345, 2002.
[28] X. Xiong, M.F. Mokbel, W.G. Aref, S.E. Hambrusch, and S. Prabhakar, “Scalable SpatioTemporal Continuous Query Processing for LocationAware Services,” Proc. 16th Int'l Conf. Scientific and Statistical Database Management, pp. 317326, 2004.
[29] J. Zhang, M. Zhu, D. Papadias, Y. Tao, and D.L. Lee, “LocationBased Spatial Queries,” Proc. ACM SIGMOD Conf., pp. 443454, 2003.