Filters








2,625 Hits in 9.4 sec

Utilizing Dynamic Properties of Sharing Bits and Registers to Estimate User Cardinalities over Time [article]

Pinghui Wang, Peng Jia, Xiangliang Zhang, Jing Tao, Xiaohong Guan, Don Towsley
2018 arXiv   pre-print
Compared with previous bit and register sharing methods, our algorithms exploit the dynamic properties of the bit and register arrays (e.g., the fraction of zero bits in the bit array at each time) to  ...  To address these problems, we develop novel bit and register sharing algorithms, which use a bit array and a register array to build a compact sketch of all users' connected items respectively.  ...  Compared with previous bit and register sharing methods, our algorithms exploit the dynamic properties of the bit and register arrays (e.g., the fraction of zero bits in the bit array at each time) to  ... 
arXiv:1811.09126v2 fatcat:33vbcqh7yzgerhewzz3nj2ldd4

A survey of sketches in traffic measurement: Design, Optimization, Application and Implementation [article]

Shangsen Li, Lailong Luo, Deke Guo, Qianzhen Zhang, Pengtao Fu
2021 arXiv   pre-print
Due to the massive, speedy, unpredictable features of network flows, sketches are widely implemented in measurement nodes to approximately record the frequency or estimate the cardinality of flows.  ...  To summarize the existing efforts, we carry out an in-depth study of the existing literature, covering more than 90 sketch designs and optimization strategies.  ...  Furthermore, Virtual Register Sharing [89] dynamically creates an estimator for each flow by randomly selecting several registers from a multi-bits registers pool to estimate the cardinality of elephant  ... 
arXiv:2012.07214v2 fatcat:lme2ghsshje3tag2m5q3xgvcna

Loglog Counting of Large Cardinalities [chapter]

Marianne Durand, Philippe Flajolet
2003 Lecture Notes in Computer Science  
In general the LogLog algorithm makes use of m "small bytes" of auxiliary memory in order to estimate in a single pass the number of distinct elements (the "cardinality") in a file, and it does so with  ...  The "small bytes" to be used in order to count cardinalities till Nmax comprise about log log Nmax bits, so that cardinalities well in the range of billions can be determined using one or two kilobytes  ...  The authors are grateful to Cristian Estan and George Varghese for very liberally sharing ideas and preliminary versions of their works, and to Keith Briggs for his suggestions regarding implementation  ... 
doi:10.1007/978-3-540-39658-1_55 fatcat:fku4uyslq5glbdiowxw6kozsfq

When the levee breaks: a practical guide to sketching algorithms for processing the flood of genomic data

Will P. M. Rowe
2019 Genome Biology  
Considerable advances in genomics over the past decade have resulted in vast amounts of data being generated and deposited in global archives.  ...  Sketching algorithms produce small, approximate summaries of data and have shown great utility in tackling this flood of genomic data, while using minimal compute resources.  ...  To obtain a cardinality estimate from this sketch, the harmonic mean is calculated across all sketch registers and this is the approximate number of distinct elements in the set.  ... 
doi:10.1186/s13059-019-1809-x pmid:31519212 pmcid:PMC6744645 fatcat:o4kyzu2obfgffkbx4hu6qlfdmu

Evaluating the Power of Flexible Packet Processing for Network Resource Allocation

Naveen Kr. Sharma, Antoine Kaufmann, Thomas E. Anderson, Arvind Krishnamurthy, Jacob Nelson, Simon Peter
2017 Symposium on Networked Systems Design and Implementation  
This allows operators to configure switches to parse and process custom packet headers using flexible match+action tables in order to exercise control over how packets are processed and routed.  ...  However, flexible switches have limited state, support limited types of operations, and limit per-packet computation in order to be able to operate at line rate.  ...  Acknowledgments We would like to thank the anonymous NSDI reviewers and our shepherd Rodrigo Fonseca for their valuable feedback.  ... 
dblp:conf/nsdi/SharmaKAKNP17 fatcat:34hyovyckfegzozydcfdryz2yu

Striking the Balance: Effective yet Privacy Friendly Contact Tracing [article]

Giuseppe Garofalo, Tim Van hamme, Davy Preuveneers, Wouter Joosen, Aysajan Abidin, Mustafa A. Mustafa
2020 IACR Cryptology ePrint Archive  
., the two public keys and the established shared key) are then used to generate two unique per-user-per-contact hashes: one for infection registration and one for exposure score query.  ...  yet allowing effective tracing and notifying the close contacts of diagnosed users.  ...  Prioritising privacy over utility, in fact, has led to low adoption rates of applications and a diffuse sense of inefficacy among users [17] .  ... 
dblp:journals/iacr/GarofalohPJAM20 fatcat:afzn57mt5ffcpdqfhxfqxdi5jm

Continuously adaptive continuous queries over streams

Samuel Madden, Mehul Shah, Joseph M. Hellerstein, Vijayshankar Raman
2002 Proceedings of the 2002 ACM SIGMOD international conference on Management of data - SIGMOD '02  
sharing of work and space that it enables.  ...  By breaking the abstraction of shared relational algebra expressions, our Telegraph CACQ implementation is able to share physical operators -both selections and join state -at a very fine grain.  ...  user wants the windows to open if it is both warm and quiet at the same time.  ... 
doi:10.1145/564691.564698 dblp:conf/sigmod/MaddenSHR02 fatcat:4aysipiy3bcfpelqaefmg23nzy

Continuously adaptive continuous queries over streams

Samuel Madden, Mehul Shah, Joseph M. Hellerstein, Vijayshankar Raman
2002 Proceedings of the 2002 ACM SIGMOD international conference on Management of data - SIGMOD '02  
sharing of work and space that it enables.  ...  By breaking the abstraction of shared relational algebra expressions, our Telegraph CACQ implementation is able to share physical operators -both selections and join state -at a very fine grain.  ...  user wants the windows to open if it is both warm and quiet at the same time.  ... 
doi:10.1145/564696.564698 fatcat:knt5bbpaujhctlvesrug3rytie

Physical Layer Secret Key Generation in Static Environments [article]

Nasser Aldaghri, Hessam Mahdavifar
2019 arXiv   pre-print
These samples are then quantized, reconciled, and hashed to compensate for the information leakage to the eavesdropper and to allow verification of consistency of the generated key bit sequences.  ...  We utilize semantic security measures and information-theoretic inequalities to upper bound the probability of successful eavesdropping attack in terms of the mutual information measures that can be numerically  ...  Wireless channels can be naturally assumed to be dynamic assuming a certain level of mobility by users and/or in the surrounding environment.  ... 
arXiv:1908.03637v1 fatcat:h3klmsjgpjf4tcncdrz3i2v5ke

Limiting Self-Propagating Malware Based On Connection Failure Behavior Through Hyper-Compact Estimators

You Zhou, Yian Zhou, Shigang Chen
2016 International journal of network security and its applications  
Furthermore, we propose another solution based on shared register array data structure, achieving better memory efficiency and much larger estimation range than our double-bitmap solution.  ...  One branch of defense research investigates the behavioral difference between worm-infected hosts and normal hosts to set them apart.  ...  The size of each register is determined by the maximum estimation cardinality. For example, we can set the size of register to be 5 bits for the estimation up to 2 32 .  ... 
doi:10.5121/ijnsa.2016.8101 fatcat:m5lu7bcwovf5doivueynrg32sy

Pirates and Samaritans: A decade of measurements on peer production and their implications for net neutrality and copyright

Johan A. Pouwelse, Pawel Garbacki, Dick Epema, Henk Sips
2008 Telecommunications Policy  
It is argued that this hinders innovation and causes a large discrepancy between legal and user perspectives.  ...  The telecommunications and content industry are disrupted by this way of peer production. As a consequence, revenues of both industries are likely to suffer in the coming years.  ...  The initial comment score is 1 for registered users and 0 for anonymous comments.  ... 
doi:10.1016/j.telpol.2008.09.004 fatcat:y6b6mvpyifd3vpkxerybdpmjzm

Software Connectors for Highly Distributed and Voluminous Data Intensive Systems

Chris Mattmann
2006 21st IEEE/ACM International Conference on Automated Software Engineering (ASE'06)  
Utilize software component framework developed so far on sample PDS and EDRN data sets: use OCO if time is available M8 Documentation of the results Distributor Path Static, Dynamic, and Cached, determined  ...  Although the entire data volume across PDS at the time was around 7 terabytes, it was estimated that the volume would grow to 10 terabytes by 2004.  ...  Appendix Classification of Distribution Connector Instances  ... 
doi:10.1109/ase.2006.62 dblp:conf/kbse/Mattmann06 fatcat:hd572e7qirabjmu7wk6jci65ay

Evolutionary Query Optimization For Heterogeneous Distributed Database Systems

Reza Ghaemi, Amin Milani Fard, Hamid Tabatabaee, Mahdi Sadeghizadeh
2008 Zenodo  
An optimal dynamic programming method for such high dimensional queries has the big disadvantage of its exponential order and thus we are interested in semi-optimal but faster approaches.  ...  Due to new distributed database applications such as huge deductive database systems, the search complexity is constantly increasing and we need better algorithms to speedup traditional relational database  ...  Cartesian product: The cardinality of the Cartesian product of R and S is ) ( ) ( ) ( S card R card S R card × = × Join: There is no general way to estimate the cardinality of a join without additional  ... 
doi:10.5281/zenodo.1080054 fatcat:kuvp4xvlurf7rfviezzexnoaca

IncShrink: Architecting Efficient Outsourced Databases using Incremental MPC and Differential Privacy [article]

Chenghong Wang, Johes Bater, Kartik Nayak, Ashwin Machanavajjhala
2022 arXiv   pre-print
The evaluation results show that Incshrink provides a 3-way trade-off in terms of privacy, accuracy, and efficiency guarantees, and offers at least a 7,800 times performance advantage over standard secure  ...  To the best of our knowledge, there are no existing systems that have these properties.  ...  Instead, we can utilize estimates of 𝑑 1 and 𝑑 2 learned from the DP volume information released by our materialized joins, as seen in Figure3.  ... 
arXiv:2203.05084v1 fatcat:phddzgauubca7o2glzg6ypaykq

Distributed hash sketches

N. Ntarmos, P. Triantafillou, G. Weikum
2009 ACM Transactions on Computer Systems  
of the cardinality estimation, and (5) simplicity and easy integration in applications.  ...  Examples of such applications range from optimizing query access plans in peer-to-peer data sharing, to computing the significance (rank/score) of data items in distributed information retrieval.  ...  INTRODUCTION Peer-to-peer (P2P) networks came into existence as a means of sharing files and/or CPU cycles among end-users.  ... 
doi:10.1145/1482619.1482621 fatcat:3mb3sonrvjawfkn4w4j2yoec5m
« Previous Showing results 1 — 15 out of 2,625 results