Sciweavers

278 search results - page 26 / 56
» Adapting Partitioned Continuous Query Processing in Distribu...
Sort
View
PVLDB
2010
118views more  PVLDB 2010»
15 years 28 days ago
Ten Thousand SQLs: Parallel Keyword Queries Computing
Keyword search in relational databases has been extensively studied. Given a relational database, a keyword query finds a set of interconnected tuple structures connected by fore...
Lu Qin, Jefferey Yu, Lijun Chang
ICPADS
2005
IEEE
15 years 8 months ago
A Model for Distributing and Querying a Data Warehouse on a Computing Grid
Data warehouses store large volumes of data according to a multidimensional model with dimensions representing different axes of analysis. OLAP systems (OnLine Analytical Processi...
Pascal Wehrle, Maryvonne Miquel, Anne Tchounikine
SIGIR
2009
ACM
15 years 9 months ago
Effective query expansion for federated search
While query expansion techniques have been shown to improve retrieval performance in a centralized setting, they have not been well studied in a federated setting. In this paper, ...
Milad Shokouhi, Leif Azzopardi, Paul Thomas
DOLAP
2004
ACM
15 years 8 months ago
Experimental evidence on partitioning in parallel data warehouses
Parallelism can be used for major performance improvement in large Data warehouses (DW) with performance and scalability challenges. A simple low-cost shared-nothing architecture ...
Pedro Furtado
131
Voted
EDBTW
2006
Springer
15 years 6 months ago
A Data and Query Model for Streaming Geospatial Image Data
Abstract. Most of the recent work on adaptive processing and continuous querying of data streams assume that data objects come in the form of tuples, thus relying on the relational...
Michael Gertz, Quinn Hart, Carlos Rueda, Shefali S...