552 search results - page 74 / 111 » Efficient Algorithms for Processing XPath Queries |
225
Voted
ICDE
2003
IEEE
16 years 3 months ago
2003
IEEE
Structural join operations are central to evaluating queries against XML data, and are typically responsible for consuming a lion's share of the query processing time. Thus, ...
158
click to vote
JSS
2008
15 years 2 months ago
2008
So far, many researches have been done to develop efficient music retrieval systems, and query-by-humming has been considered as one of the most intuitive and effective query meth...
203
Voted
VLDB
2008
ACM
16 years 2 months ago
2008
ACM
Several variations of nearest neighbor (NN) query have been investigated by the database community. However, realworld applications often result in the formulation of new variatio...
194
Voted
SIGMOD
2009
ACM
16 years 2 months ago
2009
ACM
Uncertain data arises in a number of domains, including data integration and sensor networks. Top-k queries that rank results according to some user-defined score are an important...
129
Voted
ENTCS
2002
15 years 2 months ago
2002
Abstract. We present an extension to linear-time temporal logic (LTL) that combines the temporal specification with the collection of statistical data. By collecting statistics ove...