6654 search results - page 1027 / 1331 » Querying Faceted Databases |
150
Voted
PODS
2005
ACM
16 years 6 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...
175
Voted
PODS
2006
ACM
16 years 6 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...
179
click to vote
EDBT
2004
ACM
16 years 6 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...
179
click to vote
EDBT
2004
ACM
16 years 6 months ago
2004
ACM
Due to the large difference between seek time and transfer time in current disk technology, it is advantageous to perform large I/O using a single sequential access rather than mu...
191
Voted
EDBT
2006
ACM
16 years 6 months ago
2006
ACM
In many decision-making applications, the skyline query is frequently used to find a set of dominating data points (called skyline points) in a multidimensional dataset. In a high-...