In the above mentioned data structure I have Map of address which internally holds map of current and previous address. What is the efficient way to index this data structure in app-search??
can I use dictionary to efficiently save the structure(if so can anyone tell me how)?
Generally speaking, when indexing data into App Search, our recommendation is to flatten data. The flattened version of the above might be something like:
Apache, Apache Lucene, Apache Hadoop, Hadoop, HDFS and the yellow elephant
logo are trademarks of the
Apache Software Foundation
in the United States and/or other countries.