Sciweavers

301 search results - page 11 / 61
» Efficient Sketches for the Set Query Problem
Sort
View
74
Voted
FGCS
2000
81views more  FGCS 2000»
14 years 10 months ago
Managing the operator ordering problem in parallel databases
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...
Harald Kosch
RTCSA
2008
IEEE
15 years 5 months ago
Efficient Query Processing for Tracing RFID Tags by Reordering Location Identifiers
This paper addresses the problem of using the Location IDentifier (LID) as the domain value of the index for trajectories of RFID tags and proposes the solution for solving this p...
Sungwoo Ahn, Bonghee Hong
169
Voted
SYRCODIS
2008
184views Database» more  SYRCODIS 2008»
15 years 10 days ago
Towards Cost-based Query Optimization in Native XML Database Management Systems
In the last few years, XML became a de-facto standard for the exchange of structured and semi-structured data. The database research community took this development into account b...
Andreas M. Weiner, Christian Mathis, Theo Här...
SIGMOD
2005
ACM
111views Database» more  SIGMOD 2005»
15 years 11 months ago
Efficient Computation of Multiple Group By Queries
Data analysts need to understand the quality of data in the warehouse. This is often done by issuing many Group By queries on the sets of columns of interest. Since the volume of ...
Zhimin Chen, Vivek R. Narasayya
90
Voted
WWW
2001
ACM
15 years 11 months ago
Efficient Acquisition of Web Data through Restricted Query Interfaces
A wealth of information is available on the Web. But often, such data are hidden behind form interfaces which allow only a restrictive set of queries over the underlying databases...
Cláudio T. Silva, Juliana Freire, Simon Bye...