標(biāo)題: Titlebook: Advances in Spatial Databases; 6th International Sy Ralf Hartmut Güting,Dimitris Papadias,Fred Lochovs Conference proceedings 1999 Springer [打印本頁] 作者: Kennedy 時(shí)間: 2025-3-21 19:18
書目名稱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 22:13 作者: Asparagus 時(shí)間: 2025-3-22 02:27 作者: Isthmus 時(shí)間: 2025-3-22 05:06
Multi-way Spatial Joins Using R-Trees: Methodology and Performance Evaluation Additionally, we introduce . in the M-way join and propose a further optimization technique to improve the performance of the M-way R-tree join. Through experiments using real data, we show that our optimization techniques significantly improve the performance of the M-way spatial join.作者: 注意力集中 時(shí)間: 2025-3-22 10:32 作者: 昏暗 時(shí)間: 2025-3-22 12:59
Naveed Akhtar,Faisal Shafait,Ajmal Mianly, thus providing a basis for the development of applications that need to manage the level-of-detail of complex objects. In this paper, we present general query operations on such models, we describe and classify alternative data structures for encoding an SMC, and we discuss the cost and performance of such structures.作者: Obligatory 時(shí)間: 2025-3-22 17:41
Cheng Zhang,Hedvig Kjellstr?m,Carl Henrik Ekthe join with another indexed relation. A common platform is used on which a set of spatial access methods and join algorithms are available. The QEPs are implemented with a general iterator-based spatial query processor, allowing for pipelined QEP execution, thus minimizing memory space required for intermediate results.作者: 圍巾 時(shí)間: 2025-3-23 01:16
Topological Queriesonly the third one is topological. Topological queries form a robust and practically interesting subclass of all possible queries one may want to ask of a spatial database. Furthermore, they give rise to an unexpectedly complex and rich theory.作者: 血統(tǒng) 時(shí)間: 2025-3-23 02:28
Data Structures for Simplicial Multi-complexesly, thus providing a basis for the development of applications that need to manage the level-of-detail of complex objects. In this paper, we present general query operations on such models, we describe and classify alternative data structures for encoding an SMC, and we discuss the cost and performance of such structures.作者: 共同生活 時(shí)間: 2025-3-23 07:56
A Performance Evaluation of Spatial Join Processing Strategiesthe join with another indexed relation. A common platform is used on which a set of spatial access methods and join algorithms are available. The QEPs are implemented with a general iterator-based spatial query processor, allowing for pipelined QEP execution, thus minimizing memory space required for intermediate results.作者: 分發(fā) 時(shí)間: 2025-3-23 13:35 作者: 言外之意 時(shí)間: 2025-3-23 15:49
Tobias Weyand,Ilya Kostrikov,James Philbinciated with a given output. In this paper, we first present the general contexts of geologic map manipulation and design. We then propose a framework for geologic map designers which supports multiple interpretations.作者: Wordlist 時(shí)間: 2025-3-23 21:41
Lecture Notes in Computer Sciencehe use for query processing of the proposed representation in conjunction with indexing. It is demonstrated how queries involving uncertainty may be answered using the standard filter-and-refine approach known from spatial query processing.作者: 文件夾 時(shí)間: 2025-3-24 01:08
Dong Chen,Gang Hua,Fang Wen,Jian Sunosed. While both algorithms can reduce the amalgamation cost significantly, the occupancy-based algorithm is particularly attractive because: 1) it retrieves a smaller amount of data than the adjacency-based algorithm; 2) it is based on a simple extension to a commonly used spatial indexing mechanism; and 3) it can handle fuzzy amalgamation.作者: Apoptosis 時(shí)間: 2025-3-24 06:24 作者: 運(yùn)動(dòng)性 時(shí)間: 2025-3-24 07:02
Efficient Polygon Amalgamation Methods for Spatial OLAP and Spatial Data Miningosed. While both algorithms can reduce the amalgamation cost significantly, the occupancy-based algorithm is particularly attractive because: 1) it retrieves a smaller amount of data than the adjacency-based algorithm; 2) it is based on a simple extension to a commonly used spatial indexing mechanism; and 3) it can handle fuzzy amalgamation.作者: antenna 時(shí)間: 2025-3-24 13:00
Algorithms for Joining R-Trees and Linear Region Quadtreesrent, access methods. Two of the algorithms are based on heuristics that aim at minimizing I/O cost with a limited amount of main memory. We also present the results of experiments performed with real data that compare the I/O performance of these algorithms.作者: 膠水 時(shí)間: 2025-3-24 14:55
Abduction and Deduction in Geologic Hypermapsciated with a given output. In this paper, we first present the general contexts of geologic map manipulation and design. We then propose a framework for geologic map designers which supports multiple interpretations.作者: LINE 時(shí)間: 2025-3-24 20:54
Hojin Cho,Hyunjoon Lee,Seungyong Leend the paper provides a formal framework in which simplifications can be computed (for example, as compositions of other simpliffcations). A detailed case study is presented to illustrate the techniques developed, and directions for further work are discussed.作者: 安裝 時(shí)間: 2025-3-25 00:04 作者: 殘廢的火焰 時(shí)間: 2025-3-25 07:15 作者: CAJ 時(shí)間: 2025-3-25 09:45 作者: 異端邪說2 時(shí)間: 2025-3-25 14:52 作者: Inveterate 時(shí)間: 2025-3-25 17:54 作者: Tortuous 時(shí)間: 2025-3-25 23:37 作者: 表否定 時(shí)間: 2025-3-26 01:24 作者: Explicate 時(shí)間: 2025-3-26 07:40 作者: 貞潔 時(shí)間: 2025-3-26 10:20 作者: fetter 時(shí)間: 2025-3-26 15:30 作者: inquisitive 時(shí)間: 2025-3-26 18:08
GBI: A Generalized R-Tree Bulk-Insertion Strategyss the problem of bulk insertions into existing index structures with particular focus on R-trees — which are an important class of index structures used widely in commercial database systems. We propose a new technique, which as opposed to the current technique of inserting data one by one, bulk in作者: 巫婆 時(shí)間: 2025-3-27 00:18 作者: HAWK 時(shí)間: 2025-3-27 04:23
Dynamic Spatial Clustering for Intelligent Mobile Information Sharing and Disseminationollaborating on a common mission and with interests in a common situation domain. A mobile user operating in the field changes location, consumes resources, investigates situations “on the horizon,” and performs other incrementally evolving activities. A mobile user’s information needs are therefore作者: PANG 時(shí)間: 2025-3-27 08:01 作者: 六邊形 時(shí)間: 2025-3-27 12:35 作者: 宴會(huì) 時(shí)間: 2025-3-27 14:24
Efficiently Matching Proximity Relationships in Spatial Databasesmage analysis, road traffic accident analysis, etc. It demands for efficient solutions for many new, expensive, and complicated problems. In this paper, we investigate a proximity matching problem among clusters and features. The investigation involves proximity relationship measurement between clus作者: conscribe 時(shí)間: 2025-3-27 18:10
3D Shape Histograms for Similarity Search and Classification in Spatial Databases, medical imaging or meteorology. The underlying models have to consider spatial properties such as shape or extension as well as thematic attributes. We introduce 3D shape histograms as an intuitive and powerful similarity model for 3D objects. Particular flexibility is provided by using quadratic 作者: 糾纏 時(shí)間: 2025-3-28 01:25
Multi-way Spatial Joins Using R-Trees: Methodology and Performance Evaluationlization of the .. Although a generalization of the 2-way R-tree join has recently been studied, it did not properly take into account the optimization techniques of the original algorithm. Here, we extend these optimization techniques for M-way joins. Since the join ordering was considered to be im作者: 我不重要 時(shí)間: 2025-3-28 05:31 作者: 信條 時(shí)間: 2025-3-28 06:31
Algorithms for Performing Polygonal Map Overlay and Spatial Join on Massive Data Setsputational geometry to solve these problems for massive data sets. A performance study with artificial and real-world data sets helps to identify the algorithm that should be used for given input data.作者: 闖入 時(shí)間: 2025-3-28 11:56
A Performance Evaluation of Spatial Join Processing Strategiess and use a common set of spatial joins algorithms, among which one is a novel extension of a strategy based on an on-the-fly index creation prior to the join with another indexed relation. A common platform is used on which a set of spatial access methods and join algorithms are available. The QEPs作者: 阻撓 時(shí)間: 2025-3-28 17:06
Abduction and Deduction in Geologic Hypermapsrface structures from observed surface phenomena and (ii) building abductive models of events and processes that shaped them during the geologic past. In order to do this, chains of explanations are used to reconstruct the Earth history step-by-step. In this context, many interpretations may be asso作者: 大氣層 時(shí)間: 2025-3-28 19:16 作者: incubus 時(shí)間: 2025-3-29 02:49 作者: 聾子 時(shí)間: 2025-3-29 05:18 作者: dysphagia 時(shí)間: 2025-3-29 07:58
0302-9743 Overview: 978-3-540-66247-1978-3-540-48482-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: floaters 時(shí)間: 2025-3-29 11:29 作者: pacific 時(shí)間: 2025-3-29 15:48 作者: Pageant 時(shí)間: 2025-3-29 22:51 作者: enumaerate 時(shí)間: 2025-3-30 03:17 作者: 可能性 時(shí)間: 2025-3-30 06:23 作者: Largess 時(shí)間: 2025-3-30 11:45
https://doi.org/10.1007/978-3-319-10602-1environmental information systems, and multimedia. In this paper we address research issues in spatio-temporal databases, by providing an analysis of the challenges set, the problems encountered, as well as the proposed solutions and the envisioned research areas open to investigation.作者: Analogy 時(shí)間: 2025-3-30 13:22 作者: strain 時(shí)間: 2025-3-30 17:13
Hojin Cho,Hyunjoon Lee,Seungyong Lee the case where the underlying data is structured as a graph. The paper presents a new approach in that a distinction is made between generalizations that amalgamate data objects and those that select data objects. We show that these two types of generalization are conceptually distinct, and provide作者: 閑逛 時(shí)間: 2025-3-30 21:47 作者: violate 時(shí)間: 2025-3-31 01:22
Graph Cuts for Supervised Binary Codingas that of the query window. In this paper we present an approach which considerably improves query performance in such cases. By adding a scale dimension to the schema we make the index structure explicitly “aware” of the scale of a spatial object. The additional dimension causes the index structur作者: Limpid 時(shí)間: 2025-3-31 05:11 作者: Angiogenesis 時(shí)間: 2025-3-31 13:01 作者: enlist 時(shí)間: 2025-3-31 15:10
Lecture Notes in Computer Scienceresearch efforts. The representation of the continuously changing positions of the objects is fundamentally important in these applications. This paper reports on on-going research in the representation of the positions of moving-point objects. More speciffically, object positions are sampled using 作者: Expurgate 時(shí)間: 2025-3-31 19:59 作者: Generator 時(shí)間: 2025-4-1 00:01 作者: Palpate 時(shí)間: 2025-4-1 05:02 作者: ADAGE 時(shí)間: 2025-4-1 07:38
