Sciweavers

7607 search results - page 41 / 1522
» Querying data provenance
Sort
View
WEA
2007
Springer
74views Algorithms» more  WEA 2007»
14 years 3 months ago
Landmark-Based Routing in Dynamic Graphs
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
Daniel Delling, Dorothea Wagner
TSD
2010
Springer
13 years 7 months ago
Comparison of Different Lemmatization Approaches through the Means of Information Retrieval Performance
This paper presents a quantitative performance analysis of two different approaches to the lemmatization of the Czech text data. The first one is based on manually prepared diction...
Jakub Kanis, Lucie Skorkovská
PVLDB
2008
146views more  PVLDB 2008»
13 years 9 months ago
Graceful database schema evolution: the PRISM workbench
Supporting graceful schema evolution represents an unsolved problem for traditional information systems that is further exacerbated in web information systems, such as Wikipedia a...
Carlo Curino, Hyun Jin Moon, Carlo Zaniolo
ICEBE
2005
IEEE
168views Business» more  ICEBE 2005»
14 years 3 months ago
Frequency Operators for Condensative Queries over Data Streams
Over a traditional Database Management System (DBMS), the answer to an aggregate query is usually much smaller than the answer to a similar nonaggregate query. Therefore, we call ...
Lisha Ma, Werner Nutt
CORR
2011
Springer
169views Education» more  CORR 2011»
13 years 1 months ago
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Andrei E. Romashchenko