Filters








51 Hits in 7.4 sec

Compact I/O-Efficient Representation of Separable Graphs and Optimal Tree Layouts [article]

Tomáš Gavenčiak, Jakub Tětek
2018 arXiv   pre-print
Then we propose I/O-efficient succinct representation and memory layout for random walks in(weighted) separable graphs in the pointer machine model, including an efficient algorithm to compute them.  ...  of finding an optimal compact layout.  ...  Among other notable I/O-efficient algorithms, Maheshwari and Zeh [30] develop I/O-efficient algorithms for computing vertex separators, shortest paths and several other problems in planar and separable  ... 
arXiv:1811.06749v1 fatcat:dm6fuo7ktjdlhfgrxh5q7qxxjy

A compact space decomposition for effective metric indexing

Edgar Chávez, Gonzalo Navarro
2005 Pattern Recognition Letters  
In this paper we present a simple index called list of clusters (LC), which is based on a compact partitioning of the data set.  ...  We finish with a discussion of the role of unbalancing in metric space searching, and how it permits trading memory space for construction time.  ...  Finally, it would be interesting to devise I/O efficient variants that are able to compete with M-trees and D-indexes in secondary memory.  ... 
doi:10.1016/j.patrec.2004.11.014 fatcat:5ogwhgm62zcfxgksid2cet57au

Cache efficient functional algorithms

Guy E. Blelloch, Robert Harper
2015 Communications of the ACM  
I/O efficient algorithms.  ...  These bounds imply that purely functional programs based on lists and trees with no special attention to any details of memory layout can be asymptotically as efficient as the carefully designed imperative  ...  This work is partially supported by the National Science Foundation under grant number CCF-1018188, and by Intel Labs Academic Research Office for the Parallel Algorithms for Non-Numeric Computing Program  ... 
doi:10.1145/2776825 fatcat:7pgdmkxnfzck7jffm4jywkg3ka

LiveGraph: A Transactional Graph Storage System with Purely Sequential Adjacency List Scans [article]

Xiaowei Zhu, Guanyu Feng, Marco Serafini, Xiaosong Ma, Jiping Yu, Lei Xie, Ashraf Aboulnaga, Wenguang Chen
2019 arXiv   pre-print
Our evaluation shows that LiveGraph significantly outperforms state-of-the-art (graph) database solutions on both transactional and real-time analytical workloads.  ...  The specific characteristics of graph workloads make it hard to design a one-size-fits-all graph storage system.  ...  Manually managing memory allows all operations to access sequential chunks of data, resulting in better cache utilization, branch prediction, and I/O efficiency if data is not in memory.  ... 
arXiv:1910.05773v1 fatcat:7eluyrrabja5lhrugd32oh5fru

Compressed Dynamic Binary Relations

Nieves R. Brisaboa, Guillermo de Bernardo, Gonzalo Navarro
2012 2012 Data Compression Conference  
The data structure is a dynamic variant of the k 2 -tree, a static compact representation that takes advantage of clustering in the binary relation to achieve compression.  ...  We apply our dynamic data structure to the representation of Web graphs and RDF databases, showing that it combines good compression ratios with fast query and update times.  ...  a good I/O efficiency in practice.  ... 
doi:10.1109/dcc.2012.13 dblp:conf/dcc/BrisaboaBN12 fatcat:3456iyi6nvgnvfoalc5dp5jfhm

External Memory Algorithms For Path Traversal in Graphs [article]

Craig Dillabaugh
2013 arXiv   pre-print
This thesis presents a number of results related to path traversal in trees and graphs.  ...  In addition, for trees and planar graphs the data structures we present are succinct.  ...  I/O efficiency for some graphs.  ... 
arXiv:1308.4469v1 fatcat:2affi6c4x5hlxhx6m3xb6duoxu

Can we analyze big data inside a DBMS?

Carlos Ordonez
2013 Proceedings of the sixteenth international workshop on Data warehousing and OLAP - DOLAP '13  
On the other hand, for data analytics in a broad sense, there are plenty of non-DBMS tools including statistical languages, matrix packages, generic data mining programs and largescale parallel systems  ...  We conclude with a proposal of long-term research issues, considering the "big data analytics" trend.  ...  SYSTEM INFRASTRUCTURE Storage and Indexing Most systems use three fundamental data set storage layouts, which influence I/O efficiency: • Row storage: This is the most common storage layout, in which  ... 
doi:10.1145/2513190.2513198 dblp:conf/dolap/Ordonez13 fatcat:ejuvzywvqrd5jig6bfcmixc66m

Efficient Binary Decision Diagram Manipulation in External Memory [article]

Steffan Christ Sølvsten, Jaco van de Pol, Anna Blume Jakobsen, Mathias Weller Berg Thomasen
2021 arXiv   pre-print
We follow up on the idea of Lars Arge to rephrase the Reduce and Apply procedures of Binary Decision Diagrams (BDDs) as iterative I/O-efficient algorithms.  ...  We identify multiple avenues to simplify and improve the performance of his proposed algorithms.  ...  Acknowledgements Thanks to the late Lars Arge for his input and advice and to Mathias Rav for helping us with TPIE and his inputs on the levelized priority queue. Thanks to Gerth S. Brodal, Asger H.  ... 
arXiv:2104.12101v3 fatcat:4wre6xvwojgsll2ou4tum45c4m

Cache-conscious frequent pattern mining on modern and emerging processors

Amol Ghoting, Gregory Buehrer, Srinivasan Parthasarathy, Daehyun Kim, Anthony Nguyen, Yen-Kuang Chen, Pradeep Dubey
2006 The VLDB journal  
This optimization affords an additional speedup of 50%, resulting in an overall speedup of up to 4.8. To *  ...  The resulting tree improves spatial locality and also enhances the benefits from hardware cache line prefetching.  ...  Rather, it generates frequent itemsets using FP-tree projections in main memory. The payoff is improved search space traversal and very high I/O efficiency.  ... 
doi:10.1007/s00778-006-0025-y fatcat:qr6zxxggazeodaxlykh5w57kay

In-Memory Big Data Management and Processing: A Survey

Hao Zhang, Gang Chen, Beng Chin Ooi, Kian-Lee Tan, Meihui Zhang
2015 IEEE Transactions on Knowledge and Data Engineering  
In this survey, we aim to provide a thorough review of a wide range of in-memory data management and processing proposals and systems, including both data storage systems and data processing frameworks  ...  Many of these researches have focused along several dimensions: modern CPU and memory hierarchy utilization, time/space efficiency, parallelism and concurrency control.  ...  We would like to thank the anonymous reviewers, and also Bingsheng He, Eric Lo and Bogdan Marius Tudor, for their insightful comments and suggestions.  ... 
doi:10.1109/tkde.2015.2427795 fatcat:u7r3rtvhxbainfeazfduxcdwrm

Algorithms and Data Structures for External Memory

Jeffrey Scott Vitter
2006 Foundations and Trends® in Theoretical Computer Science  
The problem domains considered include sorting, permuting, FFT, scientific computing, computational geometry, graphs, databases, geographic information systems, and text and string processing.  ...  Algorithms and Data Structures for External Memory surveys the state of the art in the design and analysis of external memory (or EM) algorithms and data structures, where the goal is to exploit locality  ...  problems) and those related to I/O efficiency.  ... 
doi:10.1561/0400000014 fatcat:bkfchugd4fbjvcu5zipnh23k6e

External memory algorithms and data structures: dealing with massive data

Jeffrey Scott Vitter
2001 ACM Computing Surveys  
For the batched problem of sorting and related problems such as permuting and fast Fourier transform, the key paradigms include distribution and merging.  ...  In this article we survey the state of the art in the design and analysis of external memory (or EM) algorithms and data structures, where the goal is to exploit locality in order to reduce the I/O costs  ...  Figures 6, 7, 9 , 10, 12, and 13 are modified versions of figures in Arge et al. [1998a] Enbody and Du [1998], Kanellakis et al. [1996] , Arge et al. [1999a,b], and Ferragina and Grossi [1999] , respectively  ... 
doi:10.1145/384192.384193 fatcat:tunz4fa3rrgv7hwbk7qsvahd5i

Modeling and Visualization Approaches for Time-Varying Volumetric Data [chapter]

Kenneth Weiss, Leila De Floriani
2008 Lecture Notes in Computer Science  
Since most models of time-varying data have been abstracted from well-known approaches to volumetric data, we review models of volumetric data as well as schemes to accelerate isosurface extraction and  ...  Finally, we discuss multi-resolution approaches which allow interactive processing and visualization of large time varying datasets. ⋆ ⋆ ⋆  ...  In an attempt to improve I/O efficiency, spatially coherent cells are clustered into meta-cells, containing the field values for all time-steps. Vrolijk et. al.  ... 
doi:10.1007/978-3-540-89646-3_100 fatcat:jepwymhnxzfujhprtce5plomai

Adaptive tetrapuzzles

Paolo Cignoni, Fabio Ganovelli, Enrico Gobbetti, Fabio Marton, Federico Ponchio, Roberto Scopigno
2004 ACM Transactions on Graphics  
The representation is constructed during a fine-to-coarse simplification of the surface contained in diamonds (sets of tetrahedral cells sharing their longest edge).  ...  Abstract We describe an efficient technique for out-of-core construction and accurate view-dependent visualization of very large surface models.  ...  We are grateful to the anonymous reviewers for their thorough work and to the Stanford Graphics Group, the Digital Michelangelo project, and the University of Stuttgart for making benchmark datasets available  ... 
doi:10.1145/1015706.1015802 fatcat:ygjrou4rpvfqhfp2rneaztakye

Performance Analysis and Tuning for General Purpose Graphics Processing Units (GPGPU)

Hyesoon Kim, Richard Vuduc, Sara Baghsorkhi, Jee Choi, Wen-mei Hwu
2012 Synthesis Lectures on Computer Architecture  
Acknowledgments First we would like to thank Mark Hill and Michael Morgan for having invited us to write a synthesis lecture and for their support. Many thanks to reviews from Tor M. Aamodt  ...  COMBINED ANALYSES OF PARALLELISM AND I/O-EFFICIENCY The preceding discussion treats parallelism and locality (I/O-efficiency) separately.  ...  COMBINED ANALYSES OF PARALLELISM AND I/O-EFFICIENCY 33 • Recall that for matrix multiply, we were able to state a lower bound on the number of I/O transfers for any algorithm.  ... 
doi:10.2200/s00451ed1v01y201209cac020 fatcat:ll4uas6lmjbcll5zqzomhcv5vq
« Previous Showing results 1 — 15 out of 51 results