Jason Hunter to speak at Sold Out QCon SF, November 3, 2010

Jason Hunter to speak at Sold Out QCon SF, November 3, 2010

by Eric Bloch

QCon SF 2010

 

QCon is coming up next week here in San Francisco.   From the conference website, you can see:

 

QCon is a practitioner-driven conference designed for team leads, architects and project management.  The program includes two tutorial days led by industry experts and authors and three conference days with 16 tracks covering a wide variety of relevant and exciting topics in software development today.   There is no other event in the US with similar opportunities for learning, networking, and tracking innovation occurring in the enterprise software development community.

 

Among a really great list of speakers including folks like Martin Fowler (of OOP fame) and Dan Ingalls (of Smalltalk fame), MarkLogic's own Jason Hunter will be speaking on our combination of search-engine and database in MarkLogic's Universal Index.  Details of his presentation are below:

Presentation: "Unifying the Search Engine and NoSQL DBMS with a Universal Index"

Time: Wednesday 12:05 - 13:05

Location: Concordia Room

Abstract:

In contrast to single-function architectures, MarkLogic Server takes an unusual approach to collapsing the usual hierarchies of types of servers that make up a complete application, combining Search, a NoSQL DBMS, and an application server in a single kernel. The computational foundation for this hybrid is the Universal Index.

In this talk, we'll begin with the familiar text indexing data structures and algorithms that underlie search engine technologies. We'll extend that index to cover document structure and semantics, add scalar range indexing in one and two dimensions (including geospatial application), and then incorporate "reverse" indexing of queries. We will demonstrate a novel type of "matchmaking" query whose evaluation is based on a composition of forward and reverse index evaluation. Finally, we'll explore the means by which all of this indexing may efficiently run concurrently with querying, using Multi-Version Concurrency Control and Log-Structured Merge Trees, providing ACID transactions together with lock-free query evaluation, built-in sharding, terabyte-per-server scale-out, replication, and query distribution.

Comments