Can we have more than 100k - million items in SharePoint List?
If by 10 Lakh you mean 1 million, then yes you can have 300 Lakh maximum (recommeneded)
http://blogs.msdn.com/b/markarend/archive/2010/05/18/sharepoint-2010-list-and-library-size.aspx
I would recommend storing elsewhere if you're approaching even half that number.
Related
I have a database of about 100 million customer relation records and 3 million distinct clients
I need to write a SQL script to work out which clients have registered 5 or more complaints within 30 days of each other, over the entire history of the client
I thought that a window function would be the answer but I haven't had any luck
Any ideas would be useful, but efficient ones would be even better, as I have low system priority and my codes takes hours to run.
What does "Maximum number of records returned by the server" mean when publishing from ArcGIS Desktop to ArcGIS Online?
Is this referring to the number of records of each layer or number of records in total?
So for example, let's say I have two layers:
Layer 1 has 500 records
Layer 2 has 400 records
Do I put 500 (the max of both numbers) or 900 (the total amount of records) under maximum number of records returned by the server?
It means the total number of records that you want to allow any one query to return.
In your example, you could say 500, because a query operates on one and only one feature layer. However, you might want to reduce that number if your clients' bandwidth or hardware are not sufficient to process 500 features efficiently.
I'm having trouble designing the appropriate table to represent a setting for an application.
How can we store greater than and less than information into an mssql table?
I need to save the following "settings" in an application. Basically It represents how many seconds it took for the Armor to be penetrated in seconds.
For example on the Light armor, how would I save that as a table in a db. How would I store the value: If seconds are less than 389?
In one table or multiple?
I want to save the greater than or less than range not the actual data.
Type Needs Meets Exceeds
LightJediArmor < 389 390-480 > 480
HeavyJediArmor < 1000 1000-2000 > 2000
How about:
Type MeetThreshold ExceedsThreshold
Light 390 480
Heavy 1000 2000
Optimization – Rearranging items of a specific type?
Here’s a little optimization problem for a personal project I’m working on: so imagine you have many boxes of an item, and within each box, you know that the items must be shipped to various locations.
Example:
Box 1: 1000 items, 500 to location A, 500 to location B.
Box 2: 1000 items, 500 to location A, 500 to location B.
I want to be able to rearrange the items such that I can ship as many full boxes as I can to one destination. For instance, in the example above, I would be able to rearrange the items such that new_box 1 has 1000 items to location A, and 1000 to location B.
Now you can imagine that this perfect rearrangement case will not always occur. What if I had:
Box 1: 1000 items, 500 to location A, 300 to location B, 200 to location C.
Box 2: 1000 items, 500 to location A, 500 to location B.
Then, I would want to (a) optimize the number of full boxes to one destination, & (b) minimize the number of different locations in every other box. For instance, having 3 boxes each with 2 different destinations would be better than having 3 boxes each with 3 different destinations. The optimum rearrangement of the second example above would be:
New_box_1: 1000 items, 1000 to location A.
New_box_2: 1000 items, 800 to location B and 200 to location C.
My question is: How would I handle this situation for arbitrary number of boxes and arbitrary number of destinations per box? For the sake of the problem, let’s start with assuming that each box has the same number of items.
What I’m thinking right now is to take a greedy approach:
Go down the line for each subsequent box and keep a running sum of the destinations and the number of items that will be shipped to it.
If any of these sum to a value that is greater than the box capacity, place these items in their own box.
Then, take the highest number of items to one destination that is remaining, call this “x”, take the value (box capacity – x), (call this “y”), and find the value of the number of items to one destination that is both ABOVE “y” and the closest to “y”.
Then, place “x” items to the first destination and “y items to the second destination in another box, and repeat.
Any other suggestions, or insights? Thanks so much.
I think this is a simple 1d bin-packing problem. The problem is a box with 1000 items at most. Then you can use a bin-packing algorithm like best-fit, first-fit or so.
I am looking for some advice / guide on the best way to unlock content from in-app purchases.
I have a list of 100 words. I have the broken into 25 units. The first unit of 25 is free and the remaining 3 units can be unlocked after you purchase them from an in-app purchase. No content will be downloaded.
All 100 words are currently stored in an array.
After the purchaser buys a unit, I want that specific segment to become available.
So if they buy unit 3, then the word list should include units 1 and 3.
What is the best way to implement this? Should I use 4 different NSArrays for the word sets? And then just load a master NSArray with the purchased words?
For the bare minimum you could use four NSArrays and then add them to an NSMutableArray as they are purchased. And use NSUserDefaults to store a boolean for each possible purchase.
I don't know wether or not I understand your question correctly.
Maybe you could put everything into one big array and have a max_available_index. Each purchase increments this index. The user is never allowed to access items beyond this maximum index.
If your unit size is 25, then buying 3 units increments the max_available_index by 75.