Filters








3,485,906 Hits in 6.5 sec

Just-in-time data structures

Mattias De Wael, Stefan Marr, Joeri De Koster, Jennifer B. Sartor, Wolfgang De Meuter
2015 2015 ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software (Onward!) - Onward! 2015  
Just-in-Time Data Structures are an attempt to shift the focus from finding the "right" data structure to finding the "right" sequence of data representations.  ...  To this end we introduce Just-in-Time Data Structures, which enable representation changes at runtime, based on declarative input from a performance expert programmer.  ...  Our Just-in-Time Data Structures fill this hole.  ... 
doi:10.1145/2814228.2814231 dblp:conf/oopsla/WaelMKSM15 fatcat:ltxlnoilandqrbeifk7cpggy3y

Just-in-time data structures: towards declarative swap rules

Mattias De Wael
2015 Proceedings of the 13th International Workshop on Dynamic Analysis - WODA 2015  
In previous work, we developed a language to develop such Just-in-Time Data Structures.  ...  A swap rule analyses the state and usage of a just-in-time data structure and reacts as defined by a developer.  ...  Or in other words: Just-in-Time Data Structures are an attempt to shift the focus from finding the "right" data structure to finding the "right" sequence of data representations.  ... 
doi:10.1145/2823363.2823371 dblp:conf/oopsla/Wael15 fatcat:vk4kmchkyfadhpwmn4lerzqv2u

JiTTree: A Just-in-Time Compiled Sparse GPU Volume Data Structure

Matthias Labschutz, Stefan Bruckner, M. Eduard Groller, Markus Hadwiger, Peter Rautek
2016 IEEE Transactions on Visualization and Computer Graphics  
Through just-in-time (JIT) compilation, JiTTree reduces the traversal overhead of the resulting optimal data structure.  ...  This paper presents JiTTree, a novel sparse hybrid volume data structure that uses just-in-time compilation to overcome these problems.  ...  In contrast to other data structures, JiTTree enables the generation of just-in-time compiled GPU code.  ... 
doi:10.1109/tvcg.2015.2467331 pmid:26529746 fatcat:aencw776q5e3xezooubymg6ewi

Just-in-time query retrieval over partially indexed data on structured P2P overlays

Sai Wu, Jianzhong Li, Beng Chin Ooi, Kian-Lee Tan
2008 Proceedings of the 2008 ACM SIGMOD international conference on Management of data - SIGMOD '08  
That is, the (partial) index in PISCES is built in a Just-In-Time (JIT) manner.  ...  Structured peer-to-peer (P2P) overlays have been successfully employed in many applications to locate content.  ...  The tuples are indexed Just-In-Time (JIT): An index is built for a query set whenever it is necessary.  ... 
doi:10.1145/1376616.1376647 dblp:conf/sigmod/WuLOT08 fatcat:rbmm5hfxzvastj4pccaend6fza

Use of Just in Time Maintenance of Reinforced Concrete Bridge Structures based on Real Historical Data Deterioration Models

A. Abu-Tair, A. Al Hussain, M. Belhaq
2016 MATEC Web of Conferences  
The method used both deterministic and stochastic methods to predict the service life of a bridge, using these service lives in combination with the just in time (JIT) principle of management would enable  ...  maintenance managers to justify the need for action and the budgets needed, to intervene at the optimum time in the life of the structure and that of the deterioration.  ...  Just in time maintenance JIT maintenance was first developed in Japan particularly by Toyota engineers who are why it is called Toyota Production System.  ... 
doi:10.1051/matecconf/20168306002 fatcat:3zrxmki4drdcpesp2tmvjz3rve

Data interface + algorithms = efficient programs

Mattias De Wael, Stefan Marr, Wolfgang De Meuter
2014 Proceedings of the 9th International Workshop on Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems PLE - ICOOOLPS '14  
These Just-In-Time data structures can dynamically swap their internal data representation when the cost of swapping is payed back many times in the remainder of the computation.  ...  In this position paper we introduce the idea of Just-In-Time data structures, a combination of a data interface and a set of concrete data representations with different performance characteristics.  ...  Our idea towards this goal is "Just-In-Time Data Structures", a data interface with multiple implementations that allows to change its representation at runtime.  ... 
doi:10.1145/2633301.2633303 dblp:conf/ecoop/WaelMM14 fatcat:5zfs74fa4bdunhcxmao3pi5mdi

A Two-Level Cache for Distributed Information Retrieval in Search Engines

Weizhe Zhang, Hui He, Jianwei Ye
2013 The Scientific World Journal  
The experiments prove that the hit rate, the efficiency, and the time consumption of the two-level cache have advantages compared with other structures of cache.  ...  To improve the performance of distributed information retrieval in search engines, we propose a two-level cache structure based on the queries of the users' logs.  ...  Total queries (times) Hit counts of two-level cache structure (times) Hit counts of just using dynamic cache (times)  ... 
doi:10.1155/2013/596724 pmid:24363621 pmcid:PMC3864153 fatcat:dtysar6vcfdbdg6ykvtbc42qny

An Efficient Word Lookup System by using Improved Trie Algorithm [article]

Rahat Yeasin Emon, Sharmistha Chanda Tista
2019 arXiv   pre-print
Many word searching data structures and algorithms exist in the current world but few of them have space compress ability.  ...  Efficiently word storing and searching is an important task in computer science. An application space complexity, time complexity, and overall performance depend on this string data.  ...  We proposed to use the proposed trie as a prime data structure or data tank to any software application and use all other data structure as a non-prime data structure which just stores the node pointer  ... 
arXiv:1911.01763v1 fatcat:qnzrsw3ud5f7helt2yyl2jciba

Fast Scalable Construction of (Minimal Perfect Hash) Functions [chapter]

Marco Genuzio, Giuseppe Ottaviano, Sebastiano Vigna
2016 Lecture Notes in Computer Science  
Recent advances in random linear systems on finite fields have paved the way for the construction of constant-time data structures representing static functions and minimal perfect hash functions using  ...  Our implementation of these techniques yields a minimal perfect hash function data structure occupying 2.24 bits per element, compared to 2.68 for MWHC-based ones, and a static function data structure  ...  that, if such a function exists, the data structure just requires to store w and θ.  ... 
doi:10.1007/978-3-319-38851-9_23 fatcat:gghvd2uyrfbbfe35fbllv2xflu

Fast Scalable Construction of (Minimal Perfect Hash) Functions [article]

Marco Genuzio, Giuseppe Ottaviano, Sebastiano Vigna
2016 arXiv   pre-print
Recent advances in random linear systems on finite fields have paved the way for the construction of constant-time data structures representing static functions and minimal perfect hash functions using  ...  Our implementation of these techniques yields a minimal perfect hash function data structure occupying 2.24 bits per element, compared to 2.68 for MWHC-based ones, and a static function data structure  ...  that, if such a function exists, the data structure just requires to store w and θ.  ... 
arXiv:1603.04330v2 fatcat:ef3exwqa6ffq3davamqv6yzaii

Succinct Data Structures in Information Retrieval

Simon Gog, Rossano Venturini
2016 Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval - SIGIR '16  
These new kind of data structures mimic the operations of their classical counterparts within a comparable time complexity but require much less space.  ...  Succinct data structures are used today in many information retrieval applications, e.g., posting lists representation, language model representation, indexing (social) graphs, query auto-completion, document  ...  Succinct data structures often extend the functionality of traditional structures or reduce query time.  ... 
doi:10.1145/2911451.2914802 dblp:conf/sigir/GogV16a fatcat:pdche27oozcapfiapdwcmjtyva

Data Block and Tuple Identification Using Master Index

Michal Kvet, Karol Matiasko
2020 Sensors  
From the physical point of view, data are stored in the data files delimited by the tablespaces. Files are block-oriented.  ...  Each data tuple is logically stored in the table referenced by relationships between individual tables.  ...  The work is also supported by the project VEGA 1/0089/19 Data analysis methods and decision support tools for service systems supporting electric vehicles and Grant System UNIZA.  ... 
doi:10.3390/s20071848 pmid:32225095 pmcid:PMC7181049 fatcat:rl327la7rrc7tj2mlqfto2izsu

FunSeqSet: Towards a Purely Functional Data Structure for the Linearisation Case of Dynamic Trees Problem [article]

Juan Carlos Saenz-Carrasco
2019 arXiv   pre-print
(i.e. sets) data structures in order to manage efficiently k-ary trees for the linearisation case of the dynamic trees problem.  ...  Dynamic trees, originally described by Sleator and Tarjan, have been studied deeply for non persistent structures providing O(log n) time for update and lookup operations as shown in theory and practice  ...  If we want to distinguish between semi-dynamic data structures and data structures allowing both operations, then the latter are called fully dynamic data structures.  ... 
arXiv:1908.11105v1 fatcat:ft3uhez235cfpctnpa2s5y6yq4

Processing Recursive XQuery over XML Streams: The Raindrop Approach

Mingzhu Wei, Ming Li, E.A. Rundensteiner, M. Mani
2006 22nd International Conference on Data Engineering Workshops (ICDEW'06)  
This in turn requires that we avoid holding data in the query buffer, by outputting it at the earliest possible time.  ...  In particular we propose two strategies for implementing structural joins: (a) the just-in-time structural join strategy efficiently processes joins as long as the input XML substreams are non-recursive  ...  If the data is not recursive, then the just-in-time structural join strategy is called; otherwise, the recursive structural join strategy is called.  ... 
doi:10.1109/icdew.2006.119 dblp:conf/icde/WeiLRM06 fatcat:quipesvew5eb3jpyd2janggs4i

Processing recursive XQuery over XML streams: The Raindrop approach

Mingzhu Wei, Elke A. Rundensteiner, Murali Mani, Ming Li
2008 Data & Knowledge Engineering  
This in turn requires that we avoid holding data in the query buffer, by outputting it at the earliest possible time.  ...  In particular we propose two strategies for implementing structural joins: (a) the just-in-time structural join strategy efficiently processes joins as long as the input XML substreams are non-recursive  ...  If the data is not recursive, then the just-in-time structural join strategy is called; otherwise, the recursive structural join strategy is called.  ... 
doi:10.1016/j.datak.2007.09.007 fatcat:y5bn5grqhjgtfivowvhj3jc6za
« Previous Showing results 1 — 15 out of 3,485,906 results