Angebote zu "Oracle" (42 Treffer)

Kategorien

Shops

SQL Server 2019 Revealed
28,99 € *
ggf. zzgl. Versand

Get up to speed on the game-changing developments in SQL Server 2019. No longer just a database engine, SQL Server 2019 is cutting edge with support for machine learning (ML), big data analytics, Linux, containers, Kubernetes, Java, and data virtualization to Azure. This is not a book on traditional database administration for SQL Server. It focuses on all that is new for one of the most successful modernized data platforms in the industry. It is a book for data professionals who already know the fundamentals of SQL Server and want to up their game by building their skills in some of the hottest new areas in technology. SQL Server 2019 Revealed begins with a look at the project's team goal to integrate the world of big data with SQL Server into a major product release. The book then dives into the details of key new capabilities in SQL Server 2019 using a "learn by example" approach for Intelligent Performance, security, mission-critical availability, and features for the modern developer. Also covered are enhancements to SQL Server 2019 for Linux and gain a comprehensive look at SQL Server using containers and Kubernetes clusters. The book concludes by showing you how to virtualize your data access with Polybase to Oracle, MongoDB, Hadoop, and Azure, allowing you to reduce the need for expensive extract, transform, and load (ETL) applications. You will then learn how to take your knowledge of containers, Kubernetes, and Polybase to build a comprehensive solution called Big Data Clusters, which is a marquee feature of 2019. You will also learn how to gain access to Spark, SQL Server, and HDFS to build intelligence over your own data lake and deploy end-to-end machine learning applications. What You Will Learn Implement Big Data Clusters with SQL Server, Spark, and HDFS Create a Data Hub with connections to Oracle, Azure, Hadoop, and other sources Combine SQL and Spark to build a machine learning platform for AI applications Boost your performance with no application changes using Intelligent Performance Increase security of your SQL Server through Secure Enclaves and Data Classification Maximize database uptime through online indexing and Accelerated Database Recovery Build new modern applications with Graph, ML Services, and T-SQL Extensibility with Java Improve your ability to deploy SQL Server on Linux Gain in-depth knowledge to run SQL Server with containers and Kubernetes Know all the new database engine features for performance, usability, and diagnostics Use the latest tools and methods to migrate your database to SQL Server 2019 Apply your knowledge of SQL Server 2019 to Azure Who This Book Is For IT professionals and developers who understand the fundamentals of SQL Server and wish to focus on learning about the new, modern capabilities of SQL Server 2019. The book is for those who want to learn about SQL Server 2019 and the new Big Data Clusters and AI feature set, support for machine learning and Java, how to run SQL Server with containers and Kubernetes, and increased capabilities around Intelligent Performance, advanced security, and high availability.

Anbieter: buecher
Stand: 25.05.2020
Zum Angebot
SQL Server 2019 Revealed
28,99 € *
ggf. zzgl. Versand

Get up to speed on the game-changing developments in SQL Server 2019. No longer just a database engine, SQL Server 2019 is cutting edge with support for machine learning (ML), big data analytics, Linux, containers, Kubernetes, Java, and data virtualization to Azure. This is not a book on traditional database administration for SQL Server. It focuses on all that is new for one of the most successful modernized data platforms in the industry. It is a book for data professionals who already know the fundamentals of SQL Server and want to up their game by building their skills in some of the hottest new areas in technology. SQL Server 2019 Revealed begins with a look at the project's team goal to integrate the world of big data with SQL Server into a major product release. The book then dives into the details of key new capabilities in SQL Server 2019 using a "learn by example" approach for Intelligent Performance, security, mission-critical availability, and features for the modern developer. Also covered are enhancements to SQL Server 2019 for Linux and gain a comprehensive look at SQL Server using containers and Kubernetes clusters. The book concludes by showing you how to virtualize your data access with Polybase to Oracle, MongoDB, Hadoop, and Azure, allowing you to reduce the need for expensive extract, transform, and load (ETL) applications. You will then learn how to take your knowledge of containers, Kubernetes, and Polybase to build a comprehensive solution called Big Data Clusters, which is a marquee feature of 2019. You will also learn how to gain access to Spark, SQL Server, and HDFS to build intelligence over your own data lake and deploy end-to-end machine learning applications. What You Will Learn Implement Big Data Clusters with SQL Server, Spark, and HDFS Create a Data Hub with connections to Oracle, Azure, Hadoop, and other sources Combine SQL and Spark to build a machine learning platform for AI applications Boost your performance with no application changes using Intelligent Performance Increase security of your SQL Server through Secure Enclaves and Data Classification Maximize database uptime through online indexing and Accelerated Database Recovery Build new modern applications with Graph, ML Services, and T-SQL Extensibility with Java Improve your ability to deploy SQL Server on Linux Gain in-depth knowledge to run SQL Server with containers and Kubernetes Know all the new database engine features for performance, usability, and diagnostics Use the latest tools and methods to migrate your database to SQL Server 2019 Apply your knowledge of SQL Server 2019 to Azure Who This Book Is For IT professionals and developers who understand the fundamentals of SQL Server and wish to focus on learning about the new, modern capabilities of SQL Server 2019. The book is for those who want to learn about SQL Server 2019 and the new Big Data Clusters and AI feature set, support for machine learning and Java, how to run SQL Server with containers and Kubernetes, and increased capabilities around Intelligent Performance, advanced security, and high availability.

Anbieter: buecher
Stand: 25.05.2020
Zum Angebot
Algorithm Design: Pearson New International Edi...
84,99 € *
ggf. zzgl. Versand

August 6, 2009 Author, Jon Kleinberg, was recently cited in the New York Times for his statistical analysis research in the Internet age. Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. The book teaches students a range of design and analysis techniques for problems that arise in computing applications. The text encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science. Features + Benefits Focus on problem analysis and design techniques. Discussion is grounded in concrete problems and examples rather than abstract presentation of principles, with representative problems woven throughout the text. Over 200 well crafted problems from companies such as Yahoo!® and Oracle®. Each problem has been class tested for usefulness and accuracy in the authors' own undergraduate algorithms courses. Broad coverage of algorithms for dealing with NP-hard problems and the application of randomization, increasingly important topics in algorithms. Algorithm DesignJon Kleinberg and Eva TardosTable of Contents 1 Introduction: Some Representative Problems 1.1 A First Problem: Stable Matching 1.2 Five Representative Problems Solved ExercisesExcercisesNotes and Further Reading2 Basics of Algorithms Analysis 2.1 Computational Tractability 2.2 Asymptotic Order of Growth Notation 2.3 Implementing the Stable Matching Algorithm using Lists and Arrays 2.4 A Survey of Common Running Times 2.5 A More Complex Data Structure: Priority Queues Solved Exercises Exercises Notes and Further Reading3 Graphs 3.1 Basic Definitions and Applications 3.2 Graph Connectivity and Graph Traversal 3.3 Implementing Graph Traversal using Queues and Stacks 3.4 Testing Bipartiteness: An Application of Breadth-First Search 3.5 Connectivity in Directed Graphs 3.6 Directed Acyclic Graphs and Topological Ordering Solved Exercises Exercises Notes and Further Reading 4 Divide and Conquer 4.1 A First Recurrence: The Mergesort Algorithm 4.2 Further Recurrence Relations 4.3 Counting Inversions 4.4 Finding the Closest Pair of Points 4.5 Integer Multiplication 4.6 Convolutions and The Fast Fourier Transform Solved Exercises Exercises Notes and Further Reading5 Greedy Algorithms 5.1 Interval Scheduling: The Greedy Algorithm Stays Ahead 5.2 Scheduling to Minimize Lateness: An Exchange Argument 5.3 Optimal Caching: A More Complex Exchange Argument 5.4 Shortest Paths in a Graph 5.5 The Minimum Spanning Tree Problem 5.6 Implementing Kruskal's Algorithm: The Union-Find Data Structure 5.7 Clustering 5.8 Huffman Codes and the Problem of Data Compression*5.9 Minimum-Cost Arborescences: A Multi-Phase Greedy Algorithm Solved Exercises Excercises Notes and Further Reading 6 Dynamic Programming 6.1 Weighted Interval Scheduling: A Recursive Procedure 6.2 Weighted Interval Scheduling: Iterating over Sub-Problems 6.3 Segmented Least Squares: Multi-way Choices 6.4 Subset Sums and Knapsacks: Adding a Variable 6.5 RNA Secondary Structure: Dynamic Programming Over Intervals 6.6 Sequence Alignment 6.7 Sequence Alignment in Linear Space 6.8 Shortest Paths in a Graph 6.9 Shortest Paths and Distance Vector Protocols *6.10 Negative Cycles in a Graph Solved ExercisesExercisesNotes and Further Reading7 Network Flow 7.1 The Maximum Flow Problem and the Ford-Fulkerson Algorithm 7.2 Maximum Flows and Minimum Cuts in a Network 7.3 Choosing Good Augmenting Paths *7.4 The Preflow-Push Maximum Flow Algorithm 7.5 A First Application: The Bipartite Matching Problem 7.6 Disjoint Paths in Directed and Undirected Graphs 7.7 Extensions to the Maximum Flow Problem 7.8 Survey Design 7.9 Airline Scheduling 7.10 Image Segmentation 7.11 Project Selection 7.12 Baseball Elimination *7.13 A Further Direction: Adding Costs to the Matching Problem Solved ExercisesExercisesNotes and Further Reading 8 NP and Computational Intractability 8.1 Polynomial-Time Reductions 8.2 Reductions via "Gadgets": The Satisfiability Problem 8.3 Efficient Certification and the Definition of NP 8.4 NP-Complete Problems 8.5 Sequencing Problems 8.6 Partitioning Problems 8.7 Graph Coloring8.8 Numerical Problems 8.9 Co-NP and the Asymmetry of NP8.10 A Partial Taxonomy of Hard Problems Solved Exercises Exercises Notes and Further Reading9 PSPACE: A Class of Problems Beyond NP9.1 PSPACE 9.2 Some Hard Problems in PSPACE 9.3 Solving Quantified Problems and Games in Polynomial Space9.4 Solving the Planning Problem in Polynomial Space9.5 Proving Problems PSPACE-Complete Solved ExercisesExercisesNotes and Further Reading 10 Extending the Limits of Tractability 10.1 Finding Small Vertex Covers 10.2 Solving NP-Hard Problem on Trees 10.3 Coloring a Set of Circular Arcs *10.4 Tree Decompositions of Graphs *10.5 Constructing a Tree Decomposition Solved Exercises Exercises Notes and Further Reading11 Approximation Algorithms 11.1 Greedy Algorithms and Bounds on the Optimum: A Load Balancing Problem 11.2 The Center Selection Problem 11.3 Set Cover: A General Greedy Heuristic 11.4 The Pricing Method: Vertex Cover 11.5 Maximization via the Pricing method: The Disjoint Paths Problem 11.6 Linear Programming and Rounding: An Application to Vertex Cover *11.7 Load Balancing Revisited: A More Advanced LP Application 11.8 Arbitrarily Good Approximations: the Knapsack Problem Solved ExercisesExercisesNotes and Further Reading 12 Randomized Algorithms 12.1 A First Application: Contention Resolution 12.2 Finding the Global Minimum Cut 12.3 Random Variables and their Expectations 12.4 A Randomized Approximation Algorithm for MAX 3-SAT 12.5 Randomized Divide-and-Conquer: Median-Finding and Quicksort 12.6 Hashing: A Randomized Implementation of Dictionaries 12.7 Finding the Closest Pair of Points: A Randomized Approach 12.8 Randomized Caching 12.9 Chernoff Bounds 12.10 Load Balancing *12.11 Packet Routing 12.12 Background: Some Basic Probability DefinitionsSolved ExercisesExercisesNotes and Further Reading 13 Local Search 13.1 The Landscape of an Optimization Problem 13.2 The Metropolis Algorithm and Simulated Annealing 13.3 An Application of Local Search to Hopfield Neural Networks 13.4 Maximum Cut Approximation via Local Search 13.5 Choosing a Neighbor Relation *13.6 Classification via Local Search 13.7 Best-Response Dynamics and Nash EquilibriaSolved ExercisesExercisesNotes aAugust 6, 2009 Author, Jon Kleinberg, was recently cited in the for his statistical analysis research in the Internet age. Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. The book teaches students a range of design and analysis techniques for problems that arise in computing applications. The text encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science.

Anbieter: buecher
Stand: 25.05.2020
Zum Angebot
Algorithm Design: Pearson New International Edi...
84,99 € *
ggf. zzgl. Versand

August 6, 2009 Author, Jon Kleinberg, was recently cited in the New York Times for his statistical analysis research in the Internet age. Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. The book teaches students a range of design and analysis techniques for problems that arise in computing applications. The text encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science. Features + Benefits Focus on problem analysis and design techniques. Discussion is grounded in concrete problems and examples rather than abstract presentation of principles, with representative problems woven throughout the text. Over 200 well crafted problems from companies such as Yahoo!® and Oracle®. Each problem has been class tested for usefulness and accuracy in the authors' own undergraduate algorithms courses. Broad coverage of algorithms for dealing with NP-hard problems and the application of randomization, increasingly important topics in algorithms. Algorithm DesignJon Kleinberg and Eva TardosTable of Contents 1 Introduction: Some Representative Problems 1.1 A First Problem: Stable Matching 1.2 Five Representative Problems Solved ExercisesExcercisesNotes and Further Reading2 Basics of Algorithms Analysis 2.1 Computational Tractability 2.2 Asymptotic Order of Growth Notation 2.3 Implementing the Stable Matching Algorithm using Lists and Arrays 2.4 A Survey of Common Running Times 2.5 A More Complex Data Structure: Priority Queues Solved Exercises Exercises Notes and Further Reading3 Graphs 3.1 Basic Definitions and Applications 3.2 Graph Connectivity and Graph Traversal 3.3 Implementing Graph Traversal using Queues and Stacks 3.4 Testing Bipartiteness: An Application of Breadth-First Search 3.5 Connectivity in Directed Graphs 3.6 Directed Acyclic Graphs and Topological Ordering Solved Exercises Exercises Notes and Further Reading 4 Divide and Conquer 4.1 A First Recurrence: The Mergesort Algorithm 4.2 Further Recurrence Relations 4.3 Counting Inversions 4.4 Finding the Closest Pair of Points 4.5 Integer Multiplication 4.6 Convolutions and The Fast Fourier Transform Solved Exercises Exercises Notes and Further Reading5 Greedy Algorithms 5.1 Interval Scheduling: The Greedy Algorithm Stays Ahead 5.2 Scheduling to Minimize Lateness: An Exchange Argument 5.3 Optimal Caching: A More Complex Exchange Argument 5.4 Shortest Paths in a Graph 5.5 The Minimum Spanning Tree Problem 5.6 Implementing Kruskal's Algorithm: The Union-Find Data Structure 5.7 Clustering 5.8 Huffman Codes and the Problem of Data Compression*5.9 Minimum-Cost Arborescences: A Multi-Phase Greedy Algorithm Solved Exercises Excercises Notes and Further Reading 6 Dynamic Programming 6.1 Weighted Interval Scheduling: A Recursive Procedure 6.2 Weighted Interval Scheduling: Iterating over Sub-Problems 6.3 Segmented Least Squares: Multi-way Choices 6.4 Subset Sums and Knapsacks: Adding a Variable 6.5 RNA Secondary Structure: Dynamic Programming Over Intervals 6.6 Sequence Alignment 6.7 Sequence Alignment in Linear Space 6.8 Shortest Paths in a Graph 6.9 Shortest Paths and Distance Vector Protocols *6.10 Negative Cycles in a Graph Solved ExercisesExercisesNotes and Further Reading7 Network Flow 7.1 The Maximum Flow Problem and the Ford-Fulkerson Algorithm 7.2 Maximum Flows and Minimum Cuts in a Network 7.3 Choosing Good Augmenting Paths *7.4 The Preflow-Push Maximum Flow Algorithm 7.5 A First Application: The Bipartite Matching Problem 7.6 Disjoint Paths in Directed and Undirected Graphs 7.7 Extensions to the Maximum Flow Problem 7.8 Survey Design 7.9 Airline Scheduling 7.10 Image Segmentation 7.11 Project Selection 7.12 Baseball Elimination *7.13 A Further Direction: Adding Costs to the Matching Problem Solved ExercisesExercisesNotes and Further Reading 8 NP and Computational Intractability 8.1 Polynomial-Time Reductions 8.2 Reductions via "Gadgets": The Satisfiability Problem 8.3 Efficient Certification and the Definition of NP 8.4 NP-Complete Problems 8.5 Sequencing Problems 8.6 Partitioning Problems 8.7 Graph Coloring8.8 Numerical Problems 8.9 Co-NP and the Asymmetry of NP8.10 A Partial Taxonomy of Hard Problems Solved Exercises Exercises Notes and Further Reading9 PSPACE: A Class of Problems Beyond NP9.1 PSPACE 9.2 Some Hard Problems in PSPACE 9.3 Solving Quantified Problems and Games in Polynomial Space9.4 Solving the Planning Problem in Polynomial Space9.5 Proving Problems PSPACE-Complete Solved ExercisesExercisesNotes and Further Reading 10 Extending the Limits of Tractability 10.1 Finding Small Vertex Covers 10.2 Solving NP-Hard Problem on Trees 10.3 Coloring a Set of Circular Arcs *10.4 Tree Decompositions of Graphs *10.5 Constructing a Tree Decomposition Solved Exercises Exercises Notes and Further Reading11 Approximation Algorithms 11.1 Greedy Algorithms and Bounds on the Optimum: A Load Balancing Problem 11.2 The Center Selection Problem 11.3 Set Cover: A General Greedy Heuristic 11.4 The Pricing Method: Vertex Cover 11.5 Maximization via the Pricing method: The Disjoint Paths Problem 11.6 Linear Programming and Rounding: An Application to Vertex Cover *11.7 Load Balancing Revisited: A More Advanced LP Application 11.8 Arbitrarily Good Approximations: the Knapsack Problem Solved ExercisesExercisesNotes and Further Reading 12 Randomized Algorithms 12.1 A First Application: Contention Resolution 12.2 Finding the Global Minimum Cut 12.3 Random Variables and their Expectations 12.4 A Randomized Approximation Algorithm for MAX 3-SAT 12.5 Randomized Divide-and-Conquer: Median-Finding and Quicksort 12.6 Hashing: A Randomized Implementation of Dictionaries 12.7 Finding the Closest Pair of Points: A Randomized Approach 12.8 Randomized Caching 12.9 Chernoff Bounds 12.10 Load Balancing *12.11 Packet Routing 12.12 Background: Some Basic Probability DefinitionsSolved ExercisesExercisesNotes and Further Reading 13 Local Search 13.1 The Landscape of an Optimization Problem 13.2 The Metropolis Algorithm and Simulated Annealing 13.3 An Application of Local Search to Hopfield Neural Networks 13.4 Maximum Cut Approximation via Local Search 13.5 Choosing a Neighbor Relation *13.6 Classification via Local Search 13.7 Best-Response Dynamics and Nash EquilibriaSolved ExercisesExercisesNotes aAugust 6, 2009 Author, Jon Kleinberg, was recently cited in the for his statistical analysis research in the Internet age. Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. The book teaches students a range of design and analysis techniques for problems that arise in computing applications. The text encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science.

Anbieter: buecher
Stand: 25.05.2020
Zum Angebot
Apress Expert Oracle Database Architecture Soft...
53,49 € *
ggf. zzgl. Versand

Now in its second edition, this best-selling book by Tom Kyte of "Ask Tom" fame continues to bring you some of the best thinking on how to apply Oracle Database to produce scalable applications that perform well and deliver correct results. Tom has a simple philosophy: you can treat Oracle as a black box and just stick data into it or you can understand how it works and exploit it as a powerful computing environment. If you choose the latter, then you’ll find that there are few information management problems that you cannot solve quickly and elegantly. This fully revised second edition covers the developments up to Oracle Database 11g. Each feature is taught in a proof-by-example manner, not only discussing what it is, but also how it works, how to implement software using it, and the common pitfalls associated with it. Don’t treat Oracle Database as a black-box. Get this book. Get under the hood. Turbo-charge your career. - Fully revised to cover Oracle Database 11g - Proof-by-example approach: Let the evidence be your guide - Dives deeply into Oracle Databases’s most powerful features What you’ll learn - Develop an evidence-based approach to problem solving - Manage transactions in highly concurrent environments - Speed access to data through table and index design - Manage files and memory structures for performance and reliability - Scale up through partitioning and parallel processing - Load and unload data to interface with external systems - Think for yourself, don’t take Tom’s word for it! Who this book is for This book is aimed at Oracle Database administrators, at PL/SQL and Java developers writing code to be deployed inside the database, and at developers of external applications who use Oracle Database as a data store. It is the go-to book for those wishing to create efficient and scalable applications.

Anbieter: Dodax
Stand: 25.05.2020
Zum Angebot
Apress Expert Oracle GoldenGate Software-Handbu...
62,01 € *
ggf. zzgl. Versand

Expert Oracle GoldenGate is a hands-on guide to creating and managing complex data replication environments using the latest in database replication technology from Oracle. GoldenGate is the future in replication technology from Oracle, and aims to be best-of-breed. GoldenGate supports homogeneous replication between Oracle databases. It supports heterogeneous replication involving other brands such as Microsoft SQL Server and IBM DB2 Universal Server. GoldenGate is high-speed, bidirectional, highly-parallelized, and makes only a light impact on the performance of databases involved in replication. The authors share their experience in the form of tutorials on designing and implementing all types of Oracle GoldenGate environments. You’ll learn methods for tuning Oracle GoldenGate performance. You’ll discover GoldenGate’s utility as a migration and extract, transform, load (ETL) tool. You’ll learn to configure highly-available environments involving GoldenGate, Real Application Clusters, and Data Guard. From installation to design to implementation and troubleshooting, Expert Oracle GoldenGate helps you master all aspects of using and applying Oracle GoldenGate as the replication tool of choice in your environment. - Explains all aspects of using GoldenGate for replication - Covers homogeneous, heterogeneous, and bidirectional replication - Shows the use of GoldenGate for data migration and extract, transform, load (ETL) What you’ll learn - Install Oracle GoldenGate quickly and painlessly - Design single- and bi-directional replication solutions - Apply GoldenGate to high-availability solutions - Troubleshoot and tune GoldenGate for performance - Verify data synchronization using GoldenGate Veridata - Manage and monitor GoldenGate environments using GoldenGate Director Who this book is for Expert Oracle GoldenGate is for database professionals who need to master the latest in replication technology from Oracle. It is for the Oracle Database administrator, technical manager, or Oracle developer requiring a solid base of expertise on to implement or manage replication environments with GoldenGate technology. Expert Oracle GoldenGate is an appropriate and timely reference for all users of the GoldenGate software.

Anbieter: Dodax
Stand: 25.05.2020
Zum Angebot
Business Intelligence Tools for Small Companies
40,65 € *
ggf. zzgl. Versand

Learn how to transition from Excel-based business intelligence (BI) analysis to enterprise stacks of open-source BI tools. Select and implement the best free and freemium open-source BI tools for your company's needs and design, implement, and integrate BI automation across the full stack using agile methodologies.Business Intelligence Tools for Small Companies provides hands-on demonstrations of open-source tools suitable for the BI requirements of small businesses. The authors draw on their deep experience as BI consultants, developers, and administrators to guide you through the extract-transform-load/data warehousing (ETL/DWH) sequence of extracting data from an enterprise resource planning (ERP) database freely available on the Internet, transforming the data, manipulating them, and loading them into a relational database.The authors demonstrate how to extract, report, and dashboard key performance indicators (KPIs) in a visually appealing format from the relational database management system (RDBMS). They model the selection and implementation of free and freemium tools such as Pentaho Data Integrator and Talend for ELT, Oracle XE and MySQL/MariaDB for RDBMS, and Qliksense, Power BI, and MicroStrategy Desktop for reporting. This richly illustrated guide models the deployment of a small company BI stack on an inexpensive cloud platform such as AWS.What You'll LearnYou will learn how to manage, integrate, and automate the processes of BI by selecting and implementing tools to:Implement and manage the business intelligence/data warehousing (BI/DWH) infrastructureExtract data from any enterprise resource planning (ERP) toolProcess and integrate BI data using open-source extract-transform-load (ETL) toolsQuery, report, and analyze BI data using open-source visualization and dashboard toolsUse a MOLAP tool to define next year's budget, integrating real data with target scenariosDeploy BI solutions and big data experiments inexpensively on cloud platforms Who This Book Is For Engineers, DBAs, analysts, consultants, and managers at small companies with limited resources but whose BI requirements have outgrown the limitations of Excel spreadsheets, personnel in mid-sized companies with established BI systems who are exploring technological updates and more cost-efficient solutions

Anbieter: Dodax
Stand: 25.05.2020
Zum Angebot
Pro MongoDB Development
40,65 € *
ggf. zzgl. Versand

Pro MongoDB Development is about MongoDB, a NoSQL database based on the BSON (binary JSON) document model. The book discusses all aspects of using MongoDB in web applications: Java, PHP, Ruby, JavaScript are the most commonly used programming/scripting languages and the book discusses accessing MongoDB database with these languages. The book also discusses using Java EE frameworks Kundera and Spring Data with MongoDB. As NoSQL databases are commonly used with the Hadoop ecosystem the book also discusses using MongoDB with Apache Hive. Migration from other NoSQL databases (Apache Cassandra and Couchbase) and from relational databases (Oracle Database) is also discussed. What You'll Learn: How to use a Java client and MongoDB shellHow to use MongoDB with PHP, Ruby, and Node.js as well How to migrate Apache Cassandra tables to MongoDB documents, Couchbase to MongoDB, and transferring data between Oracle and MongoDBHow to use Kundera, Spring Data, and Spring XD with MongoDBHow to load MongoDB data into Oracle Database and integrating MongoDB with Oracle Database in Oracle Data Integrator Audience: The target audience of the book is NoSQL database developers. Target audience includes Java, PHP and Ruby developers. The book is suitable for an intermediate level course in NoSQL database.

Anbieter: Dodax
Stand: 25.05.2020
Zum Angebot
Oracle WebLogic Server 12c Administration Handbook
61,00 € *
ggf. zzgl. Versand

Best Practices for Oracle WebLogic Server 12 c Configuration and AdministrationMaintain a high-performance enterprise application framework using the detailed information in this authoritative resource. Through expert instruction and real-world examples, Oracle WebLogic Server 12c Administration Handbook fully explains the latest management tools and techniques. Learn how to work from the Oracle WebLogic Server Administration Console or command line, configure servers and clusters, deploy applications, and optimize application performance. Tuning, troubleshooting, and load balancing are thoroughly covered in this Oracle Press guide.Install Oracle WebLogic Server 12 c or perform an upgradeManage domains, server instances, networks, and virtual hostsWork with the WebLogic Scripting Tool feature and Node ManagerBuild custom network channels and resource adaptersMonitor performance with the WebLogic Diagnostics Framework featurePrioritize requests using Oracle WebLogic Server Work ManagersConfigure Oracle WebLogic clusters and migrate servers and servicesDeploy web applications, Enterprise JavaBeans, and Java EE modulesEstablish security realms and authenticate and authorize usersAllocate memory, optimize throughput, and tune the Java Virtual Machine

Anbieter: Dodax
Stand: 25.05.2020
Zum Angebot