Sciweavers

311 search results - page 37 / 63
» Approximate XML joins
Sort
View
ICDE
2005
IEEE
240views Database» more  ICDE 2005»
16 years 1 months ago
Adaptive Processing of Top-K Queries in XML
The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories. The efficiency of top-k query evaluation relies o...
Amélie Marian, Divesh Srivastava, Nick Koud...
ADC
2003
Springer
173views Database» more  ADC 2003»
15 years 5 months ago
Cooperative Query Answering for Semistructured Data
Semistructured data, in particular XML, has emerged as one of the primary means for information exchange and content management. The power of XML allows authors to structure a doc...
Michael Barg, Raymond K. Wong
SIGMOD
2007
ACM
145views Database» more  SIGMOD 2007»
15 years 12 months ago
Why off-the-shelf RDBMSs are better at XPath than you might expect
To compensate for the inherent impedance mismatch between the relational data model (tables of tuples) and XML (ordered, unranked trees), tree join algorithms have become the prev...
Torsten Grust, Jan Rittinger, Jens Teubner
VLDB
2005
ACM
129views Database» more  VLDB 2005»
15 years 5 months ago
Sketching Streams Through the Net: Distributed Approximate Query Tracking
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...
Graham Cormode, Minos N. Garofalakis
JUCS
2008
158views more  JUCS 2008»
14 years 11 months ago
A Linear Time Approximation Algorithm for Ruler Folding Problem
: A chain or n-link is a sequence of n links whose lengths are fixed and are joined together from their endpoints, free to turn about their endpoints, which act as joints. "Ru...
Ali Nourollah, Mohammadreza Razzazi