Instant restore after a media failure

Media failures usually leave database systems unavailable for several hours until recovery is complete, especially in applications with large devices and high transaction volume. Previous work introduced a technique called single-pass restore, which increases restore bandwidth and thus substantially decreases time to repair. Instant restore goes further as it permits read/write access to any data on a device undergoing restore--even data not yet restored--by restoring individual data segments on demand. Thus, the restore process is guided primarily by the needs of applications, and the observed mean time to repair is effectively reduced from several hours to a few seconds. This paper presents an implementation and evaluation of instant restore. The technique is incrementally implemented on a system starting with the traditional ARIES design for logging and recovery. Experiments show that the transaction latency perceived after a media failure can be cut down to less than a second and that the overhead imposed by the technique on normal processing is minimal. The net effect is that a few "nines" of availability are added to the system using simple and low-overhead software techniques

From Cooperative Scans to Predictive Buffer Management

In analytical applications, database systems often need to sustain workloads with multiple concurrent scans hitting the same table. The Cooperative Scans (CScans) framework, which introduces an Active Buffer Manager (ABM) component into the database architecture, has been the most effective and elaborate response to this problem, and was initially developed in the X100 research prototype. We now report on the the experiences of integrating Cooperative Scans into its industrial-strength successor, the Vectorwise database product. During this implementation we invented a simpler optimization of concurrent scan buffer management, called Predictive Buffer Management (PBM). PBM is based on the observation that in a workload with long-running scans, the buffer manager has quite a bit of information on the workload in the immediate future, such that an approximation of the ideal OPT algorithm becomes feasible. In the evaluation on both synthetic benchmarks as well as a TPC-H throughput run we compare the benefits of naive buffer management (LRU) versus CScans, PBM and OPT; showing that PBM achieves benefits close to Cooperative Scans, while incurring much lower architectural impact.Comment: VLDB201

On the construction of pseudo-hermitian quantum system with a pre-determined metric in the Hilbert space

A class of pseudo-hermitian quantum system with an explicit form of the positive-definite metric in the Hilbert space is presented. The general method involves a realization of the basic canonical commutation relations defining the quantum system in terms of operators those are hermitian with respect to a pre-determined positive definite metric in the Hilbert space. Appropriate combinations of these operators result in a large number of pseudo-hermitian quantum systems admitting entirely real spectra and unitary time evolution. The examples considered include simple harmonic oscillators with complex angular frequencies, Stark(Zeeman) effect with complex electric(magnetic) field, non-hermitian general quadratic form of N boson(fermion) operators, symmetric and asymmetric XXZ spin-chain in complex magnetic field, non-hermitian Haldane-Shastry spin-chain and Lipkin-Meshkov-Glick model.Comment: 29 pages, revtex, minor changes, version to appear in Journal of Physics A(v3

Transactional support for adaptive indexing

Adaptive indexing initializes and optimizes indexes incrementally, as a side effect of query processing. The goal is to achieve the benefits of indexes while hiding or minimizing the costs of index creation. However, index-optimizing side effects seem to turn read-only queries into update transactions that might, for example, create lock contention. This paper studies concurrency control and recovery in the context of adaptive indexing. We show that the design and implementation of adaptive indexing rigorously separates index structures from index contents; this relaxes constraints and requirements during adaptive indexing compared to those of traditional index updates. Our design adapts to the fact that an adaptive index is refined continuously and exploits any concurrency opportunities in a dynamic way. A detailed experimental analysis demonstrates that (a) adaptive indexing maintains its adaptive properties even when running concurrent queries, (b) adaptive indexing can exploit the opportunity for parallelism due to concurrent queries, (c) the number of concurrency conflicts and any concurrency administration overheads follow an adaptive behavior, decreasing as the workload evolves and adapting to the workload needs

PT symmetry, Cartan decompositions, Lie triple systems and Krein space related Clifford algebras

Gauged PT quantum mechanics (PTQM) and corresponding Krein space setups are studied. For models with constant non-Abelian gauge potentials and extended parity inversions compact and noncompact Lie group components are analyzed via Cartan decompositions. A Lie triple structure is found and an interpretation as PT-symmetrically generalized Jaynes-Cummings model is possible with close relation to recently studied cavity QED setups with transmon states in multilevel artificial atoms. For models with Abelian gauge potentials a hidden Clifford algebra structure is found and used to obtain the fundamental symmetry of Krein space related J-selfadjoint extensions for PTQM setups with ultra-localized potentials.Comment: 11 page

Long-range adiabatic quantum state transfer through a linear array of quantum dots

We introduce an adiabatic long-range quantum communication proposal based on a quantum dot array. By adiabatically varying the external gate voltage applied on the system, the quantum information encoded in the electron can be transported from one end dot to another. We numerically solve the Schr\"odinger equation for a system with a given number of quantum dots. It is shown that this scheme is a simple and efficient protocol to coherently manipulate the population transfer under suitable gate pulses. The dependence of the energy gap and the transfer time on system parameters is analyzed and shown numerically. We also investigate the adiabatic passage in a more realistic system in the presence of inevitable fabrication imperfections. This method provides guidance for future realizations of adiabatic quantum state transfer in experiments.Comment: 7 pages, 7 figure

JJ-self-adjoint operators with C\mathcal{C}-symmetries: extension theory approach

A well known tool in conventional (von Neumann) quantum mechanics is the self-adjoint extension technique for symmetric operators. It is used, e.g., for the construction of Dirac-Hermitian Hamiltonians with point-interaction potentials. Here we reshape this technique to allow for the construction of pseudo-Hermitian ($J$-self-adjoint) Hamiltonians with complex point-interactions. We demonstrate that the resulting Hamiltonians are bijectively related with so called hypermaximal neutral subspaces of the defect Krein space of the symmetric operator. This symmetric operator is allowed to have arbitrary but equal deficiency indices . General properties of the $\cC$ operators for these Hamiltonians are derived. A detailed study of $\cC$-operator parametrizations and Krein type resolvent formulas is provided for $J$-self-adjoint extensions of symmetric operators with deficiency indices . The technique is exemplified on 1D pseudo-Hermitian Schr\"odinger and Dirac Hamiltonians with complex point-interaction potentials

Quantum catastrophes: a case study

The bound-state spectrum of a Hamiltonian H is assumed real in a non-empty domain D of physical values of parameters. This means that for these parameters, H may be called crypto-Hermitian, i.e., made Hermitian via an {\it ad hoc} choice of the inner product in the physical Hilbert space of quantum bound states (i.e., via an {\it ad hoc} construction of the so called metric). The name of quantum catastrophe is then assigned to the N-tuple-exceptional-point crossing, i.e., to the scenario in which we leave domain D along such a path that at the boundary of D, an N-plet of bound state energies degenerates and, subsequently, complexifies. At any fixed $N \geq 2$, this process is simulated via an N by N benchmark effective matrix Hamiltonian H. Finally, it is being assigned such a closed-form metric which is made unique via an N-extrapolation-friendliness requirement.Comment: 23 p

The nonlinear Schroedinger equation for the delta-comb potential: quasi-classical chaos and bifurcations of periodic stationary solutions

The nonlinear Schroedinger equation is studied for a periodic sequence of delta-potentials (a delta-comb) or narrow Gaussian potentials. For the delta-comb the time-independent nonlinear Schroedinger equation can be solved analytically in terms of Jacobi elliptic functions and thus provides useful insight into the features of nonlinear stationary states of periodic potentials. Phenomena well-known from classical chaos are found, such as a bifurcation of periodic stationary states and a transition to spatial chaos. The relation of new features of nonlinear Bloch bands, such as looped and period doubled bands, are analyzed in detail. An analytic expression for the critical nonlinearity for the emergence of looped bands is derived. The results for the delta-comb are generalized to a more realistic potential consisting of a periodic sequence of narrow Gaussian peaks and the dynamical stability of periodic solutions in a Gaussian comb is discussed.Comment: Enhanced and revised version, to appear in J. Nonlin. Math. Phy