hello, I d like to better understand indexing performance for fulltext search.
You have, say, 10K nodes and 1M relationships. ~100 rels for each node. Each node has fulltext properties to index name and text as such. If I perform a simple query like Match (n) where n.name=~"Bbkabka*." It will take still a while, despite nodes are not that many. (about 10 seconds) Is it simply due to the fact I am testing it on my laptop (6GB dedicated JVM, current use 1.23GB, 8GB RAM), or is to elses factors? Or either i really have to reduce #rels? If so, which is a good ratio to estimate density of nodes? I d like to figure out (and forecast) a possible use for real case production, where responsiveness is fast. PLEASE NOTE that I am importing the db with the batch importer. I am using it to create indexes, then when I am in neo4j console I noticed that indeed: index --indexes > list node indexes: > ix1 > ix2 ... (the one created with batch.properties) BUT schema returns NO indexes NO constraints ( http://stackoverflow.com/questions/19801599/neo4j-is-there-a-cypher-query-syntax-to-list-show-all-indexes-in-db ) Do I have properly indexed by db for fulltext search or not? Could you please clarify the difference between: index --indexes and schema? I found it confusing. Thank you! -- You received this message because you are subscribed to the Google Groups "Neo4j" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/d/optout.
