標(biāo)題: Titlebook: Advances in Spatial Databases; Third International David Abel,Beng Chin Ooi Conference proceedings 1993 Springer-Verlag Berlin Heidelberg [打印本頁] 作者: 筆記 時間: 2025-3-21 18:58
書目名稱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é)科排名
作者: 中古 時間: 2025-3-21 22:54 作者: Bronchial-Tubes 時間: 2025-3-22 01:56 作者: conjunctiva 時間: 2025-3-22 04:56 作者: 尖叫 時間: 2025-3-22 09:49
The transformation technique for spatial objects revisited,technique in a sense that some of these properties can be proven to be harmless while the harmful ones can be overcome by new methods. Furthermore, we demonstrate that new kinds of transformations which take other than pure location parameters into account, provide the transformation technique with new quality.作者: Disk199 時間: 2025-3-22 14:28
A paging scheme for pointer-based quadtrees,dtree into pages and manages the pages using B-tree techniques. A paged-pointer quadtree always requires less space than the corresponding linear quadtree. Our initial implementation provides better performance than a highly optimized system based on linear quadtrees.作者: Chandelier 時間: 2025-3-22 20:43
Concurrent accesses to R-trees, underflow at some nodes is also discussed. Concurrency control algorithms using the three locking methods mentioned above are described in this paper. They have also been implemented in the SR distributed programming language. We report on our preliminary results comparing their relative performance.作者: Systemic 時間: 2025-3-22 21:15 作者: IRK 時間: 2025-3-23 04:56 作者: Inculcate 時間: 2025-3-23 07:05 作者: patriot 時間: 2025-3-23 10:54
On optimal multiversion access structures,ltiversion capabilities come at no extra cost, neither for storage space nor for runtime, asymptotically in the worst case. The analysis of the behavior of the multiversion B-tree shows that the constant loss of efficiency is low enough to make our suggestion not only a theoretical, but also a practical one.作者: 可能性 時間: 2025-3-23 17:24 作者: Innovative 時間: 2025-3-23 18:31 作者: Congeal 時間: 2025-3-23 23:08
Query- adaptive data space partitioning using variable-size storage clusters,the ideal case an expected query is satisfied by accessing only one storage cluster of appropriate size. To get near to this optimum we adapt the data space partition to query ranges. We call this approach a .. Initial evaluation studies show the feasibility of this approach.作者: 兵團(tuán) 時間: 2025-3-24 05:15 作者: BILK 時間: 2025-3-24 08:58
Lecture Notes in Computer Science. Data manipulation is easily made through a spatial extension of SQL. Optimization techniques are used, providing for a strong integration of spatial operators based on spatial indexing and join-indices techniques. Built-in spatial functionalities may be further extended by application programmers through object oriented features.作者: initiate 時間: 2025-3-24 11:23 作者: 要塞 時間: 2025-3-24 18:15 作者: 收藏品 時間: 2025-3-24 22:20
Spatial data management in database systems: Research directions,r spatial data. The objective of this paper is to identify a number of key issues that need to be addressed in the near term before we can expect to see a rich support of spatial data management in commercial database systems.作者: pancreas 時間: 2025-3-25 02:12
Strong integration of spatial domains and operators in a relational database system,. Data manipulation is easily made through a spatial extension of SQL. Optimization techniques are used, providing for a strong integration of spatial operators based on spatial indexing and join-indices techniques. Built-in spatial functionalities may be further extended by application programmers through object oriented features.作者: MELD 時間: 2025-3-25 04:05 作者: DEMUR 時間: 2025-3-25 10:09 作者: 完全 時間: 2025-3-25 15:01 作者: PAD416 時間: 2025-3-25 18:42 作者: GIBE 時間: 2025-3-25 20:09 作者: analogous 時間: 2025-3-26 01:44 作者: Proponent 時間: 2025-3-26 05:13
0302-9743 ous meetings of the series were atSanata Barbara (1989) and Zurich (1991). The meetings areplanned as a forum for researchers and practitionersspecializing in database theory for and advancedapplications of Spatial Information Systems.This volume constitutes the proceedings of the symposium. Itconta作者: Flounder 時間: 2025-3-26 09:00 作者: Bouquet 時間: 2025-3-26 15:26 作者: 障礙物 時間: 2025-3-26 19:10 作者: 勛章 時間: 2025-3-26 22:15
Strong integration of spatial domains and operators in a relational database system,e spatial database system, integrating in a single model both alphanumeric and geometric data, is discussed. Such a database system, GéoSabrina, has been developed as an extension of an already existing relational database system. The system supports spatial data with corresponding spatial operators作者: Altitude 時間: 2025-3-27 04:23
The transformation technique for spatial objects revisited, deletion and proximity queries can be carried out with reasonable performance. The basic idea is to transform the bounding boxes into points in higher dimensional space in order to apply data structures for points which are better understood and easier to handle. Even though the basic concept of th作者: 去掉 時間: 2025-3-27 09:17
A paging scheme for pointer-based quadtrees,e they support the efficient computation of traditional GIS spatial analysis algorithms. While the quadtree has many representations, the . has become the standard. Initially thought to be more space efficient than traditional . quadtree representations, its main operational virtue has been its abil作者: homocysteine 時間: 2025-3-27 09:40
A hierarchical spatial index for cell complexes,ting of general .-dimensional spatial objects described by .-dimensional cell complexes. The new hierarchical spatial index, called a cellular .-tree, generalizes similar structures developed for planar maps, and is defined as a recursive subdivision of a universe containing the cell complex into re作者: Goblet-Cells 時間: 2025-3-27 17:34 作者: FISC 時間: 2025-3-27 19:51 作者: NAUT 時間: 2025-3-27 23:59
A spatial data model and a topological sweep algorithm for map overlay,rs a new map by using an overlay function. Existing algorithms for vector-based map overlay operations suffer from one or more of the following disadvantages: lacking generality, inefficiency or poor adaptability to existing GIS-Systems. Furthermore only few proposals for parallel implementations of作者: 一再煩擾 時間: 2025-3-28 04:55 作者: 紅腫 時間: 2025-3-28 08:36
Database support for multidimensional discrete data, the image, or they are designed as specialized systems providing sophisticated imaging functionality, but no general data modeling and retrieval capabilities; none of them provides full modeling support for arbitrary pixel data types. Still more important, no system offers enough data independence 作者: 北極人 時間: 2025-3-28 10:45
From extensible databases to interoperability between multiple databases and GIS applications,w that its generalisation in an open distributed environment well supports the exchange of either (foreign) data or of (foreign) operations between multiple geo-databases and several GIS application systems and in particular between databases and application-specific computation services. This is a 作者: 諂媚于人 時間: 2025-3-28 16:27 作者: 政府 時間: 2025-3-28 20:51
GeO2: Why objects in a geographical DBMS?, entities‘ semantic is expressed through high level concepts in an entity-relationship model extended by both inheritance and propagation mechanisms..The system‘s implementation is described. It takes advantage of the object-oriented aspect of the O. DBMS, and in particular of the inheritance mechan作者: 舊石器 時間: 2025-3-28 23:06 作者: CANDY 時間: 2025-3-29 06:10
Qualitative and topological relationships in spatial databases,The main advantages of such a formalism are its rigorousness, clear semantics and sound inference mechanism. We also show how the formalism can be extended to include orientation and metrical information. Comparisons with other formalisms are discussed.作者: 金哥占卜者 時間: 2025-3-29 10:06 作者: GRIEF 時間: 2025-3-29 14:42
Query- adaptive data space partitioning using variable-size storage clusters,page. Here we present considerations on data space partitions which use large . storage clusters of variable size rather than single pages. Its main motivation is given by real complex geographical objects ranging from 100 Bytes to 10 KBytes in storage size. For such objects it does not make sense t作者: 歌唱隊 時間: 2025-3-29 18:20 作者: 騷擾 時間: 2025-3-29 22:47 作者: 艱苦地移動 時間: 2025-3-30 01:25 作者: Oversee 時間: 2025-3-30 07:47 作者: 賞錢 時間: 2025-3-30 09:52
Qualitative and topological relationships in spatial databases,The main advantages of such a formalism are its rigorousness, clear semantics and sound inference mechanism. We also show how the formalism can be extended to include orientation and metrical information. Comparisons with other formalisms are discussed.作者: Invigorate 時間: 2025-3-30 15:40 作者: botany 時間: 2025-3-30 19:13
Nikolaos Passalis,Anastasios Tefasan be a set of polygons with holes), (ii) have formally defined semantics, (iii) be defined in terms of finite representations available in computers, (iv) offer facilities to enforce geometric consistency of related spatial objects, and (v) be independent of a particular DBMS data model, but cooper作者: 做事過頭 時間: 2025-3-30 21:09
Vittorio Ferrari,Martial Hebert,Yair Weissf objects to be modelled is an extension of the set of 2-dimensional objects which can be represented within the vector-based data model. The model aims to capture explicitly some important topological properties of the spatial objects, e.g. connectedness and region inclusion. The construction discu作者: 緩和 時間: 2025-3-31 02:57
Lecture Notes in Computer Sciencee spatial database system, integrating in a single model both alphanumeric and geometric data, is discussed. Such a database system, GéoSabrina, has been developed as an extension of an already existing relational database system. The system supports spatial data with corresponding spatial operators作者: LVAD360 時間: 2025-3-31 05:32
https://doi.org/10.1007/978-3-030-01231-1 deletion and proximity queries can be carried out with reasonable performance. The basic idea is to transform the bounding boxes into points in higher dimensional space in order to apply data structures for points which are better understood and easier to handle. Even though the basic concept of th作者: 門閂 時間: 2025-3-31 11:24
Chen Liu,Jiaye Wu,Yasutaka Furukawae they support the efficient computation of traditional GIS spatial analysis algorithms. While the quadtree has many representations, the . has become the standard. Initially thought to be more space efficient than traditional . quadtree representations, its main operational virtue has been its abil作者: patella 時間: 2025-3-31 15:18 作者: 迫擊炮 時間: 2025-3-31 20:05
Lecture Notes in Computer Scienceion, whereas range queries and exact match queries are allowed for any version, present or past. The technique we present for transforming a (usual single version) B-tree into a multiversion B-tree is more general: it applies to a number of spatial and non-spatial hierarchical external access struct作者: 漸變 時間: 2025-3-31 23:17
Hao-Shu Fang,Jinkun Cao,Yu-Wing Tai,Cewu Lu as an index structure, and modify it to allow concurrent accesses. We investigate three different locking methods for concurrency control. The first method uses a single lock to lock the entire tree, allowing concurrent searches but only sequential updates. The second method locks the whole tree on
