Index structures for flexible querying in fuzzy spatial databases

Date

2004-07-29

Author

Sozer, A
Yazıcı, Adnan

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

83
views

0
downloads

Database systems can be effective only if the data are properly handled at the physical level. Therefore, it is important to develop an effective spatial and aspatial indexing technique to facilitate flexible spatial and/or aspatial querying for spatial databases. In this study we adapt a number of spatial index structures, such as Multi-level grid file (MLGF), G-tree, R-tree, and R*-tree, for fuzzy spatial databases and compare the performances of these structures for various flexible queries.

Subject Keywords

Spatial databases, Indexing, Uncertainty, Database systems, Spatial indexes, Data engineering, Geographic Information Systems, Lakes, Soil measurements, Natural languages

URI

https://hdl.handle.net/11511/62677

DOI

https://doi.org/10.1109/fuzzy.2004.1375796

Collections

Department of Computer Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Efficient computation of strong partial transitive-closures Toroslu, İsmail Hakkı (null; 1993-01-01) The development of efficient algorithms to process the different forms of the transitive-closure (TC) queries within the context of large database systems has recently attracted a large volume of research efforts. In this paper, we present a new algorithm suitable for processing one of these forms, the so called strong partially-instantiated, in which one of the query's argument is instantiated to a set of constants and the processing of which yields a set of tuples that draw their values form both of the q...
Distributed database design with integer linear programming and evolutionary hybrid algorithms Tosun, Umut; Coşar, Ahmet; Department of Computer Engineering (2013) The communication costs of remote access and retrieval of table fragments required in the execution of distributed database queries, are the major factors determining the quality of a distributed database design. Data allocation algorithms try to minimize these costs by dividing database tables into horizontal fragments, then assigning each fragment at or near the database sites they are needed more frequently. In this thesis, we propose efficient optimization algorithms for centralized and distributed data...
Concurrency control for distributed multiversion databases through time intervals Halıcı, Uğur (1991-04-01) © 1991 ACM.Multiversion Schedulers are now a widely accepted method for enhancing performance of the concurrency control component of a database. When the read and write sets of transactions are known in advance, the amount of concurrency provided by the Multiversion Schedulers can further be improved. In this paper, a new concurrency control technique, which uses multiversion data in conjunction with predeclared read-write sets and the Time Interval technique is suggested. With the proposed method, a trans...
Uncertainty in a nested relational database model Yazıcı, Adnan; Buckles, BP; Petry, FE (1999-07-01) Some database models have already been developed to deal with complex values but they have constrains that data stored is precise and queries are crisp. However, as many researchers have pointed out, there is a need to present, manipulate, and query complex and uncertain data of various non-traditional database applications such as oceanography, multimedia, meteorology, office automation systems, engineering designs, expert database systems and geographic information systems. In this paper, we present a log...
Secure logical schema and decomposition algorithm for proactive context dependent attribute based inference control Turan, Ugur; Toroslu, İsmail Hakkı; Kantarcioglu, Murat (2017-09-01) Inference problem has always been an important and challenging topic of data privacy in databases. In relational databases, the traditional solution to this problem was to define views on relational schemas to restrict the subset of attributes and operations available to the users in order to prevent unwanted inferences. This method is a form of decomposition strategy, which mainly concentrates on the granularity of the accessible fields to the users, to prevent sensitive information inference. Nowadays, du...

Citation Formats

A. Sozer and A. Yazıcı, “Index structures for flexible querying in fuzzy spatial databases,” 2004, p. 559, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/62677.