Sciweavers

367 search results - page 21 / 74
» A Storage and Access Architecture for Efficient Query Proces...
Sort
View
ICDE
2007
IEEE
124views Database» more  ICDE 2007»
14 years 9 months ago
On MBR Approximation of Histories for Historical Queries: Expectations and Limitations
Traditional approaches for efficiently processing historical queries, where a history is a multidimensional timeseries, employ a two step filter-and-refine scheme. In the filter s...
Reza Sherkat, Davood Rafiei
VLDB
1994
ACM
147views Database» more  VLDB 1994»
13 years 11 months ago
Integrating a Structured-Text Retrieval System with an Object-Oriented Database System
We describe the integration of a structuredtext retrieval system (TextMachine) into an object-oriented database system (OpenODB). We use the external function capability of the da...
Tak W. Yan, Jurgen Annevelink
FAST
2004
13 years 9 months ago
Diamond: A Storage Architecture for Early Discard in Interactive Search
This paper explores the concept of early discard for interactive search of unindexed data. Processing data inside storage devices using downloaded searchlet code enables Diamond t...
Larry Huston, Rahul Sukthankar, Rajiv Wickremesing...
DASFAA
2006
IEEE
135views Database» more  DASFAA 2006»
13 years 11 months ago
An Efficient Co-operative Framework for Multi-query Processing over Compressed XML Data
XML is a de-facto standard for exchanging and presenting information on the Web. However, XML data is also recognized as verbose since it heavily inflates the size of the data due ...
Juzhen He, Wilfred Ng, Xiaoling Wang, Aoying Zhou
PODS
2006
ACM
138views Database» more  PODS 2006»
14 years 7 months ago
Efficiently ordering subgoals with access constraints
d Abstract] Guizhen Yang Artificial Intelligence Center SRI International Menlo Park, CA 94025, USA Michael Kifer Dept. of Computer Science Stony Brook University Stony Brook, NY 1...
Guizhen Yang, Michael Kifer, Vinay K. Chaudhri