Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Mark Logic StrangeLoop 2010
Upcoming SlideShare
Loading in …5
×

Mark Logic StrangeLoop 2010

545 views
523 views

Published on

Presentation from StrangeLoop 2010 in St. Louis: "Unifying the Search Engine and NoSQL DBMS with a Universal Index"

Published in: Technology
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
545
On SlideShare
0
From Embeds
0
Number of Embeds
57
Actions
Shares
0
Downloads
6
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide
  • Ordered index in lat-major order. log(n) lookup in latitude bounds, then scans longitude bounds
  • Generate all the normal indexing terms for the reverse-query document, then do a linear merge to match query-document terms with the root nodes of the unified expression tree. Based on which terms do or don't match, nominate documents that may contain matching queries. For each nominated query-document, evaluate from the root of the query tree on the right side towards the leaf nodes at the left of the slide. Once a subtree has been evaluated for one query-document, we remember the result and short-circuit that evaluation for any other query-documents that share the subquery.
  • ×