標(biāo)題: Titlebook: Advances in Spatial Databases; 5th International Sy Michel Scholl,Agnès Voisard Conference proceedings 1997 Springer-Verlag Berlin Heidelbe [打印本頁] 作者: Dopamine 時(shí)間: 2025-3-21 19:02
書目名稱Advances in Spatial Databases影響因子(影響力)
書目名稱Advances in Spatial Databases影響因子(影響力)學(xué)科排名
書目名稱Advances in Spatial Databases網(wǎng)絡(luò)公開度
書目名稱Advances in Spatial Databases網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Advances in Spatial Databases被引頻次
書目名稱Advances in Spatial Databases被引頻次學(xué)科排名
書目名稱Advances in Spatial Databases年度引用
書目名稱Advances in Spatial Databases年度引用學(xué)科排名
書目名稱Advances in Spatial Databases讀者反饋
書目名稱Advances in Spatial Databases讀者反饋學(xué)科排名
作者: 修剪過的樹籬 時(shí)間: 2025-3-21 20:59 作者: buoyant 時(shí)間: 2025-3-22 03:15 作者: Pelago 時(shí)間: 2025-3-22 08:10 作者: STYX 時(shí)間: 2025-3-22 08:48 作者: 我說不重要 時(shí)間: 2025-3-22 15:10 作者: 思想靈活 時(shí)間: 2025-3-22 18:07
Geo-Opera: Workflow concepts for spatial processes,periment management, incorporating many characteristics of workflow management systems as well as a simple but expressive process modeling language, exception handling, and data and metadata indexing and querying capabilities.作者: Lucubrate 時(shí)間: 2025-3-22 21:53 作者: Systemic 時(shí)間: 2025-3-23 02:35 作者: Encapsulate 時(shí)間: 2025-3-23 06:31 作者: Digest 時(shí)間: 2025-3-23 10:57
Camille Couprie,Pauline Luc,Jakob Verbeekf hierarchical routing algorithms. Our experiments with the Twin Cities metropolitan road-map show that materializing the shortest-path-cost view for the boundary graph provides the best savings in computation time, for a given amount of storage and a small number of fragments. Materializing the rel作者: paragon 時(shí)間: 2025-3-23 16:32
Prateep Bhattacharjee,Sukhendu Dase represented (for example, the distance between two objects cannot be computed). Finally, no update language for spatial constraint databases has been defined yet. The aim of this paper is to overcome some of the previous limitations. In particular, we extend the model and the algebra to directly d作者: CRUE 時(shí)間: 2025-3-23 19:48 作者: 貪婪的人 時(shí)間: 2025-3-24 00:01 作者: 致命 時(shí)間: 2025-3-24 05:16
Computer Vision – ECCV 2018 Workshopsperiment management, incorporating many characteristics of workflow management systems as well as a simple but expressive process modeling language, exception handling, and data and metadata indexing and querying capabilities.作者: macular-edema 時(shí)間: 2025-3-24 07:09 作者: 表被動(dòng) 時(shí)間: 2025-3-24 13:21
Spatial internet marketplaces: A grand challenge?,f very high potential value which require greater access to data and data manipulation tools than can currently be provided. This paper considers extension of the electronic market concept to Spatial Internet Marketplaces. A Spatial Internet Marketplace consists of a large number of providers offeri作者: Aerate 時(shí)間: 2025-3-24 17:13
3D Similarity search by shape approximation,ging, or CAD. We propose a similarity criterion and algorithm for 3D surface segments which is based on the approximation of segments by using multi-parametric functions. The method can be adjusted to individual requirements of specific applications by choosing appropriate surface functions as appro作者: 音樂等 時(shí)間: 2025-3-24 20:05
Finding boundary shape matching relationships in spatial data,atial data, whereby many objects called . (represented as polygons) are compared with one or more point sets called .. The research described has practical application in such domains as Geographic Information Systems, in which a cluster of points (possibly created by an SQL query) is compared to ma作者: 嚙齒動(dòng)物 時(shí)間: 2025-3-25 00:10
Spatial data mining: A database approach,wing. This paper introduces a set of basic operations which should be supported by a spatial database system (SDBS) to express algorithms for KDD in SDBS. For this purpose, we introduce the concepts of neighborhood graphs and paths and a small set of operations for their manipulation. We argue that 作者: 使更活躍 時(shí)間: 2025-3-25 06:29 作者: Provenance 時(shí)間: 2025-3-25 09:54 作者: 紅潤(rùn) 時(shí)間: 2025-3-25 14:05 作者: Graphite 時(shí)間: 2025-3-25 17:31 作者: certitude 時(shí)間: 2025-3-25 20:59 作者: 執(zhí) 時(shí)間: 2025-3-26 01:27
Orthogonal polygons as bounding structures in filter-refine query processing strategies,ith a minimum bounding rectangle (an orthogonal polygon with just 4 vertices in two dimensions) as an object approximation method is presented. Orthogonal polygons can be used to improve the performance of the refine step in the filter-refine query processing strategy employed in spatial databases. 作者: Minuet 時(shí)間: 2025-3-26 04:34 作者: fleeting 時(shí)間: 2025-3-26 09:15
Geo-Opera: Workflow concepts for spatial processes,vocations and data exchanges. Due to the generality of the notion of process and the high demand for the functionality they provide, process support systems are starting to be used in a variety of application areas, from business re-engineering to experiment management. In particular, recent results作者: 向下五度才偏 時(shí)間: 2025-3-26 14:33
Physical database design for raster images in concert,osed in research and development. Externalization of database functionality is a radical departure from traditional thinking. Traditionally, all data is loaded into and owned by the database, whereas in the new paradigm data may reside outside the database in external repositories or archives. Never作者: 偶像 時(shí)間: 2025-3-26 20:01
Topological error correcting in GIS,data sets are coming from a lack of knowledge about topological relations between the geographical objects stored in the database. Consequently, topology can help to find errors in GIS data sets, and can help to correct them. The topic of this paper is to present how topological relation can be used作者: 鞭打 時(shí)間: 2025-3-26 22:31 作者: formula 時(shí)間: 2025-3-27 01:09 作者: Self-Help-Group 時(shí)間: 2025-3-27 08:15
New linear node splitting algorithm for R-trees,d in most implementations of .-tree, it is more superior in terms of the time required to split a node, the distribution of data after splitting, as well as the area of overlapping. Most important of all, it has a better query performance. The claim is substantiated by an analysis of the algorithm a作者: 小木槌 時(shí)間: 2025-3-27 11:05
The S-tree: An efficient index for multidimensional objects,h as cartography, satellite and medical images. The .-tree discussed in this paper is similar in flavor to the standard .-tree, but accepts mild imbalance in the resulting tree in return for significantly reduced area, overlap and perimeter in the resulting minimum bounding rectangles. In fact, the 作者: 加入 時(shí)間: 2025-3-27 16:51
0302-9743 in July 1997..The 18 revised full papers presented were carefully selected from a total of 55 submissions. Also included are two keynote contributions. The papers are organized in topical sections on spatial similarities, geo-algorithms, spatial constraint databases, spatial query processing, system作者: Clinch 時(shí)間: 2025-3-27 21:29 作者: 指數(shù) 時(shí)間: 2025-3-27 23:21
Spatial data mining: A database approach, KDD algorithms based on the proposed operations. Furthermore, the efficient support of operations on large neighborhood graphs and on large sets of neighborhood paths by the SDBS is discussed. Neighborhood indices are introduced to materialize selected neighborhood graphs in order to speed up the processing of the proposed operations.作者: Neolithic 時(shí)間: 2025-3-28 03:24 作者: nerve-sparing 時(shí)間: 2025-3-28 07:43
Interpretable Intuitive Physics Modelregions. We present an algorithm to efficiently perform ellipsoid queries on the class of spatial index structures that manage their directory by rectilinear hyperrectangles, such as R-trees or X-trees. Our experiments show both, effectiveness as well as efficiency of our method using a sample application from molecular biology.作者: 錯(cuò) 時(shí)間: 2025-3-28 12:27
Zheng Hui,Xiumei Wang,Lirui Deng,Xinbo Gaoygon intersection during the refinement step by more than 50%. Most state-of-the-art methods in spatial join processing can benefit from SID‘s performance gains because the SID approach integrates easily into the established two-phase spatial join process.作者: 星星 時(shí)間: 2025-3-28 16:27
Hang Dai,Nick Pears,William Smithkey to overcome this problem is to preserve spatial locality in task decomposition. We show in this paper that a near-optimal speedup can be achieved for parallel spatial join processing using our new algorithms.作者: FEIGN 時(shí)間: 2025-3-28 20:07
Gerald Baulig,Thomas Gulde,Cristóbal Curioinvestigations of a joint project where engineering applications such as 3D building reconstruction and raster image mosaics are supported by database functionality. We specifically mention advantages with respect to tertiary storage integration and database memory mapping thus directly supporting application specific algorithms.作者: 意外的成功 時(shí)間: 2025-3-29 01:42
Carlos Marquez Rodriguez-Peral,Dexmont Pe?aive a formal definition of basic operations and predicates which particularly allow a more fine-grained investigation of spatial situations than in the pure exact case. We also demonstrate the integration of the presented concepts into an SQL-like query language.作者: 朝圣者 時(shí)間: 2025-3-29 06:16
Lecture Notes in Computer Scienceic and topological properties of a map layer are retained or monotonically decreased along the generalisation hierarchy. In this paper we study the former, i.e. we propose a framework for the assessment of metric consistency between two map layers.作者: 按等級(jí) 時(shí)間: 2025-3-29 07:31 作者: amorphous 時(shí)間: 2025-3-29 12:45
Improving spatial intersect joins using Symbolic Intersect Detection,ygon intersection during the refinement step by more than 50%. Most state-of-the-art methods in spatial join processing can benefit from SID‘s performance gains because the SID approach integrates easily into the established two-phase spatial join process.作者: resistant 時(shí)間: 2025-3-29 19:04 作者: 擦試不掉 時(shí)間: 2025-3-29 21:39 作者: Absenteeism 時(shí)間: 2025-3-30 02:22
Vague regions,ive a formal definition of basic operations and predicates which particularly allow a more fine-grained investigation of spatial situations than in the pure exact case. We also demonstrate the integration of the presented concepts into an SQL-like query language.作者: 結(jié)果 時(shí)間: 2025-3-30 07:51 作者: anagen 時(shí)間: 2025-3-30 10:40 作者: laceration 時(shí)間: 2025-3-30 16:15 作者: 把…比做 時(shí)間: 2025-3-30 19:38
https://doi.org/10.1007/978-3-030-11012-3 on this parameter. We then analyze the .-tree analytically, giving theoretical bounds on the degree of imbalance of the tree. We also analyze the .-tree experimentally. While the .-tree is extremely effective for static databases, we outline the extension to dynamic databases as well.作者: Musket 時(shí)間: 2025-3-30 21:33
0302-9743 . The papers are organized in topical sections on spatial similarities, geo-algorithms, spatial constraint databases, spatial query processing, systems, spatial data models and spatial access methods.978-3-540-63238-2978-3-540-69240-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 密切關(guān)系 時(shí)間: 2025-3-31 02:12
Conference proceedings 199797..The 18 revised full papers presented were carefully selected from a total of 55 submissions. Also included are two keynote contributions. The papers are organized in topical sections on spatial similarities, geo-algorithms, spatial constraint databases, spatial query processing, systems, spatial作者: Esalate 時(shí)間: 2025-3-31 06:52 作者: 精致 時(shí)間: 2025-3-31 11:27
Stefan Milz,Tobias Rüdiger,Sebastian Süssd in most implementations of .-tree, it is more superior in terms of the time required to split a node, the distribution of data after splitting, as well as the area of overlapping. Most important of all, it has a better query performance. The claim is substantiated by an analysis of the algorithm and a set of empirical results.作者: 在駕駛 時(shí)間: 2025-3-31 16:26
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/149836.jpg作者: expository 時(shí)間: 2025-3-31 19:38 作者: 安裝 時(shí)間: 2025-3-31 22:58 作者: hysterectomy 時(shí)間: 2025-4-1 02:48
https://doi.org/10.1007/3-540-63238-73D; GIS; Geoinformationssysteme; algorithms; database; geographic algorithms; geographic data; geographic i作者: atrophy 時(shí)間: 2025-4-1 06:44
978-3-540-63238-2Springer-Verlag Berlin Heidelberg 1997作者: geometrician 時(shí)間: 2025-4-1 13:19 作者: 群居動(dòng)物 時(shí)間: 2025-4-1 15:18
