14,584 Hits in 4.4 sec

Decentralized Dynamic Query Optimization based on Mobiles Agents for Large Scale Data Integration Systems

Mohammad Hussein
2012 International Journal of Computer Applications  
In this paper, we propose an execution model based on mobile agents for the distributed dynamic query optimization.  ...  Also, we embed into agent a migration policy allowing agent to choose an execution site among execution sites of the considered system.  ...  EXECUTION MODEL BASED MOBILE AGENTS FOR DECENTRALIZED DYNAMIC QUERY OPTIMIZATION In this section, we describe an execution model based on mobile agents for decentralized dynamic queries optimization.  ... 
doi:10.5120/9710-4172 fatcat:67fbnnwlnbhk3j4giwlbw2b42u

Dynamic prioritization of database queries

Sivaramakrishnan Narayanan, Florian Waas
2011 2011 IEEE 27th International Conference on Data Engineering  
For example, periodic reporting queries are usually mission critical whereas ad-hoc queries by analysts tend to be less crucial.  ...  It is desirable to enable database administrators to express (and modify) the importance of queries at a simple and intuitive level.  ...  Our approach achieves near-optimal results and is distinguished by its robustness, responsiveness to highly dynamic query workloads, and negligible overhead.  ... 
doi:10.1109/icde.2011.5767836 dblp:conf/icde/NarayananW11 fatcat:n7ug6vctxjabfjt63qu36vplui

Performance analysis of a dynamic query processing scheme [chapter]

M. L. Kersten, S. Shair-Ali, C. A. Berg
1991 Lecture Notes in Computer Science  
Tra~iltional query optimizers produce a fixed query evaluation plan based on assumptions about data distribution and processor workloads.  ...  In this paper, we propose a dynamic query processing scheme and we present the performance results obtained by simulation of a queueing network model of the proposed software architecture.  ...  The techniques for this can be borrowed from centralized query processing.  ... 
doi:10.1007/3-540-54132-2_61 fatcat:dwhcrjcnzvdsvonxrrflumi3ii

Dynamic Query Processing for P2P Data Services in the Cloud [chapter]

Pawel Jurczyk, Li Xiong
2009 Lecture Notes in Computer Science  
This paper presents the details of the dynamic query execution engine within our data query infrastructure that dynamically adapts to network and node conditions.  ...  The query processing is capable of fully benefiting from all the distributed resources to minimize the query response time and maximize system throughput.  ...  Overview As we have discussed, the key to query processing in our framework is to have a decentralized and distributed query execution engine that dynamically adapts to network and resource conditions.  ... 
doi:10.1007/978-3-642-03573-9_34 fatcat:c6vnebikhjgxzatgpmrrbi2usa

Dynamic Conflict-free Query Scheduling for Wireless Sensor Networks

Octav Chipara, Chenyang Lu, John Stankovic
2006 Proceedings of the 2006 IEEE International Conference on Network Protocols  
To meet this challenge, we present Dynamic Conflict-free Query Scheduling (DCQS), a novel scheduling technique for queries in wireless sensor networks.  ...  To meet this challenge, we present Dynamic Conflict-free Query Scheduling (DCQS), a novel scheduling technique for queries in wireless sensor networks.  ...  Therefore, a key challenge is to provide a high-throughput query service that can collect data from large networks and adapt to dynamic workload changes.  ... 
doi:10.1109/icnp.2006.320182 dblp:conf/icnp/ChiparaLS06 fatcat:b5eq36qjbndtnetioc2j2esl6i

Dynamic Data Migration Policies for Query-Intensive Distributed Data Environments [chapter]

Tengjiao Wang, Bishan Yang, Allen Huang, Qi Zhang, Jun Gao, Dongqing Yang, Shiwei Tang, Jinzhong Niu
2009 Lecture Notes in Computer Science  
The other policy lets individual server dynamically selects a partner to migrate data and balance query load in between.  ...  This paper introduces two policies that dynamically migrate data in such an environment as the pattern of queries on data changes, and achieve query load balance.  ...  The data migration process is controlled by the central controller that makes decisions from the system-wide viewpoint. -We propose a dynamic data migration policy with decentralized control.  ... 
doi:10.1007/978-3-642-00672-2_8 fatcat:gm566x2sqfgbrdpgpx23xwar34

Dynamic Conflict-Free Transmission Scheduling for Sensor Network Queries

Octav Chipara, Chenyang Lu, John A. Stankovic, Gruia-Catalin Roman
2011 IEEE Transactions on Mobile Computing  
To meet this challenge, we propose Dynamic Conflict-free Query Scheduling (DCQS), a novel scheduling technique for queries in wireless sensor networks.  ...  First, it optimizes the query performance through conflict-free transmission scheduling based on the temporal properties of queries in wireless sensor networks.  ...  This reduces query latency because it reduces the time a node waits to receive the data reports from all of its children. The pseudocode of the centralized planner is shown in Fig. 4 .  ... 
doi:10.1109/tmc.2010.209 fatcat:bt3o6xaxbrd43a6bedmxdhybs4

Enhanced Distributed Dynamic Skyline Query for Wireless Sensor Networks

Khandakar Ahmed, Nazmus Nafi, Mark Gregory
2016 Journal of Sensor and Actuator Networks  
Dynamic skyline query is one of the most popular and significant variants of skyline query in the field of multi-criteria decision-making.  ...  EDDS applies a threshold based hierarchical approach, which uses temporal correlation among sectors and sector segments to calculate a dynamic skyline.  ...  Nazmus Shaker Nafi contributed to manuscript drafting and revision of manuscript. Mark Gregory contributed to original ideas and revision of manuscript.  ... 
doi:10.3390/jsan5010002 fatcat:2kxrtju3mrdffb3tmms5akalpq

Dynamic Clustering-Based Query Answering in Peer-to-Peer Systems [chapter]

Weining Qian, Shuigeng Zhou, Yi Ren, Aoying Zhou, Beng Chin Ooi, Kian-Lee Tan
2003 Lecture Notes in Computer Science  
Considering the decentralization nature (autonomy of peers, dynamism and ad hoc of network, and lack of global metadata) of P2P environment, it is inefficient to conduct similarity query in P2P systems  ...  Given a query (it can be an example, or a set of keywords for document retrieval), we define CBQA as to retrieve the data objects that are in the same cluster of the query from the global dataset distributed  ...  ACKNOWLEDGEMENT The authors would like to thank Wee Siong Ng, for providing us the source code of BestPeer.  ... 
doi:10.1007/978-3-540-45160-0_30 fatcat:4b34dk3ln5bdjjiipsyy25hp4u

Efficient Dynamic Operator Placement in a Locally Distributed Continuous Query System [chapter]

Yongluan Zhou, Beng Chin Ooi, Kian-Lee Tan, Ji Wu
2006 Lecture Notes in Computer Science  
Essentially, during runtime, we migrate query operators/fragments from overloaded nodes to lightly loaded ones to achieve better performance.  ...  We also propose a solution, that is asynchronous and local, to dynamically manage the load across the system nodes.  ...  When a query is submitted to the system, it is compiled and optimized into a logical query plan without considering the distribution of the data streams.  ... 
doi:10.1007/11914853_5 fatcat:upneph2ayzbupj6sck77sxs2ei

Multi-set DHT for Range Queries on Dynamic Data for Grid Information Service [chapter]

Georges Da Costa, Salvatore Orlando, Marios D. Dikaiakos
2008 Lecture Notes in Computer Science  
Peer to Peer systems are usually used to solve scalability problems as centralized approaches do not scale without large dedicated infrastructure.  ...  But most current Peer to Peer systems do not take into account that indexed data can be dynamic.  ...  This allows us to obtain a fully decentralized system. Each user is connected to one of these peers.  ... 
doi:10.1007/978-3-540-85176-9_9 fatcat:zhh3rgv4tbezzddjda37dh7nha

On processing continuous frequent K-N-match queries for dynamic data over networked data sources

Shih-Chuan Chiu, Jiun-Long Huang, Jen-He Huang
2011 Knowledge and Information Systems  
Thus, we propose in this paper two schemes to process continuous frequent k-n-match queries over dynamic data.  ...  However, the prior algorithm to process frequent k-n-match queries is designed for static data, whose attributes are fixed, and is not suitable for dynamic data.  ...  Scheme CFKNMatchAD-D: continuous frequent K -N-match query processing in decentralized environments The decentralized system architecture Since the centralized server needs to process all queries, the  ... 
doi:10.1007/s10115-011-0413-5 fatcat:kjs5aseibbazxli2wbm7t4dh3q

Evolution of Query Optimization Methods [chapter]

Abdelkader Hameurlain, Franck Morvan
2009 Lecture Notes in Computer Science  
(centralized or decentralized control).  ...  In this paper, we try to describe synthetically the evolution of query optimization methods from uniprocessor relational database systems to data Grid systems through parallel, distributed and data integration  ...  Acknowledgement We would like to warmly thank Professor Roland Wagner for his kind invitation to write this paper. Section 1 contains materials from [98] with kind permissions from Inderscience.  ... 
doi:10.1007/978-3-642-03722-1_9 fatcat:uzhmfy5iq5gajodcpj6ixpj5qy

Towards Minimum Traffic Cost and Minimum Response Latency: A Novel Dynamic Query Protocol in Unstructured P2P Networks

Chen Tian, Hongbo Jiang, Xue Liu, Wenyu Liu, Yi Wang
2008 2008 37th International Conference on Parallel Processing  
of an undesirable latency performance; Enhanced dynamic querying (DQ+) can reduce the search latency too, while it is hard to determine a general optimum parameters set.  ...  In this paper, a novel algorithm named Selective Dynamic Query (SDQ) is proposed.  ...  INTRODUCTION There are three types of architecture for peer-to-peer networks: centralized, decentralized but structured, and decentralized and unstructured [1] .  ... 
doi:10.1109/icpp.2008.78 dblp:conf/icpp/TianJLLW08 fatcat:d3k6j43arzcvzdd46co5umtz3m

A New Method of Dynamic Horizontal Fragmentation for Multimedia Databases Contemplating Content-Based Queries

Felipe Castro-Medina, Lisbeth Rodríguez-Mazahua, Asdrúbal López-Chau, Jair Cervantes, Giner Alor-Hernández, Isaac Machorro-Cano, Mario Leoncio Arrioja-Rodríguez
2022 Electronics  
This work proposes a new method of dynamic horizontal fragmentation for multimedia databases, including a way to contemplate content-based queries in the creation of new fragments.  ...  Dynamic fragmentation techniques offer this advantage and represent a reduction of the tasks that an administrator must perform and the complete autonomy to determine when to carry out a new fragmentation  ...  Acknowledgments: The authors are very grateful to the National Technological of Mexico (TecNM) for supporting this work.  ... 
doi:10.3390/electronics11020288 fatcat:4g3t7blv7vb27co2n4mf25ej7q
« Previous Showing results 1 — 15 out of 14,584 results