Sciweavers

175 search results - page 4 / 35
» Cost-Aware Processing of Similarity Queries in Structured Ov...
Sort
View
ICDE
2006
IEEE
196views Database» more  ICDE 2006»
15 years 11 months ago
Closure-Tree: An Index Structure for Graph Queries
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...
Huahai He, Ambuj K. Singh
DBISP2P
2006
Springer
110views Database» more  DBISP2P 2006»
15 years 1 months ago
Reusing Classical Query Rewriting in P2P Databases
Sharing of structured data in P2P overlays is a challenging problem, especially in the absence of a global schema. The nature of structured data stored in the overlay enforces stri...
Verena Kantere, Timos K. Sellis
VLDB
2001
ACM
94views Database» more  VLDB 2001»
15 years 2 months ago
FeedbackBypass: A New Approach to Interactive Similarity Query Processing
In recent years, several methods have been proposed for implementing interactive similarity queries on multimedia databases. Common to all these methods is the idea to exploit use...
Ilaria Bartolini, Paolo Ciaccia, Florian Waas
PVLDB
2010
190views more  PVLDB 2010»
14 years 4 months ago
Efficient B-tree Based Indexing for Cloud Data Processing
A Cloud may be seen as a type of flexible computing infrastructure consisting of many compute nodes, where resizable computing capacities can be provided to different customers. T...
Sai Wu, Dawei Jiang, Beng Chin Ooi, Kun-Lung Wu
OPODIS
2007
14 years 11 months ago
Peer to Peer Multidimensional Overlays: Approximating Complex Structures
Peer to peer overlay networks have proven to be a good support for storing and retrieving data in a fully decentralized way. A sound approach is to structure them in such a way tha...
Olivier Beaumont, Anne-Marie Kermarrec, Etienne Ri...