Filters








62,046 Hits in 8.0 sec

Incremental Discovery of Functional Dependencies with a Bit-vector Algorithm

Loredana Caruccio, Stefano Cirillo, Vincenzo Deufemia, Giuseppe Polese
2019 Sistemi Evoluti per Basi di Dati  
In the context of big data, the speed at which new data is being created demand for new efficient algorithms for fd discovery.  ...  In this paper, we propose an incremental fd discovery approach, which is able to update the set of holding fds upon insertions of new tuples to the data instance, without having to restart the discovery  ...  Incremental Discovery of Functional Dependencies This section presents the structure of the proposed incremental approach for fds discovery by introducing the data representation and the search strategies  ... 
dblp:conf/sebd/CaruccioCDP19 fatcat:mnj5bw3iq5fwdekxm7j4w7auyu

Monitoring Evolution of Dependency Discovery Results

Loredana Caruccio, Loredana Caruccio
2020 Journal of Visual Language and Computing  
A B S T R A C T The automatic discovery from data of Functional Dependencies (FDs), and their extensions Relaxed Functional Dependencies (RFDs), represents one of the main tasks in the data profiling research  ...  To this end, in this paper, we present DEVICE, a tool for continuously monitoring resulting RFDs during the execution of discovery processes.  ...  Introduction Collecting metadata from big datasets is the goal of the data profiling research area, in which the discovery of functional dependencies (FDs), and their extensions relaxed functional dependencies  ... 
doi:10.18293/jvlc2020-n2-007 fatcat:d4jnuq2gkncilgxlmd5zxsm4ym

On data dependencies in dataspaces

Shaoxu Song, Lei Chen, Philip S. Yu
2011 2011 IEEE 27th International Conference on Data Engineering  
It covers the semantics of a broad class of dependencies in databases, including functional dependencies (FDs), metric functional dependencies (MFDs), and matching dependencies (MDs).  ...  Nevertheless, we develop several approaches for efficient approximation computation, including greedy and randomized approaches with an approximation bound on the maximum number of violations that an object  ...  Figure 6 (a) illustrates the incremental discovery of dependencies with the increase of functions.  ... 
doi:10.1109/icde.2011.5767857 dblp:conf/icde/SongCY11 fatcat:ospxouhgv5fjbev47dav5nb7xu

Water alternating gas incremental recovery factor prediction and WAG pilot lessons learned

Lazreg Belazreg, Syed Mohammad Mahmood
2019 Journal of Petroleum Exploration and Production Technology  
set were used for validation.  ...  A predictive model was developed using both regression and group method of data handling (GMDH) techniques; 70% of the 33 WAG pilot projects data were used as validation, whereas remaining 30% of data  ...  Acknowledgements The authors would like to thank the University of Teknologi PETRONAS for their support and permission to publish this paper.  ... 
doi:10.1007/s13202-019-0694-x fatcat:btsr2uwbobbtforjmymeokarnq

Comparable dependencies over heterogeneous data

Shaoxu Song, Lei Chen, Philip S. Yu
2012 The VLDB journal  
It covers the semantics of a broad class of dependencies in databases, including functional dependencies (fds), metric functional dependencies (mfds), and matching dependencies (mds).  ...  As we illustrated, comparable dependencies are useful in real practice of dataspaces, such as semantic query optimization.  ...  Figure 6a illustrates the incremental discovery of dependencies with the increase in functions.  ... 
doi:10.1007/s00778-012-0285-7 fatcat:ypssgl2kcbfwvloq4qtejxht44

Data dependencies for query optimization: a survey

Jan Kossmann, Thorsten Papenbrock, Felix Naumann
2021 The VLDB journal  
dependencies, such as functional, uniqueness, order, or inclusion dependencies.  ...  We consider the most popular types of data dependencies and focus on optimization strategies that target the optimization of relational database queries.  ...  Similar to the other types of data dependencies, the incremental discovery has also been studied for ODs. For example, a recent incremental discovery algorithm for pointwise ODs is IncPOD [119] .  ... 
doi:10.1007/s00778-021-00676-3 fatcat:gvmodrjh6vchldroysrtbfgqiu

Scalable incremental building with dynamic task dependencies

Gabriël Konat, Sebastian Erdweg, Eelco Visser
2018 Proceedings of the 33rd ACM/IEEE International Conference on Automated Software Engineering - ASE 2018  
Incremental build systems enable short feedback cycles when they capture dependencies precisely and selectively execute build tasks efficiently.  ...  Specifically, our algorithm accepts a set of changed files, transitively detects and re-executes affected build tasks, but also accounts for new task dependencies discovered during building.  ...  The validate function incrementally validates the correctness of the new dependency graph after executing a task t.  ... 
doi:10.1145/3238147.3238196 dblp:conf/kbse/KonatEV18 fatcat:nznnfq263jcujm26nqqwi6i5aa

Novel approach for predicting water alternating gas injection recovery factor

Lazreg Belazreg, Syed Mohammad Mahmood, Akmal Aulia
2019 Journal of Petroleum Exploration and Production Technology  
Predictive models that calculate WAG incremental recovery factor as a function of the input parameters were developed.  ...  The performance of WAG process is measured by its incremental recovery factor over secondary recovery.  ...  During the training, GMDH will use the input matrix of n observations and m+1 input variables (m x ij independent variables and one dependent variable Y i ).  ... 
doi:10.1007/s13202-019-0673-2 fatcat:3iu3ekkntjgbrlfowtllyhxzim

Lazy product discovery in huge configuration spaces

Michael Lienhardt, Ferruccio Damiani, Einar Broch Johnsen, Jacopo Mauro
2020 Proceedings of the ACM/IEEE 42nd International Conference on Software Engineering  
Furthermore, the method succeeds when more efficient, heuristics-based engines fail to find a valid configuration. 1 input : set of feature models 2 input : configuration 3 var = 4 var M ′ = compose( {  ...  The results show that lazy product discovery has significant performance benefits compared to standard product discovery, which in contrast to our method requires all fragments to be composed to analyze  ...  We thank the reviewers for constructive feedback, Thomas Thüm, Andrzej Wasowski and Sven Apel for useful discussions on the topic of this paper, and Simone Donetti for testing the publicly available artifact  ... 
doi:10.1145/3377811.3380372 dblp:conf/icse/LienhardtDJM20 fatcat:sq3vr2gs35aotjwf23vouoaqze

Lazy Product Discovery in Huge Configuration Spaces [article]

Michael Lienhardt, Ferruccio Damiani, Einar Broch Johnsen, Jacopo Mauro
2020 arXiv   pre-print
Furthermore, the method succeeds when more efficient, heuristics-based engines fail to find a valid configuration.  ...  Highly-configurable software systems can have thousands of interdependent configuration options across different subsystems.  ...  We thank the reviewers for constructive feedback, Thomas Thüm, Andrzej Wasowski and Sven Apel for useful discussions on the topic of this paper, and Simone Donetti for testing the publicly available artifact  ... 
arXiv:2003.07383v1 fatcat:ljdktjfv7bfkfedd7mp7mllhpu

New Product Development Process On High-Tech Innovation Life Cycle

Gonçalo G. Aleixo, Alexandra B. Tenera
2009 Zenodo  
It will reveal that radical and incremental innovations are complementary during the innovation life cycle and accomplished through distinct ways of developing new products.  ...  This paper proposes the inclusion of the organizational function areas that influence new product's development on the new product development process.  ...  In other words, the difference of the models presented by these NPD researchers and many other investigators depends on the aim and on the detail that each one requires for efficiently characterize the  ... 
doi:10.5281/zenodo.1071257 fatcat:w4hxrrdbbnc33mkz4vtthiyc3y

A SEMI-AUTOMATIC APPROACH FOR CONFOUNDING-AWARE SUBGROUP DISCOVERY

MARTIN ATZMUELLER, FRANK PUPPE, HANS-PETER BUSCHER
2009 International journal on artificial intelligence tools  
It can also be incrementally refined during the interactive analysis task after the automatic method has been applied, for example, based on new knowledge or findings.  ...  For instance, the quality of a subgroup may be confounded by other variables that are associated with the independent variables, and are a direct cause of the (dependent) target variable.  ...  For subgroup discovery the fast and effective SD-Map algorithm 2 was applied. During the experiments we utilized the relative gain quality function (cf.  ... 
doi:10.1142/s0218213009000056 fatcat:joxhvjgcrjff5nzp45loaz4zkm

Resource Discovery Using Spatio-temporal Information in Mobile Ad-Hoc Networks [chapter]

Ouri Wolfson, Bo Xu, Huabei Yin, Naphtali Rishe
2005 Lecture Notes in Computer Science  
We evaluate the value of resource information in terms of how much time is saved when using the information to discover resources, compared to the case when the information is not used.  ...  In this paper we examine the benefit of reports about resources in mobile ad-hoc networks.  ...  (eds), Third Edition, Higher Education Press, China, 2001. 3 An event sequence has stationary increments if the number of events during a time period depends only on the length of the time period and not  ... 
doi:10.1007/11599289_12 fatcat:wg4r4udmvbcjtgvr3f6kepyavm

Data profiling revisited

Felix Naumann
2014 SIGMOD record  
Individual research projects have proposed several additional profiling tasks, such as the discovery of inclusion dependencies or conditional functional dependencies.  ...  and uniqueness of columns, keys and foreign keys, and occasionally functional dependencies and association rules.  ...  Fan et al. focus on the area of conditional functional dependencies and also consider incremental updates [20] .  ... 
doi:10.1145/2590989.2590995 fatcat:npzfyqoqjbgfxdo4ewjjm565d4

Incremental Association Mining using a Closed-Set Lattice

Aaron Ceglar, John F. Roddick
2007 Journal of research and practice in information technology  
incorporating windowing functionality.  ...  This paper presents a novel approach to incremental association mining in which the maintenance of the set of frequent itemsets is based upon the evolution of a closed-set lattice.  ...  It provides two functions, the reduction (stripping) of I to eliminate unwanted elements and the discovery of all remaining emergent itemsets.  ... 
dblp:journals/acj/CeglarR07 fatcat:v7zu7n5ojje6ndly4jw4x5t6xa
« Previous Showing results 1 — 15 out of 62,046 results