|
|
|
|
| LEADER |
05258nmm a2200529 u 4500 |
| 001 |
EB001930465 |
| 003 |
EBX01000000000000001093367 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
210123 ||| eng |
| 020 |
|
|
|a 9781783287765
|
| 020 |
|
|
|a 1783287756
|
| 020 |
|
|
|a 1783287764
|
| 050 |
|
4 |
|a QA76.9.D32
|
| 100 |
1 |
|
|a Panzarino, Onofrio
|
| 245 |
0 |
0 |
|a Learning cypher
|b write powerful and efficient queries for Neo4j with Cypher its official query language
|c Onofrio Panzarino
|
| 260 |
|
|
|a Birmingham, U.K.
|b Packt Pub.
|c 2014
|
| 300 |
|
|
|a 1 volume
|b illustrations
|
| 505 |
0 |
|
|a The UNION statementSummary; Chapter 3: Manipulating the Database; Using Neo4j Browser; Creating nodes and relationships; Labels and properties; Multiple labels; Properties; Creating multiple patterns; Creating relationships; Creating full paths; Creating relationships between existing nodes using read-and-write queries; Modifying existing data; Creating unique patterns; Complex patterns; Setting properties and labels; Cloning a node; Adding labels to nodes; Merging matched patterns; Idempotent queries; Deleting data; Removing labels; Removing properties; Deleting nodes and relations
|
| 505 |
0 |
|
|a Cover; Copyright; Credits; About the Author; About the Reviewers; www.PacktPub.com; Table of Contents; Preface; Chapter 1: Querying Neo4j Effectively with Pattern Matching; Setting up a new Neo4j database; Neo4j running modes; Neo4j Server; An embedded database; HR management tool -- an example; Creating nodes and relationships using the Java API; A querying database; Invoking Cypher from Java; Finding nodes by relationships; Filtering properties; Filtering relationships; Dealing with missing parts; Working with paths; Node IDs as starting points; Query parameters; Passing parameters with Java
|
| 505 |
0 |
|
|a Clearing the whole databaseLoops; Working with collections; Summary; Chapter 4: Improving Performance; Performance issues; Best practices and recommendations; Using parameterized queries; Parameterized queries with the REST API; Reusing ExecutionEngine; Finding the optimum transaction size; Avoiding unnecessary clauses; Specifying the direction of relationships and variable length paths; Profiling queries; Profiling using the Java API; Inside the execution plan description; Profiling with Neo4j Shell; Profiling with the REST API; Indexes and constraints; SCAN hints; Index hints; Constraints
|
| 653 |
|
|
|a Non-relational databases / http://id.loc.gov/authorities/subjects/sh2013002186
|
| 653 |
|
|
|a Bases de données non relationnelles
|
| 653 |
|
|
|a Langages d'interrogation
|
| 653 |
|
|
|a Databases / Development
|
| 653 |
|
|
|a COMPUTERS / Data Processing / bisacsh
|
| 653 |
|
|
|a Database design / fast
|
| 653 |
|
|
|a Databases / Programming
|
| 653 |
|
|
|a Non-relational databases / fast
|
| 653 |
|
|
|a Database design / http://id.loc.gov/authorities/subjects/sh88004472
|
| 653 |
|
|
|a Query languages (Computer science) / http://id.loc.gov/authorities/subjects/sh96000160
|
| 653 |
|
|
|a Bases de données / Conception
|
| 653 |
|
|
|a Query languages (Computer science) / fast
|
| 653 |
|
|
|a COMPUTERS / Programming Languages / SQL. / bisacsh
|
| 653 |
|
|
|a COMPUTERS / Programming / Open Source / bisacsh
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b OREILLY
|a O'Reilly
|
| 490 |
0 |
|
|a Community experience distilled
|
| 500 |
|
|
|a Includes index
|
| 776 |
|
|
|z 9781783287758
|
| 856 |
4 |
0 |
|u https://learning.oreilly.com/library/view/~/9781783287758/?ar
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 500
|
| 082 |
0 |
|
|a 745.4
|
| 082 |
0 |
|
|a 005.7565
|
| 520 |
|
|
|a Chapter 5: Migrating from SQL; Our example; Migrating the schema; Labels; Indexes and constraints; Relationships; Migrating the data; Entities; Relationships; Migrating queries; CRUD; Searching queries; Grouping queries; Summary; Appendix: Operators and Functions; Operators; Comparison operators; Ordering operators; Equality operators; NULL equality operators; Mathematical operators; The concatenation operator; The IN operator; Regular expressions; Functions; COALESCE; TIMESTAMP; ID; Working with nodes; NODES; LABELS; Working with paths and relationships; TYPE; ENDNODE and STARTNODE
|
| 520 |
|
|
|a An easy-to-follow guide full of tips and examples of real-world applications. In each chapter, a thorough example will show you the concepts in action, followed by a detailed explanation. This book is intended for those who want to learn how to create, query, and maintain a graph database, or who want to migrate to a graph database from SQL. It would be helpful to have some familiarity with Java and/or SQL, but no prior experience is required
|
| 520 |
|
|
|a Chapter 2: Filter, Aggregate, and Combine Results; Filtering; The book store - an example; Text search; Working with regular expressions; Escaping the text; Value comparisons; The IN predicate; Boolean operators; Working with collections; Paging results - LIMIT and SKIP; Sorting; A descending sort; Dealing with null values using the COALESCE function; Aggregating results; Counting matching rows or non-null values; Summation; Average; Maximum and minimum; Standard deviation; Collecting values in an array; Grouping keys; Conditional expressions; Separating query parts using WITH
|