Thanks Jeremy, I will give this a read. Are there any sample projects that demonstrate these types of queries?
On Tue, Feb 9, 2016 at 9:59 AM, Jeremy Kepner <kep...@ll.mit.edu> wrote: > 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? >
