Sciweavers

205 search results - page 27 / 41
» Optimizing Multiple Top-K Queries over Joins
Sort
View
NIPS
2008
13 years 9 months ago
Estimating Robust Query Models with Convex Optimization
Query expansion is a long-studied approach for improving retrieval effectiveness by enhancing the user's original query with additional related words. Current algorithms for ...
Kevyn Collins-Thompson
ICDE
2003
IEEE
144views Database» more  ICDE 2003»
14 years 9 months ago
Flux: An Adaptive Partitioning Operator for Continuous Query Systems
The long-running nature of continuous queries poses new scalability challenges for dataflow processing. CQ systems execute pipelined dataflows that may be shared across multiple q...
Mehul A. Shah, Joseph M. Hellerstein, Sirish Chand...
DASFAA
2007
IEEE
205views Database» more  DASFAA 2007»
13 years 11 months ago
Efficient Support for Ordered XPath Processing in Tree-Unaware Commercial Relational Databases
Abstract. In this paper, we present a novel ordered XPATH evaluation in treeunaware RDBMS. The novelties of our approach lies in the followings. (a) We propose a novel XML storage ...
Boon-Siew Seah, Klarinda G. Widjanarko, Sourav S. ...
CORR
2011
Springer
181views Education» more  CORR 2011»
12 years 11 months ago
SmartInt: Using Mined Attribute Dependencies to Integrate Fragmented Web Databases
Many web databases can be seen as providing partial and overlapping information about entities in the world. To answer queries effectively, we need to integrate the information ab...
Ravi Gummadi, Anupam Khulbe, Aravind Kalavagattu, ...
ICDE
2005
IEEE
131views Database» more  ICDE 2005»
14 years 9 months ago
On the Sequencing of Tree Structures for XML Indexing
Sequence-based XML indexing aims at avoiding expensive join operations in query processing. It transforms structured XML data into sequences so that a structured query can be answ...
Haixun Wang, Xiaofeng Meng