552 search results - page 24 / 111 » Efficient Algorithms for Processing XPath Queries |
ICWS
2009
IEEE
14 years 7 months ago
2009
IEEE
DHTs are scalable, self-organizing, and adaptive to underlying topology changes, thus being a promising infrastructure for realizing efficient Web service discovery. Range queries...
DBKDA
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract—XML indexing and search has become an important topic, and twig joins are key building blocks in XML search systems. This paper describes a novel approach using a nested...
CIKM
2006
Springer
15 years 1 months ago
2006
Springer
In an uncertain database, each data item is modeled as a range associated with a probability density function. Previous works for this kind of data have focussed on simple queries...
VLDB
1989
ACM
15 years 1 months ago
1989
ACM
This paper presents a parallel algorithm for recursive query processing and shows how it can be efficiently implemented in a local computer network. The algorithm relies on an int...
SIGMOD
2003
ACM
15 years 9 months ago
2003
ACM
Object-oriented and object-relational DBMS support setvalued attributes, which are a natural and concise way to model complex information. However, there has been limited research...