1429 search results - page 51 / 286 » Efficient processing of XPath queries using indexes |
SSD
1999
Springer
14 years 1 months ago
1999
Springer
We provide an evaluation of query execution plans (QEP) in the case of queries with one or two spatial joins. The QEPs assume R -tree indexed relations and use a common set of spat...
ASWC
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. Nowadays, the demand on querying and searching the Semantic Web is increasing. Some systems have adopted IR (Information Retrieval) approaches to index and search the Sem...
SIGMOD
2003
ACM
14 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...
VLDB
2002
ACM
13 years 8 months ago
2002
ACM
With the rapid growth of XML-document traffic on the Internet, scalable content-based dissemination of XML documents to a large, dynamic group of consumers has become an important...
SIGMOD
2004
ACM
14 years 9 months ago
2004
ACM
Increasing popularity of XML in recent years has generated much interest in query processing over graph-structured data. To support efficient evaluation of path expressions, many ...