represented as a series of interrelated states or events such as in a state diagram moreover not all acts illustrated in a methodology may be required for a novel implementation fig5 illustrates a computer implemented indexing method in accordance with the disclosed architecture at 500 a query is received for execution against a datastore the datastore can be a column store and or row store at 502 resources are monitored for processing the query at 504 a list of partitions and corresponding segments is obtained based on the resources at 506 the segments are indexed for thread processing based on available resources fig6 illustrates further aspects of the method of fig5 at 600 the list of partitions is retrieved during query execution plan compilation at 602 the list of partitions is generated during query execution at 604 a degree of parallel execution and memory usage is adjusted before query execution to optimize resource utilization at query execution at 606 same or different segments are processed concurrently at 608 helper threads are assigned to process segments from the list of partitions at 610 each segment is processed using a single thread of execution as used in this application the terms u201c component u201d and u201c system u201d are intended to refer to a computer related entity either hardware a combination of software and tangible hardware software or software in execution for example a component can be but is not limited to tangible components such as a processor chip memory mass storage devices e g optical drives solid state drives and or magnetic storage media drives and computers and software components such as a process running on a processor an object an executable module a thread of execution and or a program by way of illustration both.