On 22 May 2015, at 3:26, Efi wrote:
Thank you for the recursively tag check, Steven told me about it
yesterday as well.I hadnt thought of it so far but I will think of
ways to implement it for these methods so it does not create problems.
My question was not exactly that, I was considering
Thank you for the recursively tag check, Steven told me about it
yesterday as well.I hadnt thought of it so far but I will think of ways
to implement it for these methods so it does not create problems.
My question was not exactly that, I was considering if the query engine
could parse data
This seems correct to me. Since our objective in implementing HDFS is to
deal with very large XML files, I think we should avoid any size
limitations. Regarding the tags, does anyone have any thoughts on this? In
the case of searching for all elements with a given name regardless of
depth, this
(1) I agree that [1] looks better (thanks for the diagrams - we should add them
to the docs!).
(2) I think that it’s ok to have the restriction, that the given tag
(a) identifies the root element of the elements that we want to work with
and
(b) is not used recursively (and I would
Hello everyone,
For this week the two different methods for reading complete items
according to a specific tag are completed and tested in standalone hdfs
deployment.In detail what each method does:
The first method, I call it One Buffer Method, reads a block, saves it
in a buffer, and
Great work!
Steven
On Sun, May 17, 2015 at 1:15 PM, Efi efika...@gmail.com wrote:
Hello everyone,
This is my update on what I have been doing this last week:
Created an XMLInputFormat java class with the functionalities that Hamza
described in the issue [1] .The class reads from blocks
+1 Sounds great!
On 5/18/15 8:33 AM, Steven Jacobs wrote:
Great work!
Steven
On Sun, May 17, 2015 at 1:15 PM, Efi efika...@gmail.com wrote:
Hello everyone,
This is my update on what I have been doing this last week:
Created an XMLInputFormat java class with the functionalities that Hamza
