연구동향 분석
박사

View field aware spatial query processing

이성민 2016년

논문상세정보
인용/피인용
' View field aware spatial query processing' 의 주제별 논문영향력
논문영향력 선정 방법
논문영향력 요약
주제
  • Database
  • View Field Aware Spatial Query
  • spatial database
동일주제 총논문수 논문피인용 총횟수 주제별 논문영향력의 평균
238 0

0.0%

' View field aware spatial query processing' 의 참고문헌

  • Ying Cai et al. \Real-time processing of range-monitoring queries in heterogeneous mobile databases". In: Mobile Computing, IEEE Trans- actions on 5.7 (2006), pp. 931{942.
  • Xiaopeng Xiong, Mohamed F Mokbel, and Walid G Aref. \Sea-cnn: Scalable processing of continuous k-nearest neighbor queries in spatio- temporal databases". In: Data Engineering, 2005. ICDE 2005. Pro- ceedings. 21st International Conference on. IEEE. 2005, pp. 643{654.
  • Won-Ho Chung. \A smartphone watch for mobile surveillance service". In: Personal and Ubiquitous Computing 16.6 (2012), pp. 687{696.
  • WeiWu and Kian-Lee Tan. \isee: Ecient continuous k-nearest-neighbor monitoring over moving objects". In: Scienti c and Statistical Database Management, 2007. SSBDM'07. 19th International Conference on. IEEE. 2007, pp. 36{36.
  • Timos Sellis, Nick Roussopoulos, and Christos Faloutsos. \The R+- tree: A dynamic index for multidimensional objects". In: Proc. 13th VLDB Conf. 1987, pp. 507{518.
  • Sungmin Yi et al. \View Field Nearest Neighbor: A Novel Type of Spatial Queries". In: Information Sciences 275 (Aug. 2014), pp. 68{ 82.
  • Scott T. Leutenegger, Mario A. Lopez, and Je rey Edgington. \STR: A Simple and Ecient Algorithm for R-tree Packing". In: Data En- gineering, 1997. Proceedings. 13th International Conference on. 1997, pp. 497{506.
  • Sarana Nutanong, Egemen Tanin, and Rui Zhang. \Visible nearest neighbor queries". In: Advances in Databases: Concepts, Systems and Applications. Springer, 2007, pp. 876{883.
  • R.P Feynman and F.L Vernon Jr. \The theory of a general quantum system interacting with a linear dissipative system". In: Annals of Physics 24 (1963), pp. 118{173. doi: 10.1016/0003-4916(63)90068- X.
  • P.A.M. Dirac. \The lorentz transformation and absolute time". In: Physica 19.1-{12 (1953), pp. 888{896. doi: 10.1016/S0031-8914(53) 80099-6.
  • Open Data Nottingham. https://www.opendatanottingham.org.uk.
  • Norbert Beckmann et al. \The R-tree: An Ecient and Robust Ac- cess Method for Points and Rectangles". In: Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data. SIGMOD '90. 1990, pp. 322{331.
  • Nick Roussopoulos, Stephen Kelley, and Frederic Vincent. \Nearest Neighbor Queries". In: Proceedings of the 1995 ACM SIGMOD In- ternational Conference on Management of Data. SIGMOD '95. 1995, pp. 71{79.
  • Mohamed F Mokbel, Xiaopeing Xiong, and Walid G Aref. \Sina: Scal- able incremental processing of continuous queries in spatio-temporal databases". In: Proceedings of the 2004 ACM SIGMOD international conference on Management of data. ACM. 2004, pp. 623{634.
  • Mabel Gonzalez et al. \On the stopping criteria for k-Nearest Neighbor in positive unlabeled time series classi cation problems". In: Informa- tion Sciences 328 (Jan. 2016), pp. 42{59.
  • Kyriakos Mouratidis, Dimitris Papadias, and Marios Hadjieleftheriou. \Conceptual partitioning: an ecient method for continuous nearest neighbor monitoring". In: Proceedings of the 2005 ACM SIGMOD in- ternational conference on Management of data. ACM. 2005, pp. 634{ 645.
  • King Lum Cheung and Ada Wai-Chee Fu. \Enhanced Nearest Neigh- bour Search on the R-tree". In: SIGMOD Rec. 27.3 (Sept. 1998), pp. 16{21.
  • Ken CK Lee, Wang-Chien Lee, and Hong Va Leong. \Nearest sur- rounder queries". In: Knowledge and Data Engineering, IEEE Trans- actions on 22.10 (2010), pp. 1444{1458.
  • Ibrahim Kamel and Christos Faloutsos. \Hilbert R-tree: An Improved R-tree Using Fractals". In: Proceedings of the 20th International Con- ference on Very Large Data Bases. 1994, pp. 500{509.
  • Guohui Li et al. \Network Voronoi Diagram on uncertain objects for nearest neighbor queries". In: Information Sciences 301 (Apr. 2015), pp. 241{261.
  • Gsli R. Hjaltason and Hanan Samet. \Distance Browsing in Spatial Databases". In: ACM Trans. Database Syst. 24.2 (June 1999), pp. 265{ 318.
  • Dmitri V Kalashnikov, Sunil Prabhakar, and Susanne E Hambrusch. \Main memory evaluation of monitoring queries over moving objects". In: Distributed and Parallel Databases 15.2 (2004), pp. 117{135.
  • Dimitris Papadias et al. \Topological Relations in the World of Mini- mum Bounding Rectangles: A Study with R-trees". In: Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data. 1995, pp. 92{103.
  • Bugra Gedik and Ling Liu. \Mobieyes: A distributed location moni- toring service using moving location queries". In: Mobile Computing, IEEE Transactions on 5.10 (2006), pp. 1384{1402.
  • Antonin Guttman. \R-trees: A Dynamic Index Structure for Spatial Searching". In: Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data. SIGMOD '84. 1984, pp. 47{57.