Setting up a graph database to query common properties across different types of nodes -

i looking @ using graph database data relational database. way database setup, information related single item spread across multiple tables. have read, seems way go have node type corresponds each table, , each entry in table node. setting edges between nodes gets tricky.

for example, have table of car parts:

| part number | price | quantity in inventory | 

cars:

| make | model | price | 

and table of car uses part:

| model number | part number | quantity | 

i create node each car part, , node each car model. there :uses relationship car model each part uses. makes easy parts used in particular car, or cars contain specific part.

what if wanted find cars , car parts have price? (ignoring in example car parts tend not cost as car) i.e. querying shared properties? query goes through, examining each node, , accepting or rejecting node if price not match seems not scale well. if had millions of parts in database, wouldn't slow?

the way around can think of create price node each unique price, , make link between each part , price. seems approach leave node every unique property value, , seems excessive too.

when taking data relational database put graph database, , want able query based on common properties across different types of nodes, best way go setting nodes , relationships?