Hi Eliot,
It seems you already found the solution that works for your use case
(and I can't propose anything better anyway ;). I'd just like to
indicate that there has been some initial discussion on asynchronous
requests in the GitHub tracker [1].
Cheers,
Christian
[1]
In my link management application I'm creating a potentially large number
of small documents that will serve as a where-used index over the content
documents.
Are there any potential issues with how these documents are organized into
directories within database? The simplest thing would be to put
Hi Lars,
I guess it was due to the internal XQFT representation of match
positions that adjacent matches are marked one by one, and it's
probably difficult to change this without too much additional effort.
However, you can use XQuery for transforming your result; see e.g. the
attached XQuery
Hi Eliot,
You shouldn't encounter any problems when storing all XML documents in
the same database directory. It may only get an issue if you plan to
export the files to disk.
I remember one use case in which we stored around 20 millions
documents in a single database. It has been a while ago,
I'm trying to understand how to use db:output() in the context of a REST
function that does a bunch of stuff that updates and then wants to return
a result.
I have my updating functions using db:output() to return XML elements that
are log entries, which I have up to now then formatted as HTML
Hi Eliot,
Two years ago, two members of our team gave a little demo on RESTXQ
[1,2]. Maybe this gives you an idea how we db:output can be used in
web applications.
Just recently, we added a function that allows you to access the
current entries of the output cache [3]. Please note, however, that
Thanks for XQuery code! I will try to integrate it with our own efforts,
and let you know how it goes.
Lars
2015-07-05 15:19 GMT+02:00 Christian Grün christian.gr...@gmail.com:
Hi Lars,
I guess it was due to the internal XQFT representation of match
positions that adjacent matches are
I'm trying to plan for large scale. For a large company managing many DITA
publications you could have 100s of 1000s of individual topics and 1000s
of maps that organize those topics.
So if there are 100,000 topics and an average of 10 links to each topic
(definitely an upper bound in normal
8 matches
Mail list logo