707 search results - page 23 / 142 » Processing queries on tree-structured data efficiently |
ICDE
2009
IEEE
14 years 10 months ago
2009
IEEE
Discovering non-trivial matching subsequences from two time series is very useful in synthesizing novel time series. This can be applied to applications such as motion synthesis wh...
IS
2007
13 years 8 months ago
2007
Despite the importance of ranked queries in numerous applications involving multi-criteria decision making, they are not efficiently supported by traditional database systems. In ...
PVLDB
2008
13 years 8 months ago
2008
Unlike traditional database queries, keyword queries do not adhere to predefined syntax and are often dirty with irrelevant words from natural languages. This makes accurate and e...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
: - In this paper we present several novel efficient techniques and multidimensional data structures which can improve the decision making process in many domains. We consider onli...
SIGMOD
2007
ACM
14 years 8 months ago
2007
ACM
Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between query scores and data uncertainty ma...