- 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
- 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
Query Processing in Spatial Network Databases空间网络数据库中的查询处理
Query Processing in Spatial Network Databases Outline Introduction Related work Spatial query processing in Euclidean Space Disk-based graph representations- CCAM structure Spatial query in network databases Architecture Spatial queries: Nearest neighbor query Other queries Performances Summary Introduction Motivation Euclidean distance vs. network distance Euclidean distance = network distance Conventional spatial queries: K Nearest neighbor query: retrieves the k ponits closest to the query location Range query: retrieves the points covered by certain range Intersection join: retrieves all the intersected points from the query location sets Outline Introduction Related work Spatial query processing in Euclidean Space Disk-based graph representations- CCAM structure Spatial query in network databases Architecture Spatial queries: Nearest neighbor query Other queries Performances Summary Spatial query processing in Euclidean Space An R-tree index Multidimentional extension of B-tree (quoted from Query Processing in Spatial Network Databases) MBR: Minimum Bounding Rectangle Spatial points are clustered according to the distances between their MBR Hereby, R-tree is fast for spatial query Spatial query processing in Euclidean Space an example Disk-based graph representations- CCAM structure A graph can be represented as An adjacency list Two-dimensional matrix The Connectivity-clustered Access Method (CCAM) structure Stores the single dimensional lists Stores the lists of neighbor nodes together Disk-based graph representations- CCAM structure An example Outline Introduction Related work Spatial query processing in Euclidean Space Disk-based graph representations- CCAM structure Spatial query in network databases Architecture Spatial queries: Nearest neighbor query Other queries Performances Summary Architecture The above example Architecture Primitive operations Check_entity(seg,p): if entity p is covered by seg, then it returns true Find_segment(p): returns t
您可能关注的文档
- Properties and Fabrication Experience with 性能和制造经验.ppt
- Properties of Light Department of Physics光物理系的性质.ppt
- PROPERTIES OF LOVE bjbiblelessons爱bjbiblelessons性质.ppt
- Properties of Matter resource物质资源的性质.sbo.accomack.k12.va.us.ppt
- Properties of Minerals The University of Kansas矿物的性质勘萨斯大学.ppt
- Properties of Minerals myteacherpages性能的矿物 myteacherpages.ppt
- Properties of Matter and the Analysis of Glass物质的性质和玻璃的分析.ppt
- Properties of Mobile Radio Propagation Channel移动无线电波传播信道的特性.ppt
- Properties of Water Wikispaces水的性质 wiki空间.ppt
- Property Based Coordination MINES Sainttienne基于属性的协调矿山圣与#艾蒂安201.ppt
- Querying Websites Using Compact Skeletons使用紧凑的骨架查询网站.ppt
- Question Bank Henry and Mudge #3 Chapter 1 The 问题银行亨利和玛吉3章1.ppt
- Question of the Day How are people and animals alike问题的一天人和动物都一样.ppt
- Quantum Phase Estimation using Multivalued Logic利用多值逻辑量子相位估计.pptx
- Questions and Comments, Popkin text pp问题和意见波普金文本PP. 7475.ppt
- Questions College of Lake County问题湖县学院.ppt
- Queues Are Databases队列是数据库.ppt
- Queueing Theory Tutorial MIT排队论教程麻省理工学院.ppt
- Quick and Dirty Intro to PHP Northwestern University快速和肮脏的PHP 西北大学介绍.ppt
- QUICK DRAW trafalgarenglish快速绘制 trafalgarenglish.wikispaces.ppt
原创力文档


文档评论(0)