VLDB 2005 - PDF Preprint Papers

VLDB 2005 International Conference on Very Large Data Bases

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed VLDB-2005 Paper

click to vote

VLDB
2005
ACM

397views Database» more VLDB 2005»

Concurrency control and recovery for balanced B-link trees

14 years 4 months ago

Download www.mathematik.uni-marburg.de

Abstract. In this paper we present new concurrent and recoverable B-link-tree algorithms. Unlike previous algorithms, ours maintain the balance of the B-link tree at all times, so ...

Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soinin...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	397	Concurrency control and recovery for balanced B-link trees	claim
2	226	BATON: A Balanced Tree Structure for Peer-to-Peer Networks	claim
3	206	Native XML Support in DB2 Universal Database	claim
4	196	Summarizing and Mining Inverse Distributions on Data Streams via Dynamic Inverse Sampling	claim
5	185	Storing and querying XML data using denormalized relational databases	claim
6	184	Rule-based workflow management for bioinformatics	claim
7	180	Cache-conscious Frequent Pattern Mining on a Modern Processor	claim
8	177	Indexing mobile objects using dual transformations	claim
9	177	Discovering Large Dense Subgraphs in Massive Graphs	claim
10	175	Query Translation from XPath to SQL in the Presence of Recursive DTDs	claim
11	175	Catching the Best Views of Skyline: A Semantic Approach Based on Decisive Subspaces	claim
12	165	Semantic Adaptation of Schema Mappings when Schemas Evolve	claim
13	162	FiST: Scalable XML Document Filtering by Sequencing Twig Patterns	claim
14	162	XQuery Implementation in a Relational Database System	claim
15	159	Temporal Management of RFID Data	claim
16	153	An effective and efficient algorithm for high-dimensional outlier detection	claim
17	152	Composing, optimizing, and executing plans for bioinformatics web services	claim
18	151	On Map-Matching Vehicle Tracking Data	claim
19	151	Query Execution Assurance for Outsourced Databases	claim
20	149	Selectivity estimators for multidimensional range queries over real attributes	claim
21	146	Adaptive website recommendations with AWESOME	claim
22	144	Bidirectional Expansion For Keyword Search on Graph Databases	claim
23	143	WISE-Integrator: A System for Extracting and Integrating Complex Web Search Interfaces of the Deep Web	claim
24	142	PrediCalc: A Logical Spreadsheet Management System	claim
25	141	Automatic Data Fusion with HumMer	claim
26	140	MINERVA: Collaborative P2P Search	claim
27	140	OLAP Over Uncertain and Imprecise Data	claim
28	140	Loadstar: Load Shedding in Data Stream Mining	claim
29	140	Complex Spatio-Temporal Pattern Queries	claim
30	140	The Integrated Microbial Genomes (IMG) System: A Case Study in Biological Data Management	claim
31	139	Tree-Pattern Queries on a Lightweight XML Processor	claim
32	139	Analyzing Plan Diagrams of Database Query Optimizers	claim
33	139	Statistical Learning Techniques for Costing XML Queries	claim
34	136	On k-Anonymity and the Curse of Dimensionality	claim
35	136	iMeMex: Escapes from the Personal Information Jungle	claim
36	135	Distributed Privacy Preserving Information Sharing	claim
37	134	HePToX: Marrying XML and Heterogeneity in Your P2P Databases	claim
38	134	MDL Summarization with Holes	claim
39	133	Caching with 'Good Enough' Currency, Consistency, and Completeness	claim
40	132	Practical methods for constructing suffix trees	claim
41	132	Hash-based labeling techniques for storage scaling	claim
42	132	MIX: A Meta-data Indexing System for XML	claim
43	129	Sketching Streams Through the Net: Distributed Approximate Query Tracking	claim
44	126	Hubble: An Advanced Dynamic Folder Technology for XML	claim
45	126	Consistently Estimating the Selectivity of Conjuncts of Predicates	claim
46	125	Sync your data: update propagation for heterogeneous protein databases	claim
47	125	Interactive Schema Translation with Instance-Level Mappings	claim
48	125	Rewriting XPath Queries Using Materialized Views	claim
49	125	Using Association Rules for Fraud Detection in Web Advertising Networks	claim
50	124	Indexing Multi-Dimensional Uncertain Data with Arbitrary Probability Density Functions	claim
51	123	Querying XML streams	claim
52	123	Concept-based querying in mediator systems	claim
53	122	Optimizing Nested Queries with Parameter Sort Orders	claim
54	122	Streaming Pattern Discovery in Multiple Time-Series	claim
55	122	C-Store: A Column-oriented DBMS	claim
56	121	Join operations in temporal databases	claim
57	121	Online Estimation For Subset-Based SQL Queries	claim
58	121	Using a Fuzzy Classification Query Language for Customer Relationship Management	claim
59	121	Improving Database Performance on Simultaneous Multithreading Processors	claim
60	120	Efficiently Processing Queries on Interval-and-Value Tuples in Relational Databases	claim
61	119	Database-Inspired Search	claim
62	118	Selectivity Estimation for Fuzzy String Predicates in Large Data Sets	claim
63	118	Mining Compressed Frequent-Pattern Sets	claim
64	117	Parallel Querying with Non-Dedicated Computers	claim
65	117	Data Sharing in the Hyperion Peer Database System	claim
66	116	Client Assignment in Content Dissemination Networks for Dynamic Data	claim
67	115	KLEE: A Framework for Distributed Top-k Query Algorithms	claim
68	114	A framework for modeling and evaluating automatic semantic reconciliation	claim
69	114	Checking for k-Anonymity Violation by Views	claim
70	113	Mediators over taxonomy-based information sources	claim
71	113	Optimistic Intra-Transaction Parallelism on Chip Multiprocessors	claim
72	113	AReNA: Adaptive Distributed Catalog Infrastructure Based On Relevance Networks	claim
73	112	REED: Robust, Efficient Filtering and Event Detection in Sensor Networks	claim
74	112	Content-Based Routing: Different Plans for Different Data	claim
75	110	U-DBMS: A Database System for Managing Constantly-Evolving Data	claim
76	109	Model-based approximate querying in sensor networks	claim
77	109	Link Spam Alliances	claim
78	109	Parallel Execution of Test Runs for Database Application Systems	claim
79	108	A Heartbeat Mechanism and Its Application in Gigascope	claim
80	106	Adaptive Stream Filters for Entity-based Queries with Non-Value Tolerance	claim
81	105	View Matching for Outer-Join Views	claim
82	105	Answering Imprecise Queries over Web Databases	claim
83	105	WmXML: A System for Watermarking XML Data	claim
84	105	Light-weight Domain-based Form Assistant: Querying Web Databases On the Fly	claim
85	104	Approximate Matching of Hierarchical Data Using pq-Grams	claim
86	103	Consistency for Web Services Applications	claim
87	103	Mapping Maintenance for Data Integration Systems	claim
88	103	Semantic Query Optimization for XQuery over XML Streams	claim
89	101	Efficient Implementation of Large-Scale Multi-Structural Databases	claim
90	100	PSYCHO: A Prototype System for Pattern Management	claim
91	100	Query Caching and View Selection for XML Databases	claim
92	97	Fine-Grained Replication and Scheduling with Freshness and Correctness Guarantees	claim
93	97	Answering Queries from Statistics and Probabilistic Views	claim
94	97	A Dynamically Adaptive Distributed System for Processing Complex Continuous Queries	claim
95	97	Query By Excel	claim
96	96	Supporting RFID-based Item Tracking Applications in Oracle DBMS Using a Bitmap Datatype	claim
97	96	Robust Real-time Query Processing with QStream	claim
98	94	Special issue on data management, analysis, and mining for the life sciences	claim
99	93	The TEXTURE Benchmark: Measuring Performance of Text Queries on a Relational DBMS	claim
100	93	Indexing Mixed Types for Approximate Retrieval	claim
101	93	Revisiting Pipelined Parallelism in Multi-Join Query Processing	claim
102	90	Getting Priorities Straight: Improving Linux Support for Database I/O	claim
103	90	Tuning Schema Matching Software using Synthetic Scenarios	claim
104	87	NILE-PDT: A Phenomenon Detection and Tracking Framework for Data Stream Management Systems	claim
105	87	An Efficient SQL-based RDF Querying Scheme	claim
106	87	n-Gram/2L: A Space and Time Efficient Two-Level n-Gram Inverted Index Structure	claim
107	86	Database Publication Practices	claim
108	86	One-Pass Wavelet Synopses for Maximum-Error Metrics	claim
109	85	Inspector Joins	claim
110	85	Pattern Tree Algebras: Sets or Sequences?	claim
111	85	A Faceted Query Engine Applied to Archaeology	claim
112	84	Automatic Composition of Transition-based Semantic Web Services with Messaging	claim
113	84	Pathfinder: XQuery - The Relational Way	claim
114	83	Indexing Data-oriented Overlay Networks	claim
115	82	Information Preserving XML Schema Embedding	claim
116	82	Stack-based Algorithms for Pattern Matching on DAGs	claim
117	81	Structure and Content Scoring for XML	claim
118	81	Flexible Database Generators	claim
119	80	Parameter Free Bursty Events Detection in Text Streams	claim
120	79	ULoad: Choosing the Right Storage for Your XML Application	claim
121	79	General Purpose Database Summarization	claim
122	74	Designing Information-Preserving Mapping Schemes for XML	claim
123	74	Efficient Evaluation of XQuery over Streaming Data	claim
124	73	Maximal Vector Computation in Large Data Sets	claim
125	66	Querying Business Processes with BP-QL	claim
126	59	Scaling and Time Warping in Time Series Querying	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers