Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 789001
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 14, 20262026-05-14T21:27:25+00:00 2026-05-14T21:27:25+00:00

I am trying to develop a complex textual search engine. I have thousands of

  • 0

I am trying to develop a complex textual search engine.
I have thousands of textual pages from many books.
I need to search pages that contain specified complex logical criterias.
These criterias can contain virtually any compination of the following:

A: Full words.

B: Word roots (semilar to stems; i.e. all words with certain key letters).

C: Word templates (in some languages roots are filled in certain templates to form various part of speech such as adjactives, past/present verbs…).

D: Logical connectives: AND/OR/XOR/NOT/IF/IFF and parentheses to state priorities.

Now, would it be faster to have the pages’ full text in database (not indexed) and search through them all using SQL and Regular Expressions ?

Or would it be better to construct indexes of word/root/template-page-location tuples.
Hence, we can boost searching for individual words/roots/templates.
However, it gets tricky as we introduce logical connectives into our queries.
I thought of doing the following steps in such cases:

1: Seperately search for each individual words/roots/templates in the specified query.

2: On priority bases, we merge two result lists (from step 1) at a time depedning on the logical connective

For example, if we are searching for “he AND (is OR was)”:

1: We shall search for “he”, “is” and “was” seperately and get result lists for each word.

2: Merge the result lists of “is” and “was” using the merging function OR-MERGE.

3: Merge the merged result list from the OR-MERGE function with the one of “he” using the merging function AND-MERGE.

The result of step 3 is then returned as the result of the specified query.

What do you think gurues ? Which is faster ? Any better ideas ?

Thank you all in advance.

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-14T21:27:26+00:00Added an answer on May 14, 2026 at 9:27 pm

    There are plenty of off-the-shelf solutions to this kind of problem. I would strongly recommend you use one of those instead of developing your own.

    You don’t say what database solution you’re using. If it’s Microsoft SQL Server, you could use its Full Text Search features. If it’s MySQL, take a look at its Full-Text Search Functions. I’m sure Oracle, DB2 and any other major DBMS will have similar functionality.

    Alternatively, take a look at Apache’s Lucene for Java or Lucene for .NET. This will allow you to index documents without needing to use a DBMS.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Ask A Question

Stats

  • Questions 408k
  • Answers 408k
  • Best Answers 0
  • User 1
  • Popular
  • Answers
  • Editorial Team

    How to approach applying for a job at a company ...

    • 7 Answers
  • Editorial Team

    What is a programmer’s life like?

    • 5 Answers
  • Editorial Team

    How to handle personal stress caused by utterly incompetent and ...

    • 5 Answers
  • Editorial Team
    Editorial Team added an answer Using ListView and ArrayAdapter you can do more complicated layouts… May 15, 2026 at 6:45 am
  • Editorial Team
    Editorial Team added an answer Discovered the problem. It turned out that I did reference… May 15, 2026 at 6:45 am
  • Editorial Team
    Editorial Team added an answer I recommend that you use Capistrano to deploy your application… May 15, 2026 at 6:45 am

Trending Tags

analytics british company computer developers django employee employer english facebook french google interview javascript language life php programmer programs salary

Top Members

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.