Sciweavers

6654 search results - page 146 / 1331
» Querying Faceted Databases
Sort
View
118
Voted
TIME
2000
IEEE
15 years 7 months ago
Towards a Theory of Movie Database Queries
We present a data model for movies and movie databases. A movie is considered to be a 2-dimensional semialgebraic figure that can change in time. We give a number of computabilit...
Bart Kuijpers, Jan Paredaens, Dirk Van Gucht
137
Voted
CIKM
2008
Springer
15 years 5 months ago
Estimating the number of answers with guarantees for structured queries in p2p databases
Structured P2P overlays supporting standard database functionalities are a popular choice for building large-scale distributed data management systems. In such systems, estimating...
Marcel Karnstedt, Kai-Uwe Sattler, Michael Ha&szli...
117
Voted
TKDE
1998
126views more  TKDE 1998»
15 years 3 months ago
Dictionary: A New Access Method for Query Processing in Object-Oriented Databases
—We present a new access method, called the path dictionary index (PDI) method, for supporting nested queries on object-oriented databases. PDI supports object traversal and asso...
Wang-Chien Lee, Dik Lun Lee
140
Voted
CIKM
2011
Springer
14 years 3 months ago
Integrating and querying web databases and documents
There exist many interrelated information sources on the Internet that can be categorized into structured (database) and semistructured (documents). A key challenge is to integrat...
Carlos Garcia-Alvarado, Carlos Ordonez
ICDE
2008
IEEE
127views Database» more  ICDE 2008»
16 years 4 months ago
Efficient Processing of Top-k Queries in Uncertain Databases
This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a n...
Ke Yi, Feifei Li, George Kollios, Divesh Srivastav...