Text comparison using word embeddings
You do not need to use Word Embedding to solve this problem. 

You are performing set membership check. In this problem, each book title and author combination is an element. You can create a hash for each element and perform constant time lookup. This assumes you have consistent normalization for each data source.