65 search results - page 6 / 13 » Efficient Support for Ordered XPath Processing in Tree-Unawa... |
SIGMOD
2007
ACM
14 years 7 months ago
2007
ACM
Querying XML effectively and efficiently using declarative languages such as XQuery and XPath has been widely studied in both academic and industrial settings. Most RDBMS vendors ...
SSDBM
2003
IEEE
14 years 21 days ago
2003
IEEE
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existin...
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the...
SIGMOD
2007
ACM
14 years 7 months ago
2007
ACM
The Boolean semantics of SQL queries cannot adequately capture the "fuzzy" preferences and "soft" criteria required in non-traditional data retrieval applicati...
VLDB
2002
ACM
13 years 7 months ago
2002
ACM
Star queries are the most prevalent kind of queries in data warehousing, OLAP and business intelligence applications. Thus, there is an imperative need for efficiently processing ...