Address standarization using C# dictionary data or table sql server data? -

-

i'm developing application address standardization in c# using form (desktop application) , sql server 2005. work follow:

my model in sql:

---------------------|    table correctaddress |  ---------------------|  correctaddressid pk  |  correctaddress       |  ---------------------|   -------------------| table wrongaddress | -------------------| wrongaddressid pk  | wrongaddress       | correctaddressid fk| -------------------|  -------------------------| table standardizeaddress | -------------------------| standardizeaddressid  pk | streetname               | -------------------------|

correctaddress: 70.000 records
wrongaddress: 900.000 records
standardizeaddress: maybe 1 or 1.000.000 records.

and query , change "streetname" "correctaddress" is:

select s.standardizeaddressid, s.streetname, c.correctaddress   correctaddress  c         inner join wrongaddress        w on c.correctaddressid = w.correctaddressid         inner join standardizeaddress  s on w.wrongaddress = s.streetname

this query work, when i've million or thounsand of standardizeaddress records, take time (20 minutes).

so, looking best solution, saw c# dictionary data structure. question if same work using c# dictionary? putting correctaddress , wrongaddress in c# dictionary correctaddress?

it work better? or there best option? i'm thinking using dictionary:

public correctaddress dictionary(of string, string) = new dictionary(of string, string)  public sub new()         directionals             .add("riverside drive", "rvrsid drve")             .add("union street", "unon strt")             .add("grand avenue", "grnd avene") -- , on until 900.000 records! end

tanks comments!

despite fact hard actual bottleneck in case, reading post, if think handling data in memory, can use dataset (a collection of datatable). can query them sql in memory well.


Comments

Post a Comment

Popular posts from this blog

java - Custom OutputStreamAppender not run: LOGBACK: No context given for <MYAPPENDER> -

-
i wish write custom appender on basis of outputstreamappender . wrote following class package tests; import java.io.ioexception; import java.io.outputstream; import ch.qos.logback.core.outputstreamappender; public class myappender<e> extends outputstreamappender<e> { public myappender() { system.out.println("myappender created"); setoutputstream(new outputstream() { @override public void write(int b) throws ioexception { throw new unsupportedoperationexception(); } }); } } then wrote following runner: package tests; import org.slf4j.loggerfactory; import ch.qos.logback.classic.logger; public class runner { private static final logger log = (logger) loggerfactory.getlogger(runner.class); public static void main(string[] args) { //log.addappender(new myappender<iloggingevent>()); log.info("hello world"); } } finall...
Read more

java - UML - How would you draw a try catch in a sequence diagram? -

-
Image
is there standard way of drawing try catch sequence diagrams? i've made attempt based on this feel end result doesn't feel right. code diagram based around: public static void save () { try { filehandle filehandle = gdx.files.external(file); filehandle.writestring(boolean.tostring(constantshandler.soundenabled)+"\n", false); (int = 0; < 5; i++) { filehandle.writestring(integer.tostring(constantshandler.highscores[i])+"\n", true); } } catch (throwable e) { } } my attempt note: know still need add loop. that's ok. fragments meant show conditional control flow in sequence diagram. superstructures puts limitations on use of fragments (see pp. 467 of ss2.1.1). should use critical region try part above. , option catch . however, keep telling can take quite freedom in using uml. it's language , such changes in life time. long reader ge...
Read more

c++ - No viable overloaded operator for references a map -

-
i trying use map can make tag names reference number. when try , use it, in code error (6 in total every time reference map): src/main.cpp:25:45: error: no viable overloaded operator[] type 'std::map<std::string, std::string>' const char* idcs = node.child_value(tagmap[3]); this code: #include "pugi/pugixml.hpp" #include <iostream> #include <string> #include <map> int main() { pugi::xml_document doca, docb; std::map<std::string, pugi::xml_node> mapa, mapb; std::map<std::string, std::string> tagmap {{"1", "data"}, {"2", "entry"}, {"3", "id"}, {"4", "content"}}; if (!doca.load_file("a.xml") || !docb.load_file("b.xml")) { std::cout << "can't find input files"; return 1; } (auto& node: doca.child(tagmap[1]).children(tagmap[2])) { co...
Read more