591 search results - page 82 / 119 » The complexity of XPath query evaluation |
SIGMOD
2003
ACM
14 years 8 months ago
2003
ACM
We consider the problem of efficiently producing ranked results for keyword search queries over hyperlinked XML documents. Evaluating keyword search queries over hierarchical XML ...
DCOSS
2007
Springer
14 years 2 months ago
2007
Springer
Many emergent distributed sensing applications need to keep track of mobile entities across multiple sensor networks connected via an IP network. To simplify the realization of suc...
FOCS
2003
IEEE
14 years 1 months ago
2003
IEEE
We initiate a general study of pseudo-random implementations of huge random objects, and apply it to a few areas in which random objects occur naturally. For example, a random obj...
ICDE
2006
IEEE
14 years 2 months ago
2006
IEEE
XML structural joins, which evaluate the containment (ancestor-descendant) relationships between XML elements, are important operations of XML query processing. Estimating structu...
TKDE
2012
11 years 11 months ago
2012
—Preparing a data set for analysis is generally the most time consuming task in a data mining project, requiring many complex SQL queries, joining tables and aggregating columns....