Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Algorithms and Data Structures [[electronic resource] ] : 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings / / edited by Frank Dehne, Alejandro López-Ortiz, Jörg-Rüdiger Sack
| Algorithms and Data Structures [[electronic resource] ] : 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings / / edited by Frank Dehne, Alejandro López-Ortiz, Jörg-Rüdiger Sack |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XIV, 446 p.) |
| Disciplina | 005.7/3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Artificial intelligence—Data processing Computer science—Mathematics Discrete mathematics Computer graphics Numerical analysis Data Science Discrete Mathematics in Computer Science Computer Graphics Numerical Analysis |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Session 1 -- Towards a Theory of Algorithms -- Session 2A -- k-Restricted Rotation with an Application to Search Tree Rebalancing -- Heap Building Bounds -- Session 2B -- The Multi-radius Cover Problem -- Parameterized Complexity of Generalized Vertex Cover Problems -- The Complexity of Implicit and Space Efficient Priority Queues -- Analysis of a Class of Tries with Adaptive Multi-digit Branching -- Balanced Aspect Ratio Trees Revisited -- Session 3B -- Improved Combinatorial Group Testing for Real-World Problem Sizes -- Parameterized Counting Algorithms for General Graph Covering Problems -- Approximating the Online Set Multicover Problems via Randomized Winnowing -- Session 4A -- Max-stretch Reduction for Tree Spanners -- Succinct Representation of Triangulations with a Boundary -- Line-Segment Intersection Made In-Place -- Session 4B -- Improved Fixed-Parameter Algorithms for Two Feedback Set Problems -- Communication-Aware Processor Allocation for Supercomputers -- Dynamic Hotlinks -- Session 6A -- The Minimum-Area Spanning Tree Problem -- Hinged Dissection of Polypolyhedra -- Session 6B -- Convex Recolorings of Strings and Trees: Definitions, Hardness Results and Algorithms -- Linear Time Algorithms for Generalized Edge Dominating Set Problems -- Session 7A -- On Geometric Dilation and Halving Chords -- Orthogonal Subdivisions with Low Stabbing Numbers -- Kinetic and Dynamic Data Structures for Convex Hulls and Upper Envelopes -- Session 7B -- Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded Length -- A Dynamic Implicit Adjacency Labelling Scheme for Line Graphs -- The On-line Asymmetric Traveling Salesman Problem -- Session 8A -- All-Pairs Shortest Paths with Real Weights in O(n 3/log n) Time -- k-Link Shortest Paths in Weighted Subdivisions -- Power-Saving Scheduling for Weakly Dynamic Voltage Scaling Devices -- Session 8B -- Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems -- On the Vehicle Routing Problem -- Session 9A -- The Structure of Optimal Prefix-Free Codes in Restricted Languages: The Uniform Probability Case -- Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms -- Derandomization of Dimensionality Reduction and SDP Based Algorithms -- Session 9B -- Subquadratic Algorithms for 3SUM -- Near-Optimal Pricing in Near-Linear Time -- Improved Approximation Bounds for Planar Point Pattern Matching. |
| Record Nr. | UNISA-996465904403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and data structures : 9th international workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005 : proceedings / / Frank Dehne, Alejandro Lopez-Ortiz, Jorg-Rudiger Sack (eds.)
| Algorithms and data structures : 9th international workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005 : proceedings / / Frank Dehne, Alejandro Lopez-Ortiz, Jorg-Rudiger Sack (eds.) |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, 2005 |
| Descrizione fisica | 1 online resource (XIV, 446 p.) |
| Disciplina | 005.7/3 |
| Altri autori (Persone) |
DehneF <1960-> (Frank)
Lopez-OrtizAlejandro SackJ.-R <1954-> (Jorg-Rudiger) |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Data structures (Computer science)
Computer algorithms |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Session 1 -- Towards a Theory of Algorithms -- Session 2A -- k-Restricted Rotation with an Application to Search Tree Rebalancing -- Heap Building Bounds -- Session 2B -- The Multi-radius Cover Problem -- Parameterized Complexity of Generalized Vertex Cover Problems -- The Complexity of Implicit and Space Efficient Priority Queues -- Analysis of a Class of Tries with Adaptive Multi-digit Branching -- Balanced Aspect Ratio Trees Revisited -- Session 3B -- Improved Combinatorial Group Testing for Real-World Problem Sizes -- Parameterized Counting Algorithms for General Graph Covering Problems -- Approximating the Online Set Multicover Problems via Randomized Winnowing -- Session 4A -- Max-stretch Reduction for Tree Spanners -- Succinct Representation of Triangulations with a Boundary -- Line-Segment Intersection Made In-Place -- Session 4B -- Improved Fixed-Parameter Algorithms for Two Feedback Set Problems -- Communication-Aware Processor Allocation for Supercomputers -- Dynamic Hotlinks -- Session 6A -- The Minimum-Area Spanning Tree Problem -- Hinged Dissection of Polypolyhedra -- Session 6B -- Convex Recolorings of Strings and Trees: Definitions, Hardness Results and Algorithms -- Linear Time Algorithms for Generalized Edge Dominating Set Problems -- Session 7A -- On Geometric Dilation and Halving Chords -- Orthogonal Subdivisions with Low Stabbing Numbers -- Kinetic and Dynamic Data Structures for Convex Hulls and Upper Envelopes -- Session 7B -- Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded Length -- A Dynamic Implicit Adjacency Labelling Scheme for Line Graphs -- The On-line Asymmetric Traveling Salesman Problem -- Session 8A -- All-Pairs Shortest Paths with Real Weights in O(n 3/log n) Time -- k-Link Shortest Paths in Weighted Subdivisions -- Power-Saving Scheduling for Weakly Dynamic Voltage Scaling Devices -- Session 8B -- Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems -- On the Vehicle Routing Problem -- Session 9A -- The Structure of Optimal Prefix-Free Codes in Restricted Languages: The Uniform Probability Case -- Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms -- Derandomization of Dimensionality Reduction and SDP Based Algorithms -- Session 9B -- Subquadratic Algorithms for 3SUM -- Near-Optimal Pricing in Near-Linear Time -- Improved Approximation Bounds for Planar Point Pattern Matching. |
| Altri titoli varianti | WADS 2005 |
| Record Nr. | UNINA-9910483626003321 |
| Berlin ; ; New York, : Springer, 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms and Data Structures [[electronic resource] ] : Third Workshop, WADS '93, Montreal, Canada, August 11-13, 1993. Proceedings / / edited by Frank Dehne, Jörg-Rüdiger Sack, Nicola Santoro, Sue Whitesides
| Algorithms and Data Structures [[electronic resource] ] : Third Workshop, WADS '93, Montreal, Canada, August 11-13, 1993. Proceedings / / edited by Frank Dehne, Jörg-Rüdiger Sack, Nicola Santoro, Sue Whitesides |
| Edizione | [1st ed. 1993.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 |
| Descrizione fisica | 1 online resource (XII, 636 p.) |
| Disciplina | 005.7/3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Computer programming Mathematical analysis Analysis (Mathematics) Algorithms Combinatorics Theory of Computation Programming Techniques Analysis Algorithm Analysis and Problem Complexity Computation by Abstract Devices |
| ISBN | 3-540-47918-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Computing the all-pairs longest chains in the plane -- Towards a better understanding of pure packet routing -- Tolerating faults in meshes and other networks -- A generalization of binary search -- Groups and algebraic complexity -- Connected component and simple polygon intersection searching -- An optimal algorithm for finding the separation of simple polygons -- Balanced search trees made simple -- Probing a set of hyperplanes by lines and related problems -- A general lower bound on the I/O-complexity of comparison-based algorithms -- Point probe decision trees for geometric concept classes -- A dynamic separator algorithm -- Online load balancing of temporary tasks -- Connected domination and steiner set on asteroidal triple-free graphs -- The complexity of finding certain trees in tournaments -- Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract) -- Separating the power of EREW and CREW PRAMs with small communication width -- Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs -- Parallel construction of quadtrees and quality triangulations -- Pattern matching for permutations -- Filling polyhedral molds -- Deferred-query—An efficient approach for problems on interval and circular-arc graphs -- On the complexity of graph embeddings -- Algorithms for polytope covering and approximation -- Global strategies for augmenting the efficiency of TSP heuristics -- Static and dynamic algorithms for k-point clustering problems -- Scalable algorithms for bichromatic line segment intersection problems on Coarse Grained Multicomputers -- Persistence, randomization and parallelization: On some combinatorial games and their applications (abstract) -- The K-D heap: An efficient multi-dimensional priority queue -- A complete and efficient algorithm for the intersection of a general and a convex polyhedron -- Computing the smallest k-enclosing circle and related problems -- An index data structure for matrices, with applications to fast two-dimensional pattern matching -- A plane-sweep algorithm for the all-nearest-neighbors problem for a set of convex planar objects -- Further results on generalized intersection searching problems: Counting, reporting, and dynamization -- Generalized approximate algorithms for point set congruence -- Approximating shortest superstrings with constraints -- Tree reconstruction from partial orders -- Improved parallel depth-first search in undirected planar graphs -- On approximating the longest path in a graph -- Designing multi-commodity flow trees -- A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs -- On fat partitioning, fat covering and the union size of polygons -- A time-randomness tradeoff for selection in parallel -- Detecting race conditions in parallel programs that use one semaphore -- An algorithm for finding predecessors in integer sets -- The exhaustion of shared memory: Stochastic results -- Minimum weight euclidean matching and weighted relative neighborhood graphs -- Efficient approximate shortest-path queries among isothetic rectangular obstacles -- Counting and reporting red/blue segment intersections -- Repetitive hidden-surface-removal for polyhedral scenes -- On reconfigurability of VLSI linear arrays -- Reconstructing strings from substrings (Extended abstract) -- Combinatorial complexity of signed discs -- Fast algorithms for one-dimensionsal compaction with jog insertion -- An optimal algorithm for roundness determination on convex polygons -- Practical algorithms on partial k-trees with an application to domination-like problems -- Greedy algorithms for the on-line steiner tree and generalized steiner problems. |
| Record Nr. | UNISA-996465874003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Data Structures [[electronic resource] ] : 2nd Workshop, WADS '91, Ottawa, Canada, August 14-16, 1991. Proceedings / / edited by Frank Dehne, Jörg-Rüdiger Sack, Nicola Santoro
| Algorithms and Data Structures [[electronic resource] ] : 2nd Workshop, WADS '91, Ottawa, Canada, August 14-16, 1991. Proceedings / / edited by Frank Dehne, Jörg-Rüdiger Sack, Nicola Santoro |
| Edizione | [1st ed. 1991.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 |
| Descrizione fisica | 1 online resource (X, 502 p.) |
| Disciplina | 005.7/3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Algorithms
Computers Combinatorics Probabilities Statistics Information storage and retrieval Algorithm Analysis and Problem Complexity Computation by Abstract Devices Probability Theory and Stochastic Processes Statistics, general Information Storage and Retrieval |
| ISBN | 3-540-47566-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A case study in comparison based complexity: Finding the nearest value(s) -- On the zone of a surface in a hyperplane arrangement -- Ray-shooting and isotopy classes of lines in 3-dimensional space -- Finding level-ancestors in dynamic trees -- Treewidth of circular-arc graphs+ -- Fully dynamic delaunay triangulation in logarithmic expected time per operation -- On computing the voronoi diagram for restricted planar figures -- The MINSUMCUT problem -- Efficient algorithms for the minimum range cut problems -- Memory access in models of parallel computation: From folklore to synergy and beyond -- Farthest neighbors, maximum spanning trees and related problems in higher dimensions -- Shallow interdistance selection and interdistance enumeration -- Sharing memory in asynchronous message passing systems -- A linear-time scheme for version reconstruction -- The interval skip list: A data structure for finding all intervals that overlap a point -- Geometric knapsack problems -- A fast derandomization scheme and its applications -- Unstructured path problems and the making of semirings -- Neighborhood graphs and geometric embedding -- Finding optimal bipartitions of points and polygons -- Immobilizing a polytope -- What can we learn about suffix trees from independent tries? -- Competitive algorithms for the weighted list update problem -- An optimal algorithm for the rectilinear link center of a rectilinear polygon -- Geometric searching and link distance -- Representing and enumerating edge connectivity cuts in RNC -- Planar graph augmentation problems -- Parametric search and locating supply centers in trees -- On bends and lengths of rectilinear paths: A graph-theoretic approach -- Computing minimum length paths of a given homotopy class -- Approximation algorithms for selecting network centers -- Facility dispersion problems: Heuristics and special cases -- Optimum guard covers and m-watchmen routes for restricted polygons -- Applications of a new space partitioning technique -- Offline algorithms for dynamic minimum spanning tree problems -- An empirical analysis of algorithms for constructing a minimum spanning tree -- A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible -- Dynamically maintaining the visibility graph -- An optimal algorithm for computing visibility in the plane -- Fully persistent data structures for disjoint set union problems -- Algorithms for generating all spanning trees of undirected, directed and weighted graphs -- Sorting multisets and vectors in-place -- Probabilistic leader election on rings of known size. |
| Record Nr. | UNISA-996465671203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms –- ESA 2012 [[electronic resource] ] : 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings / / edited by Leah Epstein, Paolo Ferragina
| Algorithms –- ESA 2012 [[electronic resource] ] : 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings / / edited by Leah Epstein, Paolo Ferragina |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (XX, 839 p. 147 illus.) |
| Disciplina | 005.7/3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer networks Computer science—Mathematics Discrete mathematics Computer graphics Numerical analysis Artificial intelligence—Data processing Computer Communication Networks Discrete Mathematics in Computer Science Computer Graphics Numerical Analysis Data Science |
| ISBN | 3-642-33090-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithm engineering -- algorithmic aspects of networks -- algorithmic game theory -- approximation algorithms -- computational biology -- computational finance -- computational geometry -- combinatorial optimization -- data compression -- data structures.-databases and information retrieval -- distributed and parallel computing -- graph algorithms -- hierarchical memories -- heuristics and meta-heuristics -- mathematical programming -- mobile computing -- on-line algorithms -- parameterized complexity -- pattern matching, quantum computing -- randomized algorithms -- scheduling and resource allocation problems -- streaming algorithms. |
| Record Nr. | UNISA-996465557503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial maps : efficient data structures for computer graphics and image processing / / Guillaume Damiand, Pascal Lienhardt
| Combinatorial maps : efficient data structures for computer graphics and image processing / / Guillaume Damiand, Pascal Lienhardt |
| Autore | Damiand Guillaume |
| Edizione | [1st edition] |
| Pubbl/distr/stampa | Boca Raton : , : A.K. Peters/CRC Press, , [2015] |
| Descrizione fisica | 1 online resource (402 p.) |
| Disciplina |
005.7/3
005.73 |
| Soggetto topico |
Data structures (Compter science)
Image processing - Mathematics Computer graphics - Mathematics Combinatorial designs and configurations |
| ISBN |
0-429-17037-8
1-4822-0653-6 |
| Classificazione | COM012000TEC015000 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front Cover; Contents; Acknowledgements; List of Algorithms; List of Figures; 1. Introduction; 2. Preliminary Notions; 3. Intuitive Presentation; 4. n-Gmaps; 5. n-maps; 6. Operations; 7. Embedding for Geometric Modeling and Image Processing; 8. Cellular Structures as Structured Simplicial Structures; 9. Comparison with Other Cellular Data Structures; 10. Concluding Remarks; Bibliography |
| Record Nr. | UNINA-9910787962403321 |
Damiand Guillaume
|
||
| Boca Raton : , : A.K. Peters/CRC Press, , [2015] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
The Decision Maker's Handbook to Data Science : AI and Data Science for Non-Technical Executives, Managers, and Founders / / by Stylianos Kampakis
| The Decision Maker's Handbook to Data Science : AI and Data Science for Non-Technical Executives, Managers, and Founders / / by Stylianos Kampakis |
| Autore | Kampakis Stylianos |
| Edizione | [3rd ed. 2024.] |
| Pubbl/distr/stampa | Berkeley, CA : , : Apress : , : Imprint : Apress, , 2024 |
| Descrizione fisica | 1 online resource (189 pages) |
| Disciplina | 005.7/3 |
| Soggetto topico |
Decision making - Data processing
Artificial intelligence Big data Database management |
| ISBN |
9798868802799
9798868802782 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Chapter 1: Demystifying Data Science, AI and All the Other Buzzwords -- Chapter 2: Data Management -- Chapter 3: Data Collection Problems -- Chapter 4: How to Keep Data Tidy -- Chapter 5: Thinking like a Data Scientist (Without Being One) -- Chapter 6: A Short Introduction to Statistics -- Chapter 7: A Short Introduction to Machine Learning -- Chapter 8: An introduction to AI -- Chapter 9: Problem Solving -- Chapter 10: Pitfalls -- Chapter 11: Hiring and Managing Data Scientists -- Chapter 12: Building a Data-Driven Culture -- Chapter 13: AI Ethics -- Chapter 14: The Future of AI and Data Science. Epilogue: Data Science Rules the World -- Appendix: Tools for Data Science. |
| Record Nr. | UNINA-9910869161403321 |
|
Kampakis Stylianos
|
||
| Berkeley, CA : , : Apress : , : Imprint : Apress, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Measuring data quality for ongoing improvement [[electronic resource] ] : a data quality assessment framework / / Laura Sebastian-Coleman
| Measuring data quality for ongoing improvement [[electronic resource] ] : a data quality assessment framework / / Laura Sebastian-Coleman |
| Autore | Sebastian-Coleman Laura (Data quality author and practitioner) |
| Edizione | [1st edition] |
| Pubbl/distr/stampa | Waltham, Mass., : Elsevier, 2013 |
| Descrizione fisica | 1 online resource (404 p.) |
| Disciplina | 005.7/3 |
| Collana | The Morgan Kaufmann Series on Business Intelligence |
| Soggetto topico |
Data structures (Computer science)
Databases - Quality control |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-283-93318-7
0-12-397754-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Front Cover; Measuring Data Quality for Ongoing Improvement; Copyright Page; Contents; Acknowledgments; Foreword; Author Biography; Data Quality Measurement: the Problem we are Trying to Solve; Introduction: Measuring Data Quality for Ongoing Improvement; Recurring Challenges in the Context of Data Quality; Definitions of Data Quality; Expectations about Data; Risks to Data; The Criticality of Metadata and Explicit Knowledge; The Business/Information Technology Divide; Data Quality Strategy; DQAF: the Data Quality Assessment Framework
Overview of Measuring Data Quality for Ongoing Improvement Section One: Concepts and Definitions; Section Two: DQAF Overview; Section Three: Data Assessment Scenarios; Section Four: Applying the DQAF to Data Requirements; Section Five: Data Quality Strategy; Section Six: the DQAF in Depth; Intended Audience; What Measuring Data Quality for Ongoing Improvement Does Not Do; Why I Wrote Measuring Data Quality for Ongoing Improvement; 1: Concepts and Definitions; 1 Data; Purpose; Data; Data as Representation; The Implications of Data's Semiotic Function; Semiotics and Data Quality; Data as Facts Data as a Product Data as Input to Analyses; Data and Expectations; Information; Concluding Thoughts; 2 Data, People, and Systems; Purpose; Enterprise or Organization; IT and the Business; Data Producers; Data Consumers; Data Brokers; Data Stewards and Data Stewardship; Data Owners; Data Ownership and Data Governance; IT, the Business, and Data Owners, Redux; Data Quality Program Team; Stakeholder; Systems and System Design; Concluding Thoughts; 3 Data Management, Models, and Metadata; Purpose; Data Management; Database, Data Warehouse, Data Asset, Dataset Source System, Target System, System of Record Data Models; Types of Data Models; Physical Characteristics of Data; Metadata; Metadata as Explicit Knowledge; Data Chain and Information Life Cycle; Data Lineage and Data Provenance; Concluding Thoughts; 4 Data Quality and Measurement; Purpose; Data Quality; Data Quality Dimensions; Measurement; Measurement as Data; Data Quality Measurement and the Business/IT Divide; Characteristics of Effective Measurements; Measurements must be Comprehensible and Interpretable; Measurements must be Reproducible; Measurements must be Purposeful Data Quality Assessment Data Quality Dimensions, DQAF Measurement Types, Specific Data Quality Metrics; Data Profiling; Data Quality Issues and Data Issue Management; Reasonability Checks; Data Quality Thresholds; Process Controls; In-line Data Quality Measurement and Monitoring; Concluding Thoughts; 2: DQAF Concepts and Measurement Types; 5 DQAF Concepts; Purpose; The Problem the DQAF Addresses; Data Quality Expectations and Data Management; The Scope of the DQAF; DQAF Quality Dimensions; Completeness; Timeliness; Validity; Consistency; Integrity; The Question of Accuracy Defining DQAF Measurement Types |
| Record Nr. | UNINA-9910463018203321 |
|
Sebastian-Coleman Laura (Data quality author and practitioner)
|
||
| Waltham, Mass., : Elsevier, 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Measuring data quality for ongoing improvement : a data quality assessment framework / / Laura Sebastian-Coleman
| Measuring data quality for ongoing improvement : a data quality assessment framework / / Laura Sebastian-Coleman |
| Autore | Sebastian-Coleman Laura (Data quality author and practitioner) |
| Edizione | [1st edition] |
| Pubbl/distr/stampa | Waltham, Mass., : Elsevier, 2013 |
| Descrizione fisica | 1 online resource (xxxix, 324, 39 pages) : color illustrations |
| Disciplina | 005.7/3 |
| Collana | The Morgan Kaufmann Series on Business Intelligence |
| Soggetto topico |
Data structures (Computer science)
Databases - Quality control |
| ISBN |
1-283-93318-7
0-12-397754-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Front Cover; Measuring Data Quality for Ongoing Improvement; Copyright Page; Contents; Acknowledgments; Foreword; Author Biography; Data Quality Measurement: the Problem we are Trying to Solve; Introduction: Measuring Data Quality for Ongoing Improvement; Recurring Challenges in the Context of Data Quality; Definitions of Data Quality; Expectations about Data; Risks to Data; The Criticality of Metadata and Explicit Knowledge; The Business/Information Technology Divide; Data Quality Strategy; DQAF: the Data Quality Assessment Framework
Overview of Measuring Data Quality for Ongoing Improvement Section One: Concepts and Definitions; Section Two: DQAF Overview; Section Three: Data Assessment Scenarios; Section Four: Applying the DQAF to Data Requirements; Section Five: Data Quality Strategy; Section Six: the DQAF in Depth; Intended Audience; What Measuring Data Quality for Ongoing Improvement Does Not Do; Why I Wrote Measuring Data Quality for Ongoing Improvement; 1: Concepts and Definitions; 1 Data; Purpose; Data; Data as Representation; The Implications of Data's Semiotic Function; Semiotics and Data Quality; Data as Facts Data as a Product Data as Input to Analyses; Data and Expectations; Information; Concluding Thoughts; 2 Data, People, and Systems; Purpose; Enterprise or Organization; IT and the Business; Data Producers; Data Consumers; Data Brokers; Data Stewards and Data Stewardship; Data Owners; Data Ownership and Data Governance; IT, the Business, and Data Owners, Redux; Data Quality Program Team; Stakeholder; Systems and System Design; Concluding Thoughts; 3 Data Management, Models, and Metadata; Purpose; Data Management; Database, Data Warehouse, Data Asset, Dataset Source System, Target System, System of Record Data Models; Types of Data Models; Physical Characteristics of Data; Metadata; Metadata as Explicit Knowledge; Data Chain and Information Life Cycle; Data Lineage and Data Provenance; Concluding Thoughts; 4 Data Quality and Measurement; Purpose; Data Quality; Data Quality Dimensions; Measurement; Measurement as Data; Data Quality Measurement and the Business/IT Divide; Characteristics of Effective Measurements; Measurements must be Comprehensible and Interpretable; Measurements must be Reproducible; Measurements must be Purposeful Data Quality Assessment Data Quality Dimensions, DQAF Measurement Types, Specific Data Quality Metrics; Data Profiling; Data Quality Issues and Data Issue Management; Reasonability Checks; Data Quality Thresholds; Process Controls; In-line Data Quality Measurement and Monitoring; Concluding Thoughts; 2: DQAF Concepts and Measurement Types; 5 DQAF Concepts; Purpose; The Problem the DQAF Addresses; Data Quality Expectations and Data Management; The Scope of the DQAF; DQAF Quality Dimensions; Completeness; Timeliness; Validity; Consistency; Integrity; The Question of Accuracy Defining DQAF Measurement Types |
| Record Nr. | UNINA-9910786101103321 |
|
Sebastian-Coleman Laura (Data quality author and practitioner)
|
||
| Waltham, Mass., : Elsevier, 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Measuring data quality for ongoing improvement : a data quality assessment framework / / Laura Sebastian-Coleman
| Measuring data quality for ongoing improvement : a data quality assessment framework / / Laura Sebastian-Coleman |
| Autore | Sebastian-Coleman Laura (Data quality author and practitioner) |
| Edizione | [1st edition] |
| Pubbl/distr/stampa | Waltham, Mass., : Elsevier, 2013 |
| Descrizione fisica | 1 online resource (xxxix, 324, 39 pages) : color illustrations |
| Disciplina | 005.7/3 |
| Collana | The Morgan Kaufmann Series on Business Intelligence |
| Soggetto topico |
Data structures (Computer science)
Databases - Quality control |
| ISBN |
1-283-93318-7
0-12-397754-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Front Cover; Measuring Data Quality for Ongoing Improvement; Copyright Page; Contents; Acknowledgments; Foreword; Author Biography; Data Quality Measurement: the Problem we are Trying to Solve; Introduction: Measuring Data Quality for Ongoing Improvement; Recurring Challenges in the Context of Data Quality; Definitions of Data Quality; Expectations about Data; Risks to Data; The Criticality of Metadata and Explicit Knowledge; The Business/Information Technology Divide; Data Quality Strategy; DQAF: the Data Quality Assessment Framework
Overview of Measuring Data Quality for Ongoing Improvement Section One: Concepts and Definitions; Section Two: DQAF Overview; Section Three: Data Assessment Scenarios; Section Four: Applying the DQAF to Data Requirements; Section Five: Data Quality Strategy; Section Six: the DQAF in Depth; Intended Audience; What Measuring Data Quality for Ongoing Improvement Does Not Do; Why I Wrote Measuring Data Quality for Ongoing Improvement; 1: Concepts and Definitions; 1 Data; Purpose; Data; Data as Representation; The Implications of Data's Semiotic Function; Semiotics and Data Quality; Data as Facts Data as a Product Data as Input to Analyses; Data and Expectations; Information; Concluding Thoughts; 2 Data, People, and Systems; Purpose; Enterprise or Organization; IT and the Business; Data Producers; Data Consumers; Data Brokers; Data Stewards and Data Stewardship; Data Owners; Data Ownership and Data Governance; IT, the Business, and Data Owners, Redux; Data Quality Program Team; Stakeholder; Systems and System Design; Concluding Thoughts; 3 Data Management, Models, and Metadata; Purpose; Data Management; Database, Data Warehouse, Data Asset, Dataset Source System, Target System, System of Record Data Models; Types of Data Models; Physical Characteristics of Data; Metadata; Metadata as Explicit Knowledge; Data Chain and Information Life Cycle; Data Lineage and Data Provenance; Concluding Thoughts; 4 Data Quality and Measurement; Purpose; Data Quality; Data Quality Dimensions; Measurement; Measurement as Data; Data Quality Measurement and the Business/IT Divide; Characteristics of Effective Measurements; Measurements must be Comprehensible and Interpretable; Measurements must be Reproducible; Measurements must be Purposeful Data Quality Assessment Data Quality Dimensions, DQAF Measurement Types, Specific Data Quality Metrics; Data Profiling; Data Quality Issues and Data Issue Management; Reasonability Checks; Data Quality Thresholds; Process Controls; In-line Data Quality Measurement and Monitoring; Concluding Thoughts; 2: DQAF Concepts and Measurement Types; 5 DQAF Concepts; Purpose; The Problem the DQAF Addresses; Data Quality Expectations and Data Management; The Scope of the DQAF; DQAF Quality Dimensions; Completeness; Timeliness; Validity; Consistency; Integrity; The Question of Accuracy Defining DQAF Measurement Types |
| Record Nr. | UNINA-9910810784503321 |
|
Sebastian-Coleman Laura (Data quality author and practitioner)
|
||
| Waltham, Mass., : Elsevier, 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
