Sciweavers

1109 search results - page 153 / 222
» Query Processing, Approximation, and Resource Management in ...
Sort
View
CIKM
2006
Springer
14 years 16 days ago
Incorporating query difference for learning retrieval functions in world wide web search
We discuss information retrieval methods that aim at serving a diverse stream of user queries such as those submitted to commercial search engines. We propose methods that emphasi...
Hongyuan Zha, Zhaohui Zheng, Haoying Fu, Gordon Su...
CIDR
2007
101views Algorithms» more  CIDR 2007»
13 years 10 months ago
The Data Ring: Community Content Sharing
Information ubiquity has created a large crowd of users (most notably scientists), who could employ DBMS technology to process and share their data more effectively. Still, this ...
Serge Abiteboul, Neoklis Polyzotis
JELIA
1998
Springer
14 years 1 months ago
A Logic for Anytime Deduction and Anytime Compilation
Abstract. One of the maincharacteristics of logical reasoning in knowledge based systems is its high computational complexity. Anytime deduction and anytime compilation are two att...
Frédéric Koriche
SIGMOD
2007
ACM
134views Database» more  SIGMOD 2007»
14 years 9 months ago
Updating a cracked database
A cracked database is a datastore continuously reorganized based on operations being executed. For each query, the data of interest is physically reclustered to speed-up future ac...
Stratos Idreos, Martin L. Kersten, Stefan Manegold
SIGMOD
2009
ACM
258views Database» more  SIGMOD 2009»
14 years 9 months ago
Continuous obstructed nearest neighbor queries in spatial databases
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
Yunjun Gao, Baihua Zheng