Browse Library
Sign In Start Free Trial
Close icon Search icon
Account
Browse Library Advanced Search Sign In Start Free Trial

Add to playlist

Create a Playlist

Modal Close icon
You need to login to use this feature.
  • Book Overview & Buying NoSQL Data Models
  • Table Of Contents Toc
  • Feedback & Rating feedback
NoSQL Data Models

NoSQL Data Models

By : Olivier Pivert
close
close
NoSQL Data Models

NoSQL Data Models

By: Olivier Pivert

Overview of this book

Big Data environments are now to be handled in most current applications, this book addresses the latest issues and hurdles that are encountered in such environments. The book begins by presenting an overview of NoSQL languages and systems. Then, you’ll evaluate SPARQL queries over large RDF datasets and devise a solution that will use the MapReduce framework to process SPARQL graph patterns. Next, you’ll handle the production of web data, generate a set of links between two different datasets and overcome different heterogeneity problems. Moving ahead, you’ll take the multi-graph based approach to overcome challenges faced by the RDF data management community. Finally, you’ll deal with the flexible querying of graph databases and textual data management. By the end of this book, you’ll have gathered essential information on big data challenges faced by NoSQL databases.
Table of Contents (11 chapters)
close
close
close
Preface
Icon
Preface
Lock Free Chapter
1
1 NoSQL Languages and Systems
Icon
1.1. Introduction
Icon
1.2. Join implementations on top of MapReduce
Icon
1.3. Models for NoSQL languages and systems
Icon
1.4. New challenges for database research
Icon
1.5. Bibliography
2
2 Distributed SPARQL Query Processing: a Case Study with Apache Spark
Icon
2.1. Introduction
Icon
2.2. RDF and SPARQL
Icon
2.3. SPARQL query processing
Icon
2.4. SPARQL and MapReduce
Icon
2.5. SPARQL on Apache Spark
Icon
2.6. Bibliography
3
3 Doing Web Data: from Dataset Recommendation to Data Linking
Icon
3.1. Introduction
Icon
3.2. Datasets recommendation for data linking
Icon
3.3. Challenges of linking data
Icon
3.4. Techniques applied to the data linking process
Icon
3.5. Conclusion
Icon
3.6. Bibliography
4
4 Big Data Integration in Cloud Environments: Requirements, Solutions and Challenges
Icon
4.1. Introduction
Icon
4.2. Big Data integration requirements in Cloud environments
Icon
4.3. Automatic data store selection and discovery
Icon
4.4. Unique access for all data stores
Icon
4.5. Unified data model and query languages
Icon
4.6. Query processing and optimization
Icon
4.7. Summary and open issues
Icon
4.8. Conclusion
Icon
4.9. Bibliography
5
5 Querying RDF Data: a Multigraph-based Approach
Icon
5.1. Introduction
Icon
5.2. Related work
Icon
5.3. Background and preliminaries
Icon
5.4. AMBER: a SPARQL querying engine
Icon
5.5. Index construction
Icon
5.6. Query matching procedure
Icon
5.7. Experimental analysis
Icon
5.8. Conclusion
Icon
5.9. Acknowledgment
Icon
5.10. Bibliography
6
6 Fuzzy Preference Queries to NoSQL Graph Databases
Icon
6.1. Introduction
Icon
6.2. Preliminary statements
Icon
6.3. Fuzzy preference queries over graph databases
Icon
6.4. Implementation challenges
Icon
6.5. Related work
Icon
6.6. Conclusion and perspectives
Icon
6.7. Acknowledgment
Icon
6.8. Bibliography
7
7 Relevant Filtering in a Distributed Content-based Publish/Subscribe System
chevron up
Icon
7.1. Introduction
Icon
7.2. Related work: novelty and diversity filtering
Icon
7.3. A Publish/Subscribe data model
Icon
7.4. Publish/Subscribe relevance
Icon
7.5. Real-time integration of novelty and diversity
Icon
7.6. TDV updates
Icon
7.7. Experiments
Icon
7.8. Conclusion
Icon
7.9. Bibliography
8
List of Authors
Icon
List of Authors
9
Index
Icon
Index
10
End User License Agreement
Icon
End User License Agreement

7.6. TDV updates

As discussed in section 7.3.2, TDV computation is a very time-consuming process. We need to extract similarities between all pairs of items in a collection for N times: one without all the terms, and N times by removing a term to compute the density of this term. Consequently, this process cannot be done in real time and must be evaluated in parallel with the filtering process. Initially, it took two days to compute 10M items. Even if a TDV does not evolve much over time, it relies on the evolution of the presence of a term compared with all of them, on all items. The computation step needs to start from the beginning each time we need to provide new TDV.

Our work to enhance the computation of TDV updates is twofold: i) adapt TDV computation techniques in an incremental process and ii) adapt our algorithm in a distributed context in order to scale up.

7.6.1. TDV computation techniques

TDV computation is a heavy process that requires evaluation of the density of a collection...

Visually different images
CONTINUE READING
83
Tech Concepts
36
Programming languages
73
Tech Tools
Icon Unlimited access to the largest independent learning library in tech of over 8,000 expert-authored tech books and videos.
Icon Innovative learning tools, including AI book assistants, code context explainers, and text-to-speech.
Icon 50+ new titles added per month and exclusive early access to books as they are being written.
NoSQL Data Models
End of Section 7
Next Section
notes
bookmark Notes and Bookmarks search Search in title playlist Add to playlist font-size Font size

Change the font size

margin-width Margin width

Change margin width

day-mode Day/Sepia/Night Modes

Change background colour

Close icon Search
Country selected
Close icon Your notes and bookmarks

Confirmation

Modal Close icon
claim successful
Order Page Read Now

Buy this book with your credits?

Modal Close icon
Are you sure you want to buy this book with one of your credits?
Close
YES, BUY

Submit Your Feedback

Modal Close icon
Modal Close icon
Modal Close icon