0020-0255/$ see front matter 2009 Elsevier Inc doi:10.1016/j.ins.2009.11.029 * Corresponding author. Tel./fax: +82 2 2220 456 E-mail addresses: [email protected] (H. B (S. Park), [email protected] (S.-W. Kim). A spatial join is a query that searches for a set of object pairs satisfying a given spatial relationship from a database. It is one of the most costly queries, and thus requires an...

With the growing popularity of spatial applications, there has been a signiicant increase in the use of database systems for storing and querying spatial data. Spatial data is now readily available from a variety of sources including government mapping agencies, commercial sources, satellite images, and simulation outputs. As this trend continues, applications continue to execute increasingly c...

Inductive queries are queries that generate pattern sets. This paper studies properties of boolean inductive queries, i.e. queries that are boolean expressions over monotonic and anti-monotonic constraints. More specifically, we introduce and study algebraic operations on the answer sets of such queries and show how these can be used for constructing and optimizing query plans. Special attentio...

Muscle & NerveVolume 67, Issue 6 p. 553-553 AANEM APPLICATIONFree Access Join First published: 15 May 2023 https://doi.org/10.1002/mus.27602AboutPDF ToolsRequest permissionExport citationAdd to favoritesTrack citation ShareShare Give accessShare full text full-text accessPlease review our Terms and Conditions of Use check box below share version article.I have read accept the Wiley Online Libra...

Join is the most expensive and the frequent operation in database. Significant numbers of join queries are executed in the interactive applications. In interactive applications the first few thousand results need to be produced without any delay. The current join algorithms are mainly based on hash join or sort merge join which is less suitable for interactive applications because some pre-work...

Using groups of affine transformations of linearly ordered fields a certain construction of non-commutative join hypergroups is presented based on the criterion of reproducibility of semi-hypergroups which are determined by ordered semigroups. The aim of this paper is to construct the abelization of the non-commutative join space of affine transformations of ordered fields. A construction of co...

Most of the existing relational database query optimizers generate multi-way join plans only from those linear ones to reduce the optimization overhead. For multiprocessor computer systems, this strategy seems inadequate since it may reduce the search space too much to generate near-optimal plans. In this paper we present a framework for optimization of multiway join queries in multiprocessor c...