Sciweavers

237 search results - page 20 / 48
» Efficient Query Processing on the Relational Quadtree
Sort
View
PVLDB
2010
112views more  PVLDB 2010»
13 years 2 months ago
CODS: Evolving Data Efficiently and Scalably in Column Oriented Databases
Database evolution is the process of updating the schema of a database or data warehouse (schema evolution) and evolving the data to the updated schema (data evolution). Database ...
Ziyang Liu, Sivaramakrishnan Natarajan, Bin He, Hu...
SIGMOD
2006
ACM
122views Database» more  SIGMOD 2006»
14 years 8 months ago
MonetDB/XQuery: a fast XQuery processor powered by a relational engine
Relational XQuery systems try to re-use mature relational data management infrastructures to create fast and scalable XML database technology. This paper describes the main featur...
Peter A. Boncz, Torsten Grust, Maurice van Keulen,...
ICDE
2002
IEEE
181views Database» more  ICDE 2002»
14 years 25 days ago
YFilter: Efficient and Scalable Filtering of XML Documents
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 ...
Yanlei Diao, Peter M. Fischer, Michael J. Franklin...
VLDB
1994
ACM
99views Database» more  VLDB 1994»
13 years 12 months ago
Join Index Hierarchies for Supporting Efficient Navigations in Object-Oriented Databases
A join index hierarchy method is proposed to handle the "goto's on disk" problem in objectoriented query processing. The method constructs a hierarchy of join indic...
Zhaohui Xie, Jiawei Han
DASFAA
2004
IEEE
158views Database» more  DASFAA 2004»
13 years 11 months ago
A Cost Model for Spatial Intersection Queries on RI-Trees
Abstract. The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tr...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...