iMeMex is a dataspace management system. iMeMex is a research prototype. The package also provides several useful components for research such as external sorting, B+-trees, inverted indexes, content converters, query operators, and graph indexes.
Be the first to post a text review of iMeMex Dataspace Management System. Rate and review a project by clicking thumbs up or thumbs down in the right column.
- set initial minimum heap size to 512m. - dictionary compression in inversion indexes for attribute names - multi-threaded merge sort used for in-memory part of external memory sort operators - association trails and their canonical rewrite - binary tuple (used in social and generated plug-ins) - binary oid&name-only group - lazy group computation for persons in social plugin - person graph represented as in-memory int[][] (adjacency list) - use of common subexpressions whenever query identifier annotations are found in query plans
- set initial minimum heap size to 512m. - dictionary compression in inversion indexes for attribute names - multi-threaded merge sort used for in-memory part of external memory sort operators - association trails and their canonical rewrite - binary tuple (used in social and generated plug-ins) - binary oid&name-only group - lazy group computation for persons in social plugin - person graph represented as in-memory int[][] (adjacency list) - use of common subexpressions whenever query identifier annotations are found in query plans
Be the first person to add a text review.
Copyright © 2009 Geeknet, Inc. All rights reserved. Terms of Use
Thanks for your rating!
Would you also like to write a review?