Sciweavers

99 search results - page 15 / 20
» Efficiently evaluating complex boolean expressions
Sort
View
SIGMOD
2005
ACM
164views Database» more  SIGMOD 2005»
14 years 8 months ago
RankSQL: Query Algebra and Optimization for Relational Top-k Queries
This paper introduces RankSQL, a system that provides a systematic and principled framework to support efficient evaluations of ranking (top-k) queries in relational database syst...
Chengkai Li, Kevin Chen-Chuan Chang, Ihab F. Ilyas...
BIRTE
2006
133views Business» more  BIRTE 2006»
14 years 4 days ago
Leveraging Distributed Publish/Subscribe Systems for Scalable Stream Query Processing
Existing distributed publish/subscribe systems (DPSS) offer loosely coupled and easy to deploy content-based stream delivery services to a large number of users. However, the lack ...
Yongluan Zhou, Kian-Lee Tan, Feng Yu
RSP
2008
IEEE
118views Control Systems» more  RSP 2008»
14 years 2 months ago
Functional DIF for Rapid Prototyping
Dataflow formalisms have provided designers of digital signal processing systems with optimizations and guarantees to arrive at quality prototypes quickly. As system complexity in...
William Plishker, Nimish Sane, Mary Kiemb, Kapil A...
ICEIS
2009
IEEE
14 years 3 months ago
Relaxing XML Preference Queries for Cooperative Retrieval
Today XML is an essential technology for knowledge management within enterprises and dissemination of data over the Web. Therefore the efficient evaluation of XML queries has been ...
SungRan Cho, Wolf-Tilo Balke
CIKM
2008
Springer
13 years 10 months ago
A heuristic approach for checking containment of generalized tree-pattern queries
Query processing techniques for XML data have focused mainly on tree-pattern queries (TPQs). However, the need for querying XML data sources whose structure is very complex or not...
Pawel Placek, Dimitri Theodoratos, Stefanos Soulda...