Data structure with sql "LIKE" searchability?

[news.microsoft.com]

We need to take a large amount of data, load it into memory, and then search
on it. A hashtable would work if you could perform operations similar to
sql select .. where like ... clauses. Any data structure come to mind where
I could something like...

Object[] objs = hash["abc*"];

One other question, is it possible to create a hash with multiple keysets?
For example, an object, on keyset on name, one on some code?

TIA -

Derrick

[Nicholas Paldino [.NET/C# MVP]]

Derrick,

A DataSet might be the best option in this case. You can load the data
into tables, and then call the Select method to select rows with specific
criteria. I believe the like operator is supported as well.

Hope this helps.
--
- Nicholas Paldino [.NET/C# MVP]
- mv*@spam.guard.caspershouse.com

"news.microsoft.com" <de*********@excite.com> wrote in message
news:uJ**************@TK2MSFTNGP12.phx.gbl...

We need to take a large amount of data, load it into memory, and then search on it. A hashtable would work if you could perform operations similar to
sql select .. where like ... clauses. Any data structure come to mind where I could something like...

Object[] objs = hash["abc*"];

One other question, is it possible to create a hash with multiple keysets?
For example, an object, on keyset on name, one on some code?

TIA -

Derrick

[Derrick]

Hi Nicholas -

Thanks, I'm looking at DataSet and DataTable. We basically want to create a
relatively small in memory table based on xml files, and do simple where
like searches. Can DataSet and DataTable operate independently of an actual
relational db?

Thanks again -

Derrick
"Nicholas Paldino [.NET/C# MVP]" <mv*@spam.guard.caspershouse.com> wrote in
message news:Oi**************@TK2MSFTNGP10.phx.gbl...

Derrick,

A DataSet might be the best option in this case. You can load the data into tables, and then call the Select method to select rows with specific
criteria. I believe the like operator is supported as well.

Hope this helps.
--
- Nicholas Paldino [.NET/C# MVP]
- mv*@spam.guard.caspershouse.com

"news.microsoft.com" <de*********@excite.com> wrote in message
news:uJ**************@TK2MSFTNGP12.phx.gbl...

We need to take a large amount of data, load it into memory, and then

search

on it. A hashtable would work if you could perform operations similar to sql select .. where like ... clauses. Any data structure come to mind

where

I could something like...

Object[] objs = hash["abc*"];

One other question, is it possible to create a hash with multiple keysets? For example, an object, on keyset on name, one on some code?

TIA -

Derrick

[Jon Skeet [C# MVP]]

Derrick <de*********@excite.com> wrote:

Thanks, I'm looking at DataSet and DataTable. We basically want to create a
relatively small in memory table based on xml files, and do simple where
like searches. Can DataSet and DataTable operate independently of an actual
relational db?

Absolutely. Indeed, you might want to look at the XmlDataDocument
class.

--
Jon Skeet - <sk***@pobox.com>
http://www.pobox.com/~skeet
If replying to the group, please do not mail me too

[Derrick]

Hi Jon -

I've been looking at the QuickStart example of reading books.xml and xsd,
can't find any samples that execute an actual sql command though, you
wouldn't happen to have a code snippet handy, would you?

Thanks!

Derrick
"Jon Skeet [C# MVP]" <sk***@pobox.com> wrote in message
news:MP************************@msnews.microsoft.c om...

Derrick <de*********@excite.com> wrote:

Thanks, I'm looking at DataSet and DataTable. We basically want to create a relatively small in memory table based on xml files, and do simple where
like searches. Can DataSet and DataTable operate independently of an actual relational db?

Absolutely. Indeed, you might want to look at the XmlDataDocument
class.

--
Jon Skeet - <sk***@pobox.com>
http://www.pobox.com/~skeet
If replying to the group, please do not mail me too