6905 search results - page 1086 / 1381 » Querying Multidimensional Databases |
125
click to vote
SIGMOD
2004
ACM
16 years 4 months ago
2004
ACM
We make two main contributions in this paper. First, we motivate and introduce a novel class of data mining problems that arise in labeling a group of mass spectra, specifically f...
120
click to vote
SIGMOD
2002
ACM
16 years 4 months ago
2002
ACM
The availability of summary data for XML documents has many applications, from providing users with quick feedback about their queries, to cost-based storage design and query opti...
119
click to vote
PODS
2005
ACM
16 years 4 months ago
2005
ACM
We study the satisfiability problem associated with XPath in the presence of DTDs. This is the problem of determining, given a query p in an XPath fragment and a DTD D, whether or...
138
click to vote
PODS
2006
ACM
16 years 4 months ago
2006
ACM
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
135
click to vote
EDBT
2004
ACM
16 years 4 months ago
2004
ACM
Earlier work has demonstrated the effectiveness of in-network data aggregation in order to minimize the amount of messages exchanged during continuous queries in large sensor netwo...