Sciweavers

3225 search results - page 577 / 645
» Query Optimization by Stored Queries
Sort
View
ICDE
2009
IEEE
133views Database» more  ICDE 2009»
15 years 10 months ago
STAR: Steiner-Tree Approximation in Relationship Graphs
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
Gjergji Kasneci, Maya Ramanath, Mauro Sozio, Fabia...
CRYPTO
2009
Springer
82views Cryptology» more  CRYPTO 2009»
15 years 10 months ago
Solving Hidden Number Problem with One Bit Oracle and Advice
In the Hidden Number Problem (HNP), the goal is to find a hidden number s, when given p, g and access to an oracle that on query a returns the k most significant bits of s · ga ...
Adi Akavia
CRYPTO
2007
Springer
134views Cryptology» more  CRYPTO 2007»
15 years 10 months ago
Domain Extension of Public Random Functions: Beyond the Birthday Barrier
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}...
Ueli M. Maurer, Stefano Tessaro
EXPDB
2006
ACM
15 years 9 months ago
Pushing XPath Accelerator to its Limits
Two competing encoding concepts are known to scale well with growing amounts of XML data: XPath Accelerator encoding implemented by MonetDB for in-memory documents and X-Hive’s ...
Christian Grün, Alexander Holupirek, Marc Kra...
SSDBM
2005
IEEE
148views Database» more  SSDBM 2005»
15 years 9 months ago
A Fast Approximation Scheme for Probabilistic Wavelet Synopses
Several studies have demonstrated the effectiveness of Haar wavelets in reducing large amounts of data down to compact wavelet synopses that can be used to obtain fast, accurate a...
Antonios Deligiannakis, Minos N. Garofalakis, Nick...