439 search results - page 26 / 88 » Unnesting Arbitrary Queries |
GD
2004
Springer
14 years 3 months ago
2004
Springer
We describe the query and data processing language QUOGGLES which is particularly designed for the application on graphs. It uses a pipeline-like technique known from command line ...
DATESO
2009
13 years 7 months ago
2009
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....
MTA
2007
13 years 9 months ago
2007
Complex multimedia queries, aiming to retrieve from large databases those objects that best match the query specification, are usually processed by splitting them into a set of m ...
SSPR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. A content-based tile retrieval system based on the underlying multispectral Markov random field representation is introduced. Single tiles are represented by our approve...
IPPS
2007
IEEE
14 years 4 months ago
2007
IEEE
— An important class of queries over sensor networks are network-wide aggregation queries. In this work we study a class of aggregation queries which we refer to as aggregate thr...