Filters








1,599 Hits in 6.8 sec

A robust partitioning scheme for ad-hoc query workloads

Anil Shanbhag, Alekh Jindal, Samuel Madden, Jorge Quiane, Aaron J. Elmore
2017 Proceedings of the 2017 Symposium on Cloud Computing - SoCC '17  
Format: Dimension Change Dimension Change Dimension Change Queries on A Queries on B Queries on C Queries on D (a) Partitioning choices for ad-hoc workloads (b) Robust partitioning tree with 8 blocks  ...  However, many modern analytic applications involve ad-hoc or exploratory analysis where users do not have a representative query workload a priori.  ...  The Spark SQL optimizer pushes A Robust Partitioning Scheme for Ad-Hoc Query Workloads SoCC Algorithm 1 : 1 CreateTree Input : Int datasetSize, Int maxPartitionSize, Float[] allocation, Tuple[] initSample  ... 
doi:10.1145/3127479.3131613 dblp:conf/cloud/ShanbhagJMQE17 fatcat:tbs5ajxuc5fydb3cmcs2z6hrpy

On the Content Predictability of Cooperative Image Caching in Ad Hoc Networks

Bo Yang, A.R. Hurson, Yu Jiao
2006 7th International Conference on Mobile Data Management (MDM'06)  
In this paper, we present a semantic-aware caching scheme (SAIC) for image databases in ad hoc networks.  ...  Our combination of theoretical analysis and simulation show the efficiency of the proposed scheme, and evaluate its performance in comparison against two ad hoc caching schemes as advanced in the literature  ...  Consequently, there is a great need for methods that facilitate efficient accessing of voluminous data in ad hoc networks.  ... 
doi:10.1109/mdm.2006.116 dblp:conf/mdm/YangHJ06 fatcat:r7u5gtxigjabvlm7zcrjml46rq

Locating application data across service discovery domains

Paul Castro, Benjamin Greenstein, Richard Muntz, Parviz Kermani, Chatschik Bisdikian, Maria Papadopouli
2001 Proceedings of the 7th annual international conference on Mobile computing and networking - MobiCom '01  
Using application-defined data schemas, clusters organize themselves into a hierarchy for efficient querying and network resource usage.  ...  Each directory maintains a table of active links to other directories that share related information. A set of linked directories forms a data cluster that can be queried by devices for information.  ...  We would also like to thank Ted Kremenek for listening to our arguments. Finally, we thank the anonymous reviewers for helpful comments regarding this paper. 9.  ... 
doi:10.1145/381677.381681 dblp:conf/mobicom/CastroGMKBP01 fatcat:c55jebpiprgyvgt4vqem2fniue

Progressive optimization in a shared-nothing parallel database

Wook-Shin Han, Jack Ng, Volker Markl, Holger Kache, Mokhtar Kandil
2007 Proceedings of the 2007 ACM SIGMOD international conference on Management of data - SIGMOD '07  
In this paper, we present a comprehensive and practical solution to this problem, including several novel voting schemes whether to trigger re-optimization, a mechanism to reuse local intermediate results  ...  across nodes as a partitioned materialized view, several flavors of parallel checkpoint operators, and parallel checkpoint processing methods using efficient communication protocols.  ...  Ad hoc on-line analytical processing (OLAP) queries are formulated to analyze and identify patterns in data sets, thereby transforming data into useful and consumable information.  ... 
doi:10.1145/1247480.1247569 dblp:conf/sigmod/HanNMKK07 fatcat:rtweo2qkezhrbfym3dys3ik3de

Energy-efficient data organization and query processing in sensor networks

Ramakrishna Gummadi, Xin Li, Ramesh Govindan, Cyrus Shahabi, Wei Hong
2004 Proceedings of the 2nd international conference on Embedded networked sensor systems - SenSys '04  
for processing queries that span such decomposed relations.  ...  In this paper, we explore this space for energy-efficient data organizations (logical and physical mappings of tuples and attributes to sensor nodes) and devise purely local query optimization techniques  ...  Thus, the overall (insertion+query) cost for DCS is lower than for DCR for many ad-hoc (short-lived) workloads.  ... 
doi:10.1145/1031495.1031532 dblp:conf/sensys/GummadiLGSH04 fatcat:dvoxbcovk5atzp2lemrqyufyam

Energy-efficient data organization and query processing in sensor networks

Ramakrishna Gummadi, Xin Li, Ramesh Govindan, Cyrus Shahabi, Wei Hong
2005 ACM SIGBED Review  
for processing queries that span such decomposed relations.  ...  In this paper, we explore this space for energy-efficient data organizations (logical and physical mappings of tuples and attributes to sensor nodes) and devise purely local query optimization techniques  ...  Thus, the overall (insertion+query) cost for DCS is lower than for DCR for many ad-hoc (short-lived) workloads.  ... 
doi:10.1145/1121782.1121785 fatcat:elubnyefirahxm5ru77sca44ki

A Content-Aware Collaborative Accessing Model in Ad Hoc Networks

Bo Yang, Manohar Mareboyana
2011 Proceedings of the 7th International Conference on Collaborative Computing: Networking, Applications and Worksharing  
Within the scope of ad-hoc network paradigm, a semantic-based framework extended summary schemas model (ESSM) -is presented and analyzed.  ...  Due to the restrictions of adhoc networks and the volume of multimedia data, efficient data accessing schemes are needed for various applications.  ...  Hence, ESSM provides good scalability and robustness in heterogeneous distributed environments such as ad-hoc networks. In this paper, we present a multimedia retrieval mechanism for ad-hoc networks.  ... 
doi:10.4108/icst.collaboratecom.2011.247135 dblp:conf/colcom/YangM11 fatcat:eettbxj74vekbih462sc56rmzq

Transaction Healing

Yingjun Wu, Chee-Yong Chan, Kian-Lee Tan
2016 Proceedings of the 2016 International Conference on Management of Data - SIGMOD '16  
workloads.  ...  Today's main-memory databases can support very high transaction rate for OLTP applications.  ...  Ad-Hoc Queries THEDB processes ad-hoc transactions using conventional OCC protocol, which is fully compatible with transaction healing.  ... 
doi:10.1145/2882903.2915202 dblp:conf/sigmod/WuCT16 fatcat:ew2n2dvz4nb2jnct7i5hdxi6ma

Collaborative applications over peer-to-peer systems–challenges and solutions

H. M. N. Dilum Bandara, Anura P. Jayasumana
2012 Peer-to-Peer Networking and Applications  
Incentives, trust, privacy, and security issues are also discussed, as they will ultimately determine the success of a collaborative P2P system.  ...  MADPastry (Mobile AD-hoc Pastry) [33] proposes a similar scheme for large-scale mobile ad-hoc networks.  ...  higher- level nodes are compromised Unstructured + Flooding Small scale, static/dynamic networks Guaranteed resource discovery Highly robust Applications  Mobile social networks  Mobile ad-hoc  ... 
doi:10.1007/s12083-012-0157-3 fatcat:4ubytyiz25glzir2dt66rtwnwm

Elastic Processing of Analytical Query Workloads on IaaS Clouds [article]

Herald Kllapi, Panos Sakkos, Alex Delis, Dimitrios Gunopulos, Yannis Ioannidis
2015 arXiv   pre-print
In this work, we develop an engine for analytical query processing and a suite of specialized techniques that collectively take advantage of the tree form of such plans.  ...  The engine executes these tree plans in an elastic IaaS cloud infrastructure and dynamically adapts by allocating and releasing pertinent resources based on the query workload monitored over a sliding  ...  Acknowledgments We thank Lefteris Stamatogiannakis and Marialena Kyriakidi for their helpful comments and Alexandros Papadopoulos for setting up the systems and running part of the experiments.  ... 
arXiv:1501.01070v1 fatcat:32ocuksuarbsbovvvo5sxpurfu

A robust, optimization-based approach for approximate answering of aggregate queries

Surajit Chaudhuri, Gautam Das, Vivek Narasayya
2001 Proceedings of the 2001 ACM SIGMOD international conference on Management of data - SIGMOD '01  
A key novelty of our approach is that we can tailor the choice of samples to be robust even for workloads that are "similar" but not necessarily identical to the given workload.  ...  The ability to approximately answer aggregation queries accurately and efficiently is of great benefit for decision support and data mining tools.  ...  However, their approach is still ad-hoc in the sense that their scheme does not attempt to minimize the error for any of the well-known error metrics.  ... 
doi:10.1145/375663.375694 dblp:conf/sigmod/ChaudhuriDN01 fatcat:mtri37ozfnbljdus54uud4wpdu

Query Processing with Respect to Location in Wireless Broadcasting

C. Rajeswari, N. Chandrasekaran
2012 International Journal of Future Computer and Communication  
The ad hoc networks are used to share the information among the mobile clients in a peer-to-peer manner for avoiding congestion.  ...  Index Terms-Wireless Broadcast, Ad Hoc Network, Peer-to-Peer Network.  ...  DATA REPLICATION FOR IMPROVING DATA ACCESSIBILITY IN AD HOC NETWORKS In ad hoc networks, due to frequent network partition, data accessibility is lower than that in conventional fixed networks.  ... 
doi:10.7763/ijfcc.2012.v1.73 fatcat:tobl67zimnbpvps3znpkc2i72i

Similarity-Based Clustering Strategy for Mobile Ad Hoc Multimedia Databases

Bo Yang, Ali R. Hurson
2005 Mobile Information Systems  
This content-aware clustering scheme uses a semantic-aware framework as the theoretical foundation for data organization.  ...  To provide an efficient platform for multimedia retrieval, we propose to cluster ad hoc multimedia databases based on their semantic contents, and construct a virtual hierarchical indexing infrastructure  ...  Hence the average searching cost for a query in the proposed scheme is O(k log m (k)) hops.  ... 
doi:10.1155/2005/317136 fatcat:nhbzboas6rbd3c65lif7op2kbq

A robust, optimization-based approach for approximate answering of aggregate queries

Surajit Chaudhuri, Gautam Das, Vivek Narasayya
2001 SIGMOD record  
A key novelty of our approach is that we can tailor the choice of samples to be robust even for workloads that are "similar" but not necessarily identical to the given workload.  ...  The ability to approximately answer aggregation queries accurately and efficiently is of great benefit for decision support and data mining tools.  ...  However, their approach is still ad-hoc in the sense that their scheme does not attempt to minimize the error for any of the well-known error metrics.  ... 
doi:10.1145/376284.375694 fatcat:dw6kseoywvf2razvgiswdxugxm

Robust query processing

Goetz Graefe
2011 2011 IEEE 27th International Conference on Data Engineering  
Dagstuhl seminar 10381 on robust query processing (held 19.09.10 -24.09.10) brought together a diverse set of researchers and practitioners with a broad range of expertise for the purpose of fostering  ...  discussion and collaboration regarding causes, opportunities, and solutions for achieving robust query processing.  ...  Current optimizers use cumbersome ad hoc methods to ensure that selectivities are estimated in a consistent manner.  ... 
doi:10.1109/icde.2011.5767961 dblp:conf/icde/Graefe11 fatcat:7jwx6qukinbvlad4df2a5aumgq
« Previous Showing results 1 — 15 out of 1,599 results