Sciweavers

2859 search results - page 400 / 572
» Querying Complex Structured Databases
Sort
View
CIKM
2009
Springer
14 years 8 days ago
Scalable indexing of RDF graphs for efficient join processing
Current approaches to RDF graph indexing suffer from weak data locality, i.e., information regarding a piece of data appears in multiple locations, spanning multiple data structur...
George H. L. Fletcher, Peter W. Beck
JUCS
2008
116views more  JUCS 2008»
13 years 8 months ago
A Workflow Language for Web Automation
: Most today's web sources do not provide suitable interfaces for software programs to interact with them. Many researchers have proposed highly effective techniques to addres...
Paula Montoto, Alberto Pan, Juan Raposo, Jos&eacut...
JIIS
2002
141views more  JIIS 2002»
13 years 8 months ago
Combining Approximation Techniques and Vector Quantization for Adaptable Similarity Search
Adaptable similarity queries based on quadratic form distance functions are widely popular in data mining application domains including multimedia, CAD, molecular biology or medica...
Christian Böhm, Hans-Peter Kriegel, Thomas Se...
ICDE
2001
IEEE
115views Database» more  ICDE 2001»
14 years 9 months ago
Incremental Computation and Maintenance of Temporal Aggregates
We consider the problems of computing aggregation queries in temporal databases, and of maintaining materialized temporal aggregate views efficiently. The latter problem is partic...
Jun Yang 0001, Jennifer Widom
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
14 years 8 months ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...