Sciweavers

552 search results - page 71 / 111
» Efficient Algorithms for Processing XPath Queries
Sort
View
DKE
2006
123views more  DKE 2006»
14 years 12 months ago
Cost models for distance joins queries using R-trees
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
ICDE
2008
IEEE
232views Database» more  ICDE 2008»
16 years 1 months ago
Continuous Content-Based Copy Detection over Streaming Videos
Digital videos are increasingly adopted in various multimedia applications where they are usually broadcasted or transmitted as video streams. Continuously monitoring copies on the...
Ying Yan, Beng Chin Ooi, Aoying Zhou
WWW
2004
ACM
16 years 14 days ago
Remindin': semantic query routing in peer-to-peer networks based on social metaphors
In peer-to-peer networks, finding the appropriate answer for an information request, such as the answer to a query for RDF(S) data, depends on selecting the right peer in the netw...
Christoph Tempich, Steffen Staab, Adrian Wranik
WWW
2004
ACM
16 years 14 days ago
Best bets: thousands of queries in search of a client
A number of applications require selecting targets for specific contents on the basis of criteria defined by the contents providers rather than selecting documents in response to ...
Giuseppe Attardi, Andrea Esuli, Maria Simi
SIGMOD
2004
ACM
119views Database» more  SIGMOD 2004»
15 years 12 months ago
Lazy Query Evaluation for Active XML
In this paper, we study query evaluation on Active XML documents (AXML for short), a new generation of XML documents that has recently gained popularity. AXML documents are XML do...
Serge Abiteboul, Omar Benjelloun, Bogdan Cautis, I...