Software Development Libraries for .NET

  •        0

A collection of .NET software development libraries.

http://libraries.codeplex.com/

Tags
Implementation
License
Platform

   




Related Projects

LINQ to SQL Entity Base - Disconnected LINQ


LINQ to SQL Entity Base is a simple base class that is primarily designed to support LINQ to SQL in a disconnected way, which is one of the shortcomings of the LINQ to SQL technology at the present time. This is highly useful in an n-Tier, distributed or ASP.NET environment ...

EPICS Version 4


EPICS Version 4 is a software toolkit for writing control systems

RavenDB - NoSQL Database .NET


Raven is an document database for the .NET/Windows platform. Raven offers a flexible data model design to fit the needs of real world systems. Raven stores schema-less JSON documents, allow you to define indexes using Linq queries and focus on low latency and high performance.

Remote Linq


Remote Linq is a simple and easy to use library to translate Expression Trees from and to strongly typed, serializable expression trees.

Hazelcast Jet - Distributed data processing engine, built on top of Hazelcast


Hazelcast Jet is a distributed computing platform built for high-performance stream processing and fast batch processing. It embeds Hazelcast In Memory Data Grid (IMDG) to provide a lightweight package of a processor and a scalable in-memory storage. It supports distributed java.util.stream API support for Hazelcast data structures such as IMap and IList, Distributed implementations of java.util.{Queue, Set, List, Map} data structures highly optimized to be used for the processing

Mercurial


Mercurial is fast and powerful. Mercurial offers you the power and speed to efficiently handle projects of any size and kind. Every clone contains the whole project history, so committing, branching, tagging and merging are local operations which makes them fast and convenient. You can use a multitude of workflows and easily enhance its functionality with extensions.

Bindable LINQ


Bindable LINQ is a set of extensions to LINQ that add data binding and change propagation capabilities to standard LINQ queries.

MetaLinq - LINQ to Expressions


Class library that allows developers to use LINQ to search through and edit expressions in place, without having to manually recreate the expressions.

Microsoft Dynamics CRM Query - T4 Template


In short, this project provides a LINQ style data access solution for Microsoft CRM 4.0. It provides a T4 Template that generates code leveraging LINQ to SQL and the MS-CRM 4.0 API to give a MS-CRM CRUD data access solution. Special Support for WCF RIA Services is also provided

GeoMesa - Suite of tools for working with big geo-spatial data in a distributed fashion


GeoMesa is an open-source, distributed, spatio-temporal database built on a number of distributed cloud data storage systems, including Accumulo, HBase, Cassandra, and Kafka. Leveraging a highly parallelized indexing strategy, GeoMesa aims to provide as much of the spatial querying and data manipulation to Accumulo as PostGIS does to Postgres.

LINQ to XSD


The LINQ to XSD technology provides .NET developers with support for typed XML programming. LINQ to XSD contributes to the LINQ project (.NET Language Integrated Query); in particular, LINQ to XSD enhances the existing LINQ to XML technology.

Logic Data Access


Logic Data Access is a IQueryable Repository pattern implementation for LINQ To SQL and In-Memory storages.

udon - Universal Distributed Object Notation: data structures in distributed memory


Universal Distributed Object Notation: data structures in distributed memory

Linq to CAML


Linq to CAML supports Language integrated query support for SharePoint data sources from List, Libraries and Content Types using SharePoint web service and object model.

VoltDB - Fast Scalable SQL DBMS with ACID


VoltDB was specifically designed for contemporary software applications that are pushed beyond their limits by high volume data sources. VoltDB provides the ability to capture, store and process incoming data at millions of read/write operations per second. And VoltDB’s relational model opens that data to be analyzed in real-time, using familiar Business Intelligence tools, to identify data patterns and trends, spot anomalies, or perform tracking and alerting.

LINQ Mapper


LINQ Mapper translates simple LINQ queries between different sources. It allows you to write queries against your domain model, but have them run against a different model (typically a data model like LINQ to SQL or Entity Framework).

Redisson - Redis based In-Memory Data Grid for Java


Redisson - Distributed and Scalable Java data structures (Set, SortedSet, Map, ConcurrentMap, List, Queue, Deque, Lock, AtomicLong, CountDownLatch, Publish / Subscribe, HyperLogLog) on top of Redis server. Advanced redis java client. It supports over 28+ data structures and services, Synchronous / asynchronous / reactive interfaces and lot more.

bloofi - Bloofi: A java implementation of multidimensional Bloom filters


Bloom filters are probabilistic data structures commonly used for approximate membership problems in many areas of Computer Science (networking, distributed systems, databases, etc.). With the increase in data size and distribution of data, problems arise where a large number of Bloom filters are available, and all them need to be searched for potential matches. As an example, in a federated cloud environment, each cloud provider could encode the information using Bloom filters and share the Bloom filters with a central coordinator. The problem of interest is not only whether a given element is in any of the sets represented by the Bloom filters, but which of the existing sets contain the given element. This problem cannot be solved by just constructing a Bloom filter on the union of all the sets. Instead, we effectively have a multidimensional Bloom filter problem: given an element, we wish to receive a list of candidate sets where the element might be. To solve this problem, we consider 3 alternatives. Firstly, we can naively check many Bloom filters. Secondly, we propose to organize the Bloom filters in a hierarchical index structure akin to a B+ tree, that we call Bloofi. Finally, we propose another data structure that packs the Bloom filters in such a way as to exploit bit-level parallelism, which we call Flat-Bloofi. Our theoretical and experimental results show that Bloofi and Flat-Bloofi provide scalable and efficient solutions alternatives to search through a large number of Bloom filters.We build on an existing Bloom filter library (https://github.com/magnuss/java-bloomfilter) by Magnus Skjegstad which we embedded and modified. We also use junit and Hamcrest which we include as jar files for your convenience.