Spatial Data Management
暂无分享,去创建一个
[1] Agnès Voisard,et al. Thematic Map Modeling , 1989, SSD.
[2] Divyakant Agrawal,et al. Exploring spatial datasets with histograms , 2006, Distributed and Parallel Databases.
[3] Christian Böhm,et al. Epsilon grid order: an algorithm for the similarity join on massive high-dimensional data , 2001, SIGMOD '01.
[4] Nick Roussopoulos,et al. Nearest neighbor queries , 1995, SIGMOD '95.
[5] Dimitris Papadias,et al. Spatial Joins: Algorithms, Cost Models and Optimization Techniques , 2005, Spatial Databases.
[6] Christos Faloutsos,et al. Fast Nearest Neighbor Search in Medical Image Databases , 1996, VLDB.
[7] Sridhar Ramaswamy,et al. A Unified Approach for Indexed and Non-Indexed Spatial Joins , 2000, EDBT.
[8] Jianliang Xu,et al. A generic framework for monitoring continuous spatial queries over moving objects , 2005, SIGMOD '05.
[9] Torsten Suel,et al. Efficient query processing in geographic web search engines , 2006, SIGMOD Conference.
[10] Hanan Samet,et al. Efficient query processing on spatial networks , 2005, GIS '05.
[11] Timos K. Sellis,et al. A Family of Directional Relation Models for Extended Objects , 2007, IEEE Transactions on Knowledge and Data Engineering.
[12] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[13] Nick Roussopoulos,et al. Cubetree: Organization of and Bulk Updates on the Data Cube , 1997, SIGMOD Conference.
[14] Cyrus Shahabi,et al. A Road Network Embedding Technique for K-Nearest Neighbor Search in Moving Object Databases , 2003, GeoInformatica.
[15] Torsten Suel,et al. On Rectangular Partitionings in Two Dimensions: Algorithms, Complexity, and Applications , 1999, ICDT.
[16] Ralf Hartmut Güting. Preface to the special issue on spatial database systems , 2005, The VLDB Journal.
[17] Amos Fiat,et al. Highway dimension, shortest paths, and provably efficient algorithms , 2010, SODA '10.
[18] Derek Thompson,et al. Fundamentals of spatial information systems , 1992, A.P.I.C. series.
[19] Tao Chen,et al. The Objects Interaction Matrix for Modeling Cardinal Directions in Spatial Databases , 2010, DASFAA.
[20] Yufei Tao,et al. The Bdual-Tree: indexing moving objects by space filling curves in the dual space , 2008, The VLDB Journal.
[21] Doron Rotem. Spatial join indices , 1991, [1991] Proceedings. Seventh International Conference on Data Engineering.
[22] Christian S. Jensen,et al. Indexing the Positions of Continuously Moving Objects , 2000, SIGMOD Conference.
[23] Yannis Manolopoulos,et al. Closest pair queries in spatial databases , 2000, SIGMOD 2000.
[24] Walid G. Aref,et al. The RUM-tree: supporting frequent updates in R-trees using memos , 2009, The VLDB Journal.
[25] Jimeng Sun,et al. The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries , 2003, VLDB.
[26] Yufei Tao,et al. An efficient cost model for optimization of nearest neighbor search in low and medium dimensional spaces , 2004, IEEE Transactions on Knowledge and Data Engineering.
[27] Hanan Samet,et al. Foundations of multidimensional and metric data structures , 2006, Morgan Kaufmann series in data management systems.
[28] Juliano Lopes de Oliveira,et al. An Environment for Modeling and Design of Geographic Applications , 1997, GeoInformatica.
[29] Frank Manola,et al. PROBE Spatial Data Modeling and Query Processing in an Image Database Application , 1988, IEEE Trans. Software Eng..
[30] Max J. Egenhofer,et al. Topological Relations Between Regions with Holes , 1994, Int. J. Geogr. Inf. Sci..
[31] Antonin Guttman,et al. R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.
[32] Yufei Tao,et al. MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries , 2001, VLDB.
[33] Hans-Peter Kriegel,et al. Efficient processing of spatial joins using R-trees , 1993, SIGMOD Conference.
[34] Hans-Peter Kriegel,et al. Optimal multi-step k-nearest neighbor search , 1998, SIGMOD '98.
[35] Sridhar Ramaswamy,et al. Selectivity estimation in spatial databases , 1999, SIGMOD '99.
[36] Jürg Nievergelt,et al. The Grid File: An Adaptable, Symmetric Multikey File Structure , 1984, TODS.
[37] Ming-Ling Lo,et al. Spatial joins using seeded trees , 1994, SIGMOD '94.
[38] Marios Hadjieleftheriou,et al. SaIL: A Spatial Index Library for Efficient Application Integration , 2005, GeoInformatica.
[39] Dimitrios Gunopulos,et al. Indexing mobile objects using dual transformations , 2004, The VLDB Journal.
[40] Christian Freksa,et al. Using Orientation Information for Qualitative Spatial Reasoning , 1992, Spatio-Temporal Reasoning.
[41] Dimitris Papadias,et al. Slot Index Spatial Join , 2003, IEEE Trans. Knowl. Data Eng..
[42] A. Prasad Sistla,et al. Modeling and querying moving objects , 1997, Proceedings 13th International Conference on Data Engineering.
[43] H. V. Jagadish,et al. Algorithms for Searching Massive Graphs , 1994, IEEE Trans. Knowl. Data Eng..
[44] Ashwin Machanavajjhala,et al. l-Diversity: Privacy Beyond k-Anonymity , 2006, ICDE.
[45] Jack A. Orenstein. Spatial query processing in an object-oriented database system , 1986, SIGMOD '86.
[46] Jian Pei,et al. On k-skip shortest paths , 2011, SIGMOD '11.
[47] Pierangela Samarati,et al. Protecting Respondents' Identities in Microdata Release , 2001, IEEE Trans. Knowl. Data Eng..
[48] Nick Roussopoulos,et al. Direct spatial search on pictorial databases using packed R-trees , 1985, SIGMOD Conference.
[49] Christos Faloutsos,et al. Prediction and indexing of moving objects with unknown motion patterns , 2004, SIGMOD '04.
[50] Ming-Ling Lo,et al. Spatial hash-joins , 1996, SIGMOD '96.
[51] Nancy Wiegand,et al. Review of Spatial databases with application to GIS by Philippe Rigaux, Michel Scholl, and Agnes Voisard. Morgan Kaufmann 2002. , 2003, SGMD.
[52] Shashi Shekhar,et al. Data models in geographic information systems , 1997, CACM.
[53] Sakti Pramanik,et al. An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps , 2002, IEEE Trans. Knowl. Data Eng..
[54] Mark de Berg,et al. The Priority R-tree: a practically efficient and worst-case optimal R-tree , 2004, SIGMOD '04.
[55] Mario A. López,et al. STR: a simple and efficient algorithm for R-tree packing , 1997, Proceedings 13th International Conference on Data Engineering.
[56] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[57] T. A. J. Nicholson,et al. Finding the Shortest Route between Two Points in a Network , 1966, Comput. J..
[58] Hamid Pirahesh,et al. Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals , 1996, Data Mining and Knowledge Discovery.
[59] Ricardo Baeza-Yates,et al. Modern Information Retrieval - the concepts and technology behind search, Second edition , 2011 .
[60] Hans-Peter Kriegel,et al. Route skyline queries: A multi-preference path planning approach , 2010, 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010).
[61] Kyriakos Mouratidis,et al. Aggregate nearest neighbor queries in spatial databases , 2005, TODS.
[62] Hans-Peter Kriegel,et al. Proximity queries in large traffic networks , 2007, GIS.
[63] Masatoshi Yoshikawa,et al. The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation , 2000, VLDB.
[64] Naphtali Rishe,et al. Keyword Search on Spatial Databases , 2008, 2008 IEEE 24th International Conference on Data Engineering.
[65] Yufei Tao,et al. Query Processing in Spatial Network Databases , 2003, VLDB.
[66] Christian S. Jensen,et al. A benchmark for evaluating moving object indexes , 2008, Proc. VLDB Endow..
[67] Anand Sivasubramaniam,et al. Toward an Accurate Analysis of Range Queries on Spatial Data , 2003, IEEE Trans. Knowl. Data Eng..
[68] Latanya Sweeney,et al. k-Anonymity: A Model for Protecting Privacy , 2002, Int. J. Uncertain. Fuzziness Knowl. Based Syst..
[69] Christos Faloutsos,et al. The R+-Tree: A Dynamic Index for Multi-Dimensional Objects , 1987, VLDB.
[70] Andrew U. Frank,et al. Application of DBMS to Land Information Systems , 1981, VLDB.
[71] Peter Sanders,et al. In Transit to Constant Time Shortest-Path Queries in Road Networks , 2007, ALENEX.
[72] Hans-Werner Six,et al. Spatial searching in geometric databases , 1988, Proceedings. Fourth International Conference on Data Engineering.
[73] Hans-Peter Kriegel,et al. The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.
[74] Jonathan Goldstein,et al. When Is ''Nearest Neighbor'' Meaningful? , 1999, ICDT.
[75] Dimitrios Gunopulos,et al. On indexing mobile objects , 1999, PODS '99.
[76] Ronald Fagin,et al. Fuzzy queries in multimedia database systems , 1998, PODS '98.
[77] Dimitris Papadias,et al. Multiway spatial joins , 2001, ACM Trans. Database Syst..
[78] Bernhard Seeger,et al. A revised r*-tree in comparison with related index structures , 2009, SIGMOD Conference.
[79] Dimitris Papadias,et al. Evaluation of Iceberg Distance Joins , 2003, SSTD.
[80] Hans-Peter Kriegel,et al. The X-tree : An Index Structure for High-Dimensional Data , 2001, VLDB.
[81] Jeffrey F. Naughton,et al. Accurate estimation of the cost of spatial selections , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).
[82] Klaus H. Hinrichs,et al. A new algorithm for computing joins with grid files , 1993, Proceedings of IEEE 9th International Conference on Data Engineering.
[83] Hinrich Schütze,et al. Introduction to information retrieval , 2008 .
[84] Yufei Tao,et al. Branch-and-bound processing of ranked queries , 2007, Inf. Syst..
[85] Hanan Samet,et al. Incremental distance join algorithms for spatial databases , 1998, SIGMOD '98.
[86] Qing Liu,et al. Summarizing level-two topological relations in large spatial datasets , 2006, TODS.
[87] Christian S. Jensen,et al. Efficient Retrieval of the Top-k Most Relevant Spatial Web Objects , 2009, Proc. VLDB Endow..
[88] Nick Koudas,et al. Size separation spatial join , 1997, SIGMOD '97.
[89] Dimitris Papadias,et al. Selectivity Estimation of Complex Spatial Queries , 2001, SSTD.
[90] Beng Chin Ooi,et al. Query and Update Efficient B+-Tree Based Indexing of Moving Objects , 2004, VLDB.
[91] Panos Kalnis,et al. PRIVE: anonymous location-based queries in distributed mobile systems , 2007, WWW '07.
[92] Peter Sanders,et al. Highway Hierarchies Hasten Exact Shortest Path Queries , 2005, ESA.
[93] Ralf Hartmut Güting,et al. SECONDO: an extensible DBMS platform for research prototyping and teaching , 2005, 21st International Conference on Data Engineering (ICDE'05).
[94] H.V. Jagadish,et al. Materialization and incremental update of path information , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.
[95] H. Sagan. Space-filling curves , 1994 .
[96] Christos Faloutsos,et al. On packing R-trees , 1993, CIKM '93.
[97] Timos K. Sellis,et al. A model for the prediction of R-tree performance , 1996, PODS.
[98] Panos Kalnis,et al. Efficient OLAP Operations in Spatial Data Warehouses , 2001, SSTD.
[99] Hans-Jörg Schek,et al. A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces , 1998, VLDB.
[100] Martin L. Kersten,et al. Efficient k-NN search on vertically decomposed data , 2002, SIGMOD '02.
[101] Jens Dittrich,et al. MOVIES: indexing moving objects by shooting index images , 2011, GeoInformatica.
[102] Markus Schneider,et al. A foundation for representing and querying moving objects , 2000, TODS.
[103] Yannis Manolopoulos,et al. R-Trees: Theory and Applications , 2005, Advanced Information and Knowledge Processing.
[104] David J. DeWitt,et al. Partition based spatial-merge join , 1996, SIGMOD '96.
[105] Hanan Samet,et al. The Design and Analysis of Spatial Data Structures , 1989 .
[106] Beng Chin Ooi,et al. Indexing the Distance: An Efficient Method to KNN Processing , 2001, VLDB.
[107] Ronald J. Gutman,et al. Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks , 2004, ALENEX/ANALC.
[108] Hans-Peter Kriegel,et al. Multi-step processing of spatial joins , 1994, SIGMOD '94.
[109] Sridhar Ramaswamy,et al. Scalable Sweeping-Based Spatial Join , 1998, VLDB.
[110] Timos K. Sellis,et al. Cost models for join queries in spatial databases , 1998, Proceedings 14th International Conference on Data Engineering.
[111] Timos K. Sellis,et al. Computing and Handling Cardinal Direction Information , 2004, EDBT.
[112] Hanan Samet,et al. Scalable network distance browsing in spatial databases , 2008, SIGMOD Conference.
[113] Christos Faloutsos,et al. Hilbert R-tree: An Improved R-tree using Fractals , 1994, VLDB.
[114] Michael Zeiler,et al. Modeling our world : the ESRI guide to geodatabase design , 1999 .
[115] Bernhard Seeger,et al. Progressive skyline computation in database systems , 2005, TODS.
[116] Divyakant Agrawal,et al. Selectivity Estimation for Spatial Joins with Geometric Selections , 2002, EDBT.
[117] Christos Faloutsos,et al. FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets , 1995, SIGMOD '95.
[118] J. T. Robinson,et al. The K-D-B-tree: a search structure for large multidimensional dynamic indexes , 1981, SIGMOD '81.
[119] Kai Zimmermann,et al. Enhancing Qualitative Spatial Reasoning - Combining Orientation and Distance , 1993, COSIT.
[120] Jignesh M. Patel,et al. STRIPES: an efficient index for predicted trajectories , 2004, SIGMOD '04.
[121] Sukho Lee,et al. Adaptive multi-stage distance join processing , 2000, SIGMOD 2000.
[122] Sharad Mehrotra,et al. Progressive approximate aggregate queries with a multi-resolution tree structure , 2001, SIGMOD '01.
[123] Elke A. Rundensteiner,et al. Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation , 1998, IEEE Trans. Knowl. Data Eng..
[124] Walid G. Aref,et al. Casper*: Query processing for location services without compromising privacy , 2006, TODS.
[125] Michel Scholl,et al. A Performance Evaluation of Spatial Join Processing Strategies , 1999, SSD.
[126] Shashi Shekhar,et al. Spatial Databases: A Tour , 2003 .
[127] Nils J. Nilsson,et al. A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..
[128] Cyrus Shahabi,et al. The spatial skyline queries , 2006, VLDB.
[129] Jiawei Han,et al. Data Mining: Concepts and Techniques , 2000 .
[130] Vassilis J. Tsotras,et al. Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions , 2010, Proc. VLDB Endow..
[131] Walid G. Aref,et al. SINA: scalable incremental processing of continuous queries in spatio-temporal databases , 2004, SIGMOD '04.
[132] Dieter Pfoser,et al. Novel Approaches in Query Processing for Moving Object Trajectories , 2000, VLDB 2000.
[133] Christos Faloutsos,et al. Estimating the Selectivity of Spatial Queries Using the 'Correlation' Fractal Dimension , 1995, VLDB.
[134] Gérard Ligozat,et al. Reasoning about Cardinal Directions , 1998, J. Vis. Lang. Comput..
[135] Ralf Hartmut Güting,et al. An introduction to spatial database systems , 1994, VLDB J..
[136] D. DeWitt,et al. K-Anonymization as Spatial Indexing: Toward Scalable and Incremental Anonymization , 2007, 2007 IEEE 23rd International Conference on Data Engineering.
[137] Alberto H. F. Laender,et al. OMT-G: An Object-Oriented Data Model for Geographic Applications , 2001, GeoInformatica.
[138] Max J. Egenhofer,et al. Reasoning about Binary Topological Relations , 1991, SSD.
[139] Mark de Berg,et al. Computational geometry: algorithms and applications , 1997 .
[140] Jano Moreira de Souza,et al. A Raster Approximation For Processing of Spatial Joins , 1998, VLDB.
[141] Haim Kaplan,et al. Reach for A*: Shortest Path Algorithms with Preprocessing , 2006, The Shortest Path Problem.
[142] Ihab F. Ilyas,et al. A survey of top-k query processing techniques in relational database systems , 2008, CSUR.
[143] Donald Kossmann,et al. The Skyline operator , 2001, Proceedings 17th International Conference on Data Engineering.
[144] Bernhard Nebel,et al. On the Complexity of Qualitative Spatial Reasoning: A Maximal Tractable Fragment of the Region Connection Calculus , 1999, Artif. Intell..
[145] Michael J. Swain,et al. Color indexing , 1991, International Journal of Computer Vision.
[146] Oliver Günther,et al. Multidimensional access methods , 1998, CSUR.
[147] Yufei Tao,et al. Time-parameterized queries in spatio-temporal databases , 2002, SIGMOD '02.
[148] N. Meyers,et al. H = W. , 1964, Proceedings of the National Academy of Sciences of the United States of America.
[149] Mario A. Nascimento,et al. Towards historical R-trees , 1998, SAC '98.
[150] Hanan Samet,et al. Distance Oracles for Spatial Networks , 2009, 2009 IEEE 25th International Conference on Data Engineering.
[151] Christos Faloutsos,et al. Spatial join selectivity using power laws , 2000, SIGMOD 2000.
[152] Timos K. Sellis,et al. Topological relations in the world of minimum bounding rectangles: a study with R-trees , 1995, SIGMOD '95.
[153] Robert Laurini,et al. 9 – Design for Information Systems: Methodologies, issues , 1992 .
[154] Hanan Samet,et al. Distance browsing in spatial databases , 1999, TODS.
[155] Shashi Shekhar,et al. CCAM: A Connectivity-Clustered Access Method for Networks and Network Computations , 1997, IEEE Trans. Knowl. Data Eng..
[156] Shashi Shekhar,et al. Spatial Databases - Accomplishments and Research Needs , 1999, IEEE Trans. Knowl. Data Eng..
[157] Hanan Samet,et al. Spatial join techniques , 2007, TODS.
[158] Christos Faloutsos,et al. Fast subsequence matching in time-series databases , 1994, SIGMOD '94.
[159] Jon Louis Bentley,et al. Quad trees a data structure for retrieval on composite keys , 1974, Acta Informatica.
[160] Panos Kalnis,et al. A framework for efficient data anonymization under privacy and accuracy constraints , 2009, TODS.
[161] Raymond Chi-Wing Wong,et al. Privacy-Preserving Data Publishing: An Overview , 2010, Privacy-Preserving Data Publishing: An Overview.