5746 search results - page 379 / 1150 » Visualizing Query Structure |
196
click to vote
EDBT
2004
ACM
16 years 7 months ago
2004
ACM
XML suffers from the major limitation of high redundancy. Even if compression can be beneficial for XML data, however, once compressed, the data can be seldom browsed and queried i...
195
click to vote
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
— Skyline queries are capable of retrieving interesting points from a large data set according to multiple criteria. Most work on skyline queries so far has assumed a centralized...
190
click to vote
IDEAS
2008
IEEE
16 years 1 months ago
2008
IEEE
As the popularity of areas including document storage and distributed systems continues to grow, the demand for high performance XML databases is increasingly evident. This has le...
189
click to vote
PDP
2008
IEEE
16 years 1 months ago
2008
IEEE
Search engines use inverted files as index data structures to speed up the solution of user queries. The index is distributed on a set of processors forming a cluster of computer...
184
click to vote
ADBIS
2003
Springer
16 years 3 days ago
2003
Springer
Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistance-value” of this n-tuple is the value of a linear function of distances of the n objects...