A unified view of data-intensive flows in business intelligence systems : a survey

Data-intensive flows are central processes in today’s business intelligence (BI) systems, deploying different technologies to deliver data, from a multitude of data sources, in user-preferred and analysis-ready formats. To meet complex requirements of next generation BI systems, we often need an effective combination of the traditionally batched extract-transform-load (ETL) processes that populate a data warehouse (DW) from integrated data sources, and more real-time and operational data flows that integrate source data at runtime. Both academia and industry thus must have a clear understanding of the foundations of data-intensive flows and the challenges of moving towards next generation BI environments. In this paper we present a survey of today’s research on data-intensive flows and the related fundamental fields of database theory. The study is based on a proposed set of dimensions describing the important challenges of data-intensive flows in the next generation BI setting. As a result of this survey, we envision an architecture of a system for managing the lifecycle of data-intensive flows. The results further provide a comprehensive understanding of data-intensive flows, recognizing challenges that still are to be addressed, and how the current solutions can be applied for addressing these challenges.Peer ReviewedPostprint (author's final draft

The Impementation of Integrated Learning in The Islamic Religious Educationto Raise The Faith Devotion of The Students of State Seniour High Schools in Purwokerto

ABSTRACT Purpose: The primary objective of the Islamic Religious Education is to create amalus-solikhah, that is, the formation of pieties, both individual piety and social piety. The process of the piety formation is due to the ingrained faith and devotion to God. The process of the faith and devotion formation is achieved through tafakur and tadhabur, based on God the Almighty’s creations. Therefore, the the Islamic Religious Education is necessary to be integrated into the Natural Sciences so that there will be an integrity between the kauliyah verse with the kauniyah verse. Method:This research used a research and development study. One of the characteristics of such a study is product. One of the products of this research is the integrated thematic learning of the Islamic Religious Education with the Natural Sciences in the form of learning scenario in syllabus and lesson plan. Findings:The results of the research shows that the implementation of the integrated learning in the integrated thematic learning of the Islamic Religious Education with the Natural Sciences at State Senior Secondary Schools in Purwokerto city is very significant in improving the faith and devotion of the students, as indicated by the results of the experimental study in which the implementation of the integrated learning is very effective and the responses of the students toward it, are indeed very good

Understanding new venture market application search processes: A propositional model.

Technology-based ventures are confronted with complex decisions on how to apply their technology platform in highly uncertain and ambiguous market environments. Based on four case studies, a dynamic decision model is developed in which we highlight the similarities between the search and learning processes in venture development contexts and in new product development contexts. This entrepreneurial search and learning process is understood as consisting of sequences of episodes – characterized by uncertainty and ambiguity - and scripts – i.e. approaches to market application search. The model implies that a venture's adaptability - i.e. its ability to move efficiently and effectively between these episodes and their related scripts - influences its survival.Case studies; Decision; Decisions; Learning; Market; Model; Processes; Product; Product development; Research; Sequences; Similarity; Studies; Technology; Uncertainty;

Mining Query Plans for Finding Candidate Queries and Sub-Queries for Materialized Views in BI Systems Without Cube Generation

Materialized views are important for optimizing Business Intelligence (BI) systems when they are designed without data cubes. Selecting candidate queries from large number of queries for materialized views is a challenging task. Most of the work done in the past involves finding out frequent queries from the past workload and creating materialized views from such queries by either manually analyzing workload or using approximate string matching algorithms using query text. Most of the existing methods suggest complete queries but ignore query components such as sub queries for creation of materialized views. This paper presents a novel method to determine on which queries and query components materialized views can be created to optimize aggregate and join queries by mining database of query execution plans which are in the form of binary trees. The proposed algorithm showed significant improvement in terms of more number of optimized queries because it is using the execution plan tree of the query as a basis of selection of query to be optimized using materialized views rather than choosing query text which is used by traditional methods. For selecting a correct set of queries to be optimized using materialized views, the paper proposes efficient specialized frequent tree component mining algorithm with novel heuristics to prune search space. These frequent components are used to determine the possible set of candidate queries for creation of materialized views. Experimentation on standard, real and synthetic data sets, and also the theoretical basis, proved that the proposed method is able to optimize a large number of queries with less number of materialized views and showed a significant improvement in performance compared to traditional methods

A solution to the materialized view selection problem in data warehousing

One of the most important decisions in the physical designing of a data warehouse is the selection of materialized views and indexes to be created. The problem is to select an appropriate set of views and indexes to storage that minimizes the total query response time, as long as the cost of maintaining them, given a constraint of some resource like storage space, is kept as low as possible.In this work, we have developed a new algorithm for the general problem of se-lection of views considering indexes, as an extension to a well-known algorithm. We present a heuristic for selection of views and indexes to optimize total que-ry response under a materialization time constraint. Finally, we present an ex-perimental comparison of our proposal with the considered state-of-art ap-proach.XI Workshop Bases de Datos y Minería de DatosRed de Universidades con Carreras de Informática (RedUNCI

A solution to the materialized view selection problem in data warehousing

One of the most important decisions in the physical designing of a data warehouse is the selection of materialized views and indexes to be created. The problem is to select an appropriate set of views and indexes to storage that minimizes the total query response time, as long as the cost of maintaining them, given a constraint of some resource like storage space, is kept as low as possible.In this work, we have developed a new algorithm for the general problem of se-lection of views considering indexes, as an extension to a well-known algorithm. We present a heuristic for selection of views and indexes to optimize total que-ry response under a materialization time constraint. Finally, we present an ex-perimental comparison of our proposal with the considered state-of-art ap-proach.XI Workshop Bases de Datos y Minería de DatosRed de Universidades con Carreras de Informática (RedUNCI

Using contextual goal models for constructing situational methods

Situation and intention are two fundamental notions in situational method engineering (SME). They are used to assess the context of an ISD project and to specify method requirements in this context. They also allow defining the goals of the method chunks and the conditions under which they can be applied. In this way, the selection and assembly of method chunks for a particular ISD project is driven by matching situational method requirements to method chunks’ goals and context descriptions. In this paper we propose the use of contextual goal models for supporting all SME steps. Our approach is based on iStar2.0 modeling language that we extend with contextual annotations.Peer ReviewedPostprint (author's final draft

A workload‑driven approach for view selection in large dimensional datasets

The information explosion the world has witnessed in the last two decades has forced businesses to adopt a data-driven culture for them to be competitive. These data-driven businesses have access to countless sources of information, and face the challenge of making sense of overwhelming amounts of data in a efficient and reliable manner, which implies the execution of read-intensive operations. In the context of this challenge, a framework for the dynamic read-optimization of large dimensional datasets has been designed, and on top of it a workload-driven mechanism for automatic materialized view selection and creation has been developed. This paper presents an extensive description of this mechanism, along with a proof-of-concept implementation of it and its corresponding performance evaluation. Results show that the proposed mechanism is able to derive a limited but comprehensive set of views leading to a drop in query latency ranging from 80% to 99.99% at the expense of 13% of the disk space used by the base dataset. This way, the devised mechanism enables speeding up query execution by building materialized views that match the actual demand of query workloads

New product development in business to business marketing - a relational perspective.

Market position and long-term competitive advantages are dependent on companies’ ability to innovate and their capacity to launch new product or services. This paper aims to highlight the features of product development processes in business to business markets. The research method consisted of a documentary study in the literature and the results focus on the stages involved in the development and launch of a new product. In recent years, statistics have shown an increase in the rate of failure in launching new products on business markets. This has been caused by an inadequate planning and has negative consequences on both customer relationships and organizational economic performance. Given this reality, academics propose a sequential product development plan based on the following essential steps: identifying opportunities and generating ideas, selection of ideas with the highest chances of success, development of new product concept materialized in the form of a prototype, technical testing and acceptance testing, making the final changes to the product, establishing brand name, price level and other intangible elements of the product, legal protection of the product, placing the product into production and effectively lunching the product though a tactical marketing program. Practical experiences show that omission of one or more stages of this process can cause product failure, companies recording a low level of performance, below expected levels.Product development; business to business relationships; planning; ideas selection; marketing tests; product failure.

Automatic physical database design : recommending materialized views

This work discusses physical database design while focusing on the problem of selecting materialized views for improving the performance of a database system. We first address the satisfiability and implication problems for mixed arithmetic constraints. The results are used to support the construction of a search space for view selection problems. We proposed an approach for constructing a search space based on identifying maximum commonalities among queries and on rewriting queries using views. These commonalities are used to define candidate views for materialization from which an optimal or near-optimal set can be chosen as a solution to the view selection problem. Using a search space constructed this way, we address a specific instance of the view selection problem that aims at minimizing the view maintenance cost of multiple materialized views using multi-query optimization techniques. Further, we study this same problem in the context of a commercial database management system in the presence of memory and time restrictions. We also suggest a heuristic approach for maintaining the views while guaranteeing that the restrictions are satisfied. Finally, we consider a dynamic version of the view selection problem where the workload is a sequence of query and update statements. In this case, the views can be created (materialized) and dropped during the execution of the workload. We have implemented our approaches to the dynamic view selection problem and performed extensive experimental testing. Our experiments show that our approaches perform in most cases better than previous ones in terms of effectiveness and efficiency