O.K. This is just an idea that's been running through my head, so I figured someone here may be interested.

Text search engines that I know of are meant to index unstructured data or apply a schema to data at runtime. However, since D has the ability to do things at compile time, perhaps it would be an ideal solution for situations where a specific schema is used and much be searched on. Instead of generic data structures used to represent the data, specialized data structures could be created at compile time to allow for better indexing and performance.

That's about as far as I got with it. To me, it seemed interesting enough to share.

Enjoy.

Reply via email to