In this work, we study the notion of competing campaigns in a social network and address problem influence limitation where "bad" campaign starts propagating from certain node use limiting to counteract effect misinformation. The can be summarized as identifying subset individuals that need convinced adopt (or "good") so minimize number people at end both propagation processes. We show optimization is NP-hard provide approximation guarantees for greedy solution various definitions by proving...

Scalable database management systems (DBMS)---both for update intensive application workloads as well decision support descriptive and deep analytics---are a critical part of the cloud infrastructure play an important role in ensuring smooth transition applications from traditional enterprise infrastructures to next generation infrastructures. Though scalable data has been vision more than three decades much research focussed on large scale setting, computing brings its own set novel...

Wireless sensor networks offer the potential to span and monitor large geographical areas inexpensively. Sensors, however, have significant power constraint (battery life), making communication very expensive. Another important issue in context of sensor-based information systems is that individual readings are inherently unreliable. In order address these two aspects, database like TinyDB Cougar enable in-network data aggregation reduce cost improve reliability. The existing techniques,...

Scalability is one of the main roadblocks to business adoption blockchain systems. Despite recent intensive research on using sharding techniques enhance scalability systems, existing solutions do not efficiently address cross-shard transactions. In this paper, we introduce SharPer, a scalable permissioned system. nodes are clustered and each data shard replicated cluster. SharPer supports networks consisting either crash-only or Byzantine nodes. ledger formed as directed acyclic graph...

In this paper, we present an efficient and fault-tolerant algorithm for generating quorums to solve the distributed mutual exclusion problem. The uses a logical tree organization of network generate quorums, which are logarithmic in size best case. Our approach is resilient both site communication failures, even when such failures lead partitioning. Furthermore, exhibits property graceful degradation, i.e., it requires more messages only as number increase network. We describe how can be...

Peer-to-peer (P2P) networks are self-organizing, distributed systems, with no centralized authority or infrastructure. Because of the voluntary participation, availability resources in a P2P system can be highly variable and unpredictable. We use ideas from game theory to study interaction strategic rational peers, propose differential service-based incentive scheme improve system's performance.

Databases are increasingly being used to store multi-media objects such as maps, images, audio and video. Storage retrieval of these is accomplished using multi-dimensional index structures R*-trees SS-trees. As dimensionality increases, query performance in degrades. This phenomenon, generally referred the curse, can be circumvented by reducing data. Such a reduction however accompanied loss precision results. Current techniques QBIC use SVD transform-based ensure high precision. The...

Article A comparison of DFT and DWT based similarity search in time-series databases Share on Authors: Yi-Leh Wu Department Computer Science, University California, Santa Barbara BarbaraView Profile , Divyakant Agrawal Amr El Abbadi Authors Info & Claims CIKM '00: Proceedings the ninth international conference Information knowledge managementNovember 2000 Pages 488–495https://doi.org/10.1145/354756.354857Online:06 November 2000Publication History 144citation1,836DownloadsMetricsTotal...

We present incremental view maintenance algorithms for a data warehouse derived from multiple distributed autonomous sources. begin with detailed framework analyzing sources concurrent updates. Earlier approaches in the presence of updates typically require two types messages: one to compute change due initial update and other compensate interfering The developed this paper instead perform compensation locally by using information that is already available at warehouse. first algorithm,...

Cloud computing has emerged as a preferred platform for deploying scalable web-applications. With the growing scale of these applications and data associated with them, management systems form crucial part cloud infrastructure. Key-Value stores -- such Bigtable, PNUTS, Dynamo, their open source analogues-- have been in cloud. In systems, is represented pairs, atomic access provided only at granularity single keys. While properties work well current applications, they are insufficient next...

In recent years, numerous transaction models have been proposed to address the problems posed by advanced database applications, but only a few of these are being used in commercial products. this paper, we make case that such may be too centered around databases useful real environments. Advanced applications raise variety issues not addressed at all models. These same issues, however, basis for existing workflow systems, which having considerable success as products spite solid theoretical...

Multitenant data infrastructures for large cloud platforms hosting hundreds of thousands applications face the challenge serving characterized by small footprint and unpredictable load patterns. When such a platform is built on an elastic pay-per-use infrastructure, added to minimize system's operating cost while guaranteeing tenants' service level agreements (SLA). Elastic balancing therefore important feature enable scale-up during high scaling down when low. Live migration, technique...

The ubiquity of location enabled devices has resulted in a wide proliferation based applications and services. To handle the growing scale, database management systems driving such services (LBS) must cope with high insert rates for updates millions devices, while supporting efficient real-time analysis on latest location. Traditional DBMSs, equipped multi-dimensional index structures, can efficiently spatio-temporal data. However, popular open source relational are overwhelmed by insertion...

Tree pattern matching is one of the most fundamental tasks for XML query processing. Holistic twig processing techniques [4, 16] have been developed to minimize intermediate results, namely, those root-to-leaf path matches that are not in final results. However, useless cannot be completely avoided, especially when there a parent-child relationship query. Furthermore, existing approaches do consider fact practice, order process XPath or XQuery statements, more powerful form queries,...

Database systems serving cloud platforms must serve large numbers of applications (or tenants ). In addition to managing with small data footprints, different schemas, and variable load patterns, such multitenant minimize their operating costs by efficient resource sharing. When deployed over a pay-per-use infrastructure, elastic scaling balancing, enabled low cost live migration tenant databases, is critical tolerate variations while minimizing cost. However, existing databases---relational...

We propose an approximate integrated approach for solving both problems of finding the most popular k elements, and frequent elements in a data stream coming from large domain. Our solution is space efficient reports top- with tight guarantees on errors. For general distributions, our algorithm returns that have roughly highest frequencies; it uses limited calculating elements. realistic Zipfian data, requirement proposed exact problem decreases dramatically parameter distribution; queries,...

Data outsourcing or database as a service is new paradigm for data management in which third party provider hosts service. The provides its customers and thus obviates the need user to purchase expensive hardware software, deal with software upgrades hire professionals administrative maintenance tasks. Since using an external promises reliable storage at low cost it very attractive companies. Such would also provide universal access, through Internet private storedat secure sites. A client...

Over the last couple of years, "Cloud Computing" or "Elastic has emerged as a compelling and successful paradigm for internet scale computing. One major contributing factors to this success is elasticity resources. In spite provided by infrastructure scalable design applications, elephant (or underlying database), which drives most these web-based not very elastic scalable, hence limits scalability. paper, we propose ElasTraS addresses issue scalability data store in cloud computing...

A database management system (DBMS) serving a cloud platform must handle large numbers of application databases (or tenants ) that are characterized by diverse schemas, varying footprints, and unpredictable load patterns. Scaling out using clusters commodity servers sharing resources among (i.e., multitenancy important features such systems. Moreover, when deployed on pay-per-use infrastructure, minimizing the system's operating cost while ensuring good performance is also an goal....