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 602705
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 13, 20262026-05-13T16:51:03+00:00 2026-05-13T16:51:03+00:00

I would like to know what data structure / storage strategy I should use

  • 0

I would like to know what data structure / storage strategy I should use for this problem.

Each data entry in the database consists of a list of multiple ordered items, such as A-B-C-D, where A, B, C, D are different items.

Suppose I have 3 entries in a database,

A-B-C-D

E-F-G

G-H-B-A

When the user entered some unordered items, I have to find the matching ordered entry(ies) from the database. For example, if user enters A,B,G,H, I want to return G-H-B-A from the database to the user.

What should be my data storage strategy?

  • 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-13T16:51:04+00:00Added an answer on May 13, 2026 at 4:51 pm

    You’re best off storing the ordered and unordered elements separately, otherwise you’ll need to search on all permutations of the ordered elements, which would be time consuming.

    Try this:

    /* Create a table to track your items (A, B, C, etc.). It contains all possible elements */
    CREATE TABLE [Items](
        [Value] [char](1) NOT NULL,
     CONSTRAINT [PK_Items] PRIMARY KEY CLUSTERED ([Value]))
    
    /* Create a table to track their grouping and stated ordering */
    CREATE TABLE [Groups](
        [ID] [int] NOT NULL,
        [Order] [text] NOT NULL,
     CONSTRAINT [PK_Groups] PRIMARY KEY CLUSTERED ([ID]))
    
    /* Create a mapping table to associate them */
    CREATE TABLE [ItemsToGroups](
        [Item] [char](1) NOT NULL,
        [Group] [int] NOT NULL
    )
    
    ALTER TABLE [ItemsToGroups]  WITH CHECK ADD CONSTRAINT [FK_ItemsToGroups_Groups] FOREIGN KEY([Group])
    REFERENCES [Groups] ([ID])
    
    ALTER TABLE [ItemsToGroups] CHECK CONSTRAINT [FK_ItemsToGroups_Groups]
    
    ALTER TABLE [ItemsToGroups]  WITH CHECK ADD CONSTRAINT [FK_ItemsToGroups_Items] FOREIGN KEY([Item])
    REFERENCES [Items] ([Value])
    
    ALTER TABLE [ItemsToGroups] CHECK CONSTRAINT [FK_ItemsToGroups_Items]
    
    /* Populate your tables. 
       Items should have eight rows: A, B, C,...H
       Groups should have three rows: 1:ABCD, 2:EFG, 3:GHBA
       Items to groups should have eleven rows: A:1, B:1,...A:3 */
    
    /* You will want to pass in a table of values, so set up a table-valued parameter
       First, create a type to support your input list */
    CREATE TYPE ItemList AS TABLE (e char(1) NOT NULL PRIMARY KEY)
    DECLARE @Input ItemList
    GO
    
    /* Create a stored procedure for your query */
    CREATE PROCEDURE SelectOrderedGroup @Input ItemList READONLY AS
        SELECT *
        FROM Groups
        WHERE Groups.ID NOT IN (
            SELECT [Group]
            FROM ItemsToGroups
            WHERE Item NOT IN (SELECT e FROM @Input)
        )
    GO
    
    /* Now when you want to query them: */
    DECLARE @MyList ItemList
    INSERT @MyList(e) VALUES('G'),('H'),('B'),('A')
    EXEC SelectOrderedGroup @MyList
    

    The above will return 3:GHBA, like you want. If you pass in DCBA you’ll get back 1:ABCD, again like you’re looking for. If you pass in C, you’ll get back nothing, as no group consists of just C.

    You will probably want to use a table-valued parameter for your input, as shown above, but you could convert the final SELECT to a simple list and drop the ItemList type.

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

Sidebar

Ask A Question

Stats

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

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

    • 7 Answers
  • Editorial Team

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

    • 5 Answers
  • Editorial Team

    What is a programmer’s life like?

    • 5 Answers
  • Editorial Team
    Editorial Team added an answer You need to do this through VBScript and load in… May 14, 2026 at 7:52 am
  • Editorial Team
    Editorial Team added an answer EDIT: I tried to clarify I bit more ... 1.… May 14, 2026 at 7:52 am
  • Editorial Team
    Editorial Team added an answer Read each line, stick the contents of the line into… May 14, 2026 at 7:52 am

Related Questions

I have an idea for how to solve this problem, but I wanted to
Anyone know of an API (php preferable but I'd be interested in any language)
I would like to know what is the fastest way in java 1.5 to
I'm working on some Java <-> Perl interaction. I would like to know what
I have a large (more than 100K objects) collection of Java objects like below.

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.