Return-Path: X-Original-To: apmail-asterixdb-users-archive@minotaur.apache.org Delivered-To: apmail-asterixdb-users-archive@minotaur.apache.org Received: from mail.apache.org (hermes.apache.org [140.211.11.3]) by minotaur.apache.org (Postfix) with SMTP id 1479D186DE for ; Wed, 9 Dec 2015 19:18:32 +0000 (UTC) Received: (qmail 99901 invoked by uid 500); 9 Dec 2015 19:18:32 -0000 Delivered-To: apmail-asterixdb-users-archive@asterixdb.apache.org Received: (qmail 99869 invoked by uid 500); 9 Dec 2015 19:18:32 -0000 Mailing-List: contact users-help@asterixdb.incubator.apache.org; run by ezmlm Precedence: bulk List-Help: List-Unsubscribe: List-Post: List-Id: Reply-To: users@asterixdb.incubator.apache.org Delivered-To: mailing list users@asterixdb.incubator.apache.org Received: (qmail 99849 invoked by uid 99); 9 Dec 2015 19:18:31 -0000 Received: from Unknown (HELO spamd1-us-west.apache.org) (209.188.14.142) by apache.org (qpsmtpd/0.29) with ESMTP; Wed, 09 Dec 2015 19:18:31 +0000 Received: from localhost (localhost [127.0.0.1]) by spamd1-us-west.apache.org (ASF Mail Server at spamd1-us-west.apache.org) with ESMTP id 2F138C9BE6; Wed, 9 Dec 2015 19:18:31 +0000 (UTC) X-Virus-Scanned: Debian amavisd-new at spamd1-us-west.apache.org X-Spam-Flag: NO X-Spam-Score: 2.989 X-Spam-Level: ** X-Spam-Status: No, score=2.989 tagged_above=-999 required=6.31 tests=[HTML_MESSAGE=3, SPF_PASS=-0.001, T_RP_MATCHES_RCVD=-0.01] autolearn=disabled Received: from mx1-eu-west.apache.org ([10.40.0.8]) by localhost (spamd1-us-west.apache.org [10.40.0.7]) (amavisd-new, port 10024) with ESMTP id W1t-IWtXukwb; Wed, 9 Dec 2015 19:18:24 +0000 (UTC) Received: from mail.jpl.nasa.gov (sentrion2.jpl.nasa.gov [128.149.139.106]) by mx1-eu-west.apache.org (ASF Mail Server at mx1-eu-west.apache.org) with ESMTPS id 8C90920599; Wed, 9 Dec 2015 19:18:23 +0000 (UTC) Received: from mail.jpl.nasa.gov (ap-ehub-sp02.jpl.nasa.gov [128.149.137.149]) by smtp.jpl.nasa.gov (Sentrion-MTA-4.3.1/Sentrion-MTA-4.3.1) with ESMTP id tB9JIEgY015763 (using TLSv1 with cipher AES128-SHA (128 bits) verified NO); Wed, 9 Dec 2015 11:18:15 -0800 Received: from AP-EMBX-SP30.RES.AD.JPL ([169.254.2.179]) by ap-ehub-sp02.RES.AD.JPL ([fe80::dd85:7b07:1e36:7e3c%15]) with mapi id 14.03.0210.002; Wed, 9 Dec 2015 11:18:14 -0800 From: "Malarout, Namrata (398M-Affiliate)" To: "users@asterixdb.incubator.apache.org" , "dev@asterixdb.incubator.apache.org" Subject: Few questions about AsterixDB Thread-Topic: Few questions about AsterixDB Thread-Index: AQHRMrZaBVFW7dN5gkmJXgfo3IcoSw== Date: Wed, 9 Dec 2015 19:18:14 +0000 Message-ID: Accept-Language: en-US Content-Language: en-US X-MS-Has-Attach: X-MS-TNEF-Correlator: x-originating-ip: [128.149.137.82] Content-Type: multipart/alternative; boundary="_000_D28DBE75225CNamrataMalaroutjplnasagov_" MIME-Version: 1.0 X-Source-Sender: Namrata.Malarout@jpl.nasa.gov X-AUTH: Authorized --_000_D28DBE75225CNamrataMalaroutjplnasagov_ Content-Type: text/plain; charset="Windows-1252" Content-Transfer-Encoding: quoted-printable Hi, I had for a few question specific to AsterixDB for a Data Container Study I= am working on. I can=92t really address these as I have not explored them = yet. The questions are: 1. What, if any, are the parallelization bottlenecks? 2. Does AsterixDB support Anomaly Detection, Clustering or Graph Travers= al? 3. Can we find largest connecting components in graph? 4. Is automation possible for repetitive tasks? If anyone has worked with use cases which use any of the above concepts or = have knowledge about these and could help answer them, it would be great. Thanks in advance, Namrata --_000_D28DBE75225CNamrataMalaroutjplnasagov_ Content-Type: text/html; charset="Windows-1252" Content-ID: Content-Transfer-Encoding: quoted-printable
Hi,
I had for a few question specific to AsterixDB for a Data Container St= udy I am working on. I can=92t really address these as I have not explored = them yet.
The questions are:
  1. What, if any, are the parallelization bottl= enecks?
  2. Does A= sterixDB support Anomaly Detection, Clustering or Graph Traversal?
  3. Can we find largest connectin= g components in graph?
  4. Is automation possible for repetitive tasks?
If anyone has worked with use cases which use any of the above concept= s or have knowledge about these and could help answer them, it would be gre= at.
Thanks in advance,
Namrata
--_000_D28DBE75225CNamrataMalaroutjplnasagov_--