標(biāo)題: Titlebook: Advances in Spatial Databases; 4th International Sy Max J. Egenhofer,John R. Herring Conference proceedings 1995 Springer-Verlag Berlin Hei [打印本頁] 作者: fundoplication 時間: 2025-3-21 18:46
書目名稱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é)科排名
作者: bromide 時間: 2025-3-21 22:16
Computer Vision – ECCV 2016 Workshopseal with arithmetic conditions containing mathematical operations (like ‘+’, ‘?’, ‘*’, and ‘?’) and range queries for non-point objects. (2) We introduce a technique which allows to decompose select conditions containing Boolean operators and to reduce the processing of such a select condition to th作者: maverick 時間: 2025-3-22 01:40 作者: contradict 時間: 2025-3-22 05:19 作者: engagement 時間: 2025-3-22 09:04 作者: 貪婪性 時間: 2025-3-22 14:08 作者: SPALL 時間: 2025-3-22 18:34 作者: Diastole 時間: 2025-3-23 00:09
Extending a spatial access structure to support additional standard attributes,eal with arithmetic conditions containing mathematical operations (like ‘+’, ‘?’, ‘*’, and ‘?’) and range queries for non-point objects. (2) We introduce a technique which allows to decompose select conditions containing Boolean operators and to reduce the processing of such a select condition to th作者: Femine 時間: 2025-3-23 03:57 作者: 條約 時間: 2025-3-23 07:25
Load-balancing in high performance GIS: Declustering polygonal maps,iques for range queries in High Performance GIS. We implement static and dynamic load-balancing methods on a distributed memory parallel machine (Cray T3D) for polygon data, and we experimentally evaluate their performance. Preliminary results show that both the static and dynamic load-balancing met作者: Individual 時間: 2025-3-23 10:09
Implementation of the ROSE algebra: Efficient algorithms for realm-based spatial data types,ce requirements. Due to the realm properties, these algorithms are relatively simple, efficient, and numerically completely robust. All data structures and algorithms have indeed been implemented in the .; the Modula-2 source code is freely available from the authors for study or use.作者: 微粒 時間: 2025-3-23 17:24 作者: inhibit 時間: 2025-3-23 20:32
Lossless representation of topological spatial data,lines between these points, and areas formed by these lines. The data structure has the distinctive feature that it is geared toward supporting queries involving topological properties of the database only: two databases that are topologically equivalent have the same representation. Moreover, no in作者: cumber 時間: 2025-3-24 00:25
On the desirability and limitations of linear spatial database models, logic over the real numbers with addition. We first argue the naturalness of our model and propose it as a general framework to study and compare linear spatial database models. However, we also establish that no reasonable safe extension of our data manipulation language can be complete for the li作者: frenzy 時間: 2025-3-24 02:48
,The quad view data structure — a representation for planar subdivisions,logy-oriented approaches represent the relations existing between the vertices, edges and faces of a planar subdivision. We extend this standard approach by decomposing the faces into trapezoidal views. By defining a neighborhood relation among the views we obtain the view graph which forms the basi作者: GULLY 時間: 2025-3-24 10:20 作者: FOLLY 時間: 2025-3-24 13:14
Knowledge discovery in large spatial databases: Focusing techniques for efficient class identificatallography or other scientific equipment. Therefore, automated knowledge discovery becomes more and more important in spatial databases. So far, most of the methods for knowledge discovery in databases (KDD) have been based on relational database systems. In this paper, we address the task of class 作者: Obedient 時間: 2025-3-24 15:02 作者: Apoptosis 時間: 2025-3-24 20:38
Optimal redundancy in spatial database systems,rectangles is the . method. Since each of these rectangles eventually corresponds to an entry in a spatial index, the object may be referenced several times. This . effect is controllable. In this paper, we present an empirically derived formula to assess the expected redundancy for the z-ordering a作者: 緩和 時間: 2025-3-25 00:06 作者: PURG 時間: 2025-3-25 04:21 作者: FID 時間: 2025-3-25 07:39
Towards a formal model for multiresolution spatial maps,tically modelled through ., and maps at different detail are related through continuous functions over such complexes. Metric aspects of multiresolution are controlled through the concept of homotopy. Two alternative multiresolution models are proposed, which are implicitly defined by a sequence of 作者: NAVEN 時間: 2025-3-25 13:59
Multi-Scale partitions: Application to spatial and statistical databases,lications, statistical databases also address this problem of data representation at various levels of abstraction. From these requirements, we propose a model which allows: (i) database querying without exact knowledge of the data abstraction level, (ii) the computation of multiple representations 作者: 跳脫衣舞的人 時間: 2025-3-25 17:22
Specifying open GIS with functional languages,guages as specification and prototyping tools for Open GIS components. It shows how functional programming languages fulfill the key requirements for formal specification languages and allow for rapid prototyping in addition. So far, it has never been possible to integrate specification and prototyp作者: 妨礙議事 時間: 2025-3-25 20:47
Load-balancing in high performance GIS: Declustering polygonal maps,ontain gigabytes of geometric and feature data (e.g. location, elevation, soil type etc.) stored on a hierarchy of memory devices and represented as grids and large sets of polygons. The data is often accessed via range queries (like polygon clipping) and map-overlay queries. For example, a real-tim作者: LUT 時間: 2025-3-26 01:04
Implementation of the ROSE algebra: Efficient algorithms for realm-based spatial data types,nes, and regions in the plane together with a comprehensive set of operations; semantics of types and operations have been formally defined. Values of these data types have a quite general structure, e.g. an object of type . may consist of several polygons with holes. All ROSE objects are . which me作者: Palpitation 時間: 2025-3-26 05:31
A 3D molecular surface representation supporting neighborhood queries,rfaces of molecules become basic objects in molecular databases. We propose the neighborhood query on graphs such as molecular surfaces as a fundamental query class concerning topological information on patch adjacency. Furthermore, we suggest a patch-based data structure, called the ., first, to ef作者: 最高峰 時間: 2025-3-26 11:38 作者: 內(nèi)向者 時間: 2025-3-26 14:20 作者: 半導(dǎo)體 時間: 2025-3-26 17:37 作者: 邪惡的你 時間: 2025-3-26 23:17
Topological relations between discrete regions,ts in the vector model (?.) are investigated thoroughly, we run into inconsistencies in the raster model (?.). But instead of reducing our requirements in case of reasoning in raster images we change from simple raster to a cellular decomposition of ?. — what we call a hyper-raster — which is also d作者: Compassionate 時間: 2025-3-27 04:59 作者: 注意到 時間: 2025-3-27 07:30 作者: 野蠻 時間: 2025-3-27 10:28 作者: 圓木可阻礙 時間: 2025-3-27 16:00 作者: escalate 時間: 2025-3-27 20:22
Optimal redundancy in spatial database systems,we make use of this result to determine the optimal redundancy for real spatial data by means of theoretical considerations. In order to verify our theoretical results, we conducted several experiments using real spatial data and found a good correspondence.作者: extinct 時間: 2025-3-28 01:42 作者: 后天習(xí)得 時間: 2025-3-28 04:11 作者: FACT 時間: 2025-3-28 07:06 作者: Physiatrist 時間: 2025-3-28 12:24 作者: Optimum 時間: 2025-3-28 17:41 作者: Paleontology 時間: 2025-3-28 19:56
Computer Vision – ECCV 2016 Workshopsr conversion). With the hyper-raster the intersection sets, as needed for the determination of a topological relation between two objects, are calculated simply by logical joins of binary images. Without extending our model we can also compute further refinements of the relationships.作者: 小淡水魚 時間: 2025-3-29 01:57
,The quad view data structure — a representation for planar subdivisions,y the quad view data structure. This algorithm is optimal for simply connected planar subdivisions: its time and storage requirements are linear in the size of the output subdivision. Finally we apply this overlay algorithm to implement locational vector-based map overlay operations.作者: EWE 時間: 2025-3-29 06:36
Discovery of spatial association rules in geographic information databases,refined computations on small promising patterns), shared processing in the derivation of large predicates at multiple concept levels, etc. Our analysis shows that interesting association rules can be discovered efficiently in large spatial databases.作者: pulse-pressure 時間: 2025-3-29 08:37
Accessing geographical metafiles through a database storage system,ored in files external to the database system, while indexing and query processing is carried out within the database system. We also report on our experiences in building such a prototype geographical metadata manager.作者: adulterant 時間: 2025-3-29 13:17
A 3D molecular surface representation supporting neighborhood queries,ted via complex pointers. However, we achieve a reduction of the space requirement by a factor of four. Finally, we investigate the time performance of our prototype which is based on an object-oriented database management system.作者: 原告 時間: 2025-3-29 15:51 作者: 有偏見 時間: 2025-3-29 19:44
0302-9743 ugust 1995..The 23 refereed full papers presented were selected from more than 60 submissions and describe the state-of-the-art in the expanding field of large spatial databases, with a certain emphasis on an upcoming new generation of spatial database management systems. The volume is organized in 作者: 假設(shè) 時間: 2025-3-30 02:16 作者: 水獺 時間: 2025-3-30 05:37 作者: 機(jī)密 時間: 2025-3-30 11:49
https://doi.org/10.1007/978-3-319-48881-3on are controlled through the concept of homotopy. Two alternative multiresolution models are proposed, which are implicitly defined by a sequence of map simplifications that fulfil both topological and metric consistency rules.作者: 周興旺 時間: 2025-3-30 16:00
Computer Vision – ECCV 2016 Workshopsning based inference language (GERBIL) is then presented to implement the relationships. An architecture is proposed, linking a computer graphic system for persistent entity storage with a knowledge based system shell for inferencing. A prototype system, Dafne, demonstrates proof of principle.作者: 懶惰人民 時間: 2025-3-30 19:33
Lossless representation of topological spatial data,s involving topological properties of the database only: two databases that are topologically equivalent have the same representation. Moreover, no information is lost in this way: two databases that are not topologically equivalent never have the same representation.作者: 調(diào)色板 時間: 2025-3-30 20:54
Ranking in spatial databases,e algorithm is incremental in the sense that objects are reported one by one, so that a query processor can use the algorithm in a pipelined fashion for complex queries involving proximity. It is well suited for . nearest neighbor queries, and has the property that . needs not be fixed in advance.作者: mighty 時間: 2025-3-31 02:02 作者: scrutiny 時間: 2025-3-31 05:43
An inferencing language for automated spatial reasoning about graphic entities,ning based inference language (GERBIL) is then presented to implement the relationships. An architecture is proposed, linking a computer graphic system for persistent entity storage with a knowledge based system shell for inferencing. A prototype system, Dafne, demonstrates proof of principle.作者: 公理 時間: 2025-3-31 11:31 作者: 充氣女 時間: 2025-3-31 15:59
Uncovering Symmetries in Polynomial Systemsnear spatial queries in that even very simple queries such as deciding colinearity or computing convex hull of a finite set of points cannot be expressed. We show that this fundamental result has serious ramifications for the way in which query languages for linear spatial database models have to be designed.作者: Haphazard 時間: 2025-3-31 20:48
Nam Le,Alexander Heili,Jean-Marc Odobezof data, one per abstraction level, and (iii) its application to the computation of statistical summaries. The model has been partially implemented with the DBMS .. by means of tree-structured domains: we give some examples which illustrate the above features.作者: 瘙癢 時間: 2025-3-31 23:32
2D projection interval relationships: A symbolic representation of spatial relationships,ied representation of spatial relationships, 2D Projection Interval Relationships (2D-PIR), that integrates both directional and topological relationships. We propose a graph representation for pictures that is based on 2D-PIR. This graph representation can be constructed efficiently and leads to an efficient algorithm for “picture matching”.作者: 苦惱 時間: 2025-4-1 03:07 作者: 中止 時間: 2025-4-1 08:46 作者: NOCT 時間: 2025-4-1 13:52
https://doi.org/10.1007/3-540-60159-7DBMS; Data Mining; Geographical Information Systems; Geoinformationssysteme; R?umliche Datenbankabfragen作者: malapropism 時間: 2025-4-1 15:29
978-3-540-60159-3Springer-Verlag Berlin Heidelberg 1995作者: 開頭 時間: 2025-4-1 21:34
