Sciweavers

366 search results - page 13 / 74
» Efficient Query Reformulation in Peer-Data Management System...
Sort
View
CIDR
2003
125views Algorithms» more  CIDR 2003»
13 years 9 months ago
Crossing the Structure Chasm
It has frequently been observed that most of the world’s data lies outside database systems. The reason is that database systems focus on structured data, leaving the unstructur...
Alon Y. Halevy, Oren Etzioni, AnHai Doan, Zachary ...
ICDCS
2007
IEEE
13 years 11 months ago
Efficient Execution of Continuous Incoherency Bounded Queries over Multi-Source Streaming Data
On-line decision making often involves query processing over time-varying data which arrives in the form of data streams from distributed locations. In such environments typically...
Manish Bhide, Krithi Ramamritham, Mukund Agrawal
SIGMOD
2007
ACM
219views Database» more  SIGMOD 2007»
14 years 7 months ago
Efficient exploitation of similar subexpressions for query processing
Complex queries often contain common or similar subexpressions, either within a single query or among multiple queries submitted as a batch. If so, query execution time can be imp...
Jingren Zhou, Johann Christoph Freytag, Per-Å...
ICDE
2000
IEEE
161views Database» more  ICDE 2000»
13 years 11 months ago
Efficient Query Refinement in Multimedia Databases
Increasing application demands are pushing database management systems (DBMSs) towards providing adequate and efficient support for content-based retrieval over multimedia objects...
Kaushik Chakrabarti, Kriengkrai Porkaew, Sharad Me...
SIGMOD
2008
ACM
127views Database» more  SIGMOD 2008»
13 years 7 months ago
Minimization of tree pattern queries with constraints
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...
Ding Chen, Chee Yong Chan