共查询到20条相似文献,搜索用时 15 毫秒
1.
This paper addresses the distributed stream processing of window-based multi-way join queries considering the semijoin as
a key join operator. In distributed stream processing, data streams arriving at remote sites need to be shipped to the processing
site for query execution. This typically introduces high communication overhead. Our observation is that semijoin, effective
in reducing communication overhead in distributed database query processing, can be also effective in distributed stream query
processing. The challenge, however, lies in the streaming nature of the tuples, as it requires continuous and incremental
processing of an unbounded sequence of tuples instead of one-time processing of a set of stored tuples. This paper describes
our comprehensive work done to address the challenge. Specifically, we first propose a distributed stream join processing
model that handles the issue of network delays introduced from the shipment of data streams, and allows for efficient batch
processing. Then, based on the model, we propose join algorithms in a multi-way join case: first, one-way join algorithms
for different combinations of join placement and join method and, then, multi-way join algorithms assuming linear join ordering.
Regarding the join method, two distributed join methods are introduced: (1) simple join, in which full tuples are forwarded to the query processing site and (2) semijoin-based join, in which partial tuples are forwarded. A semijoin-based join can be executed with different possible semijoin strategies which incur different
communication overheads. We present a complete set of join algorithms considering all possible semijoin strategies, and propose
an optimization algorithm. The join algorithms are executed continuously in an incremental manner as tuples arrive, and never
ship tuples redundantly. The optimization algorithm constructs an efficient multi-way join plan by using a greedy heuristic
which adds to the plan one stream with the minimum join execution cost in each step. Through extensive experiments, we conduct
comparative studies of the performance among the proposed one-way join algorithms and the efficiency of the generated plan
between the optimization algorithm based on the greedy heuristic and the exhaustive search, respectively. 相似文献
2.
Ke Deng Xiaofang Zhou Heng Tao Shen Shazia Sadiq Xue Li 《The VLDB Journal The International Journal on Very Large Data Bases》2009,18(3):675-693
The performance optimization of query processing in spatial networks focuses on minimizing network data accesses and the cost
of network distance calculations. This paper proposes algorithms for network k-NN queries, range queries, closest-pair queries and multi-source skyline queries based on a novel processing framework, namely,
incremental lower bound constraint. By giving high processing priority to the query associated data points and utilizing the
incremental nature of the lower bound, the performance of our algorithms is better optimized in contrast to the corresponding
algorithms based on known framework incremental Euclidean restriction and incremental network expansion. More importantly,
the proposed algorithms are proven to be instance optimal among classes of algorithms. Through experiments on real road network
datasets, the superiority of the proposed algorithms is demonstrated. 相似文献
3.
In many applications, XML documents need to be modelled as graphs. The query processing of graph-structured XML documents
brings new challenges. In this paper, we design a method based on labelling scheme for structural queries processing on graph-structured
XML documents. We give each node some labels, the reachability labelling scheme. By extending an interval-based reachability
labelling scheme for DAG by Rakesh et al., we design labelling schemes to support the judgements of reachability relationships
for general graphs. Based on the labelling schemes, we design graph structural join algorithms to answer the structural queries
with only ancestor-descendant relationship efficiently. For the processing of subgraph query, we design a subgraph join algorithm.
With efficient data structure, the subgraph join algorithm can process subgraph queries with various structures efficiently.
Experimental results show that our algorithms have good performance and scalability.
Support by the Key Program of the National Natural Science Foundation of China under Grant No.60533110; the National Grand
Fundamental Research 973 Program of China under Grant No. 2006CB303000; the National Natural Science Foundation of China under
Grant No. 60773068 and No. 60773063. 相似文献
4.
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 efficient processing algorithm that fully exploits the features of the underlying spatial indexes. In our earlier work, we devised a fairly effective algorithm for processing spatial joins with double transformation (DOT) indexing, which is one of several spatial indexing schemes. However, the algorithm is restricted to only the one-dimensional cases. In this paper, we extend the algorithm for the two-dimensional cases, which are general in Geographic Information Systems (GIS) applications. We first extend DOT to two-dimensional original space. Next, we propose an efficient algorithm for processing range queries using extended DOT. This algorithm employs the quarter division technique and the tri-quarter division technique devised by analyzing the regularity of the space-filling curve used in DOT. This greatly reduces the number of space transformation operations. We then propose a novel spatial join algorithm based on this range query processing algorithm. In processing a spatial join, we determine the access order of disk pages so that we can minimize the number of disk accesses. We show the superiority of the proposed method by extensive experiments using data sets of various distributions and sizes. The experimental results reveal that the proposed method improves the performance of spatial join processing up to three times in comparison with the widely-used R-tree-based spatial join method. 相似文献
5.
George Roumelis Antonio Corral Michael Vassilakopoulos Yannis Manolopoulos 《GeoInformatica》2016,20(4):571-628
Efficient and effective processing of the distance-based join query (DJQ) is of great importance in spatial databases due to the wide area of applications that may address such queries (mapping, urban planning, transportation planning, resource management, etc.). The most representative and studied DJQs are the K Closest Pairs Query (KCPQ) and εDistance Join Query (εDJQ). These spatial queries involve two spatial data sets and a distance function to measure the degree of closeness, along with a given number of pairs in the final result (K) or a distance threshold (ε). In this paper, we propose four new plane-sweep-based algorithms for KCPQs and their extensions for εDJQs in the context of spatial databases, without the use of an index for any of the two disk-resident data sets (since, building and using indexes is not always in favor of processing performance). They employ a combination of plane-sweep algorithms and space partitioning techniques to join the data sets. Finally, we present results of an extensive experimental study, that compares the efficiency and effectiveness of the proposed algorithms for KCPQs and εDJQs. This performance study, conducted on medium and big spatial data sets (real and synthetic) validates that the proposed plane-sweep-based algorithms are very promising in terms of both efficient and effective measures, when neither inputs are indexed. Moreover, the best of the new algorithms is experimentally compared to the best algorithm that is based on the R-tree (a widely accepted access method), for KCPQs and εDJQs, using the same data sets. This comparison shows that the new algorithms outperform R-tree based algorithms, in most cases. 相似文献
6.
Top-k spatial joins 总被引:1,自引:0,他引:1
Manli Zhu Papadias D. Dik Lun Lee Zhang J. 《Knowledge and Data Engineering, IEEE Transactions on》2005,17(4):567-579
Given two spatial data sets A and B, a top-k spatial join retrieves the k objects from A or B that intersect the largest number of objects from the other data set. Depending on the application requirements, there exist several variations of the problem. For instance, B may be a point data set, and the goal may be to retrieve the regions of A that contain the maximum number of points. The processing of such queries with conventional spatial join algorithms is expensive. However, several improvements are possible based on the fact that we only require a small subset of the result (instead of all intersection/containments pairs). In this paper, we propose output-sensitive algorithms for top-k spatial joins that utilize a variety of optimizations for reducing the overhead. 相似文献
7.
Privacy-Conscious Location-Based Queries in Mobile Environments 总被引:1,自引:0,他引:1
Xu Jianliang Tang Xueyan Hu Haibo Du Jing 《Parallel and Distributed Systems, IEEE Transactions on》2010,21(3):313-326
In location-based services, users with location-aware mobile devices are able to make queries about their surroundings anywhere and at any time. While this ubiquitous computing paradigm brings great convenience for information access, it also raises concerns over potential intrusion into user location privacy. To protect location privacy, one typical approach is to cloak user locations into spatial regions based on user-specified privacy requirements, and to transform location-based queries into region-based queries. In this paper, we identify and address three new issues concerning this location cloaking approach. First, we study the representation of cloaking regions and show that a circular region generally leads to a small result size for region-based queries. Second, we develop a mobility-aware location cloaking technique to resist trace analysis attacks. Two cloaking algorithms, namely MaxAccu_Cloak and MinComm_Cloak, are designed based on different performance objectives. Finally, we develop an efficient polynomial algorithm for evaluating circular-region-based kNN queries. Two query processing modes, namely bulk and progressive, are presented to return query results either all at once or in an incremental manner. Experimental results show that our proposed mobility-aware cloaking algorithms significantly improve the quality of location cloaking in terms of an entropy measure without compromising much on query latency or communication cost. Moreover, the progressive query processing mode achieves a shorter response time than the bulk mode by parallelizing the query evaluation and result transmission. 相似文献
8.
With the ever-growing popularity of smartphone devices in recent years, skyline queries over spatial Web objects in road networks have received increasing attention. In the literature, various techniques have been developed to tackle skyline queries that take both spatial and non-spatial attributes into consideration. However, the existing solutions only focus on solving point-based queries, where the query location is a spatial point. We observe that in many real-life applications, the user location is often represented by a spatial range. Thus, in this paper, we study a new problem of range-based skyline queries (CRSQs) in road networks. Two efficient algorithms named landmark-based (LBA) and index-based (IBA) algorithms are proposed. We also present incremental versions of LBA and IBA to handle continuous range-based skyline queries over moving objects. Extensive experiments using real road network datasets demonstrate the effectiveness and efficiency of our proposed algorithms. 相似文献
9.
Kai Zheng Xiaofang Zhou Pui Cheong Fung Kexin Xie 《The VLDB Journal The International Journal on Very Large Data Bases》2012,21(5):729-751
Range and nearest neighbor queries are the most common types of spatial queries, which have been investigated extensively in the last decades due to its broad range of applications. In this paper, we study this problem in the context of fuzzy objects that have indeterministic boundaries. Fuzzy objects play an important role in many areas, such as biomedical image databases and GIS communities. Existing research on fuzzy objects mainly focuses on modeling basic fuzzy object types and operations, leaving the processing of more advanced queries largely untouched. In this paper, we propose two new kinds of spatial queries for fuzzy objects, namely single threshold query and continuous threshold query, to determine the query results which qualify at a certain probability threshold and within a probability interval, respectively. For efficient single threshold query processing, we optimize the classical R-tree-based search algorithm by deriving more accurate approximations for the distance function between fuzzy objects and the query object. To enhance the performance of continuous threshold queries, effective pruning rules are developed to reduce the search space and speed up the candidate refinement process. The efficiency of our proposed algorithms as well as the optimization techniques is verified with an extensive set of experiments using both synthetic and real datasets. 相似文献
10.
In this research, we address the query clustering problem which involves determining globally optimal execution strategies for a set of queries. The need to process a set of queries together often arises in deductive database systems, scientific database systems, large bibliographic retrieval systems and several other database applications. We address the optimization problem from the perspective of overlaps in data requirements, and model the batched operations using a set-partitioning approach. In this model, we first consider the case of m queries each involving a two-way join operation. We develop a recursive methodology to determine all the processing strategies in this case. Next, we establish certain dominance properties among the strategies, and develop exact as well as heuristic algorithms for selecting an appropriate strategy. We extend this analysis to a clustering approach, and outline a framework for optimizing multiway joins. The results show that the proposed approach is viable and efficient, and can easily be incorporated into the query processing component of most database systems 相似文献
11.
基于多核处理器硬件技术和高并发查询负载需求,近年来的研究不仅关注于一次一查询模式的查询优化技术,而且也关注于一次一组模式的查询优化技术.通过将并发查询转换为共享负载,一些低访问延迟的操作,如磁盘I/O、cache访问,可以被多个并发的查询所共享.当前的研究通常基于共享查询操作符,如扫描、连接、谓词处理等,通过生成全局执行计划优化并发查询.对于复杂的分析型负载,如何创建优化的执行计划是一个具有挑战性的问题.在广泛使用的星形模型的基础上提出一种模板OLAP查询执行计划来简化查询执行计划,以达到最大化查询操作符利用率的目标.1)提出了基于代理键的连接索引技术,将传统的基于值探测的连接操作转化为内存数组索引引用(AIR),使连接操作的CPU效率更高并且支持聚集计算的后物化;2)并发查询的谓词处理简化为cache line敏感的谓词向量,在单次cache line访问中最大化并发查询谓词计算性能;3)通过多核并行实现技术在SSB基准上进行测试.实验结果表明:共享扫描和共享谓词处理能够将并发OLAP查询处理性能提升1倍. 相似文献
12.
The main requirements for spatial query processing via mobile terminals include rapid and accurate searching and low energy consumption. Most location-based services (LBSs) are provided using an on-demand method, which is suitable for light-loaded systems where contention for wireless channels and server processing is not severe. However, as the number of users of LBSs increases, performance deteriorates rapidly since the servers’ capability to process queries is limited. Furthermore, the response time of a query may significantly increase with the concentration of users’ queries in a server at the same time. That is because the server has to check the locations of users and potential objects for the final result and then individually send answers to clients via a point-to-point channel. At this time, an inefficient structure of spatial index and searching algorithm may incur an extremely large access latency. To address this problem, we propose the Hierarchical Grid Index (HGI), which provides a light-weight sequential location-based index structure for efficient LBSs. We minimize the index size through the use of hierarchical location-based identifications. And we support efficient query processing in broadcasting environments through sequential data transfer and search based on the object locations. We also propose Top-Down Search and Reduction-Counter Search algorithms for efficient searching and query processing. HGI has a simple structure through elimination of replication pointers and is therefore suitable for broadcasting environments with one-dimensional characteristics, thus enabling rapid and accurate spatial search by reducing redundant data. Our performance evaluation shows that our proposed index and algorithms are accurate and fast and support efficient spatial query processing. 相似文献
13.
The k Nearest Neighbor (kNN) join operation associates each data object in one data set with its k nearest neighbors from the same or a different data set. The kNN join on high-dimensional data (high-dimensional kNN join) is a very expensive operation. Existing high-dimensional kNN join algorithms were designed for static data sets and therefore
cannot handle updates efficiently. In this article, we propose a novel kNN join method, named kNNJoin
+, which supports efficient incremental computation of kNN join results with updates on high-dimensional data. As a by-product,
our method also provides answers for the reverse kNN queries with very little overhead. We have performed an extensive experimental
study. The results show the effectiveness of kNNJoin+ for processing high-dimensional kNN joins in dynamic workloads. 相似文献
14.
Incremental computation of time-varying query expressions 总被引:1,自引:0,他引:1
We present and analyze algorithms for the incremental computation of time-varying queries in which selection predicates refer to the state of a clock. Such queries occur naturally in many situations where temporal data are processed. Incremental techniques for query computation have proven to be more efficient than other techniques in many situations. However, all existing incremental techniques for query computation assume that old query results remain valid if no intermediate changes are made to the underlying database. Unfortunately, this assumption does not hold for time-varying queries whose results may change just because time passes. In order to solve this problem, we introduce the notion of a superview which contains all current tuples that will eventually satisfy the selection predicate of a time-varying selection. Based on the notion of superview, we develop efficient algorithms for the incremental computation of time-varying selections. Our algorithms, combined with existing incremental algorithms, allow complex time-varying queries to benefit from the proven efficiency of incremental techniques. It is important to notice that without our algorithms, the existing algorithms for incremental computation would be useless for any time-varying query expression 相似文献
15.
The efficient processing of multidimensional similarity joins is important for a large class of applications. The dimensionality of the data for these applications ranges from low to high. Most existing methods have focused on the execution of high-dimensional joins over large amounts of disk-based data. The increasing sizes of main memory available on current computers, and the need for efficient processing of spatial joins suggest that spatial joins for a large class of problems can be processed in main memory. In this paper, we develop two new in-memory spatial join algorithms, the Grid-join and EGO*-join, and study their performance. Through evaluation, we explore the domain of applicability of each approach and provide recommendations for the choice of a join algorithm depending upon the dimensionality of the data as well as the expected selectivity of the join. We show that the two new proposed join techniques substantially outperform the state-of-the-art join algorithm, the EGO-join. 相似文献
16.
An increasing number of emerging web database applications deal with large georeferenced data sets. However, exploring these
large data sets through spatial queries can be very time and resource intensive. The need for interactive spatial queries
has arisen in many applications such as Geographic Information Systems (GIS) for efficient decision-support. In this paper,
we propose a new interactive spatial query processing technique for GIS. We present a family of the Incremental Refining Spatial Join (IRSJ) algorithms that can be used to report incrementally refined running estimates for aggregate queries while simultaneously
displaying the actual query result tuples of the data sets sampled so far. Our goal is to minimize the time until an acceptably
accurate estimate of the query result is available (to users) measured by a confidence interval. Our approach enables more
interactive data exploration and analysis. While similar work has been done in relational databases, to the best of our knowledge,
this is the first work using this approach in GIS. We investigate and evaluate different sampling methodologies through extensive
experimental performance comparisons. Experiments on both real and synthetic data show an order of magnitude response time
improvement relative to the final answer obtained when using a full R-tree join. We also show the impact of different index
structures on the performance of our algorithms using three known sampling methods. 相似文献
17.
18.
Dong-Ho Lee Hyoung-Joo Kim 《Knowledge and Data Engineering, IEEE Transactions on》2003,15(6):1472-1486
The SPY-TEC (spherical pyramid-technique) was proposed as a new indexing method for high-dimensional data spaces using a special partitioning strategy that divides a d-dimensional data space into 2d spherical pyramids. In the SPY-TEC, an efficient algorithm for processing hyperspherical range queries was introduced with a special partitioning strategy. However, the technique for processing k-nearest-neighbor queries, which are frequently used in similarity search, was not proposed. In this paper, we propose an efficient algorithm for processing nearest-neighbor queries on the SPY-TEC by extending the incremental nearest-neighbor algorithm. We also introduce a metric that can be used to guide an ordered best-first traversal when finding nearest neighbors on the SPY-TEC. Finally, we show that our technique significantly outperforms the related techniques in processing k-nearest-neighbor queries by comparing it to the R*-tree, the X-tree, and the sequential scan through extensive experiments. 相似文献
19.
Efficient cost models for spatial queries using R-trees 总被引:11,自引:0,他引:11
Theodoridis Y. Stefanakis E. Sellis T. 《Knowledge and Data Engineering, IEEE Transactions on》2000,12(1):19-32
Selection and join queries are fundamental operations in database management systems (DBMS). Support for nontraditional data, including spatial objects, in an efficient manner is of ongoing interest in database research. Toward this goal, access methods and cost models for spatial queries are necessary tools for spatial query processing and optimization. We present analytical models that estimate the cost (in terms of node and disk accesses) of selection and join queries using R-tree-based structures. The proposed formulae need no knowledge of the underlying R-tree structure(s) and are applicable to uniform-like and nonuniform data distributions. In addition, experimental results are presented which show the accuracy of the analytical estimations when compared to actual runs on both synthetic and real data sets 相似文献
20.
一种支持高效XML 路径查询的自适应结构索引 总被引:1,自引:0,他引:1
提出了一种新的自适应结构索引:AS-Index(adaptive structural index),能够克服现有静态索引和自适应索引的缺陷,具备高效的查询和调整性能.AS-Index 建立在F&B-Index 的基础之上,其索引结构包括F&B-Index,Query-Table 和Part-Table.Query-Table 能够记录频繁查询,避免了查询过程中的冗余操作.并且,在Query-Table 的基础上提出了自底向上的查询处理过程,能够充分利用现有的频繁查询高效地回答非频繁查询.Part-Table 用于优化包含祖先后裔边的查询,进一步提高了查询性能.现有的自适应结构索引的调整粒度是XML 元素节点,调整过程往往需要遍历整个文档.而AS-Index 是基于F&B-Index 节点的增量调整,其过程是局部的,高效的,并且能够支持复杂分支查询的调整.实验结果表明,AS-Index 在查询和调整性能上优于现有的XML 结构索引.同时,相比于现有的自适应结构索引,AS-Index 针对大规模文档具有更加优良的可扩展性. 相似文献