- BaseX-Talk - mailman.uni-konstanz.de

how to speed up //myTag requests ?
by Fabrice Etanchaud 23 Aug '12

23 Aug '12

dear all at Basex, In a /a/b/c example schema, Is there any index that could speed up //c request ? best regards, Fabrice ETANCHAUD Senior Software Engineer edital Berkenlaan 1 B-1831 Brussels, Belgium <skype:fabrice.etanchaud?call> +32 2 716 32 32 general +32 2 716 32 20 fax fetanchaud(a)edital.com corsearch.com <http://www.corsearch.com/> | edital.com <http://www.edital.com/> <outbind://899-00000000E439C83B50BF17409D8C27B7AE0425AF07005AA868536216F 543BAB9422EAEA5338B00000011020900005AA868536216F543BAB9422EAEA5338B00000 13AA36B0000/cid:image001.gif@01CC0F02.2C91B6C0> Confidentiality Notice: This email and its attachments (if any) contain confidential information of the sender. The information is intended only for the use by the direct addressees of the original sender of this email. If you are not an intended recipient of the original sender (or responsible for delivering the message to such person), you are hereby notified that any review, disclosure, copying, distribution or the taking of any action in reliance of the contents of and attachments to this email is strictly prohibited. If you have received this email in error, please immediately notify the sender at the address shown herein and permanently delete any copies of this email (digital or paper) in your possession.

2 1

Index auto update
by Gilles CARRY 22 Aug '12

22 Aug '12

Hello, I'm a little bit confused with indexes auto update mechanism. Having created a DB with UPDINDEX=true, and after inserting nodes, 'info database' shows : Indexes Up-to-date: false Text Index: ON Attribute Index: ON Full-Text Index: OFF whereas UPDINDEX=true. After issuing 'optimize', Up-to-date come back to true and FT index to ON. Does this mean index are not automatically updated if 'optimize' is not run? I use BaseX73-20120528.232116.jar Is there any comprehensive documentation about index update mechanism? Thank-you, Gilles.

2 1

Basex editing performance test
by Yoann Maingon 21 Aug '12

21 Aug '12

Hi, Continuing on my recent question about using multiple databases, we've been running some performance test on basex. I don't have the detail of the computer that hosted these test but they were all done on the same computer. Test was to edit a node's value from a php script in a database a million time, the database being choosen randomly in X amount of databases created. (this simulates multiple users accessing our app) *2 DB* Total time : 1517.95 seconds for 1000000 iterations with 2 DB Min time : 1.17 ms with database 1 Max time : 704.72 ms with database 0 Mean time : 1.52 ms *10 000 DB* Total time : 1515.75 seconds for 1000000 iterations with 10 000 DB Min time : 1.21 ms with database 8879 Max time : 645.16 ms with database 3822 Mean time : 1.52 ms *20 000 DB* Total time : 1680.29 seconds for 1000000 iterations with 20 000 DB Min time : 1.18 ms with database 3749 Max time : 285.49 ms with database 6518 Mean time : 1.68 ms *40 000 DB* Total time : 1813.53 seconds for 1000000 iterations with 40 000 DB Min time : 1.04 ms with database 786 Max time : 212.2 ms with database 6949 Mean time : 1.81 ms *80 000 db - test 1* Total time : 24728.94 seconds for 1000000 iterations with 80 000 DB Min time : 1.16 ms with database 25693 Max time : 2433.44 ms with database 22021 Mean time : 24.73 ms *80 000 db - test 2* Total time : 18661.74 seconds for 1000000 iterations with 80 000 DB Min time : 1.68 ms with database 5979 Max time : 1936.4 ms with database 30239 Mean time : 18.66 ms We can just see that there is an important difference from 40k to 80k databases. We haven't checked other mean method to see if this was due to a few edit actions. Does any one tried to have many databases and at some point reached a certain limit? In oder to do server sizing what is key for these actions? processor?ram? Thanks for your help! -- Yoann Maingon mydatalinx 0664324966

2 1

large number of xml files
by sateesh 21 Aug '12

21 Aug '12

Hi Basex, I have a requirement of querying on large number of xml files some where around 10,000 xml files , I have written the query and while executing the query it is taking huge amount of memory and time some where around 700mb memory and time around 4 -5 minutes .Is there a way to execute the query with less memory and with in short time. Thanks & Regards Sateesh.A

2 9

the stack - what are your current favorites?
by Colin McEnearney 21 Aug '12

21 Aug '12

Dear basex xml-ers, What is your stack of choice these days? As a newcomer, interested in learning how to develop for the web using x* from end to end, it's tricky to see how quickly this space is evolving, and what is the latest and greatest. Lots of info on the basex, exist, and marklogic sites, + Adam Retter's site, + some very evangelical blog posts on XRX from 2007-09... And more recently the implementation of restxq by basex and exist... And XQuery in the browser. So many possibilities, but no one stack/framework to rule them all... ? Very interested to hear what basex users are developing with. Thanks, Colin

1 0

restxq
by Colin McEnearney 20 Aug '12

20 Aug '12

This is a newbie email. I've been using basex for some time for its xquery engine (which is awesome) but never in production or for web development. I have some small projects coming up and looking at it for the db side of a web app I just noticed RESTXQ - looks really cool! I'm not really a developer but I use xquery every day at work and so would love to use it - exclusively if possible. Does restxq mean that you can serve a site with no client (php, ruby, etc) in between the db and the html? basex <-> html That would be so simple and fun, and quite useful for a blog or other not-too-huge type of thing. Or is that totally crazy for security reasons? Colin

3 3

xquery grouping
by sateesh 20 Aug '12

20 Aug '12

Hi Basex, I have written a query on an xml file which contains 13000 nodes ,query does some grouping action on that xml,when I run that query it is taking huge amount of memory(1.5gb) and also processing time. PFA of xml file and the query.I have removed the nodes from xml for easy transfer,but in the original xml there will be around 13k <row/> tags Please suggest whether is there a way to reduce the memoru consumption. Thanks & Regards Sateesh.A

1 0

MAXCATS improvement
by Fabrice Etanchaud 19 Aug '12

19 Aug '12

Dear all at BaseX, I 'm working on a big database (more than 100 Go) containing several millions of articles, identified by a unique element. I frequently iterate on the identifiers list, each time I have to compute distinct-values(//myidentifier) in order to build that list. Could it help to set MAXCATS to 2 000 000 or 3 000 000 before creating the database ? I cannot try it, because text index generation throws a heap overflow. Could it be possible to improve the MAXCATS option in order to set a individual MAXCATS value for a specified element or attribute ? Finally, is there a way to complete the text index generation (Xmx is already set to maximum) ? Best regards, Fabrice ETANCHAUD Senior Software Engineer edital Berkenlaan 1 B-1831 Brussels, Belgium <skype:fabrice.etanchaud?call> +32 2 716 32 32 general +32 2 716 32 20 fax fetanchaud(a)edital.com corsearch.com <http://www.corsearch.com/> | edital.com <http://www.edital.com/> <outbind://899-00000000E439C83B50BF17409D8C27B7AE0425AF07005AA868536216F 543BAB9422EAEA5338B00000011020900005AA868536216F543BAB9422EAEA5338B00000 13AA36B0000/cid:image001.gif@01CC0F02.2C91B6C0> Confidentiality Notice: This email and its attachments (if any) contain confidential information of the sender. The information is intended only for the use by the direct addressees of the original sender of this email. If you are not an intended recipient of the original sender (or responsible for delivering the message to such person), you are hereby notified that any review, disclosure, copying, distribution or the taking of any action in reliance of the contents of and attachments to this email is strictly prohibited. If you have received this email in error, please immediately notify the sender at the address shown herein and permanently delete any copies of this email (digital or paper) in your possession.

2 1

Professional editing & proofreading services for your scientific, research and academic documents (£7.99 per thousand words or 0.799 pence per word)
by Academic Proofreading Services 18 Aug '12

18 Aug '12

Description: Description: Description: Description: Description: Description: PRSs.org_with_address_DBC_web.gif Dear Researcher Please excuse us for contacting you directly. We are offering an efficient service to help you and your colleagues ensure that your academic and professional work is written in perfect English. We will check the grammar and style of your work and return it to you to meet your requirements and deadlines. If your research has too many English spelling and grammar errors, or if the publishers style guide has not been followed, your research may be rejected without due regard to its content. We strongly suggest sending the document to us for editing and proofreading before submission, particularly if English is not your first language. We can provide you with a professional proofreading service at a very reasonable rate. All our proofreaders are highly qualified native English speakers. Many work as leading academics in their fields and all have extensive experience of proofreading to the highest standards. We are one of the largest proofreading and editing services worldwide for research documents covering all academic areas including Engineering, Medicine, Physical and Biological Sciences, Social Sciences, Economics, Law, Management and the Humanities. If you are interested in our service, please take a look at our website. All you have to do is send us your document as a Word/LaTeX attachment with the deadline and we will guarantee delivery of a perfectly written document to give you complete confidence when you submit your work. The fee is worked out on a flat rate (£7.99 per thousand words or 0.799 pence per word), so you know exactly how much the proofreading will cost in advance. If you have not heard from us within 2 hours during normal business hours after you have sent your work it is possible that your email has not been received. Please resend it from a webmail account such as Hotmail, Yahoo or Gmail. We look forward to hearing from you! Yours faithfully Robert Hounslow P.S. If you did not want to receive this email please reply with unsubscribe in the subject line. We will take you off our database.

1 0

restxq
by Andy Bunce 18 Aug '12

18 Aug '12

Hi, I am a great fan of RESTXQ, however there seems to be a security concern with the current BaseX implementation when used without additional layers to top. This is that the source code is available for anyone to view. E.g. with the standard installation http://localhost:8984/restxq/ is the restxq demo but http://localhost:8984/restxq.xqm reveals the source. I have pondered small changes to the implementation that would address this, e.g maybe the RESTXQ code could go in WEB-INF folders or similar. Regards /Andy > > Message: 1 > Date: Fri, 17 Aug 2012 14:26:12 -0400 > From: Colin McEnearney <colinmcenearney(a)gmail.com> > To: basex-talk(a)mailman.uni-konstanz.de > Subject: [basex-talk] restxq > Message-ID: > <CAPh7s+KPgb95fFRxGdyKUaKcv= > pkV5LVhjUOR+EVOiqQmK2oWw(a)mail.gmail.com> > Content-Type: text/plain; charset="iso-8859-1" > > This is a newbie email. > > I've been using basex for some time for its xquery engine (which is > awesome) but never in production or for web development. I have some small > projects coming up and looking at it for the db side of a web app I just > noticed RESTXQ - looks really cool! > > I'm not really a developer but I use xquery every day at work and so would > love to use it - exclusively if possible. Does restxq mean that you can > serve a site with no client (php, ruby, etc) in between the db and the > html? > > basex <-> html > > That would be so simple and fun, and quite useful for a blog or other > not-too-huge type of thing. > > Or is that totally crazy for security reasons? > > > Colin >

2 1