Sciweavers

522 search results - page 78 / 105
» Answering Aggregation Queries in a Secure System Model
Sort
View
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
14 years 7 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
SIGMOD
2005
ACM
161views Database» more  SIGMOD 2005»
14 years 7 months ago
Efficient Keyword Search for Smallest LCAs in XML Databases
Keyword search is a proven, user-friendly way to query HTML documents in the World Wide Web. We propose keyword search in XML documents, modeled as labeled trees, and describe cor...
Yu Xu, Yannis Papakonstantinou
LCPC
2005
Springer
14 years 1 months ago
Code Transformations for One-Pass Analysis
With the growing popularity of streaming data model, processing queries over streaming data has become an important topic. Streaming data has received attention in a number of comm...
Xiaogang Li, Gagan Agrawal
SIGIR
2003
ACM
14 years 26 days ago
Distributed Web Search as a Stochastic Game
Distributed search systems are an emerging phenomenon in Web search, in which independent topic-speciļ¬c search engines provide search services, and metasearchers distribute userā...
Rinat Khoussainov, Nicholas Kushmerick
NLDB
2007
Springer
14 years 1 months ago
Incomplete and Fuzzy Conceptual Graphs to Automatically Index Medical Reports
Most of Information Retrieval (IR) systems are still based on bag of word paradigm. This is a strong limitation if one needs high precision answers. For example, in restricted doma...
Loïc Maisonnasse, Jean-Pierre Chevallet, Cath...