An important query for spatial database research is to find the closest pair of objects in a given space. Existing work assumes two objects of the closest pair come from two different data sets indexed by R-trees. The closest pair in the whole space will be found via an optimzed R-tree join technique. However, this technique doesn’t perform well when the two data sets are identical. And it does...

XML data integration tools are facing a variety of challenges for their efficient and effective operation. Among these is the requirement to handle a variety of inconsistencies or mistakes present in the data sets. In this paper we study the problem of integrating XML data sources through index assisted join operations, using notions of approximate match in the structure and content of XML docu...

Many emerging applications benefit from the extraction of geospatial data specified at different resolutions for viewing purposes. Data must also be topologically accurate and up-to-date as it often represents real-world changing phenomena. Current multiresolution schemes use complex opaque data types, which limit the capacity for in-database object manipulation. By using z-values and B+trees t...

هدف: این پژوهش با هدف تحلیل روان­سنجی نسخة کوتاه مقیاس پرطاقتی روانی برای نوجوانان (مک‌گیوئن، کلیر ـ تامپسون و پوتوین، 2016) در بین گروهی از تیزهوش ایرانی انجام شد. روش: همبستگی، 300 نوجوان (150 پسر 150 دختر) به پرسشنامة نظم‌بخشی شناختی هیجان (گارنفسکی، کرایج اسپینهاون، 2001) پاسخ دادند. به‌منظور تعیین روایی عاملی روش­ آماری عامل تأییدی بررسی همسانی درونی ضرایب آلفای کرونباخ استفاده همچنین، مطا...

ادغام داده‌ها بین حسگرهای مختلف می‌تواند موجب استخراج اطلاعات با دقت و کیفیت بالاتر گردد بهبود تشخیص تهدیدهای هسته‌ای را به همراه داشته باشد. در این تحقیق، ردیابی چشمه متحرک استفاده از تلفیق داده­های سیستم آشکارساز پرتوی دوربین نظارتی مورد مطالعه قرار گرفت است. بدین منظور الگوریتمی جهت ایجاد همبستگی تصاویر دریافتی توسط شمارش طراحی شده است تا مسیر حرکت جسمی که بیش­ترین ثبت آشکارسازی دارد عنوان ا...

The domain of spatiotemporal applications is a treasure trove of new types of data and queries. However, work in this area is guided by related research from the spatial and temporal domains, so far, with little attention towards the true nature of spatiotemporal phenomena. In this work, the focus is on a spatiotemporal sub-domain, namely the trajectories of moving point objects. We present new...

A lot of recent work has studied strategies related to bulk loading of large data sets into multidimensional index structures In this paper we address the problem of bulk insertions into existing index struc tures with particular focus on R trees which are an important class of index structures used widely in commercial database systems We pro pose a new technique which as opposed to the curren...

Finding the most accessible locations has a number of applications. For example, a user may want to find an accommodation that is close to different amenities such as schools, supermarkets, and hospitals etc. In this paper, we study the problem of finding the most accessible locations among a set of possible sites. The task is converted to a top-k query that returns k points from a set of sites...

Constraint search trees are a generic approach to search trees where all operations are defined in terms of constraints. This abstract viewpoint makes clear the fundamental operations of search trees and immediately points to new possibilities for search trees. In this paper we present height-balanced constraint search trees (HCSTs), a general approach to building height-balanced index structur...