c# - Loading the tenant specific variables in a multi tenant application -


i have mvc application multi tenant architecture. in this, there global variables (common users of every tenant) , specific logged in user. also, there settings common users of specific tenant.

i storing , retrieving global , session variables mentioned below.

  • specific logged in user - httpcontext.current.session["sessionvariablename]. these variables loaded @ time login of user.
  • global variables - httpcontext.current.application["applicationvariablename"]. these variables loaded in global.asax on application startup.

now have question, how load tenant specific variables. in event need load vaiables? not want load tenant specific variables @ time of application startup many tenant may not using application. also, may overhead @ time login of each user check , load tenant specific settings. best approach ?

in case, suggest following approach

  1. create table named "tenantsettings" holds tenant specific settings
  2. create table named "usersettings" holds user specific settings
  3. identify tenant post login , when first time tenant settings, store tenantsettings cache [distributed or in-memory syc'ed via pub-sub]
  4. also, post login of user, fetch usersettings , put in cache [same in 3]
  5. do not use application memory because cache may accidentally polluted , not scale load

database entity details

1. tenantsettings following can columns tenantsettings

  • tenantid
  • settingid
  • settingvalue
  • auditfields createdby, createdon, isactive, updatedby...

2. usersettings

  • userid
  • tenantid
  • settingid
  • settingvalue
  • audit fields similar above

hope helps.


Comments

Post a Comment

Popular posts from this blog

Sort a complex associative array in PHP -

this question has answer here: php sort array subarray value 5 answers i have associative array in php like: $newarray1 = array ( [producta] => array ( [link] => http://sanjosespartan.com/blog/products/agile-java-development/ [visitcount] => 4 ) [productd] => array ( [link] => http://sanjosespartan.com/blog/products/intro-to-go/ [visitcount] => 1 ) [productg] => array ( [link] => http://sanjosespartan.com/blog/products/node-js-for-developers/ [visitcount] => 1 ) [productb] => array ( [link] => http://sanjosespartan.com/blog/products/beginning-mysql/ [visitcount] => 1 ) [productc] => array ( [link] => http://sanjosespartan.com/blog/products/computer-networks/ [visitcount] => 1 ) ...
Read more

vb.net - How to ignore if a cell is empty nothing -

how use roscolor() ignore value (like empty cell) ? color row if value upper 5 when there nothing in cell, want ignore roscolor() apply, how? public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val integer val = quotedatagridview1.rows(i).cells(3).value if val = vbempty quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white elseif val < 5 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.red elseif val > 5 , val < 10 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.lightyellow end if next end sub you can check empty value following public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val = quotedatagridview1.rows(i).cells(3).value if isdbnull(val) or val nothing quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white ...
Read more

recursion - Can every recursive algorithm be improved with dynamic programming? -

i first year undergraduate csc student looking competitive programming. recursion involves defining , solving sub problems. understand, top down dynamic programming (dp) involves memoizing solutions sub problems reduce time complexity of algorithm. can top down dp used improve efficiency of every recursive algorithm overlapping sub problems? dp fail work , how can identify this? the short answer is: yes. however, there constraints. obvious 1 recursive calls must overlap. i.e. during execution of algorithm, recursive function must called multiple times same parameters. lets truncate recursion tree memoization. can use memoization reduce number of calls. however, reduction of calls comes price. need store results somewhere. next obvious constraint need have enough memory. comes not-so obvious constraint. memory access requires time. first need find result stored , maybe copy location. in cases, might faster let recursion calculate result instead of loading somewher...
Read more