552 search results - page 85 / 111 » Efficient Algorithms for Processing XPath Queries |
185
click to vote
SIGMOD
2009
ACM
16 years 3 hour ago
2009
ACM
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
114
click to vote
ICDE
2010
IEEE
15 years 11 months ago
2010
IEEE
Keyword search is considered to be an effective information discovery method for both structured and semistructured data. In XML keyword search, query semantics is based on the con...
IDEAS
2000
IEEE
15 years 4 months ago
2000
IEEE
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
VLDB
1990
ACM
15 years 3 months ago
1990
ACM
In this paper, we describe a new indexing technique, the time indez, for improving the performance of certain classes of temporal queries. The time index can be used to retrieve v...
121
click to vote
ICIP
2002
IEEE
16 years 1 months ago
2002
IEEE
In this paper, we present a new and robust shape descriptor, which can be efficiently used to quickly prune a search for similar shapes in a large image database. The proposed sha...