Sciweavers

382 search results - page 38 / 77
» Refreshing Models to Provide Timely Query Recommendations
Sort
View
EDBT
2006
ACM
255views Database» more  EDBT 2006»
14 years 8 months ago
FIS-by-Step: Visualization of the Fast Index Scan for Nearest Neighbor Queries
Abstract. Many different index structures have been proposed for spatial databases to support efficient query processing. However, most of these index structures suffer from an exp...
Elke Achtert, Dominik Schwald
PKDD
2009
Springer
149views Data Mining» more  PKDD 2009»
14 years 3 months ago
Learning to Disambiguate Search Queries from Short Sessions
Web searches tend to be short and ambiguous. It is therefore not surprising that Web query disambiguation is an actively researched topic. To provide a personalized experience for ...
Lilyana Mihalkova, Raymond J. Mooney
VLDB
1995
ACM
97views Database» more  VLDB 1995»
14 years 1 days ago
Processing Object-Oriented Queries with Invertible Late Bound Functions
New demandsare put on query processing in Object-Oriented(00) databasesto provide efficient andrelationally completequery languages. A flexible 00 data model requires overloading ...
Staffan Flodin, Tore Risch
DASFAA
2007
IEEE
191views Database» more  DASFAA 2007»
14 years 13 days ago
ABIDE: A Bid-Based Economic Incentive Model for Enticing Non-cooperative Peers in Mobile-P2P Networks
In mobile ad-hoc peer-to-peer (M-P2P) networks, a large percentage of the mobile peers typically do not provide any service to the network, thereby motivating incentive schemes for...
Anirban Mondal, Sanjay Kumar Madria, Masaru Kitsur...
ICDCS
2011
IEEE
12 years 8 months ago
Privacy-Preserving Query over Encrypted Graph-Structured Data in Cloud Computing
— In the emerging cloud computing paradigm, data owners become increasingly motivated to outsource their complex data management systems from local sites to the commercial public...
Ning Cao, Zhenyu Yang, Cong Wang, Kui Ren, Wenjing...