1,720,981 research outputs found
A datalog-based computational model for coordination-free, data-parallel systems
No full textCloud computing refers to maximizing efficiency by sharing computational and storage resources, while data-parallel systems exploit the resources available in the cloud to perform parallel transformations over large amounts of data. In the same line, considerable emphasis has been recently given to two apparently disjoint research topics: data-parallel, and eventually consistent, distributed systems. Declarative networking has been recently proposed to ease the task of programming in the cloud, by allowing the programmer to express only the desired result and leave the implementation details to the responsibility of the run-time system. In this context, we deem it appropriate to propose a study on a logic-programming-based computational model for eventually consistent, data-parallel systems, the keystone of which is provided by the recent finding that the class of programs that can be computed in an eventually consistent, coordination-free way is that of monotonic programs. This principle is called Consistency and Logical Monotonicity (CALM) and has been proven by Ameloot et al. for distributed, asynchronous settings. We advocate that CALM should be employed as a basic theoretical tool also for data-parallel systems, wherein computation usually proceeds synchronously in rounds and where communication is assumed to be reliable. We deem this problem relevant and interesting, especially for what concerns parallel dataflow optimizations. Nowadays, we are in fact witnessing an increasing concern about understanding which properties distinguish synchronous from asynchronous parallel processing, and when the latter can replace the former. It is general opinion that coordination-freedom can be seen as a major discriminant factor. In this work, we make the case that the current form of CALM does not hold in general for data-parallel systems, and show how, using novel techniques, the satisfiability of the CALM principle can still be obtained although just for the subclass of programs called connected monotonic queries. We complete the study with considerations on the relationships between our model and the one employed by Ameloot et al., showing that our techniques subsume the latter when the synchronization constraints imposed on the system are loosened
MediaBank: Keyword Search and Tag Cloud Functionalities for aMultimedia Content Authoring Web Platform
No full textThe composition of multimedia presentations is atime- and resource-consuming task if not afforded ina well-defined manner. This is particularly true whenpeople having different roles and following differenthigh-level directives, collaborate in the authoringand assembling of a final product. For this reasonwe adopt the Select, Assemble, Transform andPresent (SATP) approach to coordinate thepresentation authoring and a tag cloud-based searchengine in order to help users in efficiently retrievinguseful assets. In the first of this paper we presentMediaPresenter, the framework we developed tosupport companies in the creation of multimediacommunication means, providing an instrument thatusers can exploit every time new communicationchannels have to be created. In the second part wedescribe how we adopt keyword search techniquescoupled with Tag Cloud in order to summarize theresults over the stored data
A Web Platform for Collaborative Multimedia Content Authoring Exploiting Keyword Search Engine and Data Cloud
No full textThe composition of multimedia presentations is a time- and resource-consuming task if not afforded in a well-defined manner. This is particularly true when people having different roles and following different high-level directives, collaborate in the authoring and assembling of a final product. For this reason we adopt the Select, Assemble, Transform and Present (SATP) approach to coordinate the presentation authoring and a tag cloud-based search engine in order to help users in efficiently retrieving useful assets. In this paper we present MediaPresenter, the framework we developed to support companies in the creation of multimedia communication means, providing an instrument that users can exploit every time new communication channels have to be created
A web-based platform for multimedia content authoring exploiting keyword search engine and data cloud
No full textThe composition of multimedia presentations is atime and resource consuming task if not afforded in a well definedmanner. This is particularly true when people having differentroles and following different high-level directives, collaborate inthe authoring and assembling of a final product. For this reasonwe adopt the Select, Assemble, Transform and Present (SATP)approach to coordinate the presentation authoring and a tagcloud-based search engine in order to help users in efficientlyretrieving useful assets. In this paper we present MediaPresenter,the framework we developed to support companies in the creationof multimedia communication means, providing an instrumentthat users can exploit every time new communication channelshave to be created
MediaPresenter, a web platform for multimedia content management
No full textThe composition of multimedia presentations is a time and resource consuming task if not afforded in a well defined manner. This is particularly true for medium/big companies, where people having different roles and following different high-level directives, collaborate in the authoring and assembling of a final product. In this paper we present MediaPresenter, the framework we developed to support companies in the creation of multimedia communication means, providing an instrument that users can exploit every time new communication channels have tobe created
Understanding Data in the Blink of an Eye
No full textMany data analysis and knowledge mining tasks require a basic understanding of the content of a dataset prior to any data access. In this demo, we showcase how data descriptions---a set of compact, readable and insightful formulas of boolean predicates---can be used to guide users in understanding datasets. Finding the best description for a dataset is, unfortunately, both computationally hard and task-specific. This demo shows that not only we can generate descriptions at interactive speed, but also that diverse user needs---from anomaly detection to data exploration---can be accommodated through a user-driven process exploiting dynamic programming in concert with a set of heuristics
Towards accelerating generic machine learning prediction pipelines
No full textMachine Learning models are often composed by sequences of transformations. While this design makes easy to decompose and accelerate single model components at training time, predictions requires low latency and high performance predictability whereby end-to-end runtime optimizations and acceleration is needed to meet such goals. This paper shed some light on the problem by using a production-like model, and showing how by redesigning model pipelines for efficient execution over CPUs and FPGAs performance improvements of several folds can be achieved
Combining User and Database Perspective for Solving Keyword Queries over Relational Databases
Full text linkOver the last decade, keyword search over relational data has attracted considerable attention. A possible approach to face this issue is to transform keyword queries into one or more SQL queries to be executed by the relational DBMS. Finding these queries is a challenging task since the information they represent may be modeled across different tables and attributes. This means that it is needed to identify not only the schema elements where the data of interest is stored, but also to find out how these elements are interconnected. All the approaches that have been proposed so far provide a monolithic solution. In this work, we, instead, divide the problem into three steps: the first one, driven by the user׳s point of view, takes into account what the user has in mind when formulating keyword queries, the second one, driven by the database perspective, considers how the data is represented in the database schema. Finally, the third step combines these two processes. We present the theory behind our approach, and its implementation into a system called QUEST (QUEry generator for STructured sources), which has been deeply tested to show the efficiency and effectiveness of our approach. Furthermore, we report on the outcomes of a number of experimental results that we have conducted
- …
