Sciweavers

505 search results - page 44 / 101
» Queries with Incomplete Answers over Semistructured Data
Sort
View
IEICET
2008
67views more  IEICET 2008»
14 years 9 months ago
Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries
We consider the polynomial time learnability of finite unions of ordered tree patterns with internal structured variables, in the query learning model of Angluin (1988). An ordered...
Satoshi Matsumoto, Takayoshi Shoudai, Tomoyuki Uch...
SEMWEB
2007
Springer
15 years 3 months ago
YARS2: A Federated Repository for Querying Graph Structured Data from the Web
We present the architecture of an end-to-end semantic search engine that uses a graph data model to enable interactive query answering over structured and interlinked data collecte...
Andreas Harth, Jürgen Umbrich, Aidan Hogan, S...
PODS
2006
ACM
122views Database» more  PODS 2006»
15 years 9 months ago
Space- and time-efficient deterministic algorithms for biased quantiles over data streams
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...
Graham Cormode, Flip Korn, S. Muthukrishnan, Dives...
PODS
2011
ACM
201views Database» more  PODS 2011»
14 years 16 days ago
Data exchange beyond complete data
In the traditional data exchange setting, source instances are restricted to be complete in the sense that every fact is either true or false in these instances. Although natural ...
Marcelo Arenas, Jorge Pérez, Juan L. Reutte...
PODS
2003
ACM
143views Database» more  PODS 2003»
15 years 9 months ago
Maintaining variance and k-medians over data stream windows
The sliding window model is useful for discounting stale data in data stream applications. In this model, data elements arrive continually and only the most recent N elements are ...
Brian Babcock, Mayur Datar, Rajeev Motwani, Liadan...