Sciweavers

2859 search results - page 291 / 572
» Querying Complex Structured Databases
Sort
View
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
16 years 6 months ago
On the cell probe complexity of membership and perfect hashing
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
Rasmus Pagh
DAMON
2007
Springer
16 years 23 days ago
A general framework for improving query processing performance on multi-level memory hierarchies
We propose a general framework for improving the query processing performance on multi-level memory hierarchies. Our motivation is that (1) the memory hierarchy is an important pe...
Bingsheng He, Yinan Li, Qiong Luo, Dongqing Yang
EUROCAST
2005
Springer
102views Hardware» more  EUROCAST 2005»
16 years 3 days ago
Similarity Queries in Data Bases Using Metric Distances - from Modeling Semantics to Its Maintenance
Similarity queries in traditional databases work directly on attribute values. But, often similar attribute values do not indicate similar meanings. Semantic background information...
Josef Küng, Roland Wagner
DBPL
2003
Springer
130views Database» more  DBPL 2003»
15 years 11 months ago
Attribute Grammars for Scalable Query Processing on XML Streams
We introduce the new notion of XML Stream Attribute Grammars (XSAGs). XSAGs are the first scalable query language for XML streams (running strictly in linear time with bounded mem...
Christoph Koch, Stefanie Scherzinger
PDIS
1994
IEEE
15 years 10 months ago
An Economic Paradigm for Query Processing and Data Migration in Mariposa
Many new database applications require very large volumes of data. Mariposa is a data base system under construction at Berkeley responding to this need. Mariposa objects can be s...
Michael Stonebraker, Robert Devine, Marcel Kornack...