Sciweavers

2608 search results - page 500 / 522
» Inferring Answers to Queries
Sort
View
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
14 years 8 months ago
Compact Ancestry Labeling Schemes for XML Trees
An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by looking at their corresponding labels. T...
Fraigniaud Pierre, Korman Amos
ICDT
2010
ACM
161views Database» more  ICDT 2010»
14 years 8 months ago
Composition with Target Constraints
It is known that the composition of schema mappings, each specified by source-to-target tgds (st-tgds), can be specified by a secondorder tgd (SO tgd). We consider the question of...
Marcelo Arenas, Ronald Fagin, Alan Nash
SOSP
2007
ACM
14 years 7 months ago
Tolerating byzantine faults in transaction processing systems using commit barrier scheduling
This paper describes the design, implementation, and evaluation of a replication scheme to handle Byzantine faults in transaction processing database systems. The scheme compares ...
Ben Vandiver, Hari Balakrishnan, Barbara Liskov, S...
TMA
2010
Springer
166views Management» more  TMA 2010»
14 years 5 months ago
Understanding and Preparing for DNS Evolution
The Domain Name System (DNS) is a crucial component of today’s Internet. The top layer of the DNS hierarchy (the root nameservers) is facing dramatic changes: cryptographically s...
Sebastian Castro, Min Zhang, Wolfgang John, Duane ...
ICDE
2009
IEEE
159views Database» more  ICDE 2009»
14 years 5 months ago
ApproxRank: Estimating Rank for a Subgraph
Abstract— Customized semantic query answering, personalized search, focused crawlers and localized search engines frequently focus on ranking the pages contained within a subgrap...
Yao Wu, Louiqa Raschid