Sciweavers

3969 search results - page 293 / 794
» Query Processing Using Ontologies
Sort
View
SIGMOD
2003
ACM
158views Database» more  SIGMOD 2003»
16 years 4 months ago
Processing Set Expressions over Continuous Update Streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
CIKM
2009
Springer
15 years 10 months ago
Workload-aware trie indices for XML
Well-designed indices can dramatically improve query performance. Including query workload information can produce indices that yield better overall throughput while balancing the...
Yuqing Wu, Sofia Brenes, Hyungdae Yi
WWW
2009
ACM
16 years 4 months ago
Answering approximate queries over autonomous web databases
To deal with the problem of empty or too little answers returned from a Web database in response to a user query, this paper proposes a novel approach to provide relevant and rank...
Xiangfu Meng, Z. M. Ma, Li Yan
ICSNW
2004
Springer
188views Database» more  ICSNW 2004»
15 years 9 months ago
Peer Selection in Peer-to-Peer Networks with Semantic Topologies
Peer-to-Peer systems have proven to be an effective way of sharing data. Modern protocols are able to efficiently route a message to a given peer. However, determining the destin...
Peter Haase, Ronny Siebes, Frank van Harmelen
ICASSP
2008
IEEE
15 years 10 months ago
Query adaptative locality sensitive hashing
It is well known that high-dimensional nearest-neighbor retrieval is very expensive. Many signal processing methods suffer from this computing cost. Dramatic performance gains can...
Herve Jegou, Laurent Amsaleg, Cordelia Schmid, Pat...