Home/ Questions/Q 831113
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-15T04:09:07+00:00

I have to implement a search feature which is able to quickly perform arbitrary

  • 0

I have to implement a search feature which is able to quickly perform arbitrary complex queries to XML-data. If the user makes a query, all XML files must be searched to find possible matches.
The users will have lots of XML-Files (a few 10000 or more) which are typically a few kilobytes in size. All the XML-files have almost the same structure.

I already benchmarked XPath, it is too slow for my needs.

How can it be done most efficiently? Is is possible to create indexes for the contents of the XML files (preserving content semantics, not just plain fulltext search)?

Will it be useful to put the XML data into an (embedded) SQL database and do the queries with SQL?

What other possibilities do I have?

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    Don’t try an re-invent the wheel!

    I would import the XML into a database(eg SQLite) (plus meta data, XML information), and query that.

    Edit 1:

    You could implement a ‘drop folder’ which is ‘indexed’/imported upon first run. A Folder watcher can be implemented to ONLY update new/changes to XML files. SQLite can be run in memeory for the fastest I/O performance.

    • 0