Sciweavers

4337 search results - page 30 / 868
» Cache-Oblivious Query Processing
Sort
View
ICDT
2012
ACM
226views Database» more  ICDT 2012»
11 years 11 months ago
Factorised representations of query results: size bounds and readability
We introduce a representation system for relational data based on algebraic factorisation using distributivity of product over union and commutativity of product and union. We giv...
Dan Olteanu, Jakub Zavodny
EMNLP
2009
13 years 6 months ago
Using Word-Sense Disambiguation Methods to Classify Web Queries by Intent
Three methods are proposed to classify queries by intent (CQI), e.g., navigational, informational, commercial, etc. Following mixed-initiative dialog systems, search engines shoul...
Emily Pitler, Ken Ward Church
CORR
2011
Springer
200views Education» more  CORR 2011»
13 years 3 months ago
Distributed Inference and Query Processing for RFID Tracking and Monitoring
In this paper, we present the design of a scalable, distributed stream processing system for RFID tracking and monitoring. Since RFID data lacks containment and location informati...
Zhao Cao, Charles Sutton, Yanlei Diao, Prashant J....
WAIM
2010
Springer
13 years 6 months ago
Efficient Continuous Top-k Keyword Search in Relational Databases
Keyword search in relational databases has been widely studied in recent years. Most of the previous studies focus on how to answer an instant keyword query. In this paper, we focu...
Yanwei Xu, Yoshiharu Ishikawa, Jihong Guan
RP
2010
Springer
163views Control Systems» more  RP 2010»
13 years 6 months ago
Efficient Graph Reachability Query Answering Using Tree Decomposition
Efficient reachability query answering in large directed graphs has been intensively investigated because of its fundamental importance in many application fields such as XML data ...
Fang Wei