نتایج جستجو برای: join space
تعداد نتایج: 509255 فیلتر نتایج به سال:
This paper presents an innovative partitionbased time join strategy for temporal databases where time is represented by time intervals. The proposed method maps time intervals to points in a two dimensional space and partitions the space into subspaces. Tupies of a temporal relation are clustered into partitions based on the mapping in the space. As a result, when two temporal relations are to ...
the aim of this paper is the study of the sequence of join spacesand fuzzy subsets associated with a hypergroupoid. in thispaper we give some properties of the membership function$widetildemu_{otimes}$ corresponding to the direct pro-duct oftwo hypergroupoids and we determine the fuzzy grade of thehypergroupoid $langle htimes h, otimesrangle$ in a particularcase.
among structured peer-to-peer systems, chord has a general popularity due to its salient features like simplicity, high scalability, small path length with respect to network size, and flexibility on node join and departure. however, chord doesn’t take into account the topology of underlying physical network when a new node is being added to the system, thus resulting in high routing latency an...
Temporal joins are important but very costly operations. While a temporal join can involve the whole time (and/or key) domain, we consider the more general case where the join is defined by some time-key rectangle from the whole space (i.e., when the user is interested in joining portions of the –usually large– temporal data). In the most restrictive join, objects (within this rectangle) are jo...
Since relational database management systems typically support only diadic join operators as primitive operations, a query optimizer must choose the “best” scquence of two-way joins to achieve the N-way join of tables requested by a query. The computational complexity of this optimization process is dominated by the number of such possible sequences that must bc evaluated by the optimizer. This...
The growing popularity of graph databases has generated interesting data management problems, such as subgraph search, shortest-path query, reachability verification, and pattern match. Among these, a pattern match query is more flexible compared to a subgraph search and more informative compared to a shortest-path or reachability query. In this paper, we address pattern match problems over a l...
Business intelligence applications ranging from stock market tickers to strategic supply chain adaptation systems require the efficient support of multi-criteria decision support (MCDS) queries. Skyline queries are a popular class of MCDS queries that have received a lot of attention recently. However, a vast majority of skyline algorithms focus entirely on the input being a single data set. In...
Compression has historically been used to reduce the cost of storage, I/Os from that storage, and buffer pool utilization, at the expense of the CPU required to decompress data every time it is queried. However, significant additional CPU efficiencies can be achieved by deferring decompression as late in query processing as possible and performing query processing operations directly on the sti...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید