Return-Path: X-Original-To: apmail-accumulo-user-archive@www.apache.org Delivered-To: apmail-accumulo-user-archive@www.apache.org Received: from mail.apache.org (hermes.apache.org [140.211.11.3]) by minotaur.apache.org (Postfix) with SMTP id 7DEFE18F23 for ; Tue, 9 Feb 2016 14:59:31 +0000 (UTC) Received: (qmail 61205 invoked by uid 500); 9 Feb 2016 14:59:31 -0000 Delivered-To: apmail-accumulo-user-archive@accumulo.apache.org Received: (qmail 61151 invoked by uid 500); 9 Feb 2016 14:59:31 -0000 Mailing-List: contact user-help@accumulo.apache.org; run by ezmlm Precedence: bulk List-Help: List-Unsubscribe: List-Post: List-Id: Reply-To: user@accumulo.apache.org Delivered-To: mailing list user@accumulo.apache.org Received: (qmail 61140 invoked by uid 99); 9 Feb 2016 14:59:31 -0000 Received: from Unknown (HELO spamd4-us-west.apache.org) (209.188.14.142) by apache.org (qpsmtpd/0.29) with ESMTP; Tue, 09 Feb 2016 14:59:31 +0000 Received: from localhost (localhost [127.0.0.1]) by spamd4-us-west.apache.org (ASF Mail Server at spamd4-us-west.apache.org) with ESMTP id DB5B8C0D23 for ; Tue, 9 Feb 2016 14:59:30 +0000 (UTC) X-Virus-Scanned: Debian amavisd-new at spamd4-us-west.apache.org X-Spam-Flag: NO X-Spam-Score: 0.572 X-Spam-Level: X-Spam-Status: No, score=0.572 tagged_above=-999 required=6.31 tests=[KAM_LAZY_DOMAIN_SECURITY=1, RP_MATCHES_RCVD=-0.429, UNPARSEABLE_RELAY=0.001] autolearn=disabled Received: from mx1-eu-west.apache.org ([10.40.0.8]) by localhost (spamd4-us-west.apache.org [10.40.0.11]) (amavisd-new, port 10024) with ESMTP id FlgbXw9cM5jJ for ; Tue, 9 Feb 2016 14:59:29 +0000 (UTC) Received: from llmx2.ll.mit.edu (LLMX2.LL.MIT.EDU [129.55.12.48]) by mx1-eu-west.apache.org (ASF Mail Server at mx1-eu-west.apache.org) with ESMTP id 25E6031AE0 for ; Tue, 9 Feb 2016 14:59:28 +0000 (UTC) Received: from LLE2K10-HUB01.mitll.ad.local (LLE2K10-HUB01.mitll.ad.local) by llmx2.ll.mit.edu (unknown) with ESMTP id u19Ex0dJ031387 for ; Tue, 9 Feb 2016 09:59:02 -0500 Date: Tue, 9 Feb 2016 09:59:03 -0500 From: Jeremy Kepner To: Subject: Re: Searching d4m based table Message-ID: <20160209145903.GA27733@ll.mit.edu> Reply-To: References: MIME-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Content-Disposition: inline In-Reply-To: User-Agent: Mutt/1.5.21 (2010-09-15) X-Proofpoint-Virus-Version: vendor=fsecure engine=2.50.10432:,, definitions=2016-02-09_09:,, signatures=0 X-Proofpoint-Spam-Details: rule=inbound_notspam policy=inbound score=0 spamscore=0 suspectscore=1 malwarescore=0 phishscore=0 adultscore=0 bulkscore=0 classifier=spam adjust=0 reason=mlx scancount=1 engine=8.0.1-1601100000 definitions=main-1602090258 Graphs and graph traversals. Exact match and range queries. If the data set is large and you are concerned about a particular query returning a lot of data then it is important to create a degree table that maintains the count of each unique entry in the d4m table. You can then query the degree table first to get an estimate of how big the results will be prior to actually performing the query. Here are some papers that might be helpful: http://arxiv.org/abs/1407.3859 http://arxiv.org/abs/1507.01066 http://arxiv.org/abs/1407.6923 http://arxiv.org/abs/1406.4923 On Tue, Feb 09, 2016 at 07:01:05AM -0500, Jamie Johnson wrote: > Is there documentation describing what types of searches perform well on a > d4m based table? Any examples?