591 search results - page 77 / 119 » The complexity of XPath query evaluation |
ICDE
2007
IEEE
14 years 3 months ago
2007
IEEE
Partitioned query processing is an effective method to process continuous queries with large stateful operators in a distributed systems. This method typically partitions input da...
SAC
2006
ACM
14 years 2 months ago
2006
ACM
Structured data and complex schemas are becoming the main way to represent the information many Digital Libraries provide, thus impacting the services they offer. When searching i...
SIGMOD
2004
ACM
14 years 8 months ago
2004
ACM
Virtually every commercial query optimizer chooses the best plan for a query using a cost model that relies heavily on accurate cardinality estimation. Cardinality estimation erro...
SIGMOD
2004
ACM
14 years 8 months ago
2004
ACM
The rapid adoption of XML as the standard for data representation and exchange foreshadows a massive increase in the amounts of XML data collected, maintained, and queried over th...
SIGMOD
1997
ACM
14 years 25 days ago
1997
ACM
: The read-mostly environment of data warehousing makes it possible to use more complex indexes to speed up queries than in situations where concurrent updatesare present. The curr...