Sciweavers

1125 search results - page 143 / 225
» Query Answering in Inconsistent Databases
Sort
View
ADVIS
2004
Springer
15 years 8 months ago
Incremental Association Rule Mining Using Materialized Data Mining Views
Data mining is an interactive and iterative process. Users issue series of similar queries until they receive satisfying results, yet currently available data mining systems do not...
Mikolaj Morzy, Tadeusz Morzy, Zbyszko Króli...
SIGMOD
2004
ACM
105views Database» more  SIGMOD 2004»
16 years 2 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
ICDT
2003
ACM
126views Database» more  ICDT 2003»
15 years 7 months ago
Typechecking Top-Down Uniform Unranked Tree Transducers
We investigate the typechecking problem for XML queries: statically verifying that every answer to a query conforms to a given output schema, for inputs satisfying a given input sc...
Wim Martens, Frank Neven
125
Voted
JSS
2006
134views more  JSS 2006»
15 years 2 months ago
On past-time indexing of moving objects
Tracking of mobile objects trajectories is one of many modern applications supported by Spatiotemporal databases. Within the context of this application, queries about the present...
Katerina Raptopoulou, Michael Vassilakopoulos, Yan...
SIGMOD
2002
ACM
134views Database» more  SIGMOD 2002»
16 years 2 months ago
Wavelet synopses with error guarantees
Recent work has demonstrated the effectiveness of the wavelet decomposition in reducing large amounts of data to compact sets of wavelet coefficients (termed "wavelet synopse...
Minos N. Garofalakis, Phillip B. Gibbons