123 search results - page 18 / 25 » Efficient B-tree Based Indexing for Cloud Data Processing |
VLDB
1995
ACM
15 years 1 months ago
1995
ACM
New demandsare put on query processing in Object-Oriented(00) databasesto provide efficient andrelationally completequery languages. A flexible 00 data model requires overloading ...
84
Voted
DBA
2004
14 years 11 months ago
2004
In order to guarantee efficient query processing together with industrial strength, spatial index structures have to be integrated into fully-fledged object-relational database ma...
ADBIS
2000
Springer
15 years 1 months ago
2000
Springer
We consider queries which originate from a mobile unit and whose result depends on the location of the user who initiates the query. Example of such a query is How many people are ...
VLDB
2005
ACM
15 years 2 months ago
2005
ACM
Devising a scheme for efficient and scalable querying of Resource Description Framework (RDF) data has been an active area of current research. However, most approaches define new...
98
Voted
ICDE
2002
IEEE
15 years 2 months ago
2002
IEEE
Soon, much of the data exchanged over the Internet will be encoded in XML, allowing for sophisticated filtering and content-based routing. We have built a filtering engine called ...